Flore Sentenac

According to our database, Flore Sentenac authored at least 12 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

On the Average-Case Performance of Greedy for Maximum Coverage.

Eric Balkanski, Jason Chatzitheodorou, Flore Sentenac

CoRR, April, 2026

A uniformity principle for spatial matching.

Taha Ameen, Flore Sentenac, Sophie H. Yu

CoRR, January, 2026

Online Matching in Geometric Random Graphs.

Flore Sentenac, Nathan Noiry, Matthieu Lerasle, Laurent Ménard, Vianney Perchet

Math. Oper. Res., 2026

2025

The Challenger: When Do New Data Sources Justify Switching Machine Learning Models?

Vassilis Digalakis Jr, Christophe Pérignon, Sébastien Saurin, Flore Sentenac

CoRR, December, 2025

Balancing optimism and pessimism in offline-to-online learning.

Flore Sentenac, Lee Albin, Csaba Szepesvári

CoRR, February, 2025

2024

Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits.

Shuai Liu, Alex Ayoub, Flore Sentenac, Xiaoqi Tan, Csaba Szepesvári

Proceedings of the Advances in Neural Information Processing Systems 37: Annual Conference on Neural Information Processing Systems 2024, 2024

2023

On Preemption and Learning in Stochastic Scheduling.

Nadav Merlis, Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet

Proceedings of the International Conference on Machine Learning, 2023

Robust Estimation of Discrete Distributions under Local Differential Privacy.

Julien Chhor, Flore Sentenac

Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022

Static Scheduling with Predictions Learned through Efficient Exploration.

Hugo Richard, Flore Sentenac, Corentin Odic, Mathieu Molina, Vianney Perchet

CoRR, 2022

2021

Decentralized Learning in Online Queuing Systems.

Flore Sentenac, Etienne Boursier, Vianney Perchet

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.

Nathan Noiry, Vianney Perchet, Flore Sentenac

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.

Flore Sentenac, Jialin Yi, Clément Calauzènes, Vianney Perchet, Milan Vojnovic

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