Clément Calauzènes

According to our database1, Clément Calauzènes authored at least 28 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Robust Consensus in Ranking Data Analysis: Definitions, Properties and Computational Issues.
Proceedings of the International Conference on Machine Learning, 2023

2022
Revenue-Maximizing Auctions: A Bidder's Standpoint.
Oper. Res., 2022

Learning in Repeated Auctions.
Found. Trends Mach. Learn., 2022

Jointly Efficient and Optimal Algorithms for Logistic Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Regret Bounds for Generalized Linear Bandits under Parameter Drift.
CoRR, 2021

Pure Exploration and Regret Minimization in Matching Bandits.
Proceedings of the 38th International Conference on Machine Learning, 2021

A Technical Note on Non-Stationary Parametric Bandits: Existing Mistakes and Preliminary Solutions.
Proceedings of the Algorithmic Learning Theory, 2021

Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Wasserstein Learning of Determinantal Point Processes.
CoRR, 2020

On ranking via sorting by estimated expected utility.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Improved Optimistic Algorithms for Logistic Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

Real-Time Optimisation for Online Learning in Auctions.
Proceedings of the 37th International Conference on Machine Learning, 2020

Do Not Mask What You Do Not Need to Mask: A Parser-Free Virtual Try-On.
Proceedings of the Computer Vision - ECCV 2020, 2020

Robust Stackelberg buyers in repeated auctions.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Embedding models for recommendation under contextual constraints.
CoRR, 2019

End-to-End Learning of Geometric Deformations of Feature Maps for Virtual Try-On.
CoRR, 2019

Improving Evolutionary Strategies with Generative Neural Networks.
CoRR, 2019

Fairness-Aware Learning for Continuous Attributes and Treatments.
Proceedings of the 36th International Conference on Machine Learning, 2019

Benchmarking GNN-CMA-ES on the BBOB noiseless testbed.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

Bridging the gap between regret minimization and best arm identification, with application to A/B tests.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Thresholding the virtual value: a simple method to increase welfare and lower reserve prices in online auction systems.
CoRR, 2018

Neural Generative Models for Global Optimization with Gradients.
CoRR, 2018

Explicit shading strategies for repeated truthful auctions.
CoRR, 2018

Offline A/B Testing for Recommender Systems.
Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, 2018

2017
Distributed SAGA: Maintaining linear convergence rate with limited communication.
CoRR, 2017

2013
Calibration and regret bounds for order-preserving surrogate losses in learning to rank.
Mach. Learn., 2013

2012
"On the (Non-)existence of Convex, Calibrated Surrogate Losses for Ranking".
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
Learning Scoring Functions with Order-Preserving Losses and Standardized Supervision.
Proceedings of the 28th International Conference on Machine Learning, 2011


  Loading...