English
Related papers

Related papers: Inconsistency thresholds for incomplete pairwise c…

200 papers

Missing data occur frequently in a wide range of applications. In this paper, we consider estimation of high-dimensional covariance matrices in the presence of missing observations under a general missing completely at random model in the…

Methodology · Statistics 2016-05-17 T. Tony Cai , Anru Zhang

The sparse signal processing literature often uses random sensing matrices to obtain performance guarantees. Unfortunately, in the real world, sensing matrices do not always come from random processes. It is therefore desirable to evaluate…

Functional Analysis · Mathematics 2018-03-06 Dustin G. Mixon , Waheed U. Bajwa , Robert Calderbank

This paper considers the problem of completing a rating matrix based on sub-sampled matrix entries as well as observed social graphs and hypergraphs. We show that there exists a \emph{sharp threshold} on the sample probability for the task…

Machine Learning · Computer Science 2026-05-29 Zhongtian Ma , Qiaosheng Zhang , Zhen Wang

The letter presents a method for the reduction in the mutual coherence of an overcomplete Gaussian or Bernoulli random matrix, which is fairly small due to the lower bound given here on the probability of the event that the aforesaid mutual…

Numerical Analysis · Mathematics 2015-11-09 Yingtong Chen , Jigen Peng

An observational study may be biased for estimating causal effects by failing to control for unmeasured confounders. This paper proposes a new quantity called the "sensitivity value", which is defined as the minimum strength of unmeasured…

Methodology · Statistics 2017-05-24 Qingyuan Zhao

This paper develops an inferential framework for matrix completion when missing is not at random and without the requirement of strong signals. Our development is based on the observation that if the number of missing entries is small…

Methodology · Statistics 2023-08-07 Jungjun Choi , Ming Yuan

A series of papers has introduced the Heuristic Rating Estimation method, which evaluates a set of alternatives based on pairwise comparisons and the weights of reference alternatives. We formulate the conditions under which the HRE method…

Artificial Intelligence · Computer Science 2026-05-12 Jacek Szybowski , Konrad Kułakowski , Jiri Mazurek

Matrix completion constantly receives tremendous attention from many research fields. It is commonly applied for recommender systems such as movie ratings, computer vision such as image reconstruction or completion, multi-task learning such…

Machine Learning · Computer Science 2019-10-08 Abdallah Chehade , Zunya Shi

The paper shows that matching without replacement on propensity scores produces estimators that generally are inconsistent for the average treatment effect of the treated. To achieve consistency, practitioners must either assume that no…

Econometrics · Economics 2021-06-21 Fredrik Sävje

Measurement incompatibility is one of the basic aspects of quantum theory. Here we study the structure of the set of compatible -- i.e. jointly measurable -- measurements. We are interested in whether or not there exist compatible…

Quantum Physics · Physics 2020-07-01 Paul Skrzypczyk , Matty J. Hoban , Ana Belén Sainz , Noah Linden

This paper establishes a comparison theorem for the maximum eigenvalue of a sum of independent random symmetric matrices. The theorem states that the maximum eigenvalue of the matrix sum is dominated by the maximum eigenvalue of a Gaussian…

Probability · Mathematics 2026-03-17 Joel A. Tropp

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…

Machine Learning · Computer Science 2020-08-13 Rui Liu , Alex Olshevsky

We consider a simple model of imprecise comparisons: there exists some $\delta>0$ such that when a subject is given two elements to compare, if the values of those elements (as perceived by the subject) differ by at least $\delta$, then the…

Data Structures and Algorithms · Computer Science 2015-01-14 Miklos Ajtai , Vitaly Feldman , Avinatan Hassidim , Jelani Nelson

Data integration is a notoriously difficult and heuristic-driven process, especially when ground-truth data are not readily available. This paper presents a measure of uncertainty by providing maximal and minimal ranges of a query outcome…

Databases · Computer Science 2023-09-12 Deniz Turkcapar , Sanjay Krishnan

In this article, we propose two quantitative methods for calculating weight vectors for incomplete pairwise comparison matrices using reference values. Both procedures are extensions of arithmetic and geometric heuristic estimation (HRE)…

Artificial Intelligence · Computer Science 2026-03-09 Konrad Kułakowski , Anna Kędzior , Jacek Szybowski , Jiri Mazurek

Assessing image quality is crucial in image processing tasks such as compression, super-resolution, and denoising. While subjective assessments involving human evaluators provide the most accurate quality scores, they are impractical for…

Multimedia · Computer Science 2025-03-26 Shima Mohammadi , João Ascenso

The analysis of experimental data with mixed-effects models requires decisions about the specification of the appropriate random-effects structure. Recently, Barr, Levy, Scheepers, and Tily, 2013 recommended fitting `maximal' models with…

Methodology · Statistics 2018-05-29 Douglas Bates , Reinhold Kliegl , Shravan Vasishth , Harald Baayen

How should we quantify the inconsistency of a database that violates integrity constraints? Proper measures are important for various tasks, such as progress indication and action prioritization in cleaning systems, and reliability…

Databases · Computer Science 2021-04-02 Ester Livshits , Rina Kochirgan , Segev Tsur , Ihab F. Ilyas , Benny Kimelfeld , Sudeepa Roy

In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…

Optimization and Control · Mathematics 2025-09-04 Zsombor Szádoczki , Sándor Bozóki

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is…

Computational Complexity · Computer Science 2014-04-11 Moritz Hardt , Raghu Meka , Prasad Raghavendra , Benjamin Weitz
‹ Prev 1 3 4 5 6 7 10 Next ›