Cover Image

Closing the Gaps: Optimality of Sample Average Approximation for Data-Driven Newsvendor Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lyu, Jiameng, Yuan, Shilin, Zhou, Bingkun, Zhou, Yuan
Format:	Preprint
Published:	2024
Subjects:	Machine Learning Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning When to Restart: Nonstationary Newsvendor from Uncensored to Censored Demand
by: Chen, Xin, et al.
Published: (2025)

A Minibatch-SGD-Based Learning Meta-Policy for Inventory Systems with Myopic Optimal Policy
by: Lyu, Jiameng, et al.
Published: (2024)

The Data-Driven Censored Newsvendor Problem
by: Hssaine, Chamsi, et al.
Published: (2024)

From Contextual Data to Newsvendor Decisions: On the Actual Performance of Data-Driven Algorithms
by: Besbes, Omar, et al.
Published: (2023)

Deep Generative Demand Learning for Newsvendor and Pricing
by: Gong, Shijin, et al.
Published: (2024)

Optimal Sample Complexity for Average Reward Markov Decision Processes
by: Wang, Shengbo, et al.
Published: (2023)

OptEMA: Adaptive Exponential Moving Average for Stochastic Optimization with Zero-Noise Optimality
by: Yuan, Ganzhao
Published: (2026)

A Minimax-MDP Framework with Future-imposed Conditions for Learning-augmented Problems
by: Chen, Xin, et al.
Published: (2025)

AdaSwitch: An Adaptive Switching Meta-Algorithm for Learning-Augmented Bounded-Influence Problems
by: Chen, Xi, et al.
Published: (2025)

Efficient Private SCO for Heavy-Tailed Data via Averaged Clipping
by: Jin, Chenhan, et al.
Published: (2022)

On Unbalanced Optimal Transport: Gradient Methods, Sparsity and Approximation Error
by: Nguyen, Quang Minh, et al.
Published: (2022)

Optimal and Order-optimal Gated Priority-based Greedy Policies for Two-layer Multi-item Order Fulfillment
by: Chen, Xi, et al.
Published: (2026)

Span-Based Optimal Sample Complexity for Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2023)

Composite Optimization with Error Feedback: the Dual Averaging Approach
by: Gao, Yuan, et al.
Published: (2025)

Learning Surrogate Potential Mean Field Games via Gaussian Processes: A Data-Driven Approach to Ill-Posed Inverse Problems
by: Zhang, Jingguo, et al.
Published: (2025)

The Plug-in Approach for Average-Reward and Discounted MDPs: Optimal Sample Complexity Analysis
by: Zurek, Matthew, et al.
Published: (2024)

Span-Agnostic Optimal Sample Complexity and Oracle Inequalities for Average-Reward RL
by: Zurek, Matthew, et al.
Published: (2025)

Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneity
by: Shi, Qiankun, et al.
Published: (2025)

Data-Driven Exploration for a Class of Continuous-Time Indefinite Linear--Quadratic Reinforcement Learning Problems
by: Huang, Yilie, et al.
Published: (2025)

Sample Complexity of Distributionally Robust Average-Reward Reinforcement Learning
by: Chen, Zijun, et al.
Published: (2025)

Achieving Tractable Minimax Optimal Regret in Average Reward MDPs
by: Boone, Victor, et al.
Published: (2024)

Span-Based Optimal Sample Complexity for Weakly Communicating and General Average Reward MDPs
by: Zurek, Matthew, et al.
Published: (2024)

Optimal Single-Policy Sample Complexity and Transient Coverage for Average-Reward Offline RL
by: Zurek, Matthew, et al.
Published: (2025)

Diffusion Model for Data-Driven Black-Box Optimization
by: Li, Zihao, et al.
Published: (2024)

Bridging the Gap Between General and Down-Closed Convex Sets in Submodular Maximization
by: Mualem, Loay, et al.
Published: (2024)

Non-Rectangular Average-Reward Robust MDPs: Optimal Policies and Their Transient Values
by: Wang, Shengbo, et al.
Published: (2026)

Solving Elliptic Optimal Control Problems via Neural Networks and Optimality System
by: Dai, Yongcheng, et al.
Published: (2023)

Data-Driven Stochastic Optimal Control in Reproducing Kernel Hilbert Spaces
by: Hoischen, Nicolas, et al.
Published: (2024)

Stochastic Approximation with Block Coordinate Optimal Stepsizes
by: Jiang, Tao, et al.
Published: (2025)

Bellman Optimality of Average-Reward Robust Markov Decision Processes with a Constant Gain
by: Wang, Shengbo, et al.
Published: (2025)

Data-Driven Density Steering via the Gromov-Wasserstein Optimal Transport Distance
by: Nakashima, Haruto, et al.
Published: (2025)

Data-Driven Sequential Sampling for Tail Risk Mitigation
by: Ahn, Dohyun, et al.
Published: (2025)

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

Towards Simple and Provable Parameter-Free Adaptive Gradient Methods
by: Tao, Yuanzhe, et al.
Published: (2024)

Data-Driven Influence Functions for Optimization-Based Causal Inference
by: Jordan, Michael I., et al.
Published: (2022)

A Data-Driven Real-Time Optimal Power Flow Algorithm Using Local Feedback
by: Liang, Heng, et al.
Published: (2025)

Two-Timescale Optimization Framework for Sparse-Feedback Linear-Quadratic Optimal Control
by: Feng, Lechen, et al.
Published: (2024)

A Computational Method for Solving the Stochastic Joint Replenishment Problem in High Dimensions
by: Ata, Barış, et al.
Published: (2025)

Deep Learning for the Multiple Optimal Stopping Problem
by: Laurière, Mathieu, et al.
Published: (2025)

Multi-Armed Sampling Problem and the End of Exploration
by: Pedramfar, Mohammad, et al.
Published: (2025)