{"total":14,"rows":[{"id":"2305.08841","title":"A Theoretical Analysis of Optimistic Proximal Policy Optimization in Linear Markov Decision Processes","created":"2023-05-15","cited_by_count":29,"area":null},{"id":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"area":null},{"id":"2302.06834","title":"Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization","created":"2023-02-14","cited_by_count":15,"area":null},{"id":"2308.14642","title":"Rate-Optimal Policy Optimization for Linear Markov Decision Processes","created":"2023-08-28","cited_by_count":14,"area":null},{"id":"2310.11550","title":"Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback","created":"2023-10-17","cited_by_count":13,"area":null},{"id":"2305.07911","title":"Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2023-05-13","cited_by_count":6,"area":null},{"id":"2310.01609","title":"Adversarial Contextual Bandits Go Kernelized","created":"2023-10-02","cited_by_count":6,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2508.11931","title":"An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction","created":"2025-08-16","cited_by_count":4,"area":null},{"id":"2411.06739","title":"Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback","created":"2024-11-11","cited_by_count":2,"area":null},{"id":"2510.08882","title":"An Improved Model-Free Decision-Estimation Coefficient with Applications in Adversarial MDPs","created":"2025-10-10","cited_by_count":2,"area":null},{"id":"2602.13700","title":"Optimal Regret for Policy Optimization in Contextual Bandits","created":"2026-02-14","cited_by_count":2,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}