Suivre
Mathurin Massias
Mathurin Massias
Adresse e-mail validée de inria.fr - Page d'accueil
Titre
Citée par
Citée par
Année
Celer: a Fast Solver for the Lasso with Dual Extrapolation
M Massias, A Gramfort, J Salmon
Proceedings of the 35th International Conference on Machine Learning, 2018
752018
Learning step sizes for unfolded sparse coding
P Ablin, T Moreau, M Massias, A Gramfort
Advances in Neural Information Processing Systems, 13100-13110, 2019
462019
Generalized Concomitant Multi-Task Lasso for Sparse Multimodal Regression
M Massias, O Fercoq, A Gramfort, J Salmon
International Conference on Artificial Intelligence and Statistics, 998-1007, 2018
272018
From safe screening rules to working sets for faster lasso-type solvers
M Massias, A Gramfort, J Salmon
10th NIPS Workshop on Optimization for Machine Learning, 2017
252017
Dual Extrapolation for Sparse Generalized Linear Models
M Massias, S Vaiter, A Gramfort, J Salmon
Journal of Machine Learning Research 21, 1-33, 2020
232020
Handling correlated and repeated measurements with the smoothed multivariate square-root Lasso
Q Bertrand, M Massias, A Gramfort, J Salmon
Advances in Neural Information Processing Systems, 3959-3970, 2019
162019
Implicit differentiation for fast hyperparameter selection in non-smooth convex learning
Q Bertrand, Q Klopfenstein, M Massias, M Blondel, S Vaiter, A Gramfort, ...
arXiv preprint arXiv:2105.01637, 2021
142021
Anderson acceleration of coordinate descent
Q Bertrand, M Massias
International Conference on Artificial Intelligence and Statistics, 1288-1296, 2021
102021
Iterative regularization for convex regularizers
C Molinari, M Massias, L Rosasco, S Villa
International Conference on Artificial Intelligence and Statistics, 1684-1692, 2021
82021
Benchopt: Reproducible, efficient and collaborative optimization benchmarks
T Moreau, M Massias, A Gramfort, P Ablin, PA Bannier, B Charlier, ...
Advances in Neural Information Processing Systems 35, 25404-25421, 2022
62022
Beyond L1: Faster and Better Sparse Models with skglm
Q Bertrand, Q Klopfenstein, PA Bannier, G Gidel, M Massias
arXiv preprint arXiv:2204.07826, 2022
52022
Support recovery and sup-norm convergence rates for sparse pivotal estimation
M Massias, Q Bertrand, A Gramfort, J Salmon
International Conference on Artificial Intelligence and Statistics, 2655-2665, 2020
52020
Dimension-free convergence rates for gradient Langevin dynamics in RKHS
B Muzellec, K Sato, M Massias, T Suzuki
Conference on Learning Theory, 1356-1420, 2022
42022
Iterative regularization for low complexity regularizers
C Molinari, M Massias, L Rosasco, S Villa
arXiv preprint arXiv:2202.00420, 2022
22022
Coordinate Descent for SLOPE
J Larsson, Q Klopfenstein, M Massias, J Wallin
International Conference on Artificial Intelligence and Statistics, 4802-4821, 2023
12023
Gap Safe screening rules for faster complex-valued multi-task group Lasso
M Massias, J Salmon, A Gramfort
SPARS, 2017
12017
Implicit Differentiation for Fast Hyperparameter Selection in Non-Smooth Convex Learning
Q Bertrand, Q Klopfenstein, M Massias, M Blondel, S Vaiter, A Gramfort, ...
Journal of Machine Learning Research 23 (149), 1-43, 2022
2022
Implicit regularization for convex regularizers
C Molinari, M Massias, L Rosasco, S Villa
arXiv preprint arXiv:2006.09859, 2020
2020
Sparse high dimensional regression in the presence of colored heteroscedastic noise: application to M/EEG source imaging
M Massias
Telecom Paristech, 2019
2019
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–19