Convex Latent Effect Logit Model via Sparse and Low-rank Decomposition
Not on the map. Why?
Abstract (arXiv)
In this paper, we propose a convex formulation for learning logistic regression model (logit) with latent heterogeneous effect on sub-population. In transportation, logistic regression and its variants are often interpreted as discrete choice models under utility theory (McFadden, 2001). Two prominent applications of logit models in the transportation domain are traffic accident analysis and choice modeling. In these applications, researchers often want to understand and capture the individual variation under the same accident or choice scenario. The mixed effect logistic regression (mixed logit) is a popular model employed by transportation researchers. To estimate the distribution of mixed logit parameters, a non-convex optimization problem with nested high-dimensional integrals needs to be solved. Simulation-based optimization is typically applied to solve the mixed logit parameter estimation problem. Despite its popularity, the mixed logit approach for learning individual heterogeneity has several downsides. First, the parametric form of the distribution requires domain knowledge and assumptions imposed by users, although this issue can be addressed to some extent by using a non-parametric approach. Second, the optimization problems arise from parameter estimation for mixed logit and the non-parametric extensions are non-convex, which leads to unstable model interpretation. Third, the simulation size in simulation-assisted estimation lacks finite-sample theoretical guarantees and is chosen somewhat arbitrarily in practice. To address these issues, we are motivated to develop a formulation that models the latent individual heterogeneity while preserving convexity, and avoids the need for simulation-based approximation. Our setup is based on decomposing the parameters into a sparse homogeneous component in the population and low-rank heterogeneous parts for each individual.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 6 of its 99 references that are in the map. First posted on arXiv 22 Aug 2021.
Builds on
6 of 99 references.
References · 6
- 2014The Why and How of Nonnegative Matrix Factorizationcited by 34
- 2013Robust subspace clusteringcited by 24
- 2013Exact and Stable Covariance Estimation from Quadratic Sampling via Convex Programmingcited by 20
- 2014Learning Latent Variable Gaussian Graphical Modelscited by 8
- 2013Efficient Algorithms for Robust and Stable Principal Component Pursuit Problemscited by 1
- 2014An ADMM Algorithm for Clustering Partially Observed Networkscited by 1
Built on by
Not cited yet.