Learning Scoring Functions with Order-Preserving Losses and Standardized Supervision. - David Buffoni; Clément Calauzènes; Patrick Gallinari; Nicolas Usunier (ICML, 2011)

"On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking". - Clément Calauzènes; Nicolas Usunier; Patrick Gallinari (NIPS, 2012)

Calibration and regret bounds for order-preserving surrogate losses in learning to rank. - Clément Calauzènes; Nicolas Usunier; Patrick Gallinari (Mach. Learn., 2013)

Distributed SAGA: Maintaining linear convergence rate with limited communication. - Clément Calauzènes; Nicolas Le Roux (CoRR, 2017)

Offline A/B Testing for Recommender Systems. - Alexandre Gilotte; Clément Calauzènes; Thomas Nedelec; Alexandre Abraham; Simon Dollé (WSDM, 2018)

Explicit shading strategies for repeated truthful auctions. - Marc Abeille; Clément Calauzènes; Noureddine El Karoui; Thomas Nedelec; Vianney Perchet (CoRR, 2018)

Neural Generative Models for Global Optimization with Gradients. - Louis Faury; Flavian Vasile; Clément Calauzènes; Olivier Fercoq (CoRR, 2018)

Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems. - Thomas Nedelec; Marc Abeille; Clément Calauzènes; Noureddine El Karoui; Benjamin Heymann; Vianney Perchet (CoRR, 2018)

Bridging the gap between regret minimization and best arm identification, with application to A/B tests. - Rémy Degenne; Thomas Nedelec; Clément Calauzènes; Vianney Perchet (AISTATS, 2019)

Benchmarking GNN-CMA-ES on the BBOB noiseless testbed. - Louis Faury; Clément Calauzènes; Olivier Fercoq (GECCO (Companion), 2019)

Fairness-Aware Learning for Continuous Attributes and Treatments. - Jérémie Mary; Clément Calauzènes; Noureddine El Karoui (ICML, 2019)

Improving Evolutionary Strategies with Generative Neural Networks. - Louis Faury; Clément Calauzènes; Olivier Fercoq; Syrine Krichene (CoRR, 2019)

End-to-End Learning of Geometric Deformations of Feature Maps for Virtual Try-On. - Thibaut Issenhuth; Jérémie Mary; Clément Calauzènes (CoRR, 2019)

Embedding models for recommendation under contextual constraints. - Syrine Krichene; Mike Gartrell; Clément Calauzènes (CoRR, 2019)

Robust Stackelberg buyers in repeated auctions. - Thomas Nedelec; Clément Calauzènes; Vianney Perchet; Noureddine El Karoui (AISTATS, 2020)

Do Not Mask What You Do Not Need to Mask: A Parser-Free Virtual Try-On. - Thibaut Issenhuth; Jérémie Mary; Clément Calauzènes (ECCV (20), 2020)

Real-Time Optimisation for Online Learning in Auctions. - Lorenzo Croissant; Marc Abeille; Clément Calauzènes (ICML, 2020)

Improved Optimistic Algorithms for Logistic Bandits. - Louis Faury; Marc Abeille; Clément Calauzènes; Olivier Fercoq (ICML, 2020)

On ranking via sorting by estimated expected utility. - Clément Calauzènes; Nicolas Usunier (NeurIPS, 2020)

Wasserstein Learning of Determinantal Point Processes. - Lucas Anquetil; Mike Gartrell; Alain Rakotomamonjy; Ugo Tanielian; Clément Calauzènes (CoRR, 2020)

Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. - Marc Abeille; Louis Faury; Clément Calauzènes (AISTATS, 2021)

A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions. - Louis Faury; Yoan Russac; Marc Abeille; Clément Calauzènes (ALT, 2021)

Pure Exploration and Regret Minimization in Matching Bandits. - Flore Sentenac; Jialin Yi; Clément Calauzènes; Vianney Perchet; Milan Vojnovic (ICML, 2021)

Regret Bounds for Generalized Linear Bandits under Parameter Drift. - Louis Faury; Yoan Russac; Marc Abeille; Clément Calauzènes (CoRR, 2021)

Jointly Efficient and Optimal Algorithms for Logistic Bandits. - Louis Faury; Marc Abeille; Kwang-Sung Jun; Clément Calauzènes (AISTATS, 2022)

Learning in Repeated Auctions. - Thomas Nedelec; Clément Calauzènes; Noureddine El Karoui; Vianney Perchet (Found. Trends Mach. Learn., 2022)

Revenue-Maximizing Auctions: A Bidder's Standpoint. - Thomas Nedelec; Clément Calauzènes; Vianney Perchet; Noureddine El Karoui (Oper. Res., 2022)

Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues. - Morgane Goibert; Clément Calauzènes; Ekhine Irurozki; Stéphan Clémençon (ICML, 2023)

Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. - Ahmed Ben Yahmed; Clément Calauzènes; Vianney Perchet (ICASSP, 2024)

Optimizing the coalition gain in Online Auctions with Greedy Structured Bandits. - Dorian Baudry; Hugo Richard; Maria Cherifa; Vianney Perchet; Clément Calauzènes (NeurIPS, 2024)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting. - Ahmed Ben Yahmed; Clément Calauzènes; Vianney Perchet (NeurIPS, 2024)

Open Research Challenges for Private Advertising Systems Under Local Differential Privacy. - Matilde Tullii; Solenne Gaucher; Hugo Richard; Eustache Diemert; Vianney Perchet; Alain Rakotomamonjy; Clément Calauzènes; Maxime Vono (WISE (5), 2024)

Dynamic online matching with budget refills. - Maria Cherifa; Clément Calauzènes; Vianney Perchet (CoRR, 2024)

Online matching on stochastic block model. - Maria Cherifa; Clément Calauzènes; Vianney Perchet (CoRR, 2025)