Data driven Dirichlet sampling on manifolds

12/29/2020
by   Luan S Prado, et al.
0

This article presents a novel method to sampling on manifolds based on the Dirichlet distribution. The proposed strategy allows to completely respect the underlying manifold around which data is observed, and to do massive samplings with low computational effort. This can be very helpful, for instance, in neural networks training process, as well as in uncertainty analysis and stochastic optimization. Due to its simplicity and efficiency, we believe that the new method has great potential. Three manifolds (two dimensional ring, Mobius strip and spider geometry) are considered to test the proposed methodology, and then it is employed to an engineering application, related to gas seal coefficients.

READ FULL TEXT
research
05/26/2023

Generalizing Adam To Manifolds For Efficiently Training Transformers

One of the primary reasons behind the success of neural networks has bee...
research
04/22/2022

Convergence of the Riemannian Langevin Algorithm

We study the Riemannian Langevin Algorithm for the problem of sampling f...
research
12/08/2022

A numerical domain decomposition method for solving elliptic equations on manifolds

A new numerical domain decomposition method is proposed for solving elli...
research
06/07/2020

A Generalization of the Pearson Correlation to Riemannian Manifolds

The increasing application of deep-learning is accompanied by a shift to...
research
12/23/2011

Discretization of Parametrizable Signal Manifolds

Transformation-invariant analysis of signals often requires the computat...
research
06/11/2020

Robust Optimization and Inference on Manifolds

We propose a robust and scalable procedure for general optimization and ...

Please sign up or login with your details

Forgot password? Click here to reset