English
Related papers

Related papers: Joint Sparsity with Different Measurement Matrices

200 papers

Repeated measures of biomarkers have the potential of explaining hazards of survival outcomes. In practice, these measurements are intermittently measured and are known to be subject to substantial measurement error. Joint modelling of…

Applications · Statistics 2019-12-12 Lisa McFetridge , Ozgur Asar , Jonas Wallin

In this work, combined calibration and DoA estimation is approached as an extension of the formulation for the Single Measurement Vector (SMV) model of self-calibration to the Multiple Measurement Model (MMV) case. By taking advantage of…

Signal Processing · Electrical Eng. & Systems 2017-12-19 Cheng-Yu Hung , Mostafa Kaveh

Sparse regularization plays a central role in solving inverse problems arising from incomplete or corrupted measurements. Different regularizers correspond to different prior assumptions about the structure of the unknown signal, and…

Machine Learning · Statistics 2026-03-16 Kanghun Lee , Hyungjoon Soh , Junghyo Jo

The article is devoted to the problem of inconsistency in the pairwise comparisons based prioritization methodology. The issue of "inconsistency" in this context has gained much attention in recent years. The literature provides us with a…

Artificial Intelligence · Computer Science 2015-10-22 Andrzej Z. Grzybowski

We study the information-theoretic limits of exactly recovering the support of a sparse signal using noisy projections defined by various classes of measurement matrices. Our analysis is high-dimensional in nature, in which the number of…

Statistics Theory · Mathematics 2008-06-04 Wei Wang , Martin J. Wainwright , Kannan Ramchandran

Sparse recovery is one of the most fundamental and well-studied inverse problems. Standard statistical formulations of the problem are provably solved by general convex programming techniques and more practical, fast (nearly-linear time)…

Data Structures and Algorithms · Computer Science 2022-03-09 Jonathan A. Kelner , Jerry Li , Allen Liu , Aaron Sidford , Kevin Tian

We present an algorithm, dubbed Multi-Branch Matching Pursuit (MBMP), to solve the sparse recovery problem over redundant dictionaries. MBMP combines three different paradigms: being a greedy method, it performs iterative signal support…

Information Theory · Computer Science 2014-07-03 Marco Rossi , Alexander M. Haimovich , Yonina C. Eldar

Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper…

Statistics Theory · Mathematics 2022-02-03 Kolos Csaba Ágoston , László Csató

Higher-order tensors can represent scores in a rating system, frames in a video, and images of the same subject. In practice, the measurements are often highly quantized due to the sampling strategies or the quality of devices. Existing…

Machine Learning · Computer Science 2020-10-28 Ren Wang , Meng Wang , Jinjun Xiong

The issue addressed in this paper is that of testing for common breaks across or within equations of a multivariate system. Our framework is very general and allows integrated regressors and trends as well as stationary regressors. The null…

Statistics Theory · Mathematics 2018-01-12 Tatsushi Oka , Pierre Perron

A distance-based inconsistency indicator, defined by the third author for the consistency-driven pairwise comparisons method, is extended to the incomplete case. The corresponding optimization problem is transformed into an equivalent…

Other Computer Science · Computer Science 2015-05-11 S. Bozoki , J. Fulop , W. W. Koczkodaj

Recovery of the sparsity pattern (or support) of an unknown sparse vector from a limited number of noisy linear measurements is an important problem in compressed sensing. In the high-dimensional setting, it is known that recovery with a…

Information Theory · Computer Science 2012-06-26 Galen Reeves , Michael Gastpar

Bayesian variable selection requires sampling from a posterior distribution that combines discrete model indicators with continuously varying parameters, a challenge often addressed through reversible jump Markov chain Monte Carlo (RJMCMC).…

Methodology · Statistics 2026-05-01 Don van den Bergh , Merlise A. Clyde , Adrian E. Raftery , Maarten Marsman

Statistical tests that compare classification algorithms are univariate and use a single performance measure, e.g., misclassification error, $F$ measure, AUC, and so on. In multivariate tests, comparison is done using multiple measures…

Machine Learning · Statistics 2014-09-17 Olcay Taner Yildiz , Ethem Alpaydin

Recently diversity-inducing regularization methods for latent variable models (LVMs), which encourage the components in LVMs to be diverse, have been studied to address several issues involved in latent variable modeling: (1) how to capture…

Machine Learning · Computer Science 2015-11-24 Pengtao Xie , Yuntian Deng , Eric Xing

In this article, we review the literature on design and analysis of recursive algorithms for reconstructing a time sequence of sparse signals from compressive measurements. The signals are assumed to be sparse in some transform domain or in…

Information Theory · Computer Science 2016-06-29 Namrata Vaswani , Jinchun Zhan

Several phenomena are available representing market activity: volumes, number of trades, durations between trades or quotes, volatility - however measured - all share the feature to be represented as positive valued time series. When…

Statistical Finance · Quantitative Finance 2021-07-14 Fabrizio Cipollini , Giampiero M. Gallo

Quantitative MR imaging is increasingly favoured for its richer information content and standardised measures. However, computing quantitative parameter maps, such as those encoding longitudinal relaxation rate (R1), apparent transverse…

Computer Vision and Pattern Recognition · Computer Science 2021-07-01 Yael Balbastre , Mikael Brudfors , Michela Azzarito , Christian Lambert , Martina F. Callaghan , John Ashburner

We describe a probabilistic, {\it sublinear} runtime, measurement-optimal system for model-based sparse recovery problems through dimensionality reducing, {\em dense} random matrices. Specifically, we obtain a linear sketch $u\in \R^M$ of a…

Information Theory · Computer Science 2012-06-22 Anastasios Kyrillidis , Volkan Cevher

We consider high dimensional sparse regression, and develop strategies able to deal with arbitrary -- possibly, severe or coordinated -- errors in the covariance matrix $X$. These may come from corrupted data, persistent experimental…

Machine Learning · Statistics 2013-01-15 Yudong Chen , Constantine Caramanis , Shie Mannor