Vianney Perchet

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 120

Top Venues

CoRR

NeurIPS

AISTATS

ICML

Publications

Etienne Boursier, Vianney Perchet
Utility/privacy trade-off as regularized optimal transport. Math. Program. 203 (1) (2024)
Felipe Garrido-Lucero, Benjamin Heymann, Maxime Vono, Patrick Loiseau, Vianney Perchet
DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation. CoRR (2023)
Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
Local and adaptive mirror descents in extensive-form games. CoRR (2023)
Hugo Richard, Etienne Boursier, Vianney Perchet
Constant or logarithmic regret in asynchronous multiplayer bandits. CoRR (2023)
Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet
On Preemption and Learning in Stochastic Scheduling. ICML (2023)
Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
Adapting to game trees in zero-sum imperfect information games. ICML (2023)
Sasila Ilandarideva, Yannis Bekri, Anatoli Iouditski, Vianney Perchet
Stochastic Mirror Descent for Large-Scale Sparse Recovery. AISTATS (2023)
Flore Sentenac, Nathan Noiry, Matthieu Lerasle, Laurent Ménard, Vianney Perchet
Online Matching in Geometric Random Graphs. CoRR (2023)
Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
Trading-off price for data quality to achieve fair online allocation. CoRR (2023)
Ziyad Benomar, Evgenii Chzhen, Nicolas Schreuder, Vianney Perchet
Addressing bias in online selection with limited budget of comparisons. CoRR (2023)
Ziyad Benomar, Vianney Perchet
Advice Querying under Budget Constraint for Online Algorithms. NeurIPS (2023)
Mathieu Molina, Nicolas Gast, Patrick Loiseau, Vianney Perchet
Trading-off price for data quality to achieve fair online allocation. NeurIPS (2023)
Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic
An algorithmic solution to the Blotto game using multi-marginal couplings. CoRR (2022)
Etienne Boursier, Vianney Perchet, Marco Scarsini
Social Learning in Non-Stationary Environments. ALT (2022)
Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet
Learning in Repeated Auctions. Found. Trends Mach. Learn. 15 (3) (2022)
Vivien Cabannes, Francis R. Bach, Vianney Perchet, Alessandro Rudi
Active Labeling: Streaming Stochastic Gradients. CoRR (2022)
Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet, Matteo Pirotta
Privacy Amplification via Shuffling for Linear Contextual Bandits. ALT (2022)
Côme Fiegel, Pierre Ménard, Tadashi Kozuno, Rémi Munos, Vianney Perchet, Michal Valko
Adapting to game trees in zero-sum imperfect information games. CoRR (2022)
Sasila Ilandarideva, Yannis Bekri, Anatoli Juditsky, Vianney Perchet
Stochastic Mirror Descent for Large-Scale Sparse Recovery. CoRR (2022)
Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet
Static Scheduling with Predictions Learned through Efficient Exploration. CoRR (2022)
Vianney Perchet, Philippe Rigollet, Thibaut Le Gouic
An Algorithmic Solution to the Blotto Game using Multi-marginal Couplings. EC (2022)
Vivien Cabannes, Francis R. Bach, Vianney Perchet, Alessandro Rudi
Active Labeling: Streaming Stochastic Gradients. NeurIPS (2022)
Evrard Garcelon, Matteo Pirotta, Vianney Perchet
Encrypted Linear Contextual Bandit. AISTATS (2022)
Etienne Boursier, Vianney Perchet
A survey on multi-player bandits. CoRR (2022)
Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui
Revenue-Maximizing Auctions: A Bidder's Standpoint. Oper. Res. 70 (5) (2022)
Evrard Garcelon, Kamalika Chaudhuri, Vianney Perchet, Matteo Pirotta
Privacy Amplification via Shuffling for Linear Contextual Bandits. CoRR (2021)
Etienne Boursier, Tristan Garrec, Vianney Perchet, Marco Scarsini
Making the most of your day: online learning for optimal allocation of time. CoRR (2021)
Firas Jarboui, Vianney Perchet
Unsupervised Neural Hidden Markov Models with a Continuous latent state space. CoRR (2021)
Nathan Noiry, Flore Sentenac, Vianney Perchet
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm. CoRR (2021)
Reda Ouhamma, Odalric-Ambrym Maillard, Vianney Perchet
Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge. NeurIPS (2021)
Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic
Pure Exploration and Regret Minimization in Matching Bandits. CoRR (2021)
Nathan Noiry, Vianney Perchet, Flore Sentenac
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm. NeurIPS (2021)
Xavier Fontaine, Pierre Perrault, Michal Valko, Vianney Perchet
Online A-Optimal Design and Active Linear Regression. ICML (2021)
Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
Be Greedy in Multi-Armed Bandits. CoRR (2021)
Evrard Garcelon, Vianney Perchet, Ciara Pike-Burke, Matteo Pirotta
Local Differential Privacy for Regret Minimization in Reinforcement Learning. NeurIPS (2021)
Flore Sentenac, Etienne Boursier, Vianney Perchet
Decentralized Learning in Online Queuing Systems. CoRR (2021)
Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic
Pure Exploration and Regret Minimization in Matching Bandits. ICML (2021)
Nicolò Cesa-Bianchi, Tommaso Cesari, Yishay Mansour, Vianney Perchet
A New Theoretical Framework for Fast and Accurate Online Decision-Making. NeurIPS (2021)
Flore Sentenac, Etienne Boursier, Vianney Perchet
Decentralized Learning in Online Queuing Systems. NeurIPS (2021)
Etienne Boursier, Tristan Garrec, Vianney Perchet, Marco Scarsini
Making the most of your day: online learning for optimal allocation of time. NeurIPS (2021)
Thomas Nedelec, Jules Baudet, Vianney Perchet, Noureddine El Karoui
Adversarial Learning in Revenue-Maximizing Auctions. AAMAS (2021)
Firas Jarboui, Vianney Perchet
Offline Inverse Reinforcement Learning. CoRR (2021)
Firas Jarboui, Vianney Perchet
A Generalised Inverse Reinforcement Learning Framework. CoRR (2021)
Reda Ouhamma, Odalric-Ambrym Maillard, Vianney Perchet
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. NeurIPS (2021)
Firas Jarboui, Vianney Perchet
Quickest change detection with unknown parameters: Constant complexity and near optimality. CoRR (2021)
Reda Ouhamma, Rémy Degenne, Pierre Gaillard, Vianney Perchet
Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. CoRR (2021)
Reda Ouhamma, Odalric Maillard, Vianney Perchet
Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge. CoRR (2021)
Evrard Garcelon, Vianney Perchet, Matteo Pirotta
Homomorphically Encrypted Linear Contextual Bandit. CoRR (2021)
Evrard Garcelon, Vianney Perchet, Ciara Pike-Burke, Matteo Pirotta
Local Differentially Private Regret Minimization in Reinforcement Learning. CoRR (2020)
Etienne Boursier, Vianney Perchet
Selfish Robustness and Equilibria in Multi-Player Bandits. CoRR (2020)
Etienne Boursier, Vianney Perchet, Marco Scarsini
Speed of Social Learning from Reviews in Non-Stationary Environments. CoRR (2020)
Thomas Nedelec, Clément Calauzènes, Noureddine El Karoui, Vianney Perchet
Learning in repeated auctions. CoRR (2020)
Abbas Mehrabian, Etienne Boursier, Emilie Kaufmann, Vianney Perchet
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players. AISTATS (2020)
Pierre Perrault, Etienne Boursier, Michal Valko, Vianney Perchet
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits. NeurIPS (2020)
Thomas Nedelec, Clément Calauzènes, Vianney Perchet, Noureddine El Karoui
Robust Stackelberg buyers in repeated auctions. AISTATS (2020)
Pierre Perrault, Michal Valko, Vianney Perchet
Covariance-adapting algorithm for semi-bandits with application to sparse outcomes. COLT (2020)
Sandrine Péché, Vianney Perchet
Robustness of Community Detection to Random Geometric Perturbations. CoRR (2020)
Pierre Perrault, Etienne Boursier, Vianney Perchet, Michal Valko
Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Bandits. CoRR (2020)
Sandrine Péché, Vianney Perchet
Robustness of Community Detection to Random Geometric Perturbations. NeurIPS (2020)
Xavier Fontaine, Shie Mannor, Vianney Perchet
An adaptive stochastic optimization algorithm for resource allocation. ALT (2020)
Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
Lifelong Learning in Multi-Armed Bandits. CoRR (2020)
Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
Categorized Bandits. CoRR (2020)
Etienne Boursier, Vianney Perchet
Utility/Privacy Trade-off through the lens of Optimal Transport. AISTATS (2020)
Matthieu Jedor, Jonathan Louëdec, Vianney Perchet
Categorized Bandits. CIRCLE (2020)
Vianney Perchet
Finding Robust Nash equilibria. ALT (2020)
Etienne Boursier, Vianney Perchet
Selfish Robustness and Equilibria in Multi-Player Bandits. COLT (2020)
Firas Jarboui, Vianney Perchet
Trajectory representation learning for Multi-Task NMRDP planning. ICPR (2020)
Thomas Nedelec, Noureddine El Karoui, Vianney Perchet
Learning to bid in revenue-maximizing auctions. ICML (2019)
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)
Pierre Perrault, Vianney Perchet, Michal Valko
Exploiting Structure of Uncertainty for Efficient Combinatorial Semi-Bandits. CoRR (2019)
Firas Jarboui, Célya Gruson-Daniel, Alain Durmus, Vincent Rocchisani, Sophie-Helene Goulet Ebongue, Anneliese Depoux, Wilfried Kirschenmann, Vianney Perchet
Markov Decision Process for MOOC users behavioral inference. CoRR (2019)
Etienne Boursier, Vianney Perchet
Private Learning and Regularized Optimal Transport. CoRR (2019)
Pierre Perrault, Vianney Perchet, Michal Valko
Exploiting structure of uncertainty for efficient matroid semi-bandits. ICML (2019)
Thomas Nedelec, Jules Baudet, Vianney Perchet, Noureddine El Karoui
Adversarial learning for revenue-maximizing auctions. CoRR (2019)
Matthieu Jedor, Vianney Perchet, Jonathan Louëdec
Categorized Bandits. NeurIPS (2019)
Etienne Boursier, Vianney Perchet
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits. NeurIPS (2019)
Thomas Nedelec, Noureddine El Karoui, Vianney Perchet
Learning to bid in revenue-maximizing auctions. CoRR (2019)
Clément Calauzènes, Thomas Nedelec, Vianney Perchet, Noureddine El Karoui
Robust Stackelberg buyers in repeated auctions. CoRR (2019)
Pierre Perrault, Vianney Perchet, Michal Valko
Finding the bandit in a graph: Sequential search-and-stop. AISTATS (2019)
Xavier Fontaine, Pierre Perrault, Vianney Perchet
Active Linear Regression. CoRR (2019)
Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet
Dynamic Pricing with Finitely Many Unknown Valuations. ALT (2019)
Firas Jarboui, Célya Gruson-Daniel, Alain Durmus, Vincent Rocchisani, Sophie-Helene Goulet Ebongue, Anneliese Depoux, Wilfried Kirschenmann, Vianney Perchet
Markov Decision Process for MOOC Users Behavioral Inference. EMOOCs (2019)
Xavier Fontaine, Shie Mannor, Vianney Perchet
A Problem-Adaptive Algorithm for Resource Allocation. CoRR (2019)
Nicolò Cesa-Bianchi, Tommaso R. Cesari, Yishay Mansour, Vianney Perchet
Repeated A/B Testing. CoRR (2019)
Thomas Nedelec, Noureddine El Karoui, Vianney Perchet
Learning to Bid in Revenue Maximizing Auction. WWW (Companion Volume) (2019)
Xavier Fontaine, Quentin Berthet, Vianney Perchet
Regularized Contextual Bandits. AISTATS (2019)
Pierre Perrault, Vianney Perchet, Michal Valko
Finding the Bandit in a Graph: Sequential Search-and-Stop. CoRR (2018)
Xavier Fontaine, Quentin Berthet, Vianney Perchet
Regularized Contextual Bandits. CoRR (2018)
Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet
Dynamic Pricing with Finitely Many Unknown Valuations. CoRR (2018)
Rémy Degenne, Evrard Garcelon, Vianney Perchet
Bandits with Side Observations: Bounded vs. Logarithmic Regret. CoRR (2018)
Marc Abeille, Clément Calauzènes, Noureddine El Karoui, Thomas Nedelec, Vianney Perchet
Explicit shading strategies for repeated truthful auctions. CoRR (2018)
Rémy Degenne, Evrard Garcelon, Vianney Perchet
Bandits with Side Observations: Bounded vs. Logarithmic Regret. UAI (2018)
Vianney Perchet, Marc Quincampoix
A differential game on Wasserstein space. Application to weak approachability with partial monitoring. CoRR (2018)
Etienne Boursier, Vianney Perchet
SIC-MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits. CoRR (2018)
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 (2018)
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 (2018)
János Flesch, Rida Laraki, Vianney Perchet
Approachability of convex sets in generalized quitting games. Games Econ. Behav. 108 (2018)
Claire Vernade, Olivier Cappé, Vianney Perchet
Stochastic Bandit Models for Delayed Conversions. CoRR (2017)
Quentin Berthet, Vianney Perchet
Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe. NIPS (2017)
Claire Vernade, Olivier Cappé, Vianney Perchet
Stochastic Bandit Models for Delayed Conversions. UAI (2017)

Vianney Perchet.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vianney Perchet