CORTEXA
← Browse
arxivcs.LGstat.ML2026-07-10

Estimation, Prediction, and Assortment Optimization for Markov Chain Choice Models with Panel Data

Yalcin Akcay, Gerardo Berbeglia, Young-San Lin

We propose a framework for the Markov chain (MC) choice model with panel data, including parameter estimation, personalized choice prediction, and personalized assortment optimization. In contrast to the traditional setting, which assumes that each transaction is independently drawn from a random utility model, our framework accounts for dependencies among transactions for the same customer in historical data, captured by partial-ordering preference information. To the best of our knowledge, our framework initiates the study of choice modeling with panel data under MC. As our primary result, we propose novel expectation-maximization (EM) algorithms for MC parameter estimation by incorporating partial-ordering-based customer preference information. On synthetic datasets and the sushi dataset, our EM algorithms outperform the traditional EM algorithm of Simsek and Topaloglu (Operations Research, 66, 2018) and multinomial-logit-based partial-order benchmarks adapted from Jagabathula and Vulcano (Management Science, 64, 2018). As our secondary contribution, we present hardness and computational results for conditional choice prediction and assortment optimization problems. These results complement our estimation framework and clarify the computational landscape of conditional choice and assortment optimization, which may be of independent interest.

View free PDFSource page

Related papers

arxivmath.STcs.LGstat.ML2026-06-30

On Optimal Data Splitting for Split Conformal Prediction

Sayan Das, Bahram Yaghooti, Todd A. Kuffner, Soumendra N. Lahiri

Conformal prediction and its variants, including the split conformal prediction, provide a distribution-free framework for uncertainty quantification by constructing prediction intervals or sets with finite-sample coverage guarantees. The statistical efficiency of these intervals…

View free PDFSource page
arxivstat.MLcs.LG2026-07-08

Tensorized algorithms and scalable filtering methods for hidden Markov and factorial hidden Markov models

Roxana Barrios, Ioannis Sgouralis

A common method for the representation and analysis of time-series data is the hidden Markov model (HMM), where each observation is associated with a hidden state that evolves over time. However, many real-world systems are influenced by multiple independent factors, which are mo…

View free PDFSource page
arxivcs.LGmath.OCstat.ML2026-06-29

Decision-Value Attribution in Predict-then-Optimize Systems

Konstantinos Ziliaskopoulos, Alexander Vinel, Alice E. Smith

Predictive models are increasingly embedded in operational decision-making, yet standard explanation methods typically explain forecasts rather than the decisions those forecasts induce. This distinction is important in predict-then-optimize systems: large forecast changes may le…

View free PDFSource page
arxivstat.MLcs.LGmath.ST2026-07-02

Prediction Sets for Counterfactual Decisions: Coverage, Optimality, and Conformal Prediction

Yurui Zheng, Ying Jin

Predictions are increasingly used to guide high-stakes decisions, from treatment selection to policy making. To ensure reliability with imperfect predictions, uncertainty quantification methods such as conformal prediction build prediction sets with coverage guarantees. However,…

View free PDFSource page
arxivcs.LGcs.ITstat.ML2026-07-11

Conservation Laws for Diffusion Models

Ziv Aharoni, Henry D. Pfister

While autoregressive models optimize the exact data likelihood via the chain rule, diffusion models are typically trained with denoising objectives. We develop conservation laws based on generalized extrinsic information transfer (GEXIT) functions for a broad class of memoryless…

View free PDFSource page
arxivmath.OCcs.AIcs.LGstat.ML2026-07-24

Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs

Akira Kitaoka

A data-driven inverse optimization problem (DDIOP) is the problem of estimating the objective-function parameters (weights) that explain observed optimal-solution data, and it arises in many applications, including integer linear programming (ILP). It is known that, by applying g…

View free PDFSource page