:: Library Catalog

Cover Image

Saved in:

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

Similar Items

Adaptive Resolving Methods for Reinforcement Learning with Function Approximations
by: Jiang, Jiashuo, et al.
Published: (2025)

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

Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions
by: Hu, Piao, et al.
Published: (2024)

Distributionally Robust Online Markov Game with Linear Function Approximation
by: Zheng, Zewu, et al.
Published: (2025)

High-dimensional Linear Bandits with Knapsacks
by: Ma, Wanteng, et al.
Published: (2023)

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

Regret Minimization and Statistical Inference in Online Decision Making with High-dimensional Covariates
by: Duan, Congyuan, et al.
Published: (2024)

Efficiently Solving Discounted MDPs with Predictions on Transition Matrices
by: Lyu, Lixing, et al.
Published: (2025)

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

Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation
by: Li, Shangzhe, et al.
Published: (2026)

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

In-Context Semi-Supervised Learning
by: Fan, Jiashuo, et al.
Published: (2025)

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

Follow The Approximate Sparse Leader for No-Regret Online Sparse Linear Approximation
by: Mukhopadhyay, Samrat, et al.
Published: (2025)

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

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

High-dimensional Semi-supervised Classification via the Fermat Distance
by: Tan, Ruoxu, et al.
Published: (2026)

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

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation
by: Hayderi, Alexandre, et al.
Published: (2024)

Improving the Linearized Laplace Approximation via Quadratic Approximations
by: Jiménez, Pedro, et al.
Published: (2026)

Semi-parametric Functional Classification via Path Signatures Logistic Regression
by: Zeng, Pengcheng, et al.
Published: (2025)

Online Linear Programming with Replenishment
by: Chen, Yuze, et al.
Published: (2026)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
by: Sakaue, Shinsaku, et al.
Published: (2025)

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

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

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

Bayesian Bandit Algorithms with Approximate Inference in Stochastic Linear Bandits
by: Huang, Ziyi, et al.
Published: (2024)

SPL-LNS: Sampling-Enhanced Large Neighborhood Search for Solving Integer Linear Programs
by: Feng, Shengyu, et al.
Published: (2025)

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)

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

Scalable Approximate Algorithms for Optimal Transport Linear Models
by: Kacprzak, Tomasz, et al.
Published: (2025)

Online Scheduling for LLM Inference with KV Cache Constraints
by: Jaillet, Patrick, et al.
Published: (2025)

A Log-Linear Non-Parametric Online Changepoint Detection Algorithm based on Functional Pruning
by: Romano, Gaetano, et al.
Published: (2023)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
by: Yang, Sifan, et al.
Published: (2026)

Vertical Semi-Federated Learning for Efficient Online Advertising
by: Li, Wenjie, et al.
Published: (2022)

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

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

Accelerated Distributional Temporal Difference Learning with Linear Function Approximation
by: Jin, Kaicheng, et al.
Published: (2025)

TabularMath: Evaluating Computational Extrapolation in Tabular Learning via Program-Verified Synthesis
by: Cheng, Zerui, et al.
Published: (2026)