Riemannian Stochastic Approximation for Minimizing Tame Nonsmooth Objective Functions
원문 초록
In many learning applications, the parameters in a model are structurally constrained in a way that can be modeled as them lying on a Riemannian manifold. Riemannian optimization, wherein procedures to enforce an iterative minimizing sequence to be constrained to the manifold, is used to train such models. At the same time, tame geometry has become a significant topological description of nonsmooth functions that appear in the landscapes of training neural networks and other important models with structural compositions of continuous nonlinear functions with nonsmooth maps. In this paper, we study the properties of such stratifiable functions on a manifold and the behavior of retracted stochastic gradient descent, with diminishing stepsizes, for minimizing such functions.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Riemannian Optimization on Relaxed Indicator Matrix Manifold
Causal Abstraction Learning based on the Semantic Embedding Principle
A Spectral Framework for Tracking Communities in Evolving Networks
Elliptical Wishart distributions: information geometry, maximum likelihood estimator, performance analysis and statistical learning
The Gaussian Discriminant Variational Autoencoder (GdVAE): A Self-Explainable Model with Counterfactual Explanations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.