MELGEMAug 18, 2020

Learning Structure in Nested Logit Models

arXiv:2008.08048v12 citationsHas Code
AI Analysis

This addresses the need for automated structure discovery in nested logit models for researchers and practitioners in fields like transportation and economics, representing a novel method for a known bottleneck rather than an incremental improvement.

The paper tackles the problem of discovering nested logit structures in discrete choice models without requiring a priori specification, introducing a data-driven method that formulates this as a mixed integer nonlinear programming problem and solves it using a linear outer approximation algorithm, with results showing correct recovery of true structures in synthetic data and application to a transportation mode survey in Massachusetts.

This paper introduces a new data-driven methodology for nested logit structure discovery. Nested logit models allow the modeling of positive correlations between the error terms of the utility specifications of the different alternatives in a discrete choice scenario through the specification of a nesting structure. Current nested logit model estimation practices require an a priori specification of a nesting structure by the modeler. In this we work we optimize over all possible specifications of the nested logit model that are consistent with rational utility maximization. We formulate the problem of learning an optimal nesting structure from the data as a mixed integer nonlinear programming (MINLP) optimization problem and solve it using a variant of the linear outer approximation algorithm. We exploit the tree structure of the problem and utilize the latest advances in integer optimization to bring practical tractability to the optimization problem we introduce. We demonstrate the ability of our algorithm to correctly recover the true nesting structure from synthetic data in a Monte Carlo experiment. In an empirical illustration using a stated preference survey on modes of transportation in the U.S. state of Massachusetts, we use our algorithm to obtain an optimal nesting tree representing the correlations between the unobserved effects of the different travel mode choices. We provide our implementation as a customizable and open-source code base written in the Julia programming language.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes