Quantum Generalized Linear Models
Colleen M. Farrelly, Srikanth Namuduri, Uchenna Chukwu

TL;DR
This paper introduces a quantum extension to generalized linear models (GLMs) that eliminates the need for link functions, improves computational efficiency, and effectively handles overdispersion, achieving state-of-the-art results on complex datasets.
Contribution
The paper proposes a novel quantum-based method for GLMs that deforms outcome distributions directly and superposes multiple distributions for efficient model fitting.
Findings
Successfully tested on overdispersed simulated data
Achieved state-of-the-art results on a benchmark dataset
Potential applications in fields with overdispersion issues
Abstract
Generalized linear models (GLM) are link function based statistical models. Many supervised learning algorithms are extensions of GLMs and have link functions built into the algorithm to model different outcome distributions. There are two major drawbacks when using this approach in applications using real world datasets. One is that none of the link functions available in the popular packages is a good fit for the data. Second, it is computationally inefficient and impractical to test all the possible distributions to find the optimum one. In addition, many GLMs and their machine learning extensions struggle on problems of overdispersion in Tweedie distributions. In this paper we propose a quantum extension to GLM that overcomes these drawbacks. A quantum gate with non-Gaussian transformation can be used to continuously deform the outcome distribution from known results. In doing so,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
