Riemannian stochastic optimization methods avoid strict saddle points
–Neural Information Processing Systems
Informally, our main result may be stated as follows: Under any stochastic Riemannian Robbins-Monro method, the probability of converging to a strict saddle point (or a submanifold thereof) is zero.
Neural Information Processing Systems
Oct-8-2025, 18:47:21 GMT
- Country:
- Africa > Middle East
- Tunisia > Ben Arous Governorate > Ben Arous (0.04)
- Asia
- Middle East > Jordan (0.04)
- Russia (0.04)
- Europe
- France > Auvergne-Rhône-Alpes
- Greece (0.04)
- Russia (0.04)
- Switzerland > Zürich
- Zürich (0.04)
- United Kingdom > England
- Cambridgeshire > Cambridge (0.04)
- North America > United States
- New Jersey > Mercer County > Princeton (0.04)
- Africa > Middle East
- Technology: