Emergent Mind

Learning Theory for Estimation of Animal Motion Submanifolds

(2003.13811)
Published Mar 30, 2020 in stat.ML and math.DS

Abstract

This paper describes the formulation and experimental testing of a novel method for the estimation and approximation of submanifold models of animal motion. It is assumed that the animal motion is supported on a configuration manifold $Q$ that is a smooth, connected, regularly embedded Riemannian submanifold of Euclidean space $X\approx \mathbb{R}d$ for some $d>0$, and that the manifold $Q$ is homeomorphic to a known smooth, Riemannian manifold $S$. Estimation of the manifold is achieved by finding an unknown mapping $\gamma:S\rightarrow Q\subset X$ that maps the manifold $S$ into $Q$. The overall problem is cast as a distribution-free learning problem over the manifold of measurements $\mathbb{Z}=S\times X$. That is, it is assumed that experiments generate a finite sets ${(si,xi)}{i=1}m\subset \mathbb{Z}m$ of samples that are generated according to an unknown probability density $\mu$ on $\mathbb{Z}$. This paper derives approximations $\gamma{n,m}$ of $\gamma$ that are based on the $m$ samples and are contained in an $N(n)$ dimensional space of approximants. The paper defines sufficient conditions that shows that the rates of convergence in $L2_\mu(S)$ correspond to those known for classical distribution-free learning theory over Euclidean space. Specifically, the paper derives sufficient conditions that guarantee rates of convergence that have the form $$\mathbb{E} \left (|\gamma\muj-\gamma{n,m}j|{L2\mu(S)}2\right )\leq C1 N(n){-r} + C2 \frac{N(n)\log(N(n))}{m}$$for constants $C1,C2$ with $\gamma\mu:={\gamma1\mu,\ldots,\gammad_\mu}$ the regressor function $\gamma\mu:S\rightarrow Q\subset X$ and $\gamma{n,m}:={\gamma1{n,j},\ldots,\gammad{n,m}}$.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.