Multi-convex Programming for Discrete Latent Factor Models Prototyping
Not on the map. Why?
Abstract (arXiv)
Discrete latent factor models (DLFMs) are widely used in various domains such as machine learning, economics, neuroscience, psychology, etc. Currently, fitting a DLFM to some dataset relies on a customized solver for individual models, which requires lots of effort to implement and is limited to the targeted specific instance of DLFMs. In this paper, we propose a generic framework based on CVXPY, which allows users to specify and solve the fitting problem of a wide range of DLFMs, including both regression and classification models, within a very short script. Our framework is flexible and inherently supports the integration of regularization terms and constraints on the DLFM parameters and latent factors, such that the users can easily prototype the DLFM structure according to their dataset and application scenario. We introduce our open-source Python implementation and illustrate the framework in several examples.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 31 references that are in the map. First posted on arXiv 2 Apr 2025.
Builds on
11 of 31 references.
References · 11
- 2021Convex optimizationcited by 2,515
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 641
- 2019Differentiable Convex Optimization Layerscited by 465
- 2017A Rewriting System for Convex Optimization Problemscited by 179
- 2018Learning Mixtures of Linear Regressions with Nearly Optimal Complexitycited by 37
- 2017Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergencecited by 17
- 2014Convex Optimization in Juliacited by 9
- 2023Multi-intention Inverse Q-learning for Interpretable Behavior Representationcited by 9
- 2016Disciplined Multi-Convex Programmingcited by 6
- 2022Bayesian Active Learning for Discrete Latent Variable Modelscited by 4
- 2025Solving Inverse Problem for Multi-armed Bandits via Convex Optimizationcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Disciplined Biconvex Programmingcited by 2
- 2025Disciplined Biconvex Programming3 Nov 2025