Clément Calauzènes

47 papers A* 9A 5B 1Misc 1Journal 27Unranked 4

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