首页/论文/2002.06524

arXiv 2002.065242020-02stat.MLcs.LGmath.STstat.MEstat.TH

Tensor denoising and completion based on ordinal observations

University of Wisconsin – Madison（威斯康星大学麦迪逊分校）

Chanwoo Lee, Miaoyan Wang

备注：: 35 pages, 6 figures
发表信息：: Proceedings of the 37th International Conference on Machine Learning(ICML), 2020

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

英文摘要相关论文

英文摘要：

Higher-order tensors arise frequently in applications such as neuroimaging, recommendation system, social network analysis, and psychological studies. We consider the problem of low-rank tensor estimation from possibly incomplete, ordinal-valued observations. Two related problems are studied, one on tensor denoising and the other on tensor completion. We propose a multi-linear cumulative link model, develop a rank-constrained M-estimator, and obtain theoretical accuracy guarantees. Our mean squared error bound enjoys a faster convergence rate than previous results, and we show that the proposed estimator is minimax optimal under the class of low-rank models. Furthermore, the procedure developed serves as an efficient completion method which guarantees consistent recovery of an order-$K$ $(d,\ldots,d)$-dimensional low-rank tensor using only $\tilde{\mathcal{O}}(Kd)$ noisy, quantized observations. We demonstrate the outperformance of our approach over previous methods on the tasks of clustering and collaborative filtering.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Quantized Matrix Completion for Personalized Learning

Rice University（莱斯大学）；Cornell University（康奈尔大学）

