English
Related papers

Related papers: SPADES and mixture models

200 papers

Sparse methods are the standard approach to obtain interpretable models with high prediction accuracy. Alternatively, algorithmic ensemble methods can achieve higher prediction accuracy at the cost of loss of interpretability. However, the…

Methodology · Statistics 2022-01-11 Anthony Christidis , Stefan Van Aelst , Ruben Zamar

We consider the framework of penalized estimation where the penalty term is given by a real-valued polyhedral gauge, which encompasses methods such as LASSO, generalized LASSO, SLOPE, OSCAR, PACS and others. Each of these estimators is…

Statistics Theory · Mathematics 2025-11-11 Piotr Graczyk , Ulrike Schneider , Tomasz Skalski , Patrick Tardivel

We give oracle inequalities on procedures which combines quantization and variable selection via a weighted Lasso $k$-means type algorithm. The results are derived for a general family of weights, which can be tuned to size the influence of…

Statistics Theory · Mathematics 2016-07-07 Clément Levrard

We derived the first sparse recovery guarantees for weighted $\ell_1$ minimization with sparse random matrices and the class of weighted sparse signals, using a weighted versions of the null space property to derive these guarantees. These…

Numerical Analysis · Mathematics 2016-05-10 Bubacarr Bah

In high-dimensional model selection problems, penalized simple least-square approaches have been extensively used. This paper addresses the question of both robustness and efficiency of penalized model selection methods, and proposes a…

Methodology · Statistics 2011-07-06 Jelena Bradic , Jianqing Fan , Weiwei Wang

Modern statistical learning algorithms are capable of amazing flexibility, but struggle with interpretability. One possible solution is sparsity: making inference such that many of the parameters are estimated as being identically 0, which…

Methodology · Statistics 2023-05-15 Nathan Wycoff , Ali Arab , Katharine M. Donato , Lisa O. Singh

We propose an $\ell_1$-penalized estimation procedure for high-dimensional linear mixed-effects models. The models are useful whenever there is a grouping structure among high-dimensional observations, i.e. for clustered data. We prove a…

Methodology · Statistics 2011-05-12 Jürg Schelldorfer , Peter Bühlmann , Sara van de Geer

The Gridding algorithm has shown great utility for reconstructing images from non-uniformly spaced samples in the Fourier domain in several imaging modalities. Due to the non-uniform spacing, some correction for the variable density of the…

Image and Video Processing · Electrical Eng. & Systems 2021-06-17 Nicholas Dwork , Daniel O'Connor , Ethan M. I. Johnson , Corey A. Baron , Jeremy W. Gordon , John M. Pauly , Peder E. Z. Larson

A novel refinement measure for non-intrusive surrogate modelling of partial differential equations (PDEs) with uncertain parameters is proposed. Our approach uses an empirical interpolation procedure, where the proposed refinement measure…

Numerical Analysis · Mathematics 2019-07-10 Yous van Halder , Benjamin Sanderse , Barry Koren

Unions of subspaces provide a powerful generalization to linear subspace models for collections of high-dimensional data. To learn a union of subspaces from a collection of data, sets of signals in the collection that belong to the same…

Machine Learning · Computer Science 2016-10-28 Eva L. Dyer , Aswin C. Sankaranarayanan , Richard G. Baraniuk

Compressive sensing (CS) exploits sparsity to recover sparse or compressible signals from dimensionality reducing, non-adaptive sensing mechanisms. Sparsity is also used to enhance interpretability in machine learning and statistics…

Information Theory · Computer Science 2015-07-21 Anastasios Kyrillidis , Luca Baldassarre , Marwa El-Halabi , Quoc Tran-Dinh , Volkan Cevher

In this paper, we first reviewed several biclustering methods that are used to identify the most significant clusters in gene expression data. Here we mainly focused on the SSVD(sparse SVD) method and tried a new sparse penalty named…

Machine Learning · Statistics 2023-09-01 Jiqiang Wang

We present and analyze a novel sparse polynomial technique for approximating high-dimensional Hilbert-valued functions, with application to parameterized partial differential equations (PDEs) with deterministic and stochastic inputs. Our…

Numerical Analysis · Mathematics 2020-01-22 Nick Dexter , Hoang Tran , Clayton Webster

We study sparse recovery with structured random measurement matrices having independent, identically distributed, and uniformly bounded rows and with a nontrivial covariance structure. This class of matrices arises from random sampling of…

Information Theory · Computer Science 2020-05-15 Simone Brugiapaglia , Sjoerd Dirksen , Hans Christian Jung , Holger Rauhut

Estimating probabilistic deformable template models is a new approach in the fields of computer vision and probabilistic atlases in computational anatomy. A first coherent statistical framework modelling the variability as a hidden random…

Computation · Statistics 2009-01-16 Stéphanie Allassonnière , Estelle Kuhn

We introduce a new empirical Bayes approach for large-scale multiple linear regression. Our approach combines two key ideas: (i) the use of flexible "adaptive shrinkage" priors, which approximate the nonparametric family of scale mixture of…

Methodology · Statistics 2024-06-13 Youngseok Kim , Wei Wang , Peter Carbonetto , Matthew Stephens

Within Bayesian nonparametrics, dependent Dirichlet process mixture models provide a highly flexible approach for conducting inference about the conditional density function. However, several formulations of this class make either rather…

Methodology · Statistics 2024-05-14 María Xosé Rodríguez-Álvarez , Vanda Inácio , Nadja Klein

Stochastic Differential Equations (SDEs) serve as a powerful modeling tool in various scientific domains, including systems science, engineering, and ecological science. While the specific form of SDEs is typically known for a given…

Methodology · Statistics 2024-02-27 Xin Cai , Jingyu Yang , Zhibao Li , Hongqiao Wang , Miao Huang

Mixtures of von Mises-Fisher distributions can be used to cluster data on the unit hypersphere. This is particularly adapted for high-dimensional directional data such as texts. We propose in this article to estimate a von Mises mixture…

Machine Learning · Computer Science 2023-01-02 Fabrice Rossi , Florian Barbaro

This article proposes diffusion LMS strategies for distributed estimation over adaptive networks that are able to exploit sparsity in the underlying system model. The approach relies on convex regularization, common in compressive sensing,…

Machine Learning · Computer Science 2015-06-05 Paolo Di Lorenzo , Ali H. Sayed
‹ Prev 1 4 5 6 7 8 10 Next ›