Clément Calauzènes
15 papers · 2012–2024 · 5 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (5) 🗺️ Taxonomy Completionist (10) 🧭 Keyword Pioneer 🏃 Academic Marathon (12)
🏃
Academic Marathon
(12)
🐝
Cross-Pollinator
(15)
📈
Trend Setter
🗃️
Keyword Collector
(72)
🔥
Unstoppable
(6)
💎
Century Club
(15)
⚡
Prolific Year
(5)
Conferences
ICML (5)
AISTATS (4)
NIPS (4)
ALT (1)
ECCV (1)
Top co-authors
Keywords
regret minimization
(4)
multi-armed bandit
(4)
logistic bandit
(3)
regret bound
(3)
online learning
(2)
calibration
(1)
game theory
(1)
algorithmic fairness
(1)
minimax optimality
(1)
robust statistics
(1)
mechanism design
(1)
computational efficiency
(1)
convex optimization
(1)
learning to rank
(1)
expected utility
(1)
preference learning
(1)
real-time optimization
(1)
surrogate loss
(1)
best arm identification
(1)
ranking evaluation
(1)
Papers
Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
NIPS 2024
Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits
NIPS 2024
Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues
ICML 2023
Jointly Efficient and Optimal Algorithms for Logistic Bandits
AISTATS 2022
Pure Exploration and Regret Minimization in Matching Bandits
ICML 2021
A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions
ALT 2021
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits
AISTATS 2021
On ranking via sorting by estimated expected utility
NIPS 2020
Robust Stackelberg buyers in repeated auctions
AISTATS 2020
Do Not Mask What You Do Not Need to Mask: a Parser-Free Virtual Try-On
ECCV 2020
Real-Time Optimisation for Online Learning in Auctions
ICML 2020
Improved Optimistic Algorithms for Logistic Bandits
ICML 2020
Bridging the gap between regret minimization and best arm identification, with application to A/B tests
AISTATS 2019
Fairness-Aware Learning for Continuous Attributes and Treatments
ICML 2019
On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking
NIPS 2012