On Gradient-Based Optimization: Accelerated, Stochastic and Nonconvex

5 535
21.7
Следующее
Популярные
148 дней – 60810:32
AI Forum 2023 | Opening Remarks
Опубликовано 29 мая 2018, 3:18
Many new theoretical challenges have arisen in the area of gradient-based optimization for large-scale statistical data analysis, driven by the needs of applications and the opportunities provided by new hardware and software platforms. I discuss several recent, related results in this area: (1) a new framework for understanding Nesterov acceleration, obtained by taking a continuous-time, Lagrangian/Hamiltonian/symplectic perspective, (2) a discussion of how to escape saddle points efficiently in nonconvex optimization, and (3) the acceleration of Langevin diffusion.

See more at microsoft.com/en-us/research/v...
автотехномузыкадетское