NDLI: Low-rank matrix completion by variational sparse Bayesian learning

Content Provider	IEEE Xplore Digital Library
Author	Babacan, S.D. Luessi, M. Molina, R. Katsaggelos, A.K.
Copyright Year	2011
Description	Author affiliation: Beckman Institute, University of Illinois at Urbana-Champaign, USA (Babacan, S.D.) \|\| Departamento de Ciencias, de la Computación e I.A., Universidad de Granada, Spain (Molina, R.) \|\| Department of Electrical Engineering and Computer Science, Northwestern University, USA (Luessi, M.; Katsaggelos, A.K.)
Abstract	There has been a significant interest in the recovery of low-rank matrices from an incomplete of measurements, due to both theoretical and practical developments demonstrating the wide applicability of the problem. A number of methods have been developed for this recovery problem, however, a principled method for choosing the unknown target rank is generally missing. In this paper, we present a recovery algorithm based on sparse Bayesian learning (SBL) and automatic relevance determination principles. Starting from a matrix factorization formulation and enforcing the low-rank constraint in the estimates as a sparsity constraint, we develop an approach that is very effective in determining the correct rank while providing high recovery performance. We provide empirical results and comparisons with current state-of-the-art methods that illustrate the potential of this approach.
Starting Page	2188
Ending Page	2191
File Size	126671
Page Count	4
File Format	PDF
ISBN	9781457705380
ISSN	15206149
e-ISBN	9781457705397
e-ISBN	9781457705373
DOI	10.1109/ICASSP.2011.5946762
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-05-22
Publisher Place	Czech Republic
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Bayesian methods Approximation methods Estimation Sparse matrices Noise Machine learning Optimization automatic relevance determination Low-rank matrix completion
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

LOW-RANK MATRIX COMPLETION BY VARIATIONAL SPARSE BAYESIAN LEARNING

Relevance singular vector machine for low-rank matrix sensing

Low-rank matrix completion by variational sparse bayesian learning.

Fast Variational Sparse Bayesian Learning With Automatic Relevance Determination for Superimposed Signals

Sparse Bayesian Methods for Low-Rank Matrix Estimation

Maximum marginal likelihood estimation for nonnegative dictionary learning

Online Bayesian low-rank subspace learning from partial observations

Fast adaptive variational sparse Bayesian learning with automatic relevance determination

Fast Low-Rank Matrix Learning with Nonconvex Regularization

Low-rank matrix completion by variational sparse Bayesian learning

Similar Documents

LOW-RANK MATRIX COMPLETION BY VARIATIONAL SPARSE BAYESIAN LEARNING

Relevance singular vector machine for low-rank matrix sensing

Low-rank matrix completion by variational sparse bayesian learning.

Fast Variational Sparse Bayesian Learning With Automatic Relevance Determination for Superimposed Signals

Sparse Bayesian Methods for Low-Rank Matrix Estimation

Maximum marginal likelihood estimation for nonnegative dictionary learning

Online Bayesian low-rank subspace learning from partial observations

Fast adaptive variational sparse Bayesian learning with automatic relevance determination

Fast Low-Rank Matrix Learning with Nonconvex Regularization

Low-rank matrix completion by variational sparse Bayesian learning