Stéphan Clémençon
42 papers · 2005–2026 · 10 venues · across top CS/AI venues
This profile combines several different researchers. Authors are keyed by name, and this name's papers fall into 9 separate collaboration groups - the largest holds only 45% of them. Pick the group below that matches the researcher you mean. How a shared name is split.
Achievements are not shown for a combined profile - each one describes a single researcher's record, which this is not.
Which Stéphan Clémençon?
6 groups of papers that share co-authors internally but none with each other - each most likely a different researcher. Pick one to see its papers.
with Aurélien Bellet, Nathan Noiry, Ekhine Irurozki
19 papers
· 2015–2024
· ICML, NeurIPS, AISTATS
Hide ▲
Assessing Uncertainty in Similarity Scoring: Performance & Fairness in Face Recognition
ICLR 2024
Towards More Robust NLP System Evaluation: Handling Missing Scores in Benchmarks
EMNLP 2024
Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues
ICML 2023
Mitigating Gender Bias in Face Recognition using the von Mises-Fisher Mixture Model
ICML 2022
Statistical Depth Functions for Ranking Distributions: Definitions, Statistical Learning and Applications
AISTATS 2022
What are the best Systems? New Perspectives on NLP Benchmarking
NeurIPS 2022
Generalization Bounds in the Presence of Outliers: a Median-of-Means Study
ICML 2021
Learning Fair Scoring Functions: Bipartite Ranking under ROC-based Fairness Constraints
AISTATS 2021
Learning from Biased Data: A Semi-Parametric Approach
ICML 2021
Autoencoding any Data through Kernel Autoencoders
AISTATS 2019
Functional Isolation Forest
ACML 2019
On Medians of (Randomized) Pairwise Means
ICML 2019
A Probabilistic Theory of Supervised Similarity Learning for Pointwise ROC Curve Optimization
ICML 2018
Gossip Dual Averaging for Decentralized Optimization of Pairwise Functions
ICML 2016
Learning from Survey Training Samples: Rate Bounds for Horvitz-Thompson Risk Minimizers
ACML 2016
On Graph Reconstruction via Empirical Risk Minimization: Fast Learning Rates and Scalability
NeurIPS 2016
Scaling-up Empirical Risk Minimization: Optimization of Incomplete U-statistics
JMLR 2016
Extending Gossip Algorithms to Distributed Estimation of U-statistics
NeurIPS 2015
SGD Algorithms based on Incomplete U-statistics: Large-Scale Minimization of Empirical Risk
NeurIPS 2015