Vianney Perchet

Math. Program., January, 2024

The Value of Reward Lookahead in Reinforcement Learning.

[BibT_eX]

[DOI]

Nadav Merlis

Dorian Baudry

CoRR, 2024

The Price of Fairness in Bipartite Matching.

[BibT_eX]

[DOI]

Rémi Castera

Felipe Garrido-Lucero

CoRR, 2024

Mode Estimation with Partial Feedback.

[BibT_eX]

[DOI]

Charles Arnal

Vivien Cabannes

CoRR, 2024

2023

Local and adaptive mirror descents in extensive-form games.

[BibT_eX]

[DOI]

CoRR, 2023

Online Matching in Geometric Random Graphs.

[BibT_eX]

[DOI]

CoRR, 2023

DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation.

[BibT_eX]

[DOI]

Felipe Garrido-Lucero

CoRR, 2023

Constant or logarithmic regret in asynchronous multiplayer bandits.

[BibT_eX]

[DOI]

Hugo Richard

CoRR, 2023

Addressing bias in online selection with limited budget of comparisons.

[BibT_eX]

[DOI]

CoRR, 2023

Trading-off price for data quality to achieve fair online allocation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Advice Querying under Budget Constraint for Online Algorithms.

[BibT_eX]

[DOI]

Ziyad Benomar

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On Preemption and Learning in Stochastic Scheduling.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Adapting to game trees in zero-sum imperfect information games.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2023

Stochastic Mirror Descent for Large-Scale Sparse Recovery.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Revenue-Maximizing Auctions: A Bidder's Standpoint.

[BibT_eX]

[DOI]

Oper. Res., 2022

Learning in Repeated Auctions.

[BibT_eX]

[DOI]

Found. Trends Mach. Learn., 2022

A survey on multi-player bandits.

[BibT_eX]

[DOI]

CoRR, 2022

Stochastic Mirror Descent for Large-Scale Sparse Recovery.

[BibT_eX]

[DOI]

CoRR, 2022

Static Scheduling with Predictions Learned through Efficient Exploration.

[BibT_eX]

[DOI]

CoRR, 2022

An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings.

[BibT_eX]

[DOI]

Thibaut Le Gouic

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Active Labeling: Streaming Stochastic Gradients.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Privacy Amplification via Shuffling for Linear Contextual Bandits.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Social Learning in Non-Stationary Environments.

[BibT_eX]

[DOI]

Marco Scarsini

Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Encrypted Linear Contextual Bandit.

[BibT_eX]

[DOI]

Evrard Garcelon

Matteo Pirotta

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits.

[BibT_eX]

[DOI]

CoRR, 2021

Unsupervised Neural Hidden Markov Models with a Continuous latent state space.

[BibT_eX]

[DOI]

CoRR, 2021

Offline Inverse Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2021

Quickest change detection with unknown parameters: Constant complexity and near optimality.

[BibT_eX]

[DOI]

CoRR, 2021

A Generalised Inverse Reinforcement Learning Framework.

[BibT_eX]

[DOI]

CoRR, 2021

Homomorphically Encrypted Linear Contextual Bandit.

[BibT_eX]

[DOI]

Evrard Garcelon

Matteo Pirotta

CoRR, 2021

Be Greedy in Multi-Armed Bandits.

[BibT_eX]

[DOI]

Matthieu Jedor

Jonathan Louëdec

CoRR, 2021

Decentralized Learning in Online Queuing Systems.

[BibT_eX]

[DOI]

Flore Sentenac

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge.

[BibT_eX]

[DOI]

Reda Ouhamma

Odalric-Ambrym Maillard

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits.

[BibT_eX]

[DOI]

Reda Ouhamma

Odalric-Ambrym Maillard

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm.

[BibT_eX]

[DOI]

Nathan Noiry

Flore Sentenac

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Local Differential Privacy for Regret Minimization in Reinforcement Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A New Theoretical Framework for Fast and Accurate Online Decision-Making.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Making the most of your day: online learning for optimal allocation of time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Pure Exploration and Regret Minimization in Matching Bandits.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Online A-Optimal Design and Active Linear Regression.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Adversarial Learning in Revenue-Maximizing Auctions.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

