260 citations · 836 across the 69 of their papers we have counts for
72 papers
Reinforcement learning
Sarod Yatawatta
Observing celestial objects and advancing our scientific knowledge about them involves tedious planning, scheduling, data collection and data post-processing. Many of these operati…
Oblivious Stochastic Composite Optimization
Clément Lezane, Alexandre d'Aspremont
In stochastic convex optimization problems, most existing adaptive methods rely on prior knowledge about the diameter bound when the smoothness or the Lipschitz constant is unk…
Optimal Algorithms for Stochastic Complementary Composite Minimization
Alexandre d'Aspremont, Cristóbal Guzmán, Clément Lezane
Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the m…
Linear Bandits on Uniformly Convex Sets
Thomas Kerdreux, Christophe Roux, Alexandre d'Aspremont +1
Linear bandit algorithms yield pseudo-regret bounds on compact convex action sets and two types of structural assu…
Local and Global Uniform Convexity Conditions
Thomas Kerdreux, Alexandre d'Aspremont, Sebastian Pokutta
We review various characterizations of uniform convexity and smoothness on norm balls in finite-dimensional spaces and connect results stemming from the geometry of Banach spaces w…
Approximation Bounds for Sparse Programs
Armin Askari, Alexandre d'Aspremont, Laurent El Ghaoui
We show that sparsity constrained optimization problems over low dimensional spaces tend to have a small duality gap. We use the Shapley-Folkman theorem to derive both data-driven…