Prediction Error Bounds for Linear Regression With the TREX

01/04/2018
by   Jacob Bien, et al.
0

The TREX is a recently introduced approach to sparse linear regression. In contrast to most well-known approaches to penalized regression, the TREX can be formulated without the use of tuning parameters. In this paper, we establish the first known prediction error bounds for the TREX. Additionally, we introduce extensions of the TREX to a more general class of penalties, and we provide a bound on the prediction error in this generalized setting. These results deepen the understanding of TREX from a theoretical perspective and provide new insights into penalized regression in general.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2022

On the generalization error of norm penalty linear regression models

We study linear regression problems inf_β∈ℝ^d(𝔼_ℙ_n[|Y - 𝐗^⊤β|^r])^1/r +...
research
04/24/2023

Estimation of sparse linear regression coefficients under L-subexponential covariates

We address a task of estimating sparse coefficients in linear regression...
research
12/06/2019

Improved PAC-Bayesian Bounds for Linear Regression

In this paper, we improve the PAC-Bayesian error bound for linear regres...
research
11/26/2019

Recursive Prediction of Graph Signals with Incoming Nodes

Kernel and linear regression have been recently explored in the predicti...
research
08/23/2022

A flexible empirical Bayes approach to multiple linear regression and connections with penalized regression

We introduce a new empirical Bayes approach for large-scale multiple lin...
research
01/22/2021

Linear Regression with Distributed Learning: A Generalization Error Perspective

Distributed learning provides an attractive framework for scaling the le...

Please sign up or login with your details

Forgot password? Click here to reset