English
Related papers

Related papers: Sparse inference in Poisson Log-Normal model by ap…

200 papers

We propose a new and computationally efficient algorithm for maximizing the observed log-likelihood for a multivariate normal data matrix with missing values. We show that our procedure based on iteratively regressing the missing on the…

Methodology · Statistics 2012-11-21 Nicolas Städler , Daniel J. Stekhoven , Peter Bühlmann

As an effective nonparametric method, empirical likelihood (EL) is appealing in combining estimating equations flexibly and adaptively for incorporating data information. To select important variables and estimating equations in the sparse…

Methodology · Statistics 2021-07-02 Jiaqi Li , Liya Fu

Penalized regression models such as the Lasso have proved useful for variable selection in many fields - especially for situations with high-dimensional data where the numbers of predictors far exceeds the number of observations. These…

Methodology · Statistics 2014-03-19 Kasper Brink-Jensen , Claus Thorn Ekstrøm

This paper aims at achieving a simultaneously sparse and low-rank estimator from the semidefinite population covariance matrices. We first benefit from a convex optimization which develops $l_1$-norm penalty to encourage the sparsity and…

Statistics Theory · Mathematics 2014-08-08 Shenglong Zhou , Naihua Xiu , Ziyan Luo , Lingchen Kong

Inference for high-dimensional logistic regression models using penalized methods has been a challenging research problem. As an illustration, a major difficulty is the significant bias of the Lasso estimator, which limits its direct…

Methodology · Statistics 2024-10-29 Yuming Zhang , Stéphane Guerrier , Runze Li

Classical penalized likelihood regression problems deal with the case that the independent variables data are known exactly. In practice, however, it is common to observe data with incomplete covariate information. We are concerned with a…

Methodology · Statistics 2010-08-04 Xiwen Ma , Bin Dai , Ronald Klein , Barbara E. K. Klein , Kristine E. Lee , Grace Wahba

Variable selection is a fundamental task in statistical data analysis. Sparsity-inducing regularization methods are a popular class of methods that simultaneously perform variable selection and model estimation. The central problem is a…

Machine Learning · Computer Science 2016-03-16 Hongbo Dong , Kun Chen , Jeff Linderoth

High-dimensional learning problems, where the number of features exceeds the sample size, often require sparse regularization for effective prediction and variable selection. While established for fully supervised data, these techniques…

Machine Learning · Computer Science 2026-01-01 The Tien Mai , Mai Anh Nguyen , Trung Nghia Nguyen

The problem of finding the maximum likelihood estimates for the regression coefficients in generalised linear models with an L1 sparsity penalty is shown to be equivalent to minimising the unpenalised maximum log-likelihood function over a…

Methodology · Statistics 2015-12-21 Tom Michoel

In this paper, we review state-of-the-art methods for feature selection in statistics with an application-oriented eye. Indeed, sparsity is a valuable property and the profusion of research on the topic might have provided little guidance…

Methodology · Statistics 2021-11-08 Dimitris Bertsimas , Jean Pauphilet , Bart Van Parys

A new statistical procedure, based on a modified spline basis, is proposed to identify the linear components in the panel data model with fixed effects. Under some mild assumptions, the proposed procedure is shown to consistently estimate…

Econometrics · Economics 2019-11-21 Ruiqi Liu , Ben Boukai , Zuofeng Shang

Determining how to appropriately select the tuning parameter is essential in penalized likelihood methods for high-dimensional data analysis. We examine this problem in the setting of penalized likelihood methods for generalized linear…

Methodology · Statistics 2016-05-12 Yingying Fan , Cheng Yong Tang

Neural networks are usually not the tool of choice for nonparametric high-dimensional problems where the number of input features is much larger than the number of observations. Though neural networks can approximate complex multivariate…

Methodology · Statistics 2019-06-25 Jean Feng , Noah Simon

We describe a simple, efficient, permutation based procedure for selecting the penalty parameter in the LASSO. The procedure, which is intended for applications where variable selection is the primary focus, can be applied in a variety of…

Machine Learning · Statistics 2014-04-09 Jeremy Sabourin , William Valdar , Andrew Nobel

This paper deals with the problem of model selection for a general class of integer-valued time series. We propose a penalized criterion based on the Poisson quasi-likelihood of the model. Under certain regularity conditions, the…

Statistics Theory · Mathematics 2020-02-21 Mamadou Lamine Diop , William Kengne

We introduce GAMSEL (Generalized Additive Model Selection), a penalized likelihood approach for fitting sparse generalized additive models in high dimension. Our method interpolates between null, linear and additive models by allowing the…

Machine Learning · Statistics 2015-06-18 Alexandra Chouldechova , Trevor Hastie

This paper presents a general theoretical framework of penalized quasi-maximum likelihood (PQML) estimation in stationary multiple time series models when the number of parameters possibly diverges. We show the oracle property of the PQML…

Statistics Theory · Mathematics 2017-04-28 Yoshimasa Uematsu

Species distribution modeling (SDM) plays a crucial role in investigating habitat suitability and addressing various ecological issues. While likelihood analysis is commonly used to draw ecological conclusions, it has been observed that its…

Methodology · Statistics 2023-07-03 Yusuke Saigusa , Shinto Eguchi , Osamu Komori

The paper introduces a penalized matrix estimation procedure aiming at solutions which are sparse and low-rank at the same time. Such structures arise in the context of social networks or protein interactions where underlying graphs have…

Data Structures and Algorithms · Computer Science 2012-07-03 Emile Richard , Pierre-Andre Savalle , Nicolas Vayatis

A methodology to perform topological regularization via information filtering network is introduced. This methodology can be directly applied to covariance selection problem providing an instrument for sparse probabilistic modeling with…

Machine Learning · Computer Science 2021-11-02 Tomaso Aste
‹ Prev 1 3 4 5 6 7 10 Next ›