Imagen de Portada

Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zong, Yiming, Jiang, Jiashuo
Formato:	Preprint
Publicado:	2026
Materias:	Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

Online Linear Programming with Batching
por: Xu, Haoran, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

Thompson Sampling in Online RLHF with General Function Approximation
por: Feng, Songtao, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

Semi-Implicit Functional Gradient Flow for Efficient Sampling
por: Zhang, Shiyue, et al.
Publicado: (2024)

A Switching System Theory of Q-Learning with Linear Function Approximation
por: Lee, Donghwan, et al.
Publicado: (2026)

Rethinking the Global Convergence of Softmax Policy Gradient with Linear Function Approximation
por: Lin, Max Qiushi, et al.
Publicado: (2025)