Timezone: »
Oral
Safe Grid Search with Optimal Complexity
Eugene Ndiaye · Tam Le · Olivier Fercoq · Joseph Salmon · Ichiro Takeuchi
Popular machine learning estimators involve regularization parameters that can be challenging to tune, and standard strategies rely on grid search for this task.
In this paper, we revisit the techniques of approximating the regularization path up to predefined tolerance $\epsilon$ in a unified framework and show that its complexity is $O(1/\sqrt[d]{\epsilon})$ for uniformly convex loss of order $d>0$ and $O(1/\sqrt{\epsilon})$ for Generalized Self-Concordant functions.
This framework encompasses least-squares but also logistic regression, a case that as far as we know was not handled as precisely in previous works.
We leverage our technique to provide refined bounds on the validation error as well as a practical algorithm for hyperparameter tuning.
The later has global convergence guarantee when targeting a prescribed accuracy on the validation set.
Last but not least, our approach helps relieving the practitioner from the (often neglected) task of selecting a stopping criterion when optimizing over the training set: our method automatically calibrates this criterion based on the targeted accuracy on the validation set.
Author Information
Eugene Ndiaye (RIKEN AIP)
Tam Le (RIKEN AIP)
My name is Tam Le. I have been an assistant professor at The Institute of Statistical Mathematics (ISM), Japan since 09/2022. I am also a visiting scientist at RIKEN AIP, Japan since 12/2022. I officially received my PhD degree from Kyoto University in 01/2016, under the supervision of Professor Marco Cuturi and Professor Akihiro Yamamoto. Before ISM, I worked at RIKEN AIP as a postdoc (09/2017 - 07/2021), and as a research scientist (08/2021 - 08/2022), working with Professor Makoto Yamada. Before those, I spent 1.5 year as a postdoc at Nagoya Institute of Technology and National Institute of Materials Science (02/2016 - 08/2017), working with Professor Ichiro Takeuchi.
Olivier Fercoq (Télécom ParisTech, Université Paris-Saclay)
Joseph Salmon (Université de Montpellier)
Ichiro Takeuchi (Nagoya Institute of Technology / RIKEN)
Related Events (a corresponding poster, oral, or spotlight)
-
2019 Poster: Safe Grid Search with Optimal Complexity »
Wed. Jun 12th 01:30 -- 04:00 AM Room Pacific Ballroom
More from the Same Authors
-
2022 Poster: Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification »
Camille Garcin · Maximilien Servajean · Alexis Joly · Joseph Salmon -
2022 Poster: Differentially Private Coordinate Descent for Composite Empirical Risk Minimization »
Paul Mangold · Aurélien Bellet · Joseph Salmon · Marc Tommasi -
2022 Spotlight: Differentially Private Coordinate Descent for Composite Empirical Risk Minimization »
Paul Mangold · Aurélien Bellet · Joseph Salmon · Marc Tommasi -
2022 Spotlight: Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification »
Camille Garcin · Maximilien Servajean · Alexis Joly · Joseph Salmon -
2022 Poster: Bayesian Optimization for Distributionally Robust Chance-constrained Problem »
Yu Inatsu · Shion Takeno · Masayuki Karasuyama · Ichiro Takeuchi -
2022 Spotlight: Bayesian Optimization for Distributionally Robust Chance-constrained Problem »
Yu Inatsu · Shion Takeno · Masayuki Karasuyama · Ichiro Takeuchi -
2021 Poster: Active Learning for Distributionally Robust Level-Set Estimation »
Yu Inatsu · Shogo Iwazaki · Ichiro Takeuchi -
2021 Spotlight: Active Learning for Distributionally Robust Level-Set Estimation »
Yu Inatsu · Shogo Iwazaki · Ichiro Takeuchi -
2021 Poster: More Powerful and General Selective Inference for Stepwise Feature Selection using Homotopy Method »
Kazuya Sugiyama · Vo Nguyen Le Duy · Ichiro Takeuchi -
2021 Spotlight: More Powerful and General Selective Inference for Stepwise Feature Selection using Homotopy Method »
Kazuya Sugiyama · Vo Nguyen Le Duy · Ichiro Takeuchi -
2021 Poster: Optimal Transport Kernels for Sequential and Parallel Neural Architecture Search »
Vu Nguyen · Tam Le · Makoto Yamada · Michael A Osborne -
2021 Spotlight: Optimal Transport Kernels for Sequential and Parallel Neural Architecture Search »
Vu Nguyen · Tam Le · Makoto Yamada · Michael A Osborne -
2020 Poster: Multi-fidelity Bayesian Optimization with Max-value Entropy Search and its Parallelization »
Shion Takeno · Hitoshi Fukuoka · Yuhki Tsukada · Toshiyuki Koyama · Motoki Shiga · Ichiro Takeuchi · Masayuki Karasuyama -
2020 Poster: Implicit differentiation of Lasso-type models for hyperparameter optimization »
Quentin Bertrand · Quentin Klopfenstein · Mathieu Blondel · Samuel Vaiter · Alexandre Gramfort · Joseph Salmon -
2019 Poster: Almost surely constrained convex optimization »
Olivier Fercoq · Ahmet Alacaoglu · Ion Necoara · Volkan Cevher -
2019 Poster: Optimal Mini-Batch and Step Sizes for SAGA »
Nidham Gazagnadou · Robert Gower · Joseph Salmon -
2019 Poster: Screening rules for Lasso with non-convex Sparse Regularizers »
alain rakotomamonjy · Gilles Gasso · Joseph Salmon -
2019 Oral: Optimal Mini-Batch and Step Sizes for SAGA »
Nidham Gazagnadou · Robert Gower · Joseph Salmon -
2019 Oral: Almost surely constrained convex optimization »
Olivier Fercoq · Ahmet Alacaoglu · Ion Necoara · Volkan Cevher -
2019 Oral: Screening rules for Lasso with non-convex Sparse Regularizers »
alain rakotomamonjy · Gilles Gasso · Joseph Salmon -
2019 Poster: A Conditional-Gradient-Based Augmented Lagrangian Framework »
Alp Yurtsever · Olivier Fercoq · Volkan Cevher -
2019 Oral: A Conditional-Gradient-Based Augmented Lagrangian Framework »
Alp Yurtsever · Olivier Fercoq · Volkan Cevher -
2018 Poster: A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming »
Alp Yurtsever · Olivier Fercoq · Francesco Locatello · Volkan Cevher -
2018 Oral: A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming »
Alp Yurtsever · Olivier Fercoq · Francesco Locatello · Volkan Cevher -
2017 Poster: Selective Inference for Sparse High-Order Interaction Models »
Shinya Suzumura · Kazuya Nakagawa · Yuta Umezu · Koji Tsuda · Ichiro Takeuchi -
2017 Talk: Selective Inference for Sparse High-Order Interaction Models »
Shinya Suzumura · Kazuya Nakagawa · Yuta Umezu · Koji Tsuda · Ichiro Takeuchi