Dylan Foster
9 papers · 2018–2021 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+3 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (17) π£ Hot Topic Early Bird π Cross-Pollinator (14) π Interdisciplinary Bridge π§ Keyword Pioneer
π
Conference Polyglot
(4)
π
Conference Pioneer
β‘
Prolific Year
(5)
Conferences
ICML (6)
AISTATS (1)
COLT (1)
L4DC (1)
Top co-authors
Research topics
Keywords
regret bound
(3)
contextual bandit
(3)
sample complexity
(2)
function approximation
(2)
online learning
(2)
system identification
(1)
distributed learning
(1)
graph theory
(1)
adaptive control
(1)
generalized linear model
(1)
minimax regret
(1)
spectral radius
(1)
markov random field
(1)
multi-armed bandit
(1)
mirror descent
(1)
minimax rate
(1)
dynamical system
(1)
linear quadratic regulator
(1)
stochastic convex optimization
(1)
statistical learning theory
(1)
Papers
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective
COLT 2021
Learning nonlinear dynamical systems from a single trajectory
L4DC 2020
Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles
ICML 2020
Logarithmic Regret for Adversarial Online Control
ICML 2020
Naive Exploration is Optimal for Online LQR
ICML 2020
Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance
ICML 2020
Distributed Learning with Sublinear Communication
ICML 2019
Practical Contextual Bandits with Regression Oracles
ICML 2018
Inference in Sparse Graphs with Pairwise Measurements and Side Information
AISTATS 2018