Multi-convex Programming for Discrete Latent Factor Models Prototyping

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.

@article{zhu2025_2504.01431,
  title={ Multi-convex Programming for Discrete Latent Factor Models Prototyping },
  author={ Hao Zhu and Shengchao Yan and Jasper Hoffmann and Joschka Boedecker },
  journal={arXiv preprint arXiv:2504.01431},
  year={ 2025 }
}