Imagen de Portada

Overcoming the Curse of Dimensionality in Reinforcement Learning Through Approximate Factorization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lu, Chenbei, Shi, Laixi, Chen, Zaiwei, Wu, Chenye, Wierman, Adam
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Reinforcement Learning with Imperfect Transition Predictions: A Bellman-Jensen Approach
por: Lu, Chenbei, et al.
Publicado: (2025)

Breaking the Curse of Multiagency in Robust Multi-Agent Reinforcement Learning
por: Shi, Laixi, et al.
Publicado: (2024)

Sample-Efficient Robust Multi-Agent Reinforcement Learning in the Face of Environmental Uncertainty
por: Shi, Laixi, et al.
Publicado: (2024)

Taming the Curses of Multiagency in Robust Markov Games with Large State Space through Linear Function Approximation
por: Gai, Jingchu, et al.
Publicado: (2026)

Hybrid Transfer Reinforcement Learning: Provable Sample Efficiency from Shifted-Dynamics Data
por: Qu, Chengrui, et al.
Publicado: (2024)

Approximate Global Convergence of Independent Learning in Multi-Agent Systems
por: Jin, Ruiyang, et al.
Publicado: (2024)

Distributionally Robust Constrained Reinforcement Learning under Strong Duality
por: Zhang, Zhengfei, et al.
Publicado: (2024)

Enhancing Efficiency of Safe Reinforcement Learning via Sample Manipulation
por: Gu, Shangding, et al.
Publicado: (2024)

KL-regularization Itself is Differentially Private in Bandits and RLHF
por: Zhang, Yizhou, et al.
Publicado: (2025)

Last-Iterate Convergence of Payoff-Based Independent Learning in Zero-Sum Stochastic Games
por: Chen, Zaiwei, et al.
Publicado: (2024)

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

Robust Gymnasium: A Unified Modular Benchmark for Robust Reinforcement Learning
por: Gu, Shangding, et al.
Publicado: (2025)

Conceptual Belief-Informed Reinforcement Learning
por: Gu, Xingrui, et al.
Publicado: (2024)

Model-Free Robust $ϕ$-Divergence Reinforcement Learning Using Both Offline and Online Data
por: Panaganti, Kishan, et al.
Publicado: (2024)

Transformers Can Overcome the Curse of Dimensionality: A Theoretical Study from an Approximation Perspective
por: Jiao, Yuling, et al.
Publicado: (2025)

Federated Offline Reinforcement Learning: Collaborative Single-Policy Coverage Suffices
por: Woo, Jiin, et al.
Publicado: (2024)

Understanding Agent Scaling in LLM-Based Multi-Agent Systems via Diversity
por: Yang, Yingxuan, et al.
Publicado: (2026)

Anytime-Competitive Reinforcement Learning with Policy Prior
por: Yang, Jianyi, et al.
Publicado: (2023)

Concentration of Contractive Stochastic Approximation: Additive and Multiplicative Noise
por: Chen, Zaiwei, et al.
Publicado: (2023)

From Set Convergence to Pointwise Convergence: Finite-Time Guarantees for Average-Reward Q-Learning with Adaptive Stepsizes
por: Chen, Zaiwei, et al.
Publicado: (2025)

Achieving $\widetilde{O}(1/ε)$ Sample Complexity for Bilinear Systems Identification under Bounded Noises
por: Yi, Hongyu, et al.
Publicado: (2026)

A Minimal-Assumption Analysis of Q-Learning with Time-Varying Policies
por: Nanda, Phalguni, et al.
Publicado: (2025)

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

The Curious Price of Distributional Robustness in Reinforcement Learning with a Generative Model
por: Shi, Laixi, et al.
Publicado: (2023)

BECAUSE: Bilinear Causal Representation for Generalizable Offline Model-based Reinforcement Learning
por: Lin, Haohong, et al.
Publicado: (2024)

Curse of Dimensionality in Neural Network Optimization
por: Na, Sanghoon, et al.
Publicado: (2025)

The Blessing and Curse of Dimensionality in Safety Alignment
por: Teo, Rachel S. Y., et al.
Publicado: (2025)

Achieving $ε^{-2}$ Sample Complexity for Single-Loop Actor-Critic under Minimal Assumptions
por: Hamza, Ishaq, et al.
Publicado: (2026)

Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework
por: Nanda, Phalguni, et al.
Publicado: (2026)

How DNNs break the Curse of Dimensionality: Compositionality and Symmetry Learning
por: Jacot, Arthur, et al.
Publicado: (2024)

Mixture of Experts Softens the Curse of Dimensionality in Operator Learning
por: Kratsios, Anastasis, et al.
Publicado: (2024)

Separable DeepONet: Breaking the Curse of Dimensionality in Physics-Informed Machine Learning
por: Mandl, Luis, et al.
Publicado: (2024)

CNNs Avoid Curse of Dimensionality by Learning on Patches
por: Madala, Vamshi C., et al.
Publicado: (2022)

Achieving $\varepsilon^{-2}$ Dependence for Average-Reward Q-Learning with a New Contraction Principle
por: Chen, Zijun, et al.
Publicado: (2026)

Sample Complexity of Offline Distributionally Robust Linear Markov Decision Processes
por: Wang, He, et al.
Publicado: (2024)

Interpreting the Curse of Dimensionality from Distance Concentration and Manifold Effect
por: Peng, Dehua, et al.
Publicado: (2023)

T2S-MPC: Time-Embedded Online Adaptive Model Predictive Control for Time-Varying Dynamics
por: Shen, Zeyu, et al.
Publicado: (2026)

Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework
por: Chen, Zaiwei, et al.
Publicado: (2026)

Do Depth-Grown Models Overcome the Curse of Depth? An In-Depth Analysis
por: Kapl, Ferdinand, et al.
Publicado: (2025)

Scalable and Certifiable Graph Unlearning: Overcoming the Approximation Error Barrier
por: Yi, Lu, et al.
Publicado: (2024)