:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Jiang, Jiashuo, Zong, Yiming, Ye, Yinyu
Format:	Preprint
Published:	2025
Subjects:	Machine Learning
Online Access:	https://arxiv.org/abs/2505.12037
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation
by: Zong, Yiming, et al.
Published: (2026)

Achieving Instance-dependent Sample Complexity for Constrained Markov Decision Process
by: Jiang, Jiashuo, et al.
Published: (2024)

A Lyapunov Drift-Plus-Penalty Method Tailored for Reinforcement Learning with Queue Stability
by: Xu, Wenhan, et al.
Published: (2025)

Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning
by: Jiang, Jiashuo
Published: (2023)

Stochastic Online Fisher Markets: Static Pricing Limits and Adaptive Enhancements
by: Jalota, Devansh, et al.
Published: (2022)

Adaptively Robust LLM Inference Optimization under Prediction Uncertainty
by: Chen, Zixi, et al.
Published: (2025)

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

Adaptive Bidding Policies for First-Price Auctions with Budget Constraints under Non-stationarity
by: Wang, Yige, et al.
Published: (2025)

Variance-Adaptive Optimal Algorithm for Reinforcement Learning with Multinomial Logit Function Approximation
by: Kim, Wonyoung, et al.
Published: (2026)

Gradient Methods with Online Scaling
by: Gao, Wenzhi, et al.
Published: (2024)

Decoupling Learning and Decision-Making: Breaking the $\mathcal{O}(\sqrt{T})$ Barrier in Online Resource Allocation with First-Order Methods
by: Gao, Wenzhi, et al.
Published: (2024)

Gradient Methods with Online Scaling Part I. Theoretical Foundations
by: Gao, Wenzhi, et al.
Published: (2025)

Gradient Methods with Online Scaling Part II. Practical Aspects
by: Chu, Ya-Chi, et al.
Published: (2025)

Replicable Reinforcement Learning with Linear Function Approximation
by: Eaton, Eric, et al.
Published: (2025)

Nonstationary Reinforcement Learning with Linear Function Approximation
by: Zhou, Huozhi, et al.
Published: (2020)

Linear Function Approximation as a Computationally Efficient Method to Solve Classical Reinforcement Learning Challenges
by: Srikanth, Hari
Published: (2024)

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

Reinforcement Learning with Function Approximation: From Linear to Nonlinear
by: Long, Jihao, et al.
Published: (2023)

Reinforcement Learning with Intrinsically Motivated Feedback Graph for Lost-sales Inventory Control
by: Liu, Zifan, et al.
Published: (2024)

Resolving Latency and Inventory Risk in Market Making with Reinforcement Learning
by: Jiang, Junzhe, et al.
Published: (2025)

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

Learning to Price with Resource Constraints: From Full Information to Machine-Learned Prices
by: Ao, Ruicheng, et al.
Published: (2025)

RL as Regressor: A Reinforcement Learning Approach for Function Approximation
by: Huang, Yongchao
Published: (2025)

Model-Based Reinforcement Learning with Multinomial Logistic Function Approximation
by: Hwang, Taehyun, et al.
Published: (2022)

Randomized Exploration for Reinforcement Learning with Multinomial Logistic Function Approximation
by: Cho, Wooseong, et al.
Published: (2024)

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

Reinforcement Learning with Function Approximation for Non-Markov Processes
by: Kara, Ali Devran
Published: (2026)

LLM Serving Optimization with Variable Prefill and Decode Lengths
by: Wang, Meixuan, et al.
Published: (2025)

Online Linear Programming with Batching
by: Xu, Haoran, et al.
Published: (2024)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
by: Jiang, Jiashuo, et al.
Published: (2022)

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

Is Risk-Sensitive Reinforcement Learning Properly Resolved?
by: Zhou, Ruiwen, et al.
Published: (2023)

Beyond $\mathcal{O}(\sqrt{T})$ Regret: Decoupling Learning and Decision-making in Online Linear Programming
by: Gao, Wenzhi, et al.
Published: (2025)

The ODE Method for Stochastic Approximation and Reinforcement Learning with Markovian Noise
by: Liu, Shuze Daniel, et al.
Published: (2024)

Data Heterogeneity Modeling for Trustworthy Machine Learning
by: Liu, Jiashuo, et al.
Published: (2025)

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

Towards Differentially Private Reinforcement Learning with General Function Approximation
by: He, Yi, et al.
Published: (2026)

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

Multilinear Tensor Low-Rank Approximation for Policy-Gradient Methods in Reinforcement Learning
by: Rozada, Sergio, et al.
Published: (2025)

Wait-Less Offline Tuning and Re-solving for Online Decision Making
by: Sun, Jingruo, et al.
Published: (2024)