Affine differential geometry and smoothness maximization as tools for identifying geometric movement primitives
Neuroscientific studies of drawing-like movements usually analyze neural representation of either geometric (eg. direction, shape) or temporal (eg. speed) features of trajectories rather than trajectory's representation as a whole. This work is about empirically supported mathematical ideas behind splitting and merging geometric and temporal features which characterize biological movements. Movement primitives supposedly facilitate the efficiency of movements' representation in the brain and comply with different criteria for biological movements, among them kinematic smoothness and geometric constraint. Criterion for trajectories' maximal smoothness of arbitrary order $n$ is employed, $n = 3$ is the case of the minimum-jerk model. I derive a class of differential equations obeyed by movement paths for which $n$-th order maximally smooth trajectories have constant rate of accumulating geometric measurement along the drawn path. Constant rate of accumulating equi-affine arc corresponds to compliance with the two-thirds power-law model. Geometric measurement is invariant under a class of geometric transformations and may be chosen to be an arc in certain geometry. Equations' solutions presumably serve as candidates for geometric movement primitives. The derived class of differential equations consists of two parts. The first part is identical for all geometric parameterizations of the path. The second part enforces consistency with desired (geometric) parametrization of curves on solutions of the first part. Equations in different geometries in plane and in space and their known solutions are presented. Connection between geometric invariance, motion smoothness, compositionality and performance of the compromised motor control system is discussed. The derived class of differential equations is a novel tool for discovering candidates for geometric movement primitives.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCSimilar Papers 제목 키워드 기반
Yau's Affine Normal Descent: Algorithmic Framework and Convergence Analysis
We propose Yau's Affine Normal Descent (YAND), a geometric framework for smooth unconstrained optimization in which search directions are defined by the equi-affine normal of level-set hypersurfaces. The resulting direct…
Mirror Descent Under Generalized Smoothness
Smoothness is crucial for attaining fast rates in first-order optimization. However, many optimization problems in modern machine learning involve non-smooth objectives. Recent studies relax the smoothness assumption by …
Algebraic Machine Learning with an Application to Chemistry
As datasets used in scientific applications become more complex, studying the geometry and topology of data has become an increasingly prevalent part of the data analysis process. This can be seen for example with the gr…
BIG-bench Machine LearningUtility maximization under endogenous pricing
We study the expected utility maximization problem of a large investor who is allowed to make transactions on tradable assets in an incomplete financial market with endogenous permanent market impacts. The asset prices a…
Smoothed Online Learning for Prediction in Piecewise Affine Systems
The problem of piecewise affine (PWA) regression and planning is of foundational importance to the study of online learning, control, and robotics, where it provides a theoretically and empirically tractable setting to s…
Prediction