English
Related papers

Related papers: Noisy and Incomplete Boolean Matrix Factorizationv…

200 papers

Multiple rotation averaging plays a crucial role in computer vision and robotics domains. The conventional optimization-based methods optimize a nonlinear cost function based on certain noise assumptions, while most previous learning-based…

Computer Vision and Pattern Recognition · Computer Science 2024-09-17 Shiqi Li , Jihua Zhu , Yifan Xie , Naiwen Hu , Mingchen Zhu , Zhongyu Li , Di Wang

Matrix factorization techniques have been widely used as a method for collaborative filtering for recommender systems. In recent times, different variants of deep learning algorithms have been explored in this setting to improve the task of…

Machine Learning · Computer Science 2019-03-26 Vaibhav Krishna , Tian Guo , Nino Antulov-Fantulin

In this paper, we introduce a probabilistic model for learning nonnegative matrix factorization (NMF) that is commonly used for predicting missing values and finding hidden patterns in the data, in which the matrix factors are latent…

Machine Learning · Computer Science 2022-06-22 Jun Lu , Xuanyu Ye

We investigate methods for parameter learning from incomplete data that is not missing at random. Likelihood-based methods then require the optimization of a profile likelihood that takes all possible missingness mechanisms into account.…

Methodology · Statistics 2012-07-02 Manfred Jaeger

Assessment of practical quantum information processing (QIP) remains partial without understanding limits imposed by noise. Unfortunately, mere description of noise grows exponentially with system size, becoming cumbersome even for modest…

Quantum Physics · Physics 2024-08-14 Vikesh Siddhu , John Smolin

We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: 1. Each comparison can be erroneous with some probability $1 - p$. 2. At each stage $k$ comparisons can be performed in parallel and a…

Quantum Physics · Physics 2011-11-09 M. Ben-Or , Avinatan Hassidim

We introduce a probabilistic model with implicit norm regularization for learning nonnegative matrix factorization (NMF) that is commonly used for predicting missing values and finding hidden patterns in the data, in which the matrix…

Machine Learning · Computer Science 2022-08-23 Jun Lu , Christine P. Chai

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

In addition to recent developments in computing speed and memory, methodological advances have contributed to significant gains in the performance of stochastic simulation. In this paper, we focus on variance reduction for matrix…

Machine Learning · Statistics 2023-03-28 Anant Mathur , Sarat Moka , Zdravko Botev

Regular medical records are useful for medical practitioners to analyze and monitor patient health status especially for those with chronic disease, but such records are usually incomplete due to unpunctuality and absence of patients. In…

High-throughput data analyses are becoming common in biology, communications, economics and sociology. The vast amounts of data are usually represented in the form of matrices and can be considered as knowledge networks. Spectra-based…

Quantitative Methods · Quantitative Biology 2010-01-06 Viet-Anh Nguyen , Zdena Koukolikova-Nicola , Franco Bagnoli , Pietro Lio

The matrix factor model has drawn growing attention for its advantage in achieving two-directional dimension reduction simultaneously for matrix-structured observations. In this paper, we propose a simple iterative least squares algorithm…

Methodology · Statistics 2023-08-02 Yong He , Ran Zhao , Wen-Xin Zhou

We derive analytical expression of matrix factorization/completion solution by variational Bayes method, under the assumption that observed matrix is originally the product of low-rank dense and sparse matrices with additive noise. We…

Signal Processing · Electrical Eng. & Systems 2018-05-24 Ryota Kawasumi , Koujin Takeda

Phase insensitive optical amplification of an unknown quantum state is known to be a fundamentally noisy operation that inevitably adds noise to the amplified state [1 - 5]. However, this fundamental noise penalty in amplification can be…

Extracting meaning from uncertain, noisy data is a fundamental problem across time series analysis, pattern recognition, and language modeling. This survey presents a unified mathematical framework that connects classical estimation theory,…

Machine Learning · Computer Science 2025-08-22 Mohammed Elmusrati

The abundance of data produced daily from large variety of sources has boosted the need of novel approaches on causal inference analysis from observational data. Observational data often contain noisy or missing entries. Moreover, causal…

Methodology · Statistics 2017-03-14 Fani Tsapeli , Peter Tino , Mirco Musolesi

In this paper, we present a novel algorithm to solve the Boolean Satisfiability (SAT) problem, using noise-based logic (NBL). Contrary to what the name may suggest, NBL is not a random/fuzzy logic system. In fact, it is a completely…

Computational Complexity · Computer Science 2011-10-05 Pey-Chang Kent Lin , Ayan Mandal , Sunil P Khatri

In this letter, we study the deterministic sampling patterns for the completion of low rank matrix, when corrupted with a sparse noise, also known as robust matrix completion. We extend the recent results on the deterministic sampling…

Information Theory · Computer Science 2018-03-14 Morteza Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

A theoretical framework for non-negative matrix factorization based on generalized dual Kullback-Leibler divergence, which includes members of the exponential family of models, is proposed. A family of algorithms is developed using this…

Machine Learning · Statistics 2019-05-20 Karthik Devarajan

We consider the problem of finding the $k^{th}$ highest element in a totally ordered set of $n$ elements (select), and partitioning a totally ordered set into the top $k$ and bottom $n-k$ elements (partition) using pairwise comparisons.…

Data Structures and Algorithms · Computer Science 2016-03-17 Mark Braverman , Jieming Mao , S. Matthew Weinberg
‹ Prev 1 3 4 5 6 7 10 Next ›