← Search

Guillaume Garrigos

4 accepted papers

2023

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization

NeurIPS 2023poster

We study multi-product inventory control problems where a manager makes sequential replenishment decisions based on partial historical information in order to minimize its cumulative losses. Our motivation is to consider general demands, losses and dynamics to go beyond standard models which usually…

Cited by 3SourcePDFScholar
2023

Provable convergence guarantees for black-box variational inference

NeurIPS 2023poster

Black-box variational inference is widely used in situations where there is no proof that its stochastic optimization succeeds. We suggest this is due to a theoretical gap in existing stochastic optimization proofs—namely the challenge of gradient estimators with unusual noise bounds, and a composit…

Cited by 26SourcePDFScholar
2022

SAN: Stochastic Average Newton Algorithm for Minimizing Finite Sums

AISTATS 2022poster

We present a principled approach for designing stochastic Newton methods for solving finite sum optimization problems. Our approach has two steps. First, we re-write the stationarity conditions as a system of nonlinear equations that associates each data point to a new row. Second, we apply a Subsam…

2019

Model Consistency for Learning with Mirror-Stratifiable Regularizers

AISTATS 2019poster

Low-complexity non-smooth convex regularizers are routinely used to impose some structure (such as sparsity or low-rank) on the coefficients for linear predictors in supervised learning. Model consistency consists then in selecting the correct structure (for instance support or rank) by regularized…

Cited by 13SourcePDFScholar