Samuel Vaiter

Orcid: 0000-0002-4077-708X

According to our database1, Samuel Vaiter authored at least 44 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Local linear convergence of proximal coordinate descent algorithm.
Optim. Lett., January, 2024

2023
The Derivatives of Sinkhorn-Knopp Converge.
SIAM J. Optim., September, 2023

The Geometry of Sparse Analysis Regularization.
SIAM J. Optim., June, 2023

Supervised Learning of Analysis-Sparsity Priors With Automatic Differentiation.
IEEE Signal Process. Lett., 2023

Convergence of Message Passing Graph Neural Networks with Generic Aggregation On Large Random Graphs.
CoRR, 2023

Gradient scarcity with Bilevel Optimization for Graph Learning.
CoRR, 2023

A Near-Optimal Algorithm for Bilevel Empirical Risk Minimization.
CoRR, 2023

What functions can Graph Neural Networks compute on random graphs? The role of Positional Encoding.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

One-step differentiation of iterative algorithms.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Robustness of Text Vectorizers.
Proceedings of the International Conference on Machine Learning, 2023

2022
Implicit Differentiation for Fast Hyperparameter Selection in Non-Smooth Convex Learning.
J. Mach. Learn. Res., 2022

A framework for bilevel optimization that enables stochastic and global variance reduction algorithms.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Automatic differentiation of nonsmooth iterative algorithms.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Benchopt: Reproducible, efficient and collaborative optimization benchmarks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Linear support vector regression with linear constraints.
Mach. Learn., 2021

Automated Data-Driven Selection of the Hyperparameters for Total-Variation-Based Texture Segmentation.
J. Math. Imaging Vis., 2021

Block-Based Refitting in ℓ <sub>12</sub> Sparse Regularization.
J. Math. Imaging Vis., 2021

On the Universality of Graph Neural Networks on Large Random Graphs.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Model identification and local linear convergence of coordinate descent.
CoRR, 2020

Sparse and Smooth: improved guarantees for Spectral Clustering in the Dynamic Stochastic Block Model.
CoRR, 2020

Convergence and Stability of Graph Convolutional Networks on Large Random Graphs.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Implicit differentiation of Lasso-type models for hyperparameter optimization.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Maximal Solutions of Sparse Analysis Regularization.
J. Optim. Theory Appl., 2019

Dual Extrapolation for Sparse Generalized Linear Models.
CoRR, 2019

Refitting Solutions Promoted by ℓ _12 Sparse Analysis Regularizations with Block Penalties.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2019

2018
Model Consistency of Partly Smooth Regularizers.
IEEE Trans. Inf. Theory, 2018

Is the 1-norm the best convex sparse regularization?
CoRR, 2018

Optimality of 1-norm regularization among weighted 1-norms for sparse recovery: a case study on how to find optimal regularizations.
CoRR, 2018

2017
CLEAR: Covariant LEAst-Square Refitting with Applications to Image Restoration.
SIAM J. Imaging Sci., 2017

Accelerated Alternating Descent Methods for Dykstra-Like Problems.
J. Math. Imaging Vis., 2017

2016
CLEAR: Covariant LEAst-square Re-fitting with applications to image restoration.
CoRR, 2016

2014
Low Complexity Regularizations of Inverse Problems. (Régularisations de Faible Complexité pour les Problèmes Inverses).
PhD thesis, 2014

Stein Unbiased GrAdient estimator of the Risk (SUGAR) for Multiple Parameter Selection.
SIAM J. Imaging Sci., 2014

Low Complexity Regularization of Linear Inverse Problems.
CoRR, 2014

Partly Smooth Regularization of Inverse Problems.
CoRR, 2014

The Degrees of Freedom of Partly Smooth Regularizers.
CoRR, 2014

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14).
CoRR, 2014

2013
Robust Sparse Analysis Regularization.
IEEE Trans. Inf. Theory, 2013

Robust Polyhedral Regularization
CoRR, 2013

Stable Recovery with Analysis Decomposable Priors
CoRR, 2013

Model Selection with Piecewise Regular Gauges.
CoRR, 2013

2012
The degrees of freedom of the Group Lasso for a General Design
CoRR, 2012

Risk estimation for matrix recovery with spectral regularization
CoRR, 2012

Unbiased risk estimation for sparse analysis regularization.
Proceedings of the 19th IEEE International Conference on Image Processing, 2012


  Loading...