OTSS: Output-Targeted Soft Segmentation for Contextual Decision-Weight Learning
Not on the map. Why?
Abstract (arXiv)
Many machine learning systems make constrained decisions by optimizing factorized objectives, but the context-specific objective is often treated as fixed. We study contextual decision-weight learning: from logged decisions and proxy outputs, learn an optimizer-facing weight vector w(x) over interpretable decision factors z(x,d), rather than a direct policy or generic predictive score. We propose OTSS, an output-targeted soft-segmentation model that deploys the personalized decision-ready weight vector. At the function-class level, the theory highlights a hard-versus-soft distinction. Hard partitions incur an approximation-estimation tradeoff under overlap, while a realizable fixed-K soft class removes the hard-partition approximation floor and attains a parametric rate. We evaluate OTSS in controlled benchmarks with finite evaluation libraries, where the true weight vector and downstream regret can be computed exactly. In the representative overlap setting, OTSS attains the lowest mean regret among the comparators, including EM mixture regression, the strongest soft-mixture baseline in our comparison; it matches EM on coefficient recovery while running about two orders of magnitude faster. In a matched K=5 benchmark, OTSS remains competitive under hard-routed truth and improves as heterogeneity becomes softer and sample size grows. On a fixed Complete Journey retail anchor with real household covariates and action geometry, OTSS again achieves the lowest mean-regret point estimate.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 26 references that are in the map. First posted on arXiv 30 Apr 2026.
Builds on
14 of 26 references.
References · 14
- 2017Smart "Predict, then Optimize"cited by 339
- 2019Differentiation of Blackbox Combinatorial Solverscited by 226
- 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 130
- 2016Off-policy evaluation for slate recommendationcited by 103
- 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 82
- 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
- 2016Contextual Bandits with Latent Confounders: An NMF Approachcited by 26
- 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Expertscited by 24
- 2024On Least Square Estimation in Softmax Gating Mixture of Expertscited by 23
- 2021Contextual Inverse Optimization: Offline and Online Learningcited by 20
- 2019Discovering Context Effects from Raw Choice Datacited by 14
- 2023Maximum Optimality Margin: A Unified Approach for Contextual Linear Programming and Inverse Linear Programmingcited by 13
2 more
- 2021Inverse Contextual Bandits: Learning How Behavior Evolves over Timecited by 12
- 2018Mixtures of Experts Modelscited by 6
Built on by
Not cited yet.