{"total":11,"rows":[{"id":"2207.02575","title":"Instance-Dependent Near-Optimal Policy Identification in Linear MDPs via Online Experiment Design","created":"2022-07-06","cited_by_count":33,"area":null},{"id":"2306.12371","title":"Optimistic Active Exploration of Dynamical Systems","created":"2023-06-21","cited_by_count":32,"area":null},{"id":"2307.13372","title":"Submodular Reinforcement Learning","created":"2023-07-25","cited_by_count":23,"area":null},{"id":"2306.01854","title":"Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space","created":"2023-06-02","cited_by_count":18,"area":null},{"id":"2602.16796","title":"Efficient Tail-Aware Generative Optimization via Flow Model Fine-Tuning","created":"2026-02-18","cited_by_count":8,"area":null},{"id":"2306.07001","title":"Cancellation-Free Regret Bounds for Lagrangian Approaches in Constrained Markov Decision Processes","created":"2023-06-12","cited_by_count":7,"area":null},{"id":"2402.08406","title":"Transition Constrained Bayesian Optimization via Markov Decision Processes","created":"2024-02-13","cited_by_count":7,"area":null},{"id":"2506.07619","title":"The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning","created":"2025-06-09","cited_by_count":3,"area":null},{"id":"2312.00622","title":"Practical Path-based Bayesian Optimization","created":"2023-12-01","cited_by_count":2,"area":null},{"id":"2509.26005","title":"BALLAST: Bayesian Active Learning with Look-ahead Amendment for Sea-drifter Trajectories under Spatio-Temporal Vector Fields","created":"2025-09-30","cited_by_count":1,"area":null},{"id":"2512.19057","title":"Efficient Personalization of Generative Models via Optimal Experimental Design","created":"2025-12-22","cited_by_count":0,"area":null}],"next_cursor":null}