Dylan J. Foster

According to our database1, Dylan J. Foster authored at least 69 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability.
CoRR, 2024

Is Behavior Cloning All You Need? Understanding Horizon in Imitation Learning.
CoRR, 2024

Correcting the Mythos of KL-Regularization: Direct Alignment without Overoptimization via Chi-Squared Preference Optimization.
CoRR, 2024

Exploratory Preference Optimization: Harnessing Implicit Q*-Approximation for Sample-Efficient RLHF.
CoRR, 2024

The Power of Resets in Online Reinforcement Learning.
CoRR, 2024

Online Estimation via Offline Estimation: An Information-Theoretic Framework.
CoRR, 2024

Can large language models explore in-context?
CoRR, 2024

Scalable Online Exploration via Coverability.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Rich-Observation Reinforcement Learning with Continuous Latent Dynamics.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Harnessing Density Ratios for Online Reinforcement Learning.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
Lower bounds for non-convex stochastic optimization.
Math. Program., May, 2023

Guaranteed Discovery of Control-Endogenous Latent States with Multi-Step Inverse Models.
Trans. Mach. Learn. Res., 2023

Foundations of Reinforcement Learning and Interactive Decision Making.
CoRR, 2023

Efficient Model-Free Exploration in Low-Rank MDPs.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Model-Free Reinforcement Learning with the Decision-Estimation Coefficient.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Representation Learning with Multi-Step Inverse Kinematics: An Efficient and Optimal Approach to Rich-Observation RL.
Proceedings of the International Conference on Machine Learning, 2023

Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games.
Proceedings of the International Conference on Machine Learning, 2023

The Role of Coverage in Online Reinforcement Learning.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Instance-Optimality in Interactive Decision Making: Toward a Non-Asymptotic Theory.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

On the Complexity of Multi-Agent Decision Making: From Learning in Games to Partial Monitoring.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
A Note on Model-Free Reinforcement Learning with the Decision-Estimation Coefficient.
CoRR, 2022

Efficient Contextual Bandits with Knapsacks via Regression.
CoRR, 2022

Guaranteed Discovery of Controllable Latent States with Multi-Step Inverse Models.
CoRR, 2022

Interaction-Grounded Learning with Action-Inclusive Feedback.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

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

On the Complexity of Adversarial Decision Making.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Contextual Bandits with Large Action Spaces: Made Practical.
Proceedings of the International Conference on Machine Learning, 2022

Offline Reinforcement Learning: Fundamental Barriers for Value Function Approximation.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Sample-Efficient Reinforcement Learning in the Presence of Exogenous Information.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021
The Statistical Complexity of Interactive Decision Making.
CoRR, 2021

Eluder Dimension and Generalized Rank.
CoRR, 2021

Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective.
Proceedings of the Conference on Learning Theory, 2021

2020
Improved Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance.
CoRR, 2020

Learning the Linear Quadratic Regulator from Nonlinear Observations.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adapting to Misspecification in Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Independent Policy Gradient Methods for Competitive Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning nonlinear dynamical systems from a single trajectory.
Proceedings of the 2nd Annual Conference on Learning for Dynamics and Control, 2020

Statistical Learning with a Nuisance Component (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Naive Exploration is Optimal for Online LQR.
Proceedings of the 37th International Conference on Machine Learning, 2020

Logarithmic Regret for Adversarial Online Control.
Proceedings of the 37th International Conference on Machine Learning, 2020

Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oracles.
Proceedings of the 37th International Conference on Machine Learning, 2020

Tight Bounds on Minimax Regret under Logarithmic Loss via Self-Concordance.
Proceedings of the 37th International Conference on Machine Learning, 2020

Open Problem: Model Selection for Contextual Bandits.
Proceedings of the Conference on Learning Theory, 2020

Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations.
Proceedings of the Conference on Learning Theory, 2020

2019
Adaptive Learning: Algorithms and Complexity.
PhD thesis, 2019

𝓁<sub>∞</sub> Vector Contraction for Rademacher Complexity.
CoRR, 2019

Orthogonal Statistical Learning.
CoRR, 2019

Model Selection for Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Hypothesis Set Stability and Generalization.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Distributed Learning with Sublinear Communication.
Proceedings of the 36th International Conference on Machine Learning, 2019

The Complexity of Making the Gradient Small in Stochastic Convex Optimization.
Proceedings of the Conference on Learning Theory, 2019

Statistical Learning with a Nuisance Component.
Proceedings of the Conference on Learning Theory, 2019

Sum-of-squares meets square loss: Fast rates for agnostic tensor completion.
Proceedings of the Conference on Learning Theory, 2019

2018
Uniform Convergence of Gradients for Non-Convex Learning and Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Contextual bandits with surrogate losses: Margin bounds and efficient algorithms.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Practical Contextual Bandits with Regression Oracles.
Proceedings of the 35th International Conference on Machine Learning, 2018

Online Learning: Sufficient Statistics and the Burkholder Method.
Proceedings of the Conference On Learning Theory, 2018

Logistic Regression: The Importance of Being Improper.
Proceedings of the Conference On Learning Theory, 2018

Inference in Sparse Graphs with Pairwise Measurements and Side Information.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017
Parameter-Free Online Learning via Model Selection.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Spectrally-normalized margin bounds for neural networks.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

ZigZag: A New Approach to Adaptive Online Learning.
Proceedings of the 30th Conference on Learning Theory, 2017

2016
Fast Convergence of Common Learning Algorithms in Games.
CoRR, 2016

Learning in Games: Robustness of Fast Convergence.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Adaptive Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015


  Loading...