Imagen de Portada

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chae, Woojin, Lee, Dabeen
Formato:	Preprint
Publicado:	2024
Materias:	Machine Learning Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Learning to Schedule in Parallel-Server Queues with Stochastic Bilinear Rewards
por: Kim, Jung-hun, et al.
Publicado: (2021)

Infinite-Horizon Reinforcement Learning with Multinomial Logistic Function Approximation
por: Park, Jaehyun, et al.
Publicado: (2024)

Online Linear Programming with Replenishment
por: Chen, Yuze, et al.
Publicado: (2026)

Infrequent Resolving Algorithm for Online Linear Programming
por: Li, Guokai, et al.
Publicado: (2024)

Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time
por: Gu, Yuzhou, et al.
Publicado: (2023)

Faster Linear Systems and Matrix Norm Approximation via Multi-level Sketched Preconditioning
por: Dereziński, Michał, et al.
Publicado: (2024)

Learning-Augmented Algorithms for the Bahncard Problem
por: Zhao, Hailiang, et al.
Publicado: (2024)

Robust Learning of a Group DRO Neuron
por: Cao, Guyang, et al.
Publicado: (2026)

Learning Mixtures of Spherical Gaussians via Fourier Analysis
por: Chakraborty, Somnath, et al.
Publicado: (2020)

Online Resource Allocation with Convex-set Machine-Learned Advice
por: Golrezaei, Negin, et al.
Publicado: (2023)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
por: Grigorescu, Elena, et al.
Publicado: (2024)

A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
por: Grigorescu, Elena, et al.
Publicado: (2024)

Learning a Single Neuron Robustly to Distributional Shifts and Adversarial Label Noise
por: Li, Shuyao, et al.
Publicado: (2024)

Non-Stationary Online Resource Allocation: Learning from a Single Sample
por: Feng, Yiding, et al.
Publicado: (2026)

Beyond Non-Degeneracy: Revisiting Certainty Equivalent Heuristic for Online Linear Programming
por: Chen, Yilun, et al.
Publicado: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
por: Objois, Étienne, et al.
Publicado: (2025)

Gradient Testing and Estimation by Comparisons
por: Tao, Xiwen, et al.
Publicado: (2024)

Closing the Computational-Query Depth Gap in Parallel Stochastic Convex Optimization
por: Jambulapati, Arun, et al.
Publicado: (2024)

Optimal Decentralized Smoothed Online Convex Optimization
por: Bhuyan, Neelkamal, et al.
Publicado: (2024)

Extended convexity and smoothness and their applications in deep learning
por: Qi, Binchuan, et al.
Publicado: (2024)

Non-Euclidean High-Order Smooth Convex Optimization
por: Contreras, Juan Pablo, et al.
Publicado: (2024)

Truncated Variance Reduced Value Iteration
por: Jin, Yujia, et al.
Publicado: (2024)

Omnipredicting Single-Index Models with Multi-Index Models
por: Hu, Lunjia, et al.
Publicado: (2024)

Gradient-Free Method for Heavily Constrained Nonconvex Optimization
por: Shi, Wanli, et al.
Publicado: (2024)

Optimization on a Finer Scale: Bounded Local Subgradient Variation Perspective
por: Diakonikolas, Jelena, et al.
Publicado: (2024)

Convergence analysis of wide shallow neural operators within the framework of Neural Tangent Kernel
por: Xu, Xianliang, et al.
Publicado: (2024)

Constrained and Composite Sampling via Proximal Sampler
por: Dang, Thanh, et al.
Publicado: (2026)

Importance Sparsification for Sinkhorn Algorithm
por: Li, Mengyu, et al.
Publicado: (2023)

Complexity of Classical Acceleration for $\ell_1$-Regularized PageRank
por: Fountoulakis, Kimon, et al.
Publicado: (2026)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
por: Ferreira, Ricardo N., et al.
Publicado: (2025)

Min-Max Optimization Is Strictly Easier Than Variational Inequalities
por: Shugart, Henry, et al.
Publicado: (2025)

Negative Stepsizes Make Gradient-Descent-Ascent Converge
por: Shugart, Henry, et al.
Publicado: (2025)

Gaussian Cooling and Dikin Walks: The Interior-Point Method for Logconcave Sampling
por: Kook, Yunbum, et al.
Publicado: (2023)

Noise Stability Optimization for Finding Flat Minima: A Hessian-based Regularization Approach
por: Zhang, Hongyang R., et al.
Publicado: (2023)

Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods
por: Tarzanagh, Davoud Ataee, et al.
Publicado: (2022)

Accelerated Algorithms for Constrained Nonconvex-Nonconcave Min-Max Optimization and Comonotone Inclusion
por: Cai, Yang, et al.
Publicado: (2022)

Online Convex Optimization with Switching Cost with Only One Single Gradient Evaluation
por: Shah, Harsh, et al.
Publicado: (2025)

Distributionally Robust Optimization with Adversarial Data Contamination
por: Li, Shuyao, et al.
Publicado: (2025)

Oracle-based Uniform Sampling from Convex Bodies
por: Dang, Thanh, et al.
Publicado: (2025)