Learning in Riemannian Orbifolds

04/19/2012
by   Brijnesh J. Jain, et al.
0

Learning in Riemannian orbifolds is motivated by existing machine learning algorithms that directly operate on finite combinatorial structures such as point patterns, trees, and graphs. These methods, however, lack statistical justification. This contribution derives consistency results for learning problems in structured domains and thereby generalizes learning in vector spaces and manifolds.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/17/2021

From the Greene–Wu Convolution to Gradient Estimation over Riemannian Manifolds

Over a complete Riemannian manifold of finite dimension, Greene and Wu i...
research
06/30/2020

Graph Laplacians, Riemannian Manifolds and their Machine-Learning

Graph Laplacians as well as related spectral inequalities and (co-)homol...
research
10/27/2021

Vector-valued Gaussian Processes on Riemannian Manifolds via Gauge Independent Projected Kernels

Gaussian processes are machine learning models capable of learning unkno...
research
05/11/2020

Design and visualization of Riemannian metrics

Local and global illumination were recently defined in Riemannian manifo...
research
06/14/2022

The Dynamics of Riemannian Robbins-Monro Algorithms

Many important learning algorithms, such as stochastic gradient methods,...
research
12/21/2019

Foundations of Structural Statistics: Topological Statistical Theory

Topological Statistical Theory, provides the foundation for a new unders...
research
01/26/2021

Statistical models and probabilistic methods on Riemannian manifolds

This entry contains the core material of my habilitation thesis, soon to...

Please sign up or login with your details

Forgot password? Click here to reset