A decision-aware weak-to-strong (W2S) framework that leverages both labeled and unlabeled data to improve contextual stochastic optimization and establishes a non-asymptotic upper bound on the excess decision risk of W2S and a complementary lower bound for a strong-only benchmark.
Abstract
Many operational decisions rely on predictive models that estimate uncertain outcomes conditional on observable contexts. Training such models, however, often faces a fundamental data asymmetry: labeled outcomes are scarce or costly to obtain, while contextual covariates are abundant. Motivated by this data asymmetry, we develop a decision-aware weak-to-strong (W2S) framework that leverages both labeled and unlabeled data to improve contextual stochastic optimization. Specifically, we first train a weak model using limited labeled data and then use it to generate predicted outcome distributions on unlabeled contexts. These distributions provide soft supervision for training a strong model. We establish a non-asymptotic upper bound on the excess decision risk of W2S and a complementary lower bound for a strong-only benchmark. Their comparison yields explicit sufficient conditions under which W2S improves downstream decision performance. The key quantity is the correlation dimension between the weak and strong feature representations: when it is small, abundant unlabeled data reduce the effect of teacher errors along non-overlapping directions. A synthetic newsvendor experiment and a comment moderation experiment based on real-world data provide empirical evidence consistent with the theory.
It is established that CGD converges to a neighborhood of the global optimum when the loss function exhibits sufficient strong convexity, and the derived bounds reveal a key insight: the strength of convexity in the loss function can compensate for the uncertainty introduced by decision-dependent effects.
Wenxuan Liu, Xiangting Liu, Maoqi Liu et al.· Production and operations ma...· 0 citations
The results show that learned ambiguity radii can recover most of the performance of strong fixed-radius DRO while reducing unnecessary conservatism and improving regime adaptivity.
A novel perturbation test based on a nonsmooth max-difference revenue statistic comparing the best null assortment with the best alternative assortment and asymptotic validity of the proposed p-value under adaptive assortment selection is proposed.
Cross-fitted estimators that transport information from the two labeled sources through source-specific density ratios are proposed that establish asymptotically linear inference for TPR and FPR, consistency and pointwise inference for the ROC curve, and asymptotically normal inference for AUC.
Numerical experiments demonstrate that the ER-DD-SAA model with nonparametric learning consistently outperforms a parametric benchmark in out-of-sample performance and the proposed reformulations and algorithm substantially improve computational tractability.
An asymmetric variant of minimally consistent concept classes is introduced and used to provide an exact characterization of proper learning with improvements in the real-izable setting, and positive results for more natural Euclidean ball improvement sets are given.
Dravyansh Sharma, Alec Sun· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.