383 citations · 773 across the 39 of their papers we have counts for
Showing 2021 · math.OCShow all
3 papers · 2 filters
math.OC2021★ 6 cited
The Speed-Robustness Trade-Off for First-Order Methods with Additive Gradient Noise
Bryan Van Scoy, Laurent Lessard
We study the trade-off between convergence rate and sensitivity to stochastic additive gradient noise for first-order optimization methods. Ordinary Gradient Descent (GD) can be ma…
math.OC2021★ 4 cited
An automatic system to detect equivalence between iterative algorithms
Shipu Zhao, Laurent Lessard, Madeleine Udell
When are two algorithms the same? How can we be sure a recently proposed algorithm is novel, and not a minor twist on an existing method? In this paper, we present a framework for…
math.OC2021
Generalized Necessary and Sufficient Robust Boundedness Results for Feedback Systems
Saman Cyrus, Laurent Lessard
Classical sufficient conditions for ensuring the robust stability of a dynamical system in feedback with a nonlinearity include passivity, small gain, circle, and conicity theorems…