First-order Stochastic Algorithms for Escaping From Saddle Points in Almost Linear Time
–Neural Information Processing Systems
For finding a nearly second-orderstationary pointxsuchthatk F(x)k and 2F(x) I (in high probability), the best time complexity of the presented algorithms is eO(d/3.5),whereF(
Neural Information Processing Systems
Feb-12-2026, 10:17:16 GMT
- Country:
- Asia
- Afghanistan > Parwan Province
- Charikar (0.04)
- Middle East > Jordan (0.05)
- Afghanistan > Parwan Province
- North America
- Canada > Quebec
- Montreal (0.04)
- United States (0.04)
- Canada > Quebec
- Asia
- Technology: