default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClément Calauzènes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c17]Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet:
Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. ICASSP 2024: 7435-7439- [i22]Maria Cherifa, Clément Calauzènes, Vianney Perchet:
Dynamic online matching with budget refills. CoRR abs/2405.09920 (2024) - [i21]Ahmed Ben Yahmed, Clément Calauzènes, Vianney Perchet:
Strategic Arms with Side Communication Prevail Over Low-Regret MAB Algorithms. CoRR abs/2408.17101 (2024) - 2023
- [c16]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: 11584-11597 - [i20]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 abs/2303.12878 (2023) - 2022
- [j3]Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet:
Learning in Repeated Auctions. Found. Trends Mach. Learn. 15(3): 176-334 (2022) - [j2]Thomas Nedelec
, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui:
Revenue-Maximizing Auctions: A Bidder's Standpoint. Oper. Res. 70(5): 2767-2783 (2022) - [c15]Louis Faury, Marc Abeille, Kwang-Sung Jun, Clément Calauzènes:
Jointly Efficient and Optimal Algorithms for Logistic Bandits. AISTATS 2022: 546-580 - [i19]Louis Faury, Marc Abeille, Kwang-Sung Jun, Clément Calauzènes:
Jointly Efficient and Optimal Algorithms for Logistic Bandits. CoRR abs/2201.01985 (2022) - 2021
- [c14]Marc Abeille, Louis Faury, Clément Calauzènes:
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. AISTATS 2021: 3691-3699 - [c13]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: 619-626 - [c12]Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic:
Pure Exploration and Regret Minimization in Matching Bandits. ICML 2021: 9434-9442 - [i18]Louis Faury, Yoan Russac, Marc Abeille, Clément Calauzènes:
Regret Bounds for Generalized Linear Bandits under Parameter Drift. CoRR abs/2103.05750 (2021) - [i17]Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic:
Pure Exploration and Regret Minimization in Matching Bandits. CoRR abs/2108.00230 (2021) - 2020
- [c11]Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui:
Robust Stackelberg buyers in repeated auctions. AISTATS 2020: 1342-1351 - [c10]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: 619-635 - [c9]Lorenzo Croissant, Marc Abeille, Clément Calauzènes:
Real-Time Optimisation for Online Learning in Auctions. ICML 2020: 2217-2226 - [c8]Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq:
Improved Optimistic Algorithms for Logistic Bandits. ICML 2020: 3052-3060 - [c7]Clément Calauzènes, Nicolas Usunier:
On ranking via sorting by estimated expected utility. NeurIPS 2020 - [i16]Louis Faury, Marc Abeille, Clément Calauzènes, Olivier Fercoq:
Improved Optimistic Algorithms for Logistic Bandits. CoRR abs/2002.07530 (2020) - [i15]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 abs/2007.02721 (2020) - [i14]Lorenzo Croissant, Marc Abeille, Clément Calauzènes:
Real-Time Optimisation for Online Learning in Auctions. CoRR abs/2010.10070 (2020) - [i13]Marc Abeille, Louis Faury, Clément Calauzènes:
Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. CoRR abs/2010.12642 (2020) - [i12]Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet:
Learning in repeated auctions. CoRR abs/2011.09365 (2020) - [i11]Lucas Anquetil, Mike Gartrell, Alain Rakotomamonjy, Ugo Tanielian, Clément Calauzènes:
Wasserstein Learning of Determinantal Point Processes. CoRR abs/2011.09712 (2020)
2010 – 2019
- 2019
- [c6]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: 1988-1996 - [c5]Louis Faury, Clément Calauzènes, Olivier Fercoq:
Benchmarking GNN-CMA-ES on the BBOB noiseless testbed. GECCO (Companion) 2019: 1928-1936 - [c4]Jérémie Mary, Clément Calauzènes, Noureddine El Karoui:
Fairness-Aware Learning for Continuous Attributes and Treatments. ICML 2019: 4382-4391 - [i10]Louis Faury, Clément Calauzènes, Olivier Fercoq, Syrine Krichene:
Improving Evolutionary Strategies with Generative Neural Networks. CoRR abs/1901.11271 (2019) - [i9]Clément Calauzènes, Thomas Nedelec, Vianney Perchet, Noureddine El Karoui:
Robust Stackelberg buyers in repeated auctions. CoRR abs/1905.13031 (2019) - [i8]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 abs/1906.01347 (2019) - [i7]Syrine Krichene, Mike Gartrell, Clément Calauzènes:
Embedding models for recommendation under contextual constraints. CoRR abs/1907.01637 (2019) - 2018
- [c3]Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, Simon Dollé:
Offline A/B Testing for Recommender Systems. WSDM 2018: 198-206 - [i6]Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec, Alexandre Abraham, Simon Dollé:
Offline A/B testing for Recommender Systems. CoRR abs/1801.07030 (2018) - [i5]Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Thomas Nedelec, Vianney Perchet:
Explicit shading strategies for repeated truthful auctions. CoRR abs/1805.00256 (2018) - [i4]Louis Faury, Flavian Vasile, Clément Calauzènes, Olivier Fercoq:
Neural Generative Models for Global Optimization with Gradients. CoRR abs/1805.08594 (2018) - [i3]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 abs/1808.06979 (2018) - [i2]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 abs/1810.04088 (2018) - 2017
- [i1]Clément Calauzènes, Nicolas Le Roux:
Distributed SAGA: Maintaining linear convergence rate with limited communication. CoRR abs/1705.10405 (2017) - 2013
- [j1]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): 227-260 (2013) - 2012
- [c2]Clément Calauzènes, Nicolas Usunier, Patrick Gallinari:
"On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking". NIPS 2012: 197-205 - 2011
- [c1]David Buffoni, Clément Calauzènes, Patrick Gallinari, Nicolas Usunier:
Learning Scoring Functions with Order-Preserving Losses and Standardized Supervision. ICML 2011: 825-832
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
