Philippe Rigollet
32 papers · 2007–2024 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
π Conference Polyglot (7) π Interdisciplinary Bridge πΊοΈ Taxonomy Completionist (13) π§ Keyword Pioneer π Academic Marathon (17)
π
Interdisciplinary Bridge
π
Conference Polyglot
(7)
π
Academic Marathon
(17)
π
Keyword Trendsetter Combo
(3)
π
Keyword Champion
(2)
π₯
Unstoppable
(10)
π
Conference Pioneer
π
Century Club
(32)
β‘
Prolific Year
(5)
π
Trend Setter
ποΈ
Keyword Collector
(154)
Conferences
COLT (12)
NIPS (8)
AISTATS (7)
JMLR (2)
ALT (1)
ICML (1)
UAI (1)
Top co-authors
Research topics
Keywords
optimal transport
(6)
markov chain monte carlo
(3)
wasserstein distance
(3)
regret bound
(3)
log-concave distribution
(3)
minimax rate
(2)
multi-armed bandit
(2)
representation learning
(2)
query complexity
(2)
convex loss
(2)
probability measure
(2)
density estimation
(2)
stochastic optimization
(2)
graphical model
(2)
binary classification
(2)
anomaly detection
(2)
variational inference
(2)
bayesian inference
(2)
determinantal point process
(2)
rejection sampling
(2)
Papers
Clustering in Causal Attention Masking
NIPS 2024
Bures-Wasserstein Barycenters and Low-Rank Matrix Recovery
AISTATS 2023
The emergence of clusters in self-attention dynamics
NIPS 2023
Variational inference via Wasserstein gradient flows
NIPS 2022
Rejection sampling from shape-constrained distributions in sublinear time
AISTATS 2022
The query complexity of sampling from strongly log-concave distributions in one dimension
COLT 2022
GULP: a prediction-based metric between representations
NIPS 2022
Efficient Interpolation of Density Estimators
AISTATS 2021
Fast and Smooth Interpolation on Wasserstein Space
AISTATS 2021
Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm
COLT 2021
A Statistical Perspective on Coreset Density Estimation
AISTATS 2021
Gradient descent algorithms for Bures-Wasserstein barycenters
COLT 2020
SVGD as a kernelized Wasserstein gradient flow of the chi-squared divergence
NIPS 2020
Exponential ergodicity of mirror-Langevin diffusions
NIPS 2020
Estimation Rates for Sparse Linear Cyclic Causal Models
UAI 2020
Balancing Gaussian vectors in high dimension
COLT 2020
Power analysis of knockoff filters for correlated designs
NIPS 2019
Statistical Optimal Transport via Factored Couplings
AISTATS 2019
Conference on Learning Theory 2018: Preface
COLT 2018
Teacher Improves Learning by Selecting a Training Subset
AISTATS 2018
Minimax Rates and Efficient Algorithms for Noisy Sorting
ALT 2018
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
NIPS 2017
Rates of estimation for determinantal point processes
COLT 2017
Learning Determinantal Point Processes with Moments and Cycles
ICML 2017
Optimal rates for total variation denoising
COLT 2016
Online learning in repeated auctions
COLT 2016
Batched Bandit Problems
COLT 2015
Complexity Theoretic Lower Bounds for Sparse Principal Component Detection
COLT 2013
Bounded regret in stochastic multi-armed bandits
COLT 2013
Neyman-Pearson classification under a strict constraint
COLT 2011
Neyman-Pearson Classification, Convexity and Stochastic Constraints
JMLR 2011
Generalization Error Bounds in Semi-supervised Classification Under the Cluster Assumption
JMLR 2007