Journal Article10.1016/j.eswa.2023.119528
Robust partially linear models for automatic structure discovery
1
TL;DR: In this article , the authors proposed a robust linear and nonlinear discovery algorithm (RLAND) by integrating the modal regression and partially linear models (PLMs), which can mitigate the influence of noise in structure discovery.
read more
Abstract: Partially linear models (PLMs), rooted in the combination of linear and nonlinear approximation, are recognized to be capable of modeling complex data. Indeed, the performance of PLMs depends heavily on the choice of model structure, such as which covariates have linear or nonlinear effects on the response. Nevertheless, most existing PLMs are limited to the mean regression, resulting in sensitivity to non-Gaussian noises, such as skewed noise and heavy-tailed noise. In order to mitigate the influence of noise in structure discovery, this paper proposes a Robust Linear And Nonlinear Discovery algorithm (RLAND) by integrating the modal regression and PLMs. Statistical analysis on generalization bound and structure discovery consistency are established to characterize its learning theory foundations. Computation analysis illustrates that the RLAND can be efficiently realized by half quadratic optimization and the quadratic programming. Empirical evaluations on simulation and real-world data validate the competitive performance of the proposed method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Error Density-dependent Empirical Risk Minimization
Hong Chen,Xuelin Zhang,Tieliang Gong,Bin Gu,Feng Zheng +4 more
References
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
The adaptive lasso and its oracle properties
TL;DR: A new version of the lasso is proposed, called the adaptive lasso, where adaptive weights are used for penalizing different coefficients in the ℓ1 penalty, and the nonnegative garotte is shown to be consistent for variable selection.
Rademacher and gaussian complexities: risk bounds and structural results
Peter L. Bartlett,Shahar Mendelson +1 more
- 01 Mar 2003
TL;DR: In this paper, the authors investigate the use of data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities, in a decision theoretic setting and prove general risk bounds in terms of these complexities.
Semiparametric Estimates of the Relation between Weather and Electricity Sales
TL;DR: In this article, a nonlinear relationship between electricity sales and temperature is estimated using a semiparametric regression procedure that easily allows linear transformations of the data and accommodates introduction of covariates, timing adjustments due to the actual billing schedules, and serial correlation.
1K
•Book
Learning Theory: An Approximation Theory Viewpoint
Felipe Cucker,Ding-Xuan Zhou +1 more
- 14 May 2007
TL;DR: This paper presents a framework of learning for regularization of vector machines for classification and some examples of regularized classifiers used in this classifier study.