Copertina

Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithm

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lu, Miao, Zhong, Han, Zhang, Tong, Blanchet, Jose
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Learning an Optimal Assortment Policy under Observational Data
di: Han, Yuxuan, et al.
Pubblicazione: (2025)

Robust Assortment Optimization from Observational Data
di: Lu, Miao, et al.
Pubblicazione: (2026)

Single-Trajectory Distributionally Robust Reinforcement Learning
di: Liang, Zhipeng, et al.
Pubblicazione: (2023)

On the Foundation of Distributionally Robust Reinforcement Learning
di: Wang, Shengbo, et al.
Pubblicazione: (2023)

ORVIT: Near-Optimal Online Distributionally Robust Reinforcement Learning
di: Ghosh, Debamita, et al.
Pubblicazione: (2025)

Learning Optimal Distributionally Robust Stochastic Control in Continuous State Spaces
di: Wang, Shengbo, et al.
Pubblicazione: (2024)

Wasserstein Distributionally Robust Regret Optimization for Reinforcement Learning from Human Feedback
di: Wang, Yikai, et al.
Pubblicazione: (2026)

Unifying Distributionally Robust Optimization via Optimal Transport Theory
di: Blanchet, Jose, et al.
Pubblicazione: (2023)

Towards Robust Offline Reinforcement Learning under Diverse Data Corruption
di: Yang, Rui, et al.
Pubblicazione: (2023)

Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
di: Li, Zhenghao, et al.
Pubblicazione: (2025)

Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
di: Shi, Laixi, et al.
Pubblicazione: (2022)

Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond
di: Soma, Tasuku, et al.
Pubblicazione: (2022)

Wasserstein Distributionally Robust Regret Optimization
di: Fiechtner, Lukas-Benedikt, et al.
Pubblicazione: (2025)

Gap-Dependent Bounds for Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation
di: Zhang, Haochen, et al.
Pubblicazione: (2026)

Minimax Optimal and Computationally Efficient Algorithms for Distributionally Robust Offline Reinforcement Learning
di: Liu, Zhishuai, et al.
Pubblicazione: (2024)

Near-Minimax-Optimal Distributional Reinforcement Learning with a Generative Model
di: Rowland, Mark, et al.
Pubblicazione: (2024)

Near-Optimality of Contrastive Divergence Algorithms
di: Glaser, Pierre, et al.
Pubblicazione: (2025)

Reinforcement Learning for Individual Optimal Policy from Heterogeneous Data
di: Miao, Rui, et al.
Pubblicazione: (2025)

A Finite Sample Complexity Bound for Distributionally Robust Q-learning
di: Wang, Shengbo, et al.
Pubblicazione: (2023)

Near-Optimal Cryptographic Hardness of Learning With Homogeneous Halfspaces Under Gaussian Marginals
di: Huang, Jizhou, et al.
Pubblicazione: (2026)

Sample Complexity of Variance-reduced Distributionally Robust Q-learning
di: Wang, Shengbo, et al.
Pubblicazione: (2023)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
di: Beznosikov, Aleksandr, et al.
Pubblicazione: (2020)

Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
di: Qu, Yanlin, et al.
Pubblicazione: (2025)

A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation
di: Zhao, Heyang, et al.
Pubblicazione: (2023)

DRO: A Python Library for Distributionally Robust Optimization in Machine Learning
di: Liu, Jiashuo, et al.
Pubblicazione: (2025)

Towards Optimal Adversarial Robust Reinforcement Learning with Infinity Measurement Error
di: Li, Haoran, et al.
Pubblicazione: (2025)

Optimality and NP-Hardness of Transformers in Learning Markovian Dynamical Functions
di: Ding, Yanna, et al.
Pubblicazione: (2025)

Realizable Abstractions: Near-Optimal Hierarchical Reinforcement Learning
di: Cipollone, Roberto, et al.
Pubblicazione: (2025)

Regret-Optimal Q-Learning with Low Cost for Single-Agent and Federated Reinforcement Learning
di: Zhang, Haochen, et al.
Pubblicazione: (2025)

On Uncertainty Quantification for Near-Bayes Optimal Algorithms
di: Wang, Ziyu, et al.
Pubblicazione: (2024)

Optimal Sample Complexity for Average Reward Markov Decision Processes
di: Wang, Shengbo, et al.
Pubblicazione: (2023)

Nearly-Optimal Algorithm for Adversarial Kernelized Bandits
di: Iwazaki, Shogo
Pubblicazione: (2026)

Near Optimal Inference for the Best-Performing Algorithm
di: Painsky, Amichai
Pubblicazione: (2025)

Fast and Regret Optimal Best Arm Identification: Fundamental Limits and Low-Complexity Algorithms
di: Zhang, Qining, et al.
Pubblicazione: (2023)

Distributionally Robust Federated Learning: An ADMM Algorithm
di: Bai, Wen, et al.
Pubblicazione: (2025)

Near-Optimal Algorithms for Omniprediction
di: Okoroafor, Princewill, et al.
Pubblicazione: (2025)

Minimax-Optimal Multi-Agent Robust Reinforcement Learning
di: Jiao, Yuchen, et al.
Pubblicazione: (2024)

Corruption-Robust Offline Reinforcement Learning with General Function Approximation
di: Ye, Chenlu, et al.
Pubblicazione: (2023)

Learning Optimal Distributionally Robust Individualized Treatment Rules Integrating Multi-Source Data
di: Cui, Wenhai, et al.
Pubblicazione: (2026)

Near-Optimal Algorithms for Differentially Private Online Learning in a Stochastic Environment
di: Hu, Bingshan, et al.
Pubblicazione: (2021)