Lifelong Learning in Multi-Armed Bandits.

[BibT_eX]

[DOI]

Matthieu Jedor

Jonathan Louëdec

CoRR, 2020

Local Differentially Private Regret Minimization in Reinforcement Learning.

[BibT_eX]

[DOI]

CoRR, 2020

Speed of Social Learning from Reviews in Non-Stationary Environments.

[BibT_eX]

[DOI]

Marco Scarsini

CoRR, 2020

Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Robustness of Community Detection to Random Geometric Perturbations.

[BibT_eX]

[DOI]

Sandrine Péché

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Trajectory representation learning for Multi-Task NMRDP planning.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Pattern Recognition, 2020

Covariance-adapting algorithm for semi-bandits with application to sparse outcomes.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

Selfish Robustness and Equilibria in Multi-Player Bandits.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2020

Categorized Bandits.

[BibT_eX]

[DOI]

Matthieu Jedor

Jonathan Louëdec

Proceedings of the First Joint Conference of the Information Retrieval Communities in Europe (CIRCLE 2020), 2020

Finding Robust Nash equilibria.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

An adaptive stochastic optimization algorithm for resource allocation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Learning Theory, 2020

Robust Stackelberg buyers in repeated auctions.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Utility/Privacy Trade-off through the lens of Optimal Transport.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019

Active Linear Regression.

[BibT_eX]

[DOI]

CoRR, 2019

Repeated A/B Testing.

[BibT_eX]

[DOI]

CoRR, 2019

Private Learning and Regularized Optimal Transport.

[BibT_eX]

[DOI]

CoRR, 2019

A Problem-Adaptive Algorithm for Resource Allocation.

[BibT_eX]

[DOI]

CoRR, 2019

Exploiting Structure of Uncertainty for Efficient Combinatorial Semi-Bandits.

[BibT_eX]

[DOI]

CoRR, 2019

Learning to Bid in Revenue Maximizing Auction.

[BibT_eX]

[DOI]

Thomas Nedelec

Noureddine El Karoui

Proceedings of the Companion of The 2019 World Wide Web Conference, 2019

SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Exploiting structure of uncertainty for efficient matroid semi-bandits.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Learning to bid in revenue-maximizing auctions.

[BibT_eX]

[DOI]

Thomas Nedelec

Noureddine El Karoui

Sophie-Helene Goulet Ebongue

Proceedings of the 36th International Conference on Machine Learning, 2019

Markov Decision Process for MOOC Users Behavioral Inference.

[BibT_eX]

[DOI]

Anneliese Depoux

Wilfried Kirschenmann

Proceedings of the Digital Education: At the MOOC Crossroads Where the Interests of Academia and Business Converge, 2019

Dynamic Pricing with Finitely Many Unknown Valuations.

[BibT_eX]

[DOI]

Nicolò Cesa-Bianchi

Tommaso Cesari

Proceedings of the Algorithmic Learning Theory, 2019

Finding the bandit in a graph: Sequential search-and-stop.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Regularized Contextual Bandits.

[BibT_eX]

[DOI]

Quentin Berthet

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Bridging the gap between regret minimization and best arm identification, with application to A/B tests.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018

Approachability of convex sets in generalized quitting games.

[BibT_eX]

[DOI]

János Flesch

Rida Laraki

Games Econ. Behav., 2018

A differential game on Wasserstein space. Application to weak approachability with partial monitoring.

[BibT_eX]

[DOI]

Marc Quincampoix

CoRR, 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Explicit shading strategies for repeated truthful auctions.

[BibT_eX]

[DOI]

CoRR, 2018

Bandits with Side Observations: Bounded vs. Logarithmic Regret.

[BibT_eX]

[DOI]

Rémy Degenne

Evrard Garcelon

Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

2017

A comparative study of counterfactual estimators.

[BibT_eX]

[DOI]

Thomas Nedelec

Nicolas Le Roux

CoRR, 2017

Bandit Optimization with Upper-Confidence Frank-Wolfe.

[BibT_eX]

[DOI]

Quentin Berthet

CoRR, 2017

Stochastic Bandit Models for Delayed Conversions.

[BibT_eX]

[DOI]

Claire Vernade

Olivier Cappé

Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe.

[BibT_eX]

[DOI]

Quentin Berthet

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Sparse Stochastic Bandits.

[BibT_eX]

[DOI]

Joon Kwon

Claire Vernade

Proceedings of the 30th Conference on Learning Theory, 2017

Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates.

[BibT_eX]

[DOI]

Joon Kwon

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, 2017

2016

Quantitative Analysis of Dynamic Fault Trees Based on the Coupling of Structure Functions and Monte Carlo Simulation.

[BibT_eX]

[DOI]

Qual. Reliab. Eng. Int., 2016

Gains and Losses are Fundamentally Different in Regret Minimization: The Sparse Case.

[BibT_eX]

[DOI]

Joon Kwon

J. Mach. Learn. Res., 2016

Highly-Smooth Zero-th Order Online Optimization Vianney Perchet.

[BibT_eX]

[DOI]

Francis R. Bach

CoRR, 2016

Combinatorial semi-bandit with known covariance.

[BibT_eX]

[DOI]

Rémy Degenne

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Anytime optimal algorithms in stochastic multi-armed bandits.

[BibT_eX]

[DOI]

Rémy Degenne

Proceedings of the 33nd International Conference on Machine Learning, 2016

Online learning in repeated auctions.

[BibT_eX]

[DOI]

Jonathan Weed

Proceedings of the 29th Conference on Learning Theory, 2016

Online Learning and Blackwell Approachability in Quitting Games.

[BibT_eX]

[DOI]

János Flesch

Rida Laraki

Proceedings of the 29th Conference on Learning Theory, 2016

Highly-Smooth Zero-th Order Online Optimization.

[BibT_eX]

[DOI]

Francis R. Bach

Proceedings of the 29th Conference on Learning Theory, 2016

2015

On a Unified Framework for Approachability with Full or Partial Monitoring.

[BibT_eX]

[DOI]

Marc Quincampoix

Math. Oper. Res., 2015

Exponential Weight Approachability, Applications to Calibration and Regret Minimization.

[BibT_eX]

[DOI]

Dyn. Games Appl., 2015

Batched Bandit Problems.

[BibT_eX]

[DOI]

Proceedings of The 28th Conference on Learning Theory, 2015

2014

A note on robust Nash equilibria with uncertainties.

[BibT_eX]

[DOI]

RAIRO Oper. Res., 2014

Set-valued approachability and online learning with partial monitoring.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2014

Gaussian Process Optimization with Mutual Information.

[BibT_eX]

[DOI]

Emile Contal

Nicolas Vayatis

Proceedings of the 31th International Conference on Machine Learning, 2014

Approachability in unknown games: Online learning meets multi-objective optimization.

[BibT_eX]

[DOI]

Proceedings of The 27th Conference on Learning Theory, 2014

2013

A Primal Condition for Approachability with Partial Monitoring

[BibT_eX]

[DOI]

CoRR, 2013

On an unified framework for approachability in games with or without signals

[BibT_eX]

[DOI]

Marc Quincampoix

CoRR, 2013

Approachability, Regret and Calibration; implications and equivalences

[BibT_eX]

[DOI]

CoRR, 2013

Nash equilibria with partial monitoring; Computation and Lemke-Howson algorithm

[BibT_eX]

[DOI]

CoRR, 2013

Approachability, fast and slow.

[BibT_eX]

[DOI]

Proceedings of the COLT 2013, 2013

Bounded regret in stochastic multi-armed bandits.

[BibT_eX]

[DOI]

Sébastien Bubeck

Proceedings of the COLT 2013, 2013

2011

Approachability of Convex Sets in Games with Partial Monitoring.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2011

Internal Regret with Partial Monitoring: Calibration-Based Optimal Algorithms.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2011

Robust approachability and regret minimization in games with partial monitoring.

[BibT_eX]

[DOI]

Proceedings of the COLT 2011, 2011

The multi-armed bandit problem with covariates

[BibT_eX]

[DOI]

CoRR, 2011

2010

Calibration and Internal no-Regret with Partial Monitoring

[BibT_eX]

[DOI]

CoRR, 2010

2009

Calibration and Internal No-Regret with Random Signals.

[BibT_eX]

[DOI]