aiqbench analysis
This paper addresses the challenge of high-dimensional feature sets in inventory management by introducing a variable selection framework with hard cardinality constraints. It combines mixed-integer second-order cone programming reformulations with randomized-rounding algorithms to balance computational scalability against statistical performance guarantees like support recovery. The work demonstrates that sparse policies can achieve competitive operational costs while significantly reducing data collection burdens, offering practical value for deploying interpretable machine learning in supply chain optimization.
Variable Selection for Feature-Based Newsvendor
arXiv:2609.01544v1 Announce Type: cross Abstract: Feature-based newsvendor models use observable covariates to tailor inventory decisions, aiming to balance holding and shortage costs under demand uncertainty. However, high-dimensional feature sets often hinder interpretability and inflate data collection and implementation costs. This paper studies variable selection for the feature-based newsvendor problem under a hard cardinality constraint on the number of selected features. We formulate the resulting $\ell_0$-constrained empirical newsvendor problem with $\ell_2$-regularization, establish its computational hardness, and develop a mixed-integer second-order cone programming reformulation that strengthens the standard Big-$M$ formulation. To enable scalability beyond exact optimization, we develop a randomized-rounding algorithm with a bi-criteria guarantee and a greedy heuristic. Statistically, we provide theoretical analysis of the resulting sparse policy estimator, including finite-sample estimation error, out-of-sample risk bounds, and support recovery guarantees. Extensive experiments on both synthetic and real data illustrate the computational and statistical trade-offs among various baselines. Our results demonstrate that the proposed variable selection framework achieves competitive out-of-sample operational costs while using substantially fewer covariates.
Abstract:Feature-based newsvendor models use observable covariates to tailor inventory decisions, aiming to balance holding and shortage costs under demand uncertainty. However, high-dimensional feature sets often hinder interpretability and inflate data collection and implementation costs. This paper studies variable selection for the feature-based newsvendor problem under a hard cardinality constraint on the number of selected features. We formulate the resulting $\ell_0$-constrained empirical newsvendor problem with $\ell_2$-regularization, establish its computational hardness, and develop a mixed-integer second-order cone programming reformulation that strengthens the standard Big-$M$ formulation. To enable scalability beyond exact optimization, we develop a randomized-rounding algorithm with a bi-criteria guarantee and a greedy heuristic. Statistically, we provide theoretical analysis of the resulting sparse policy estimator, including finite-sample estimation error, out-of-sample risk bounds, and support recovery guarantees. Extensive experiments on both synthetic and real data illustrate the computational and statistical trade-offs among various baselines. Our results demonstrate that the proposed variable selection framework achieves competitive out-of-sample operational costs while using substantially fewer covariates.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2609.01544 [stat.ML]
(or arXiv:2609.01544v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2609.01544 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 257 words
Related coverage
LLM-Guided Graph Generation for Structure-Based Local Improvement Methods
arXiv · Aug 17, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
GitLab 19.5 release notes
GitLab · Oct 15, 2026

Automate user-level custom permissions for Amazon Quick
AWS · Sep 9, 2026