The recently proposed SPARse Factor Analysis (SPARFA) framework for personalized learning performs factor analysis on ordinal or binary-valued (e.g., correct/incorrect) graded learner responses to questions. The underlying factors are termed "concepts" (or knowledge components) and are used for learning analytics (LA), the estimation of learner concept-knowledge profiles, and for content analytics (CA), the estimation of question-concept associations and question difficulties. While SPARFA is a powerful tool for LA and CA, it requires a number of algorithm parameters (including the number of c…

2014-12-18cs.LGstat.ML

泊松噪声下的低秩矩阵补全与去噪

Low-rank matrix completion and denoising under Poisson noise

Georgia Institute of Technology（佐治亚理工学院）

本文针对泊松噪声下的低秩矩阵去噪与补全问题，分析三种估计器并给出依赖秩、观测比例及行列和的上界误差，证明其极小极大最优性，并扩展到多项情形。

2020-04-30cs.LGmath.STstat.ML

Deep learning for denoising

Harbin Institute of Technology（哈尔滨工业大学）

Compared with traditional seismic noise attenuation algorithms that depend on signal models and their corresponding prior assumptions, removing noise with a deep neural network is trained based on a large training set, where the inputs are the raw datasets and the corresponding outputs are the desired clean data. After the completion of training, the deep learning method achieves adaptive denoising with no requirements of (i) accurate modelings of the signal and noise, or (ii) optimal parameters tuning. We call this intelligent denoising. We use a convolutional neural network as the basic tool…

2019-07-20cs.LGeess.SPphysics.geo-ph

Sparse Nonnegative Tensor Factorization and Completion with Noisy Observations

Central China Normal University（华中师范大学）；The University of Hong Kong（香港大学）

In this paper, we study the sparse nonnegative tensor factorization and completion problem from partial and noisy observations for third-order tensors. Because of sparsity and nonnegativity, the underlying tensor is decomposed into the tensor-tensor product of one sparse nonnegative tensor and one nonnegative tensor. We propose to minimize the sum of the maximum likelihood estimation for the observations with nonnegativity constraints and the tensor $\ell_0$ norm for the sparse factor. We show that the error bounds of the estimator of the proposed model can be established under general noise o…

2021-10-20cs.CVcs.LGcs.NA

A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency

London School of Economics and Political Science（伦敦政治经济学院）；University of Minnesota（明尼苏达大学）

Matrix completion is a class of machine learning methods that concerns the prediction of missing entries in a partially observed matrix. This paper studies matrix completion for mixed data, i.e., data involving mixed types of variables (e.g., continuous, binary, ordinal). We formulate it as a low-rank matrix estimation problem under a general family of non-linear factor models and then propose entrywise consistent estimators for estimating the low-rank matrix. Tight probabilistic error bounds are derived for the proposed estimators. The proposed methods are evaluated by simulation studies and …

2022-11-17cs.LGmath.STstat.ME

Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation

IBM T.J. Watson Research Center（IBM T.J. 沃森研究中心）；UBC（不列颠哥伦比亚大学）；Mitsubishi Electric Research Laboratories（三菱电机研究实验室）；UC Berkeley（加州大学伯克利分校）

Recent SVD-free matrix factorization formulations have enabled rank minimization for systems with millions of rows and columns, paving the way for matrix completion in extremely large-scale applications, such as seismic data interpolation. In this paper, we consider matrix completion formulations designed to hit a target data-fitting error level provided by the user, and propose an algorithm called LR-BPDN that is able to exploit factorized formulations to solve the corresponding optimization problem. Since practitioners typically have strong prior knowledge about target error level, this inno…

2014-03-05cs.LGstat.ML

更多相关论文收起更多论文

Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion

We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising it; and a priori bounds on the error of each entry, individually. In the noiseless case our algorithm is exact. For rank-one matrices, the new algorithm is fast, admits a highly-parallel implementation, and produces an error minimizing estimate that is qualitatively close to our theoretical and the state-of-the-are Nuclear Norm and OptSpace methods.

2013-03-29math.AGmath.COstat.ML

Matrix Completion with Quantified Uncertainty through Low Rank Gaussian Copula

Cornell University（康奈尔大学）

Modern large scale datasets are often plagued with missing entries. For tabular data with missing values, a flurry of imputation algorithms solve for a complete matrix which minimizes some penalized reconstruction error. However, almost none of them can estimate the uncertainty of its imputations. This paper proposes a probabilistic and scalable framework for missing value imputation with quantified uncertainty. Our model, the Low Rank Gaussian Copula, augments a standard probabilistic model, Probabilistic Principal Component Analysis, with marginal transformations for each column that allow t…

2021-01-18cs.LGstat.ML

A new perspective on least squares under convex constraint

Consider the problem of estimating the mean of a Gaussian random vector when the mean vector is assumed to be in a given convex set. The most natural solution is to take the Euclidean projection of the data vector on to this convex set; in other words, performing "least squares under a convex constraint." Many problems in modern statistics and statistical signal processing theory are special cases of this general situation. Examples include the lasso and other high-dimensional regression techniques, function estimation problems, matrix estimation and completion, shape-restricted regression, co…

2014-11-20math.PRmath.STstat.TH

基于M-积的鲁棒低秩张量补全：结合加权相关总变分与稀疏正则化

Robust Low-Rank Tensor Completion based on M-product with Weighted Correlated Total Variation and Sparse Regularization

Department of Computational and Data Sciences, Indian Institute of Science（计算与数据科学系，印度科学研究院）

本文提出基于M-积的加权相关总变分正则化方法，结合低秩性和平滑性约束，提升张量补全的鲁棒性和精度，通过改进的ADMM算法在图像恢复、去噪和背景分割中验证了其优越性能。

2026-04-15cs.LGmath.OCstat.ML

Generalized Low Rank Models

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, $k$-means, $k$-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing…

2015-05-05cs.LGmath.OCstat.ML

Basis Pursuit Denoise with Nonsmooth Constraints

Level-set optimization formulations with data-driven constraints minimize a regularization functional subject to matching observations to a given error level. These formulations are widely used, particularly for matrix completion and sparsity promotion in data interpolation and denoising. The misfit level is typically measured in the l2 norm, or other smooth metrics. In this paper, we present a new flexible algorithmic framework that targets nonsmooth level-set constraints, including L1, Linf, and even L0 norms. These constraints give greater flexibility for modeling deviations in observation …

2018-11-28math.OCphysics.geo-phstat.ML

非凸方法用于带有对偶动量的稀疏与低秩约束模型

Nonconvex Approach for Sparse and Low-Rank Constrained Models with Dual Momentum

National Taiwan University（台湾大学）

本文提出非凸秩替代项及对偶动量技巧，用于RPCA和LRR模型，通过ADMM优化，在图像补全、去噪和谱聚类中取得最优性能。

2019-06-06cs.LGcs.NAmath.NA

低秩矩阵学习的概率基础

A Probabilistic Basis for Low-Rank Matrix Learning

University of Massachusetts Amherst（马萨诸塞大学阿姆赫斯特分校）

本文通过微分几何研究核范数惩罚对应的概率分布，提出改进的MCMC算法并自动学习惩罚参数，提升低秩贝叶斯矩阵去噪与补全的精度和效率。

2025-10-06cs.LGstat.ML

Robust Kronecker Component Analysis

Imperial College London（帝国理工学院）；Middlesex University London（伦敦米德尔塞克斯大学）；University of Oulu（奥卢大学）

Dictionary learning and component analysis models are fundamental for learning compact representations that are relevant to a given task (feature extraction, dimensionality reduction, denoising, etc.). The model complexity is encoded by means of specific structure, such as sparsity, low-rankness, or nonnegativity. Unfortunately, approaches like K-SVD - that learn dictionaries for sparse coding via Singular Value Decomposition (SVD) - are hard to scale to high-volume and high-dimensional visual data, and fragile in the presence of outliers. Conversely, robust component analysis methods such as …

2018-11-10cs.CVcs.LGstat.ML