Clément Calauzènes
15 papers · 2012–2024 · 5 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+4 more ↓ Show less ↑
🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (30) 🌍 Conference Polyglot · Silver 🐣 Hot Topic Early Bird 🏃 Academic Marathon · Half
⚡
Prolific Year · Productive
🔥
Unstoppable · Bronze
💎
Century Club · Bronze
🗃️
Keyword Collector
(73)
Top co-authors
Research topics
Machine Learning
(12)
Optimization & Theory
(12)
Mathematics & Optimization
(7)
Optimization
(6)
Artificial Intelligence
(5)
Core AI
(5)
Core Methods
(5)
Data Science & Analytics
(2)
Applications · Data Science & Analytics
(2)
Learning Types
(2)
Computer Science
(1)
Application Areas
(1)
Applications · Computer Science
(1)
Mathematics
(1)
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)
exploration-exploitation tradeoff
(1)
real-time optimization
(1)
preference learning
(1)
ranking evaluation
(1)
expected utility
(1)
surrogate loss
(1)
learning to rank
(1)
Papers
Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits
NeurIPS 2024
Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
NeurIPS 2024
Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues
ICML 2023
Jointly Efficient and Optimal Algorithms for Logistic Bandits
AISTATS 2022
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
Pure Exploration and Regret Minimization in Matching Bandits
ICML 2021
Do Not Mask What You Do Not Need to Mask: a Parser-Free Virtual Try-On
ECCV 2020
Improved Optimistic Algorithms for Logistic Bandits
ICML 2020
On ranking via sorting by estimated expected utility
NeurIPS 2020
Real-Time Optimisation for Online Learning in Auctions
ICML 2020
Robust Stackelberg buyers in repeated auctions
AISTATS 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
NeurIPS 2012