:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Li, Shangzhe, Zhang, Weitong
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2604.13966
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Imitation from Observations with Trajectory-Level Generative Embeddings
by: Qu, Yongtao, et al.
Published: (2026)

Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
by: Zhang, Weitong, et al.
Published: (2021)

Near-Optimal Second-Order Guarantees for Model-Based Adversarial Imitation Learning
by: Li, Shangzhe, et al.
Published: (2025)

Augmenting Offline Reinforcement Learning with State-only Interactions
by: Li, Shangzhe, et al.
Published: (2024)

Your Self-Play Algorithm is Secretly an Adversarial Imitator: Understanding LLM Self-Play through the Lens of Imitation Learning
by: Li, Shangzhe, et al.
Published: (2026)

Provably and Practically Efficient Adversarial Imitation Learning with General Function Approximation
by: Xu, Tian, et al.
Published: (2024)

Bellman Unbiasedness: Toward Provably Efficient Distributional Reinforcement Learning with General Value Function Approximation
by: Cho, Taehyun, et al.
Published: (2024)

Uncertainty-Aware Reward-Free Exploration with General Function Approximation
by: Zhang, Junkai, et al.
Published: (2024)

Provable Domain Adaptation for Offline Reinforcement Learning with Limited Samples
by: Chen, Weiqin, et al.
Published: (2024)

Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
by: Li, Long-Fei, et al.
Published: (2024)

Energy-Weighted Flow Matching for Offline Reinforcement Learning
by: Zhang, Shiyuan, et al.
Published: (2025)

Quantile Q-Learning: Revisiting Offline Extreme Q-Learning with Quantile Regression
by: Gao, Xinming, et al.
Published: (2025)

Diverse Randomized Value Functions: A Provably Pessimistic Approach for Offline Reinforcement Learning
by: Yu, Xudong, et al.
Published: (2024)

Provably Adaptive Linear Approximation for the Shapley Value and Beyond
by: Li, Weida, et al.
Published: (2026)

Reward-free World Models for Online Imitation Learning
by: Li, Shangzhe, et al.
Published: (2024)

Provable Risk-Sensitive Distributional Reinforcement Learning with General Function Approximation
by: Chen, Yu, et al.
Published: (2024)

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

Coupled Distributional Random Expert Distillation for World Model Online Imitation Learning
by: Li, Shangzhe, et al.
Published: (2025)

Provably Mitigating Corruption, Overoptimization, and Verbosity Simultaneously in Offline and Online RLHF/DPO Alignment
by: Chen, Ziyi, et al.
Published: (2025)

Offline Inverse RL: New Solution Concepts and Provably Efficient Algorithms
by: Lazzati, Filippo, et al.
Published: (2024)

Provable Zero-Shot Generalization in Offline Reinforcement Learning
by: Wang, Zhiyong, et al.
Published: (2025)

Debiased Offline Representation Learning for Fast Online Adaptation in Non-stationary Dynamics
by: Zhang, Xinyu, et al.
Published: (2024)

Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent
by: Chu, Ya-Chi, et al.
Published: (2025)

Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation
by: Kitamura, Toshinori, et al.
Published: (2025)

Provably Efficient Online RLHF with One-Pass Reward Modeling
by: Li, Long-Fei, et al.
Published: (2025)

Hybrid Preference Optimization for Alignment: Provably Faster Convergence Rates by Combining Offline Preferences with Online Exploration
by: Bose, Avinandan, et al.
Published: (2024)

Residual Q-Learning: Offline and Online Policy Customization without Value
by: Li, Chenran, et al.
Published: (2023)

Near-Optimal Regret for Policy Optimization in Contextual MDPs with General Offline Function Approximation
by: Levy, Orin, et al.
Published: (2026)

Thompson Sampling in Online RLHF with General Function Approximation
by: Feng, Songtao, et al.
Published: (2025)

Online Robust Reinforcement Learning with General Function Approximation
by: Ghosh, Debamita, et al.
Published: (2025)

Provable and Practical In-Context Policy Optimization for Self-Improvement
by: Yu, Tianrun, et al.
Published: (2026)

One-Step Bellman Alignment Enables Provably Efficient Transfer in Online RL
by: Chen, Elynn, et al.
Published: (2026)

Source Component Shift Adaptation via Offline Decomposition and Online Mixing Approach
by: Matsuno, Ryuta
Published: (2025)

Offline-to-Online Reinforcement Learning with Classifier-Free Diffusion Generation
by: Huang, Xiao, et al.
Published: (2025)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
by: Chae, Woojin, et al.
Published: (2024)

A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization
by: Ruszczyński, Andrzej, et al.
Published: (2024)

From Static Constraints to Dynamic Adaptation: Sample-Level Constraint Relaxation for Offline-to-Online Reinforcement Learning
by: Zu, Lipeng, et al.
Published: (2025)

UDQL: Bridging The Gap between MSE Loss and The Optimal Value Function in Offline Reinforcement Learning
by: Zhang, Yu, et al.
Published: (2024)

Semantic Caching for Low-Cost LLM Serving: From Offline Learning to Online Adaptation
by: Liu, Xutong, et al.
Published: (2025)

Toward Efficient Data-Free Unlearning
by: Zhang, Chenhao, et al.
Published: (2024)