Flore Sentenac
6 papers · 2021–2024 · 3 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓
๐
Conference Polyglot ยท Bronze
๐
Interdisciplinary Bridge ยท Silver
๐บ๏ธ
Taxonomy Completionist
(19)
๐ฃ
Hot Topic Early Bird
Venues
Top co-authors
Research topics
Keywords
regret minimization
(2)
game theory
(1)
partial differential equation
(1)
no-regret learning
(1)
nash equilibrium
(1)
exponential family
(1)
robust estimation
(1)
nash equilibria
(1)
generalized linear bandit
(1)
multi-armed bandit
(1)
regret bound
(1)
greedy algorithm
(1)
random graph
(1)
minimax rate
(1)
graph matching
(1)
optimistic algorithm
(1)
natural exponential families
(1)
bandit algorithm
(1)
online learning
(1)
combinatorial optimization
(1)
Papers
Almost Free: Self-concordance in Natural Exponential Families and an Application to Bandits
NeurIPS 2024
On Preemption and Learning in Stochastic Scheduling
ICML 2023
Robust Estimation of Discrete Distributions under Local Differential Privacy
ALT 2023
Decentralized Learning in Online Queuing Systems
NeurIPS 2021
Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm
NeurIPS 2021
Pure Exploration and Regret Minimization in Matching Bandits
ICML 2021