:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Tan, Kevin, Fan, Wei, Wei, Yuting
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	https://arxiv.org/abs/2408.04526
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
por: Li, Gen, et al.
Publicado: (2020)

Actor-Critics Can Achieve Optimal Sample Efficiency
por: Tan, Kevin, et al.
Publicado: (2025)

Statistical Inference under Adaptive Sampling with LinUCB
por: Fan, Wei, et al.
Publicado: (2025)

Sample and Oracle Efficient Reinforcement Learning for MDPs with Linearly-Realizable Value Functions
por: Mhammedi, Zakaria
Publicado: (2024)

Offline-Online Reinforcement Learning for Linear Mixture MDPs
por: Zhang, Zhongjun, et al.
Publicado: (2026)

Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs
por: Maran, Davide, et al.
Publicado: (2024)

Sample Complexity Characterization for Linear Contextual MDPs
por: Deng, Junze, et al.
Publicado: (2024)

Breaking the Computational Barrier: Provably Efficient Actor-Critic for Low-Rank MDPs
por: Huang, Ruiquan, et al.
Publicado: (2026)

Reinforcement Learning for Infinite-Horizon Average-Reward Linear MDPs via Approximation by Discounted-Reward MDPs
por: Hong, Kihyuk, et al.
Publicado: (2024)

Efficient, Low-Regret, Online Reinforcement Learning for Linear MDPs
por: John, Philips George, et al.
Publicado: (2024)

CAESAR: Enhancing Federated RL in Heterogeneous MDPs through Convergence-Aware Sampling with Screening
por: Mak, Hei Yi, et al.
Publicado: (2024)

A Primal-Dual Algorithm for Offline Constrained Reinforcement Learning with Linear MDPs
por: Hong, Kihyuk, et al.
Publicado: (2024)

Sample Complexity Bounds for Linear Constrained MDPs with a Generative Model
por: Liu, Xingtu, et al.
Publicado: (2025)

Near-Optimal Sample Complexity Bounds for Constrained Average-Reward MDPs
por: Wei, Yukuan, et al.
Publicado: (2025)

Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
por: Maran, Davide, et al.
Publicado: (2024)

Breaking the Bias Barrier in Concave Multi-Objective Reinforcement Learning
por: Ganesh, Swetha, et al.
Publicado: (2026)

No-Regret Reinforcement Learning in Smooth MDPs
por: Maran, Davide, et al.
Publicado: (2024)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
por: Tsuchiya, Taira, et al.
Publicado: (2025)

Imitation Learning in Discounted Linear MDPs without exploration assumptions
por: Viano, Luca, et al.
Publicado: (2024)

Settling the Sample Complexity of Model-Based Offline Reinforcement Learning
por: Li, Gen, et al.
Publicado: (2022)

Statistical Inference for Temporal Difference Learning with Linear Function Approximation
por: Wu, Weichen, et al.
Publicado: (2024)

AMAGO-2: Breaking the Multi-Task Barrier in Meta-Reinforcement Learning with Transformers
por: Grigsby, Jake, et al.
Publicado: (2024)

Reinforcement Learning for Exponential Utility: Algorithms and Convergence in Discounted MDPs
por: Thoppe, Gugan, et al.
Publicado: (2026)

Efficient Action-Constrained Reinforcement Learning via Acceptance-Rejection Method and Augmented MDPs
por: Hung, Wei, et al.
Publicado: (2025)

Joint MDPs and Reinforcement Learning in Coupled-Dynamics Environments
por: Kaya, Ege C., et al.
Publicado: (2026)

Breaking the Finite-Sample Barrier in Entropy Coupling
por: Asoodeh, Shahab, et al.
Publicado: (2026)

Statistical and Algorithmic Foundations of Reinforcement Learning
por: Chi, Yuejie, et al.
Publicado: (2025)

Demystifying Linear MDPs and Novel Dynamics Aggregation Framework
por: Lee, Joongkyu, et al.
Publicado: (2024)

Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity
por: Zhang, Runyu, et al.
Publicado: (2023)

Near-Optimal Sample Complexity for Online Constrained MDPs
por: Liu, Chang, et al.
Publicado: (2026)

STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMs
por: Dong, Peijie, et al.
Publicado: (2024)

Breaking the Barrier: Enhanced Utility and Robustness in Smoothed DRL Agents
por: Sun, Chung-En, et al.
Publicado: (2024)

Convex Is Back: Solving Belief MDPs With Convexity-Informed Deep Reinforcement Learning
por: Koutas, Daniel, et al.
Publicado: (2025)

Provable Offline Reinforcement Learning for Structured Cyclic MDPs
por: Lee, Kyungbok, et al.
Publicado: (2026)

Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
por: Li, Long-Fei, et al.
Publicado: (2024)

Near-Optimal Regret in Linear MDPs with Aggregate Bandit Feedback
por: Cassel, Asaf, et al.
Publicado: (2024)

Is Pure Exploitation Sufficient in Exogenous MDPs with Linear Function Approximation?
por: Liang, Hao, et al.
Publicado: (2026)

Reinforcement Learning in MDPs with Information-Ordered Policies
por: Zhang, Zhongjun, et al.
Publicado: (2025)

FIS-DiT: Breaking the Few-Step Video Inference Barrier via Training-Free Frame Interleaved Sparsity
por: Tang, Jian, et al.
Publicado: (2026)

Learning Infinite-Horizon Average-Reward Linear Mixture MDPs of Bounded Span
por: Chae, Woojin, et al.
Publicado: (2024)