10 citations · 20 across the 4 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2020★ 1 cited
Escaping Saddle-Points Faster under Interpolation-like Conditions
Abhishek Roy, Krishnakumar Balasubramanian, Saeed Ghadimi +1
In this paper, we show that under over-parametrization several standard stochastic optimization algorithms escape saddle-points and converge to local-minimizers much faster. One of…
stat.ML2019
Multi-Point Bandit Algorithms for Nonstationary Online Nonconvex Optimization
Abhishek Roy, Krishnakumar Balasubramanian, Saeed Ghadimi +1
Bandit algorithms have been predominantly analyzed in the convex setting with function-value based stationary regret as the performance measure. In this paper, motivated by online…