Clément Calauzènes

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 38

Top Topics

Generalized Linear

Expected Utility

Regret Minimization

Top Venues

GECCO (Companion)

Publications

Maria Cherifa, Clément Calauzènes, Vianney Perchet
Dynamic online matching with budget refills. CoRR (2024)
Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet
Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. ICASSP (2024)
Morgane Goibert, Clément Calauzènes, Ekhine Irurozki, Stéphan Clémençon
Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues. ICML (2023)
Morgane Goibert, Clément Calauzènes, Ekhine Irurozki, Stéphan Clémençon
Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues. CoRR (2023)
Louis Faury, Marc Abeille, Kwang-Sung Jun, Clément Calauzènes
Jointly Efficient and Optimal Algorithms for Logistic Bandits. CoRR (2022)
Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet
Learning in Repeated Auctions. Found. Trends Mach. Learn. 15 (3) (2022)
Louis Faury, Marc Abeille, Kwang-Sung Jun, Clément Calauzènes
Jointly Efficient and Optimal Algorithms for Logistic Bandits. AISTATS (2022)
Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui
Revenue-Maximizing Auctions: A Bidder's Standpoint. Oper. Res. 70 (5) (2022)
Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic
Pure Exploration and Regret Minimization in Matching Bandits. CoRR (2021)
Marc Abeille, Louis Faury, Clément Calauzènes
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. AISTATS (2021)
Louis Faury, Yoan Russac, Marc Abeille, Clément Calauzènes
A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions. ALT (2021)
Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic
Pure Exploration and Regret Minimization in Matching Bandits. ICML (2021)
Louis Faury, Yoan Russac, Marc Abeille, Clément Calauzènes
Regret Bounds for Generalized Linear Bandits under Parameter Drift. CoRR (2021)
Thibaut Issenhuth, Jérémie Mary, Clément Calauzènes
Do Not Mask What You Do Not Need to Mask: A Parser-Free Virtual Try-On. ECCV (20) (2020)
Thibaut Issenhuth, Jérémie Mary, Clément Calauzènes
Do Not Mask What You Do Not Need to Mask: a Parser-Free Virtual Try-On. CoRR (2020)
Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet
Learning in repeated auctions. CoRR (2020)
Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq
Improved Optimistic Algorithms for Logistic Bandits. CoRR (2020)
Lucas Anquetil, Mike Gartrell, Alain Rakotomamonjy, Ugo Tanielian, Clément Calauzènes
Wasserstein Learning of Determinantal Point Processes. CoRR (2020)
Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui
Robust Stackelberg buyers in repeated auctions. AISTATS (2020)
Lorenzo Croissant, Marc Abeille, Clément Calauzènes
Real-Time Optimisation for Online Learning in Auctions. ICML (2020)
Clément Calauzènes, Nicolas Usunier
On ranking via sorting by estimated expected utility. NeurIPS (2020)
Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq
Improved Optimistic Algorithms for Logistic Bandits. ICML (2020)
Marc Abeille, Louis Faury, Clément Calauzènes
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. CoRR (2020)
Lorenzo Croissant, Marc Abeille, Clément Calauzènes
Real-Time Optimisation for Online Learning in Auctions. CoRR (2020)
Rémy Degenne, Thomas Nedelec, Clément Calauzènes, Vianney Perchet
Bridging the gap between regret minimization and best arm identification, with application to A/B tests. AISTATS (2019)
Louis Faury, Clément Calauzènes, Olivier Fercoq, Syrine Krichene
Improving Evolutionary Strategies with Generative Neural Networks. CoRR (2019)
Syrine Krichene, Mike Gartrell, Clément Calauzènes
Embedding models for recommendation under contextual constraints. CoRR (2019)
Thibaut Issenhuth, Jérémie Mary, Clément Calauzènes
End-to-End Learning of Geometric Deformations of Feature Maps for Virtual Try-On. CoRR (2019)
Clément Calauzènes, Thomas Nedelec, Vianney Perchet, Noureddine El Karoui
Robust Stackelberg buyers in repeated auctions. CoRR (2019)
Louis Faury, Clément Calauzènes, Olivier Fercoq
Benchmarking GNN-CMA-ES on the BBOB noiseless testbed. GECCO (Companion) (2019)
Jérémie Mary, Clément Calauzènes, Noureddine El Karoui
Fairness-Aware Learning for Continuous Attributes and Treatments. ICML (2019)
Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, Simon Dollé
Offline A/B testing for Recommender Systems. CoRR (2018)
Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, Simon Dollé
Offline A/B Testing for Recommender Systems. WSDM (2018)
Louis Faury, Flavian Vasile, Clément Calauzènes, Olivier Fercoq
Neural Generative Models for Global Optimization with Gradients. CoRR (2018)
Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Thomas Nedelec, Vianney Perchet
Explicit shading strategies for repeated truthful auctions. CoRR (2018)
Rémy Degenne, Thomas Nedelec, Clément Calauzènes, Vianney Perchet
Bridging the gap between regret minimization and best arm identification, with application to A/B tests. CoRR (2018)
Thomas Nedelec, Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Benjamin Heymann, Vianney Perchet
Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems. CoRR (2018)
Clément Calauzènes, Nicolas Le Roux
Distributed SAGA: Maintaining linear convergence rate with limited communication. CoRR (2017)
Clément Calauzènes, Nicolas Usunier, Patrick Gallinari
Calibration and regret bounds for order-preserving surrogate losses in learning to rank. Mach. Learn. 93 (2-3) (2013)
Clément Calauzènes, Nicolas Usunier, Patrick Gallinari
"On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking". NIPS (2012)
David Buffoni, Clément Calauzènes, Patrick Gallinari, Nicolas Usunier
Learning Scoring Functions with Order-Preserving Losses and Standardized Supervision. ICML (2011)