activity
20122023
most citedAnalysis and Design of Optimization Algorithms via Integral Quadratic Constraints

383 citations · 773 across the 39 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

cs.LG2018★ 8 cited

An Optimal Control Approach to Sequential Machine Teaching

Laurent Lessard, Xuezhou Zhang, Xiaojin Zhu

Given a sequential learning algorithm and a target model, sequential machine teaching aims to find the shortest training sequence to drive the learning algorithm to the target mode…

math.OC2018

Unified Necessary and Sufficient Conditions for the Robust Stability of Interconnected Sector-Bounded Systems

Saman Cyrus, Laurent Lessard

Classical conditions for ensuring the robust stability of a linear system in feedback with a sector-bounded nonlinearity include small gain, circle, passivity, and conicity theorem…

math.OC2018

A Canonical Form for First-Order Distributed Optimization Algorithms

Akhil Sundararajan, Bryan Van Scoy, Laurent Lessard

We consider the distributed optimization problem in which a network of agents aims to minimize the average of local functions. To solve this problem, several algorithms have recent…

math.OC2018★ 5 cited

Dissipativity Theory for Accelerating Stochastic Variance Reduction: A Unified Analysis of SVRG and Katyusha Using Semidefinite Programs

Bin Hu, Stephen Wright, Laurent Lessard

Techniques for reducing the variance of gradient estimates used in stochastic programming algorithms for convex finite-sum problems have received a great deal of attention in recen…

math.OC2018★ 7 cited

Lyapunov Functions for First-Order Methods: Tight Automated Convergence Guarantees

Adrien Taylor, Bryan Van Scoy, Laurent Lessard

We present a novel way of generating Lyapunov functions for proving linear convergence rates of first-order optimization methods. Our approach provably obtains the fastest linear c…