Email: joseph.salmon.taff@gmail.com
Address: IMAG, c.c. 051 Université de Montpellier Place Eugène Bataillon 34095 Montpellier Cedex 5 (office 415, building 9)
Phone: +33 4 67 14 35 19
Recent Publications
Implicit differentiation for fast hyperparameter selection in non-smooth convex learning
Q. Bertrand, Q. Klopfenstein, M. Massias, M. Blondel, S. Vaiter, A. Gramfort and J. Salmon (2022).
J. Mach. Learn. Res.
.
[BibTeX]
@article{Bertrand_Klopfenstein_Massias_Blondel_Vaiter_Gramfort_Salmon21,
author = {Q. Bertrand and Q. Klopfenstein and M. Massias and M. Blondel and S. Vaiter and A. Gramfort and J. Salmon},
journal = {J. Mach. Learn. Res.},
pdf = {https://arxiv.org/pdf/2105.01637},
title = {{Implicit differentiation for fast hyperparameter selection in non-smooth convex learning}},
year = {2022}
}
@techreport{Chevalier_Nguyen_Thirion_Salmon22,
author = {J.-A. Chevalier and T. B. Nguyen and B. Thirion and J. Salmon},
title = {Spatially relaxed inference on high-dimensional linear models},
year = {2022}
}
Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification
C. Garcin, M. Servajean, A. Joly and J. Salmon (2022).
ICML
[BibTeX]
@inproceedings{Garcin_Servajean_Joly_Salmon22,
author = {C. Garcin and M. Servajean and A. Joly and J. Salmon},
booktitle = {ICML},
pdf = {https://arxiv.org/pdf/2202.02193.pdf},
title = {Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification},
year = {2022}
}
Differentially Private Coordinate Descent for Composite Empirical Risk Minimization
P. Mangold, A. Bellet, J. Salmon and M. Tommasi (2022).
ICML
[BibTeX]
@inproceedings{Mangold_Bellet_Salmon_Tommasi21,
author = {P. Mangold and A. Bellet and J. Salmon and M. Tommasi},
booktitle = {ICML},
pdf = {https://arxiv.org/pdf/2110.11688},
title = {Differentially Private Coordinate Descent for Composite Empirical Risk Minimization},
year = {2022}
}
@techreport{Moreau_etal2022,
author = {T. Moreau and M. Massias and A. Gramfort and P. Ablin and B. Charlier and P.-A. Bannier and M. Dagréou and T. Dupré la Tour and G. Durif and C. F. Dantas and Q. Klopfenstein and J. Larsson and E. Lai and T. Lefort and B. Malézieux and B. Moufad and T. B. Nguyen and A. Rakotomamonjy and Z. Ramzi and J. Salmon and S. Vaiter},
keywords = {Machine Learning (cs.LG), Optimization and Control (math.OC), Machine Learning (stat.ML), FOS: Computer and information sciences, FOS: Computer and information sciences, FOS: Mathematics, FOS: Mathematics},
publisher = {arXiv},
title = {Benchopt: Reproducible, efficient and collaborative optimization benchmarks},
url = {https://arxiv.org/abs/2206.13424},
year = {2022}
}
Provably Convergent Working Set Algorithm for Non-Convex Regularized Regression
A. Rakotomamonjy, R. Flamary, G. Gasso and J. Salmon (2022).
AISTATS
[BibTeX]
@inproceedings{Rakotomamonjy_Flamary_Gasso_Salmon20,
author = {A. Rakotomamonjy and R. Flamary and G. Gasso and J. Salmon},
booktitle = {AISTATS},
pdf = {https://hal.archives-ouvertes.fr/hal-02875560},
title = {Provably Convergent Working Set Algorithm for Non-Convex Regularized Regression},
year = {2022}
}
LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lasso
K. Šehić, A. Gramfort, J. Salmon and L. Nardi (2022).
International Conference on
Automated Machine Learning
[BibTeX]
@inproceedings{Sehic_Gramfort_Salmom_Nardi21,
author = {K. Šehić and A. Gramfort and J. Salmon and L. Nardi},
booktitle = {International Conference on
Automated Machine Learning},
pdf = {https://arxiv.org/pdf/2010.11825.pdf},
title = {LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lasso},
year = {2022}
}
Contact
News
- March 2022: visitor at the Simons Institute for the Theory of Computing
- August 2021: New dataset available! This is a subset of the Pl@ntNet database https://plantnet.org/, with more than 300k images and thousands of classes (plant species) https://github.com/plantnet/PlantNet-300K. See the Neurips, Datasets and Benchmarks Track paper pdf.
- July 2021: IUF Nomination (junior member): https://www.iufrance.fr/detail-de-lactualite/247.html
- November 2020: Launching ML-MTP Machine Learning in Montpellier, Theory & Practice.
- October 2020: talk at GdR MIA Thematic day on Non-Convex Sparse Optimization (Toulouse, France) "Screening Rules for Lasso with Non-Convex Sparse Regularizers" slides and a bit on BenchOpt, a new package to simplify, make more transparent and more reproducible comparisons between optimization algorithms
- June 2020: New paper accepted to ICML "Implicit differentiation of Lasso-type models for hyperparameter optimization" with Q. Bertrand, Q. Klopfenstein, M. Blondel, S. Vaiter and A. Gramfort, code
- January 2020: New paper accepted to AISTATS "Support recovery and sup-norm convergence rates for sparse pivotal estimation" with Q. Bertrand, M. Massias and A. Gramfort, code
- December 2019: The AI chair proposal CaMeLOt (CooperAtive MachinE Leanrning and OpTimization) has been selected by the ANR. Open PhD and postdoc positions will be published soon (location: Montpellier). Do not hesitate to contact me for additional information.
- September 2019: New paper accepted at NeurIPS 2019, joint work with Q. Bertrand, M. Massias and A. Gramfort. "Handling correlated and repeated measurements with the smoothed Multivariate square-root Lasso" arxiv, code
- May 2019 : Workshop in Montpellier Graph signals : learning and optimization perspectives
- "Celer: a Fast Solver for the Lasso with Dual Extrapolation", accepted to ICML2018; code and companion paper called (pdf, slides). Joint work with Mathurin Massias and Alexandre Gramfort
- classgrade: an open source project for peer grading, mostly developed by C. Marini. In the process of being merged into: Peeramid.
Team
Post-doc
- Cassio Fraga Dantas 2022-?
Ph.D. Students
- Tanguy Lefort co-supervised with Benjamin Charlier 2021-2024?
- Camille Garcin co-supervised by Alexis Joly and Maximilien Servajean: 2020-2023?
- Emmanuel Pilliat co-supervised by Nicolas Verzelen and Alexandra Carpentier: 2020-2023?
- Hashem Ghanem co-supervised by Samuel Vaiter and Nicolas Keriven: 2020-2023?
- Florent Bascou co-supervised by Sophie Lèbre: 2019-2022?
- Damien Blanc co-supervised by Benjamin Charlier and funded by Quantacell: 2019-2022?
Alumni
- Quentin Bertrand [Ph.D. 2018-2021], co-supervised by Alexandre Gramfort (now at Mila)
- Nidham Gazagnadou [Ph.D. 2018-2021] co-supervised by Robert Gower (now at Sony AI)
- Pierre-Antoine Bannier [Intern 2021], co-supervised by Alexandre Gramfort
- Jérôme-Alexis Chevalier [Ph.D. 2017-2020], co-supervised by Bertrand Thirion (now at Inria Saclay)
- Mathurin Massias [Ph.D. 2016-219], co-supervised by Alexandre Gramfort (now CR INRIA, Lyon)
- Evgenii Chzhen [Ph.D. 2016-2019], co-supervised by Mohamed Hebiri (now CR CNRS, Saclay)
- Eugene Ndiaye [Ph.D., 2015-2018], co-supervised by Olivier Fercoq (now post-doctorate at GeorgiaTech)
- Jean Lafond [Ph.D., 2013-2016] co-supervised by Éric Moulines (now at Cubist Systematic, UK)
- Igor Colin [Ph.D., 2013-2016] co-supervised by Stéphan Clémençon and funded by Streamwide (now at Huawei)
- Jair Montoya [Post Doc, 2016-2017], co-supervised by Olivier Fercoq
- Thierry Guillemot (now at ARIADNEXT) Engineer, co-supervised by Alexandre Gramfort, 2016
Short Bio
Since 2018, I am a full professor at Université de Montpellier and an associate member at INRIA Parietal Team. For the spring and summer quarters 2018, I was a visiting assistant professor at UW, Statistics departement. From 2012 to 2018 I was an assistant professor at Telecom ParisTech. Back in 2011 and 2012, I was a post-doctoral Associate at Duke university working with Rebecca Willett.
In 2010, I finished my Ph.D. in statistics and image processing under the supervision of Dominique Picard and Erwan Le Pennec at the Laboratoire de Probabilités et de Modélisation Aléatoire, now LPSM, in Université Paris Diderot.
Software
-
BenchOpt: package to simplify, make more transparent and more reproducible comparisons between optimization algorithms
-
Celer: a fast Lasso solver, code of the associated ICML2018 paper "Dual Extrapolation for Faster Lasso Solvers" (pdf, slides)
- sparse-ho: a fast hyper-parameter package to select the best Lasso parameter efficiently, code of the associated ICML2020 paper "Implicit differentiation of Lasso-type models for hyperparameter optimization" (pdf)
- matlab toolboxes for statistics and image processing (this is legacy)
More on my Github Page
Joining? Open positions in my lab
I am always looking for outstanding and highly motivated people to join my team as interns, Ph.D. students, post-doctorates or research engineers in the following areas:
- optimization for machine learning (including federated learning, privacy, etc.)
- high dimensional and robust statistics
I always have open positions for outstanding applicants (post-doc, Ph.D. thesis, internship).
The application process is light:
- Email me your CV, transcript of most recent grades (for interns and Ph.D. students) and explain in a paragraph why you are interested to join my group.
- After preliminary feedback on my side, I will ask you to secure two reference letters (one is enough for interns or Ph.D. students) to be sent directly to me.
- At this stage an interview (possibly online) will be arranged to double-check your skills and profile compatibility.