Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics. | 0 | 0.34 | 2022 |
Minimax Regret for Stochastic Shortest Path. | 0 | 0.34 | 2021 |
Online Markov Decision Processes with Aggregate Bandit Feedback. | 0 | 0.34 | 2021 |
Asynchronous Stochastic Optimization Robust to Arbitrary Delays. | 0 | 0.34 | 2021 |
Average reward reinforcement learning with unknown mixing times. | 0 | 0.34 | 2019 |
Learning and Generalization for Matching Problems. | 0 | 0.34 | 2019 |
Learning to Screen | 0 | 0.34 | 2019 |
Learning Linear-Quadratic Regulators Efficiently with only √T Regret. | 0 | 0.34 | 2019 |
Learning Linear-Quadratic Regulators Efficiently with only $\sqrt{T}$ Regret. | 0 | 0.34 | 2019 |
Online Linear Quadratic Control. | 3 | 0.39 | 2018 |
Incentivizing the Dynamic Workforce: Learning Contracts in the Gig-Economy. | 0 | 0.34 | 2018 |
Planning and Learning with Stochastic Action Sets. | 0 | 0.34 | 2018 |
Planning and Learning with Stochastic Action Sets. | 1 | 0.35 | 2018 |
Online Learning with Many Experts. | 2 | 0.41 | 2017 |
Faster Optimal Planning with Partial-Order Pruning. | 5 | 0.42 | 2013 |