Saved in:
| Main Authors: | Wang, Yue, Xiong, Jinjun, Zou, Shaofeng |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2305.13289 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
by: Deng, Zilong, et al.
Published: (2025)
by: Deng, Zilong, et al.
Published: (2025)
Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022)
by: Shi, Laixi, et al.
Published: (2022)
Non-Asymptotic Analysis for Single-Loop (Natural) Actor-Critic with Compatible Function Approximation
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Sample Complexity Characterization for Linear Contextual MDPs
by: Deng, Junze, et al.
Published: (2024)
by: Deng, Junze, et al.
Published: (2024)
Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
by: Li, Gen, et al.
Published: (2022)
by: Li, Gen, et al.
Published: (2022)
Constrained Reinforcement Learning Under Model Mismatch
by: Sun, Zhongchang, et al.
Published: (2024)
by: Sun, Zhongchang, et al.
Published: (2024)
Finite-Time Error Bounds for Greedy-GQ
by: Wang, Yue, et al.
Published: (2022)
by: Wang, Yue, et al.
Published: (2022)
Rethinking Optimal Transport in Offline Reinforcement Learning
by: Asadulaev, Arip, et al.
Published: (2024)
by: Asadulaev, Arip, et al.
Published: (2024)
Theoretical Study of Conflict-Avoidant Multi-Objective Reinforcement Learning
by: Wang, Yudan, et al.
Published: (2024)
by: Wang, Yudan, et al.
Published: (2024)
Near-Optimal Sample Complexity in Reward-Free Kernel-Based Reinforcement Learning
by: Kayal, Aya, et al.
Published: (2025)
by: Kayal, Aya, et al.
Published: (2025)
Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
by: Arnob, Samin Yeasar, et al.
Published: (2025)
by: Arnob, Samin Yeasar, et al.
Published: (2025)
Video-Enhanced Offline Reinforcement Learning: A Model-Based Approach
by: Pan, Minting, et al.
Published: (2025)
by: Pan, Minting, et al.
Published: (2025)
CS-GBA: A Critical Sample-based Gradient-guided Backdoor Attack for Offline Reinforcement Learning
by: Zhao, Yuanjie, et al.
Published: (2026)
by: Zhao, Yuanjie, et al.
Published: (2026)
Learning on One Mode: Addressing Multi-modality in Offline Reinforcement Learning
by: Wang, Mianchu, et al.
Published: (2024)
by: Wang, Mianchu, et al.
Published: (2024)
Towards Optimal Offline Reinforcement Learning
by: Li, Mengmeng, et al.
Published: (2025)
by: Li, Mengmeng, et al.
Published: (2025)
On the Statistical Complexity for Offline and Low-Adaptive Reinforcement Learning with Structures
by: Yin, Ming, et al.
Published: (2025)
by: Yin, Ming, et al.
Published: (2025)
Taming OOD Actions for Offline Reinforcement Learning: An Advantage-Based Approach
by: Chen, Xuyang, et al.
Published: (2025)
by: Chen, Xuyang, et al.
Published: (2025)
State-Constrained Offline Reinforcement Learning
by: Hepburn, Charles A., et al.
Published: (2024)
by: Hepburn, Charles A., et al.
Published: (2024)
Goal-conditioned Offline Reinforcement Learning through State Space Partitioning
by: Wang, Mianchu, et al.
Published: (2023)
by: Wang, Mianchu, et al.
Published: (2023)
Near-Optimal Sample Complexities of Divergence-based S-rectangular Distributionally Robust Reinforcement Learning
by: Li, Zhenghao, et al.
Published: (2025)
by: Li, Zhenghao, et al.
Published: (2025)
Energy-Guided Diffusion Sampling for Offline-to-Online Reinforcement Learning
by: Liu, Xu-Hui, et al.
Published: (2024)
by: Liu, Xu-Hui, et al.
Published: (2024)
Provable Domain Adaptation for Offline Reinforcement Learning with Limited Samples
by: Chen, Weiqin, et al.
Published: (2024)
by: Chen, Weiqin, et al.
Published: (2024)
Robust Learning of a Group DRO Neuron
by: Cao, Guyang, et al.
Published: (2026)
by: Cao, Guyang, et al.
Published: (2026)
Sample Efficient Active Algorithms for Offline Reinforcement Learning
by: Roy, Soumyadeep, et al.
Published: (2026)
by: Roy, Soumyadeep, et al.
Published: (2026)
On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization
by: Ji, Kaixuan, et al.
Published: (2026)
by: Ji, Kaixuan, et al.
Published: (2026)
DRO: A Python Library for Distributionally Robust Optimization in Machine Learning
by: Liu, Jiashuo, et al.
Published: (2025)
by: Liu, Jiashuo, et al.
Published: (2025)
Efficient Exploration in Average-Reward Constrained Reinforcement Learning: Achieving Near-Optimal Regret With Posterior Sampling
by: Provodin, Danil, et al.
Published: (2024)
by: Provodin, Danil, et al.
Published: (2024)
Sample-Efficient Policy Constraint Offline Deep Reinforcement Learning based on Sample Filtering
by: Chen, Yuanhao, et al.
Published: (2025)
by: Chen, Yuanhao, et al.
Published: (2025)
Optimal Perturbation Budget Allocation for Data Poisoning in Offline Reinforcement Learning
by: Qiu, Junnan, et al.
Published: (2025)
by: Qiu, Junnan, et al.
Published: (2025)
Sample-Efficient Tabular Self-Play for Offline Robust Reinforcement Learning
by: Li, Na, et al.
Published: (2025)
by: Li, Na, et al.
Published: (2025)
A Non-Monolithic Policy Approach of Offline-to-Online Reinforcement Learning
by: Kim, JaeYoon, et al.
Published: (2024)
by: Kim, JaeYoon, et al.
Published: (2024)
On Sample-Efficient Offline Reinforcement Learning: Data Diversity, Posterior Sampling, and Beyond
by: Nguyen-Tang, Thanh, et al.
Published: (2024)
by: Nguyen-Tang, Thanh, et al.
Published: (2024)
When is Offline Policy Selection Sample Efficient for Reinforcement Learning?
by: Liu, Vincent, et al.
Published: (2023)
by: Liu, Vincent, et al.
Published: (2023)
Diffusion-DICE: In-Sample Diffusion Guidance for Offline Reinforcement Learning
by: Mao, Liyuan, et al.
Published: (2024)
by: Mao, Liyuan, et al.
Published: (2024)
Policy-Based Trajectory Clustering in Offline Reinforcement Learning
by: Hu, Hao, et al.
Published: (2025)
by: Hu, Hao, et al.
Published: (2025)
Achieve Performatively Optimal Policy for Performative Reinforcement Learning
by: Chen, Ziyi, et al.
Published: (2025)
by: Chen, Ziyi, et al.
Published: (2025)
Equivariant Offline Reinforcement Learning
by: Tangri, Arsh, et al.
Published: (2024)
by: Tangri, Arsh, et al.
Published: (2024)
Federated Offline Reinforcement Learning
by: Zhou, Doudou, et al.
Published: (2022)
by: Zhou, Doudou, et al.
Published: (2022)
xMLP: Revolutionizing Private Inference with Exclusive Square Activation
by: Li, Jiajie, et al.
Published: (2024)
by: Li, Jiajie, et al.
Published: (2024)
Similar Items
-
Model-Free Robust Reinforcement Learning with Sample Complexity Analysis
by: Wang, Yudan, et al.
Published: (2024) -
Near-Optimal Sample Complexity for Iterated CVaR Reinforcement Learning with a Generative Model
by: Deng, Zilong, et al.
Published: (2025) -
Distributionally Robust Model-Based Offline Reinforcement Learning with Near-Optimal Sample Complexity
by: Shi, Laixi, et al.
Published: (2022) -
Non-Asymptotic Analysis for Single-Loop (Natural) Actor-Critic with Compatible Function Approximation
by: Wang, Yudan, et al.
Published: (2024) -
Sample Complexity Characterization for Linear Contextual MDPs
by: Deng, Junze, et al.
Published: (2024)