Papers › From bilinear regression to inductive matrix completion: a quasi-Bayesian analysis
From bilinear regression to inductive matrix completion: a quasi-Bayesian analysis
The Tien Mai
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper we study the problem of bilinear regression and we further address the case when the response matrix contains missing data that referred as the problem of inductive matrix completion. We propose a quasi-Bayesian approach first to the problem of bilinear regression where a quasi-likelihood is employed. Then, we adapt this approach to the context of inductive matrix completion. Under a low-rankness assumption and leveraging PAC-Bayes bound technique, we provide statistical properties for our proposed estimators and for the quasi-posteriors. We propose a Langevin Monte Carlo method to approximately compute the proposed estimators. Some numerical studies are conducted to demonstrated our methods.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections