English
Related papers

Related papers: Oracle Efficient Estimation of Structural Breaks i…

200 papers

We consider the problem of estimating and inferring treatment effects in randomized experiments. In practice, stratified randomization, or more generally, covariate-adaptive randomization, is routinely used in the design stage to balance…

Methodology · Statistics 2022-09-27 Hanzhong Liu , Fuyi Tu , Wei Ma

Kernel ridge regression (KRR) is a widely used nonparametric method due to its strong theoretical guarantees and computational convenience. However, standard KRR does not distinguish between linear and nonlinear components in the signal,…

Statistics Theory · Mathematics 2026-05-13 Xin Bing , Chao Wang

This paper is concerned with high-dimensional panel data models where the number of regressors can be much larger than the sample size. Under the assumption that the true parameter vector is sparse we propose a panel-Lasso estimator and…

Statistics Theory · Mathematics 2014-02-14 Anders Bredahl Kock

We study a set of regularization methods for high-dimensional linear regression models. These penalized estimators have the square root of the residual sum of squared errors as loss function, and any weakly decomposable norm as penalty…

Statistics Theory · Mathematics 2016-06-28 Benjamin Stucky , Sara van de Geer

We establish oracle inequalities for a version of the Lasso in high-dimensional fixed effects dynamic panel data models. The inequalities are valid for the coefficients of the dynamic and exogenous regressors. Separate oracle inequalities…

Statistics Theory · Mathematics 2016-01-05 Anders Bredahl Kock , Haihan Tang

Sorted L-One Penalized Estimation is a relatively new convex optimization procedure which allows for adaptive selection of regressors under sparse high dimensional designs. Here we extend the idea of SLOPE to deal with the situation when…

Statistics Theory · Mathematics 2015-12-01 Damian Brzyski , Weijie Su , Małgorzata Bogdan

We consider estimation in a high-dimensional linear model with strongly correlated variables. We propose to cluster the variables first and do subsequent sparse estimation such as the Lasso for cluster-representatives or the group Lasso…

Methodology · Statistics 2015-01-14 Peter Bühlmann , Philipp Rütimann , Sara van de Geer , Cun-Hui Zhang

The paper considers a linear model with grouped explanatory variables. If the model errors are not with zero mean and bounded variance or if model contains outliers, then the least squares framework is not appropriate. Thus, the quantile…

Statistics Theory · Mathematics 2016-07-14 Gabriela Ciuperca

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

Conformal prediction is a general method that converts almost any point predictor to a prediction set. The resulting set keeps good statistical properties of the original estimator under standard assumptions, and guarantees valid average…

Methodology · Statistics 2017-08-02 Jing Lei

When a series of (related) linear models has to be estimated it is often appropriate to combine the different data-sets to construct more efficient estimators. We use $\ell_1$-penalized estimators like the Lasso or the Adaptive Lasso which…

Statistics Theory · Mathematics 2007-12-18 Lukas Meier , Peter Bühlmann

Regression trees and their ensemble methods are popular methods for nonparametric regression: they combine strong predictive performance with interpretable estimators. To improve their utility for locally smooth response surfaces, we study…

Methodology · Statistics 2021-09-13 Sören R. Künzel , Theo F. Saarinen , Edward W. Liu , Jasjeet S. Sekhon

We consider the problem of simultaneous variable selection and estimation of the corresponding regression coefficients in an ultra-high dimensional linear regression models, an extremely important problem in the recent era. The adaptive…

Methodology · Statistics 2023-09-22 Abhik Ghosh , Maria Jaenada , Leandro Pardo

This article is dedicated to the estimation of the regression function when the explanatory variable is a weakly dependent process whose correlation coefficient exhibits exponential decay and has a known bounded density function. The…

Statistics Theory · Mathematics 2025-07-17 Karine Bertin , Lisandro Fermin , Miguel Padrino

The estimation problem in a high regression model with structured sparsity is investigated. An algorithm using a two steps block thresholding procedure called GR-LOL is provided. Convergence rates are produced: they depend on simple…

Statistics Theory · Mathematics 2012-07-10 Mathilde Mougeot , Dominique Picard , Karine Tribouley

The adaptive LASSO has been used for consistent variable selection in place of LASSO in the linear regression model. In this article, we propose a modified LARS algorithm to combine adaptive LASSO with some biased estimators, namely the…

Methodology · Statistics 2024-07-02 Manickavasagar Kayanan , Pushpakanthie Wijekoon

We study the problem of nonparametric estimation under $\bL_p$-loss, $p\in [1,\infty)$, in the framework of the convolution structure density model on $\bR^d$. This observation scheme is a generalization of two classical statistical models,…

Statistics Theory · Mathematics 2017-04-17 Oleg Lepski , Thomas Willer

Linear models that contain a time-dependent response and explanatory variables have attracted much interest in recent years. The most general form of the existing approaches is of a linear regression model with autoregressive moving average…

Methodology · Statistics 2021-02-15 Hamed Haselimashhadi , Veronica Vinciotti

Generalized linear and additive models are very efficient regression tools but the selection of relevant terms becomes difficult if higher order interactions are needed. In contrast, tree-based methods also known as recursive partitioning…

Methodology · Statistics 2015-04-21 Gerhard Tutz , Moritz Berger

In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods,…

Machine Learning · Statistics 2017-11-22 Eugene Ndiaye , Olivier Fercoq , Alexandre Gramfort , Vincent Leclère , Joseph Salmon
‹ Prev 1 4 5 6 7 8 10 Next ›