English
Related papers

Related papers: Discussion: One-step sparse estimates in nonconcav…

200 papers

Various R packages have been developed for the non-convex penalized estimation but they can only be applied to the smoothly clipped absolute deviation (SCAD) or minimax concave penalty (MCP). We develop an R package, entitled ncpen, for the…

Computation · Statistics 2018-11-14 Dongshin Kim , Sangin Lee , Sunghoon Kwon

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

This paper compares convex and non-convex penalized likelihood methods in high-dimensional statistical modeling, focusing on their strengths and limitations. Convex penalties, like LASSO, offer computational efficiency and strong…

Methodology · Statistics 2025-02-26 Kasy Du

Many popular statistical models, such as factor and random effects models, give arise a certain type of covariance structures that is a summation of low rank and sparse matrices. This paper introduces a penalized approximation framework to…

Methodology · Statistics 2015-03-19 Xi Luo

We proposed a new penalized method in this paper to solve sparse Poisson Regression problems. Being different from $\ell_1$ penalized log-likelihood estimation, our new method can be viewed as penalized weighted score function method. We…

Statistics Theory · Mathematics 2017-03-14 Jinzhu Jia , Fang Xie , Lihu Xu

We propose a modified version of the three-step estimation method for the latent class model with covariates, which may be used to estimate latent Markov models for longitudinal data. The three-step estimation approach we propose is based…

Methodology · Statistics 2014-02-06 Francesco Bartolucci , Giorgio E. Montanari , Silvia Pandolfi

Distributed systems have been widely used in practice to accomplish data analysis tasks of huge scales. In this work, we target on the estimation problem of generalized linear models on a distributed system with nonrandomly distributed…

Methodology · Statistics 2020-04-07 Feifei Wang , Danyang Huang , Yingqiu Zhu , Hansheng Wang

A class of variable selection procedures for parametric models via nonconcave penalized likelihood was proposed by Fan and Li to simultaneously estimate parameters and select important variables. They demonstrated that this class of…

Statistics Theory · Mathematics 2007-06-13 Jianqing Fan , Heng Peng

We consider likelihood-based two-step estimation of latent variable models, in which just the measurement model is estimated in the first step and the measurement parameters are then fixed at their estimated values in the second step where…

Methodology · Statistics 2025-08-26 Jouni Kuha , Zsuzsa Bakk

We propose a likelihood ratio statistic for forming hypothesis tests and confidence intervals for a nonparametrically estimated univariate regression function, based on the shape restriction of concavity (alternatively, convexity). Dealing…

Statistics Theory · Mathematics 2018-09-11 Charles R. Doss

Longitudinal binary or count functional data are common in neuroscience, but are often too large to analyze with existing functional regression methods. We propose one-step penalized generalized estimating equations that supports…

Methodology · Statistics 2026-03-31 Gabriel Loewinger , Alex W. Levis , Erjia Cui , Francisco Pereira

Distributed statistical inference has recently attracted enormous attention. Many existing work focuses on the averaging estimator. We propose a one-step approach to enhance a simple-averaging based distributed estimator. We derive the…

Methodology · Statistics 2015-11-11 Cheng Huang , Xiaoming Huo

We study asymptotic behavior of one-step weighted $M$-estimators based on samples from arrays of not necessarily identically distributed random variables and representing explicit approximations to the corresponding consistent weighted…

Statistics Theory · Mathematics 2015-07-07 Yu. Yu. Linke

Sampling is often a necessary evil to reduce the processing and storage costs of distributed tracing. In this work, we describe a scalable and adaptive sampling approach that can preserve events of interest better than the widely used…

Data Structures and Algorithms · Computer Science 2021-07-19 Otmar Ertl

Recently, there has been focus on penalized log-likelihood covariance estimation for sparse inverse covariance (precision) matrices. The penalty is responsible for inducing sparsity, and a very common choice is the convex $l_1$ norm.…

Machine Learning · Statistics 2023-07-19 Goran Marjanovic , Alfred O. Hero

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

Nonparametric regression models with locally stationary covariates have received increasing interest in recent years. As a nice relief of "curse of dimensionality" induced by large dimension of covariates, additive regression model is…

Statistics Theory · Mathematics 2016-12-02 Lixia Hu , Tao Huang , Jinhong You

A penalized maximum likelihood estimation approach is proposed for discrete-time hidden Markov models where covariates affect the observed responses and serial dependence is considered. The proposed penalized maximum likelihood method…

Methodology · Statistics 2025-07-04 Luca Brusa , Fulvia Pennoni , Francesco Bartolucci , Romina Peruilh Bagolini

Sparse covariates are frequent in classification and regression problems and in these settings the task of variable selection is usually of interest. As it is well known, sparse statistical models correspond to situations where there are…

Methodology · Statistics 2020-02-14 Ana M. Bianco , Graciela Boente , Gonzalo Chebi

We present a method of variable selection for the sparse generalized additive model. The method doesn't assume any specific functional form, and can select from a large number of candidates. It takes the form of incremental forward…

Machine Learning · Statistics 2018-05-29 Tianwei Yu