English
Related papers

Related papers: Robustness of Minimum-Volume Nonnegative Matrix Fa…

200 papers

This paper studies low-rank matrix completion in the presence of heavy-tailed and possibly asymmetric noise, where we aim to estimate an underlying low-rank matrix given a set of highly incomplete noisy entries. Though the matrix completion…

Statistics Theory · Mathematics 2022-06-10 Bingyan Wang , Jianqing Fan

The aim of the paper is to establish optimal stability estimates for the determination of sound-hard polyhedral scatterers in $\mathbb{R}^N$, $N \geq 2$, by a minimal number of far-field measurements. This work is a significant and highly…

Analysis of PDEs · Mathematics 2017-02-14 Hongyu Liu , Michele Petrini , Luca Rondi , Jingni Xiao

We consider classification in the presence of class-dependent asymmetric label noise with unknown noise probabilities. In this setting, identifiability conditions are known, but additional assumptions were shown to be required for finite…

Machine Learning · Computer Science 2019-06-12 Henry W. J. Reeve , Ata Kaban

Nonnegative matrix factorization (NMF) is widely used for clustering with strong interpretability. Among general NMF problems, symmetric NMF is a special one that plays an important role in graph clustering where each element measures the…

Machine Learning · Computer Science 2023-11-07 Mengyuan Zhang , Kai Liu

We introduce and analyze an improved variant of nearest neighbors (NN) for estimation with missing data in latent factor models. We consider a matrix completion problem with missing data, where the $(i, t)$-th entry, when observed, is given…

Machine Learning · Statistics 2024-01-31 Raaz Dwivedi , Katherine Tian , Sabina Tomkins , Predrag Klasnja , Susan Murphy , Devavrat Shah

Estimating eigenvectors and low-dimensional subspaces is of central importance for numerous problems in statistics, computer science, and applied mathematics. This paper characterizes the behavior of perturbed eigenvectors for a range of…

Statistics Theory · Mathematics 2018-09-14 Joshua Cape , Minh Tang , Carey E. Priebe

Traditional nonnegative matrix factorization (NMF) learns a new feature representation on the whole data space, which means treating all features equally. However, a subspace is often sufficient for accurate representation in practical…

Computer Vision and Pattern Recognition · Computer Science 2022-04-19 Junhang Li , Jiao Wei , Can Tong , Tingting Shen , Yuchen Liu , Chen Li , Shouliang Qi , Yudong Yao , Yueyang Teng

We investigate how the azimuthal ambiguity in solar vector magnetogram data can be resolved by using the divergence-free property of magnetic fields. In a previous article, by Crouch, Barnes, and Leka (Solar Phys. 260, 271, 2009),…

Solar and Stellar Astrophysics · Physics 2012-10-12 Ashley D. Crouch

We show how to incorporate information from labeled examples into nonnegative matrix factorization (NMF), a popular unsupervised learning algorithm for dimensionality reduction. In addition to mapping the data into a space of lower…

Machine Learning · Computer Science 2011-12-19 Youngmin Cho , Lawrence K. Saul

Non-negative blind source separation (BSS) has raised interest in various fields of research, as testified by the wide literature on the topic of non-negative matrix factorization (NMF). In this context, it is fundamental that the sources…

Machine Learning · Statistics 2013-10-21 Jérémy Rapin , Jérôme Bobin , Anthony Larue , Jean-Luc Starck

Minimum aberration is an increasingly popular criterion for comparing and assessing fractional factorial designs, and few would question its importance and usefulness nowadays. In the past decade or so, a great deal of work has been done on…

Statistics Theory · Mathematics 2007-06-13 Ching-Shui Cheng , Boxin Tang

Non-Negative Matrix Factorization (NMF) is an unsupervised learning method offering low-rank representations across various domains such as audio processing, biomedical signal analysis, and image recognition. The incorporation of…

Machine Learning · Computer Science 2025-10-09 Yasaman Torabi , Shahram Shirani , James P. Reilly

The establishment of robust target appearance model over time is an overriding concern in visual tracking. In this paper, we propose an inverse nonnegative matrix factorization (NMF) method for robust appearance modeling. Rather than using…

Computer Vision and Pattern Recognition · Computer Science 2016-01-13 Fanghui Liu , Tao Zhou , Keren Fu , Irene Y. H. Gu , Jie Yang

We estimate the scattering matrix of an arbitrarily complex linear, passive, time-invariant system with $N$ monomodal lumped ports by inputting and outputting waves only via a fixed set of $N_\mathrm{A}<N$ ports while terminating the…

Applied Physics · Physics 2025-02-17 Philipp del Hougne

Non-negative Matrix Factorization (NMF) has proven to be a powerful unsupervised learning method for uncovering hidden features in complex and noisy data sets with applications in data mining, text recognition, dimension reduction, face…

Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particularly useful in many applications, e.g., in text mining, image…

Optimization and Control · Mathematics 2012-08-13 Nicolas Gillis , François Glineur

We study the problem of recovering an incomplete $m\times n$ matrix of rank $r$ with columns arriving online over time. This is known as the problem of life-long matrix completion, and is widely applied to recommendation system, computer…

Machine Learning · Computer Science 2016-12-04 Maria-Florina Balcan , Hongyang Zhang

Semi-Nonnegative Matrix Factorization (semi-NMF) extends classical Nonnegative Matrix Factorization (NMF) by allowing the basis matrix to contain both positive and negative entries, making it suitable for decomposing data with mixed signs.…

Machine Learning · Computer Science 2025-08-12 Lu Chenggang

Nonnegative matrix factorization (NMF) is now a common tool for audio source separation. When learning NMF on large audio databases, one major drawback is that the complexity in time is O(FKN) when updating the dictionary (where (F;N) is…

Machine Learning · Statistics 2011-06-22 Augustin Lefèvre , Francis Bach , Cédric Févotte

Most state-of-the-art top-N collaborative recommender systems work by learning embeddings to jointly represent users and items. Learned embeddings are considered to be effective to solve a variety of tasks. Among others, providing and…

Information Retrieval · Computer Science 2021-04-14 Giovanni Gabbolini , Edoardo D'Amico , Cesare Bernardis , Paolo Cremonesi