Joseph Salmon

Orcid: 0000-0002-3181-0634

According to our database1, Joseph Salmon authored at least 65 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

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
Supervised Learning of Analysis-Sparsity Priors With Automatic Differentiation.
IEEE Signal Process. Lett., 2023

A two-head loss function for deep Average-K classification.
CoRR, 2023

High-Dimensional Private Empirical Risk Minimization by Greedy Coordinate Descent.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Spatially relaxed inference on high-dimensional linear models.
Stat. Comput., 2022

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

Improve learning combining crowdsourced labels by weighting Areas Under the Margin.
CoRR, 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

Differentially Private Coordinate Descent for Composite Empirical Risk Minimization.
Proceedings of the International Conference on Machine Learning, 2022

Stochastic smoothing of the top-K calibrated hinge loss for deep imbalanced classification.
Proceedings of the International Conference on Machine Learning, 2022

LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lasso.
Proceedings of the International Conference on Automated Machine Learning, 2022

Convergent Working Set Algorithm for Lasso with Non-Convex Sparse Regularizers.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Decoding with confidence: Statistical control on decoder maps.
NeuroImage, 2021

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

Pl@ntNet-300K: a plant image dataset with high label ambiguity and a long-tailed distribution.
Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, 2021

Score-Based Change Detection For Gradient-Based Learning Machines.
Proceedings of the IEEE International Conference on Acoustics, 2021

Elastic Net avec gestion des interactions et débiaisage.
Proceedings of the Extraction et Gestion des Connaissances, 2021

2020
Integer Programming on the Junction Tree Polytope for Influence Diagrams.
INFORMS J. Optim., July, 2020

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

Statistical control for spatio-temporal MEG/EEG source imaging with desparsified multi-task Lasso.
CoRR, 2020

Screening Rules and its Complexity for Active Set Identification.
CoRR, 2020

Provably Convergent Working Set Algorithm for Non-Convex Regularized Regression.
CoRR, 2020

Statistical control for spatio-temporal MEG/EEG source imaging with desparsified mutli-task Lasso.
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

Support recovery and sup-norm convergence rates for sparse pivotal estimation.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Dual Extrapolation for Sparse Generalized Linear Models.
CoRR, 2019

Concomitant Lasso with Repetitions (CLaR): beyond averaging multiple realizations of heteroscedastic noise.
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

Handling correlated and repeated measurements with the smoothed multivariate square-root Lasso.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Screening rules for Lasso with non-convex Sparse Regularizers.
Proceedings of the 36th International Conference on Machine Learning, 2019

Safe Grid Search with Optimal Complexity.
Proceedings of the 36th International Conference on Machine Learning, 2019

Optimal Mini-Batch and Step Sizes for SAGA.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Statistical Inference with Ensemble of Clustered Desparsified Lasso.
Proceedings of the Medical Image Computing and Computer Assisted Intervention - MICCAI 2018, 2018

Celer: a Fast Solver for the Lasso with Dual Extrapolation.
Proceedings of the 35th International Conference on Machine Learning, 2018

Generalized Concomitant Multi-Task Lasso for Sparse Multimodal Regression.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

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

Gap Safe Screening Rules for Sparsity Enforcing Penalties.
J. Mach. Learn. Res., 2017

From safe screening rules to working sets for faster Lasso-type solvers.
CoRR, 2017

On the benefits of output sparsity for multi-label classification.
CoRR, 2017

2016
Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression.
CoRR, 2016

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

Adapting to unknown noise level in sparse deconvolution.
CoRR, 2016

GAP Safe Screening Rules for Sparse-Group Lasso.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Gossip Dual Averaging for Decentralized Optimization of Pairwise Functions.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
On Debiasing Restoration Algorithms: Applications to Total-Variation and Nonlocal-Means.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2015

GAP Safe screening rules for sparse multi-task and multi-class models.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Extending Gossip Algorithms to Distributed Estimation of U-statistics.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Mind the duality gap: safer rules for the Lasso.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Poisson Noise Reduction with Non-local PCA.
J. Math. Imaging Vis., 2014

Mandatory Critical Points of 2D Uncertain Scalar Fields.
Comput. Graph. Forum, 2014

Probabilistic low-rank matrix completion on finite alphabets.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Stable Recovery with Analysis Decomposable Priors
CoRR, 2013

Learning Heteroscedastic Models by Convex Programming under Group Sparsity.
Proceedings of the 30th International Conference on Machine Learning, 2013

2012
Patch reprojections for Non-Local methods.
Signal Process., 2012

Oracle Inequalities and Minimax Rates for Nonlocal Means and Related Adaptive Kernel-Based Methods.
SIAM J. Imaging Sci., 2012

Non-local Methods with Shape-Adaptive Patches (NLM-SAP).
J. Math. Imaging Vis., 2012

A two-stage denoising filter: The preprocessed Yaroslavsky filter.
Proceedings of the IEEE Statistical Signal Processing Workshop, 2012

2011
Optimal aggregation of affine estimators.
Proceedings of the COLT 2011, 2011

Oracle inequalities and minimax rates for non-local means and related adaptive kernel-based methods
CoRR, 2011

Anisotropic Non-Local Means with Spatially Adaptive Patch Shapes.
Proceedings of the Scale Space and Variational Methods in Computer Vision, 2011

Image denoising with patch based PCA: local versus global.
Proceedings of the British Machine Vision Conference, 2011

Competing against the Best Nearest Neighbor Filter in Regression.
Proceedings of the Algorithmic Learning Theory - 22nd International Conference, 2011

2010
On Two Parameters for Denoising With Non-Local Means.
IEEE Signal Process. Lett., 2010

From patches to pixels in Non-Local methods: Weighted-average reprojection.
Proceedings of the International Conference on Image Processing, 2010

2009
NL-Means and aggregation procedures.
Proceedings of the International Conference on Image Processing, 2009


  Loading...