Quentin Berthet
19 papers · 2013–2025 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
π Academic Marathon (12) π§ Keyword Pioneer π Interdisciplinary Bridge π Conference Polyglot (4) π Cross-Pollinator (11)
π
Renaissance Researcher
(5)
πΊοΈ
Taxonomy Completionist
(33)
π
Conference Polyglot
(4)
π
Century Club
(19)
ποΈ
Keyword Collector
(86)
π
Trend Setter
β‘
Prolific Year
(5)
Conferences
AISTATS (7)
NIPS (6)
ICML (4)
COLT (2)
Top co-authors
Research topics
Keywords
optimal transport
(3)
hypothesis testing
(3)
convex optimization
(3)
wasserstein distance
(2)
frank-wolfe algorithm
(2)
stochastic optimization
(2)
minimax rate
(2)
multi-armed bandit
(2)
computational complexity
(2)
gradient descent
(2)
online learning
(1)
hyperparameter optimization
(1)
density estimation
(1)
knowledge distillation
(1)
semi-supervised learning
(1)
statistical learning theory
(1)
parallel computing
(1)
structured prediction
(1)
compressed sensing
(1)
sparse principal component analysis
(1)
Papers
Implicit Diffusion: Efficient optimization through stochastic sampling
AISTATS 2025
Decoding-time Realignment of Language Models
ICML 2024
Regression as Classification: Influence of Task Formulation on Neural Network Features
AISTATS 2023
Differentiable Clustering with Perturbed Spanning Forests
NIPS 2023
Mirror Sinkhorn: Fast Online Optimization on Transport Polytopes
ICML 2023
Efficient and Modular Implicit Differentiation
NIPS 2022
Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization
NIPS 2022
Statistical and Computational Rates in Graph Logistic Regression
AISTATS 2020
Fast Differentiable Sorting and Ranking
ICML 2020
Learning with Differentiable Pertubed Optimizers
NIPS 2020
Stochastic Optimization for Regularized Wasserstein Estimators
ICML 2020
Regularized Contextual Bandits
AISTATS 2019
Statistical Windows in Testing for the Initial Distribution of a Reversible Markov Chain
AISTATS 2019
Detection of Planted Solutions for Flat Satisfiability Problems
AISTATS 2019
Unsupervised Alignment of Embeddings with Wasserstein Procrustes
AISTATS 2019
Estimation of smooth densities in Wasserstein distance
COLT 2019
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe
NIPS 2017
Average-case hardness of RIP certification
NIPS 2016
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection
COLT 2013