Journal Article10.1109/TNNLS.2020.3005144
Sparse Modal Additive Model
32
TL;DR: A new robust regression method is proposed, called as sparse modal additive model (SpMAM), by integrating the modal regression metric, the data-dependent hypothesis space, and the weighted <inline-formula> <tex-math notation="LaTeX">$\ell _{q,1}$ </tex- Math>-norm regularizer into the additive models.
read more
Abstract: Sparse additive models have been successfully applied to high-dimensional data analysis due to the flexibility and interpretability of their representation. However, the existing methods are often formulated using the least-squares loss with learning the conditional mean, which is sensitive to data with the non-Gaussian noises, e.g., skewed noise, heavy-tailed noise, and outliers. To tackle this problem, we propose a new robust regression method, called as sparse modal additive model (SpMAM), by integrating the modal regression metric, the data-dependent hypothesis space, and the weighted $\ell _{q,1}$ -norm regularizer $(q \geq 1)$ into the additive models. Specifically, the modal regression metric assures the model robustness to complex noises via learning the conditional mode, the data-dependent hypothesis space offers the model adaptivity via sample-based presentation, and the $\ell _{q,1}$ -norm regularizer addresses the algorithmic interpretability via sparse variable selection. In theory, the proposed SpMAM enjoys statistical guarantees on asymptotic consistency for regression estimation and variable selection simultaneously. Experimental results on both synthetic and real-world benchmark data sets validate the effectiveness and robustness of the proposed model.
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
•Proceedings Article
Multi-task Additive Models for Robust Estimation and Automatic Structure Discovery
Yingjie Wang,Hong Chen,Feng Zheng,Chen Xu,Tieliang Gong,Yanhong Chen +5 more
- 01 Jan 2020
TL;DR: This work proposes a new class of additive models, called Multi-task Additive Models (MAM), by integrating the mode-induced metric, the structure-based regularizer, and additive hypothesis spaces into a bilevel optimization framework.
•Proceedings Article
Sparse Shrunk Additive Models
Hong Chen,guodong liu,Heng Huang +2 more
- 12 Jul 2020
TL;DR: A new method, called as sparse shrunk additive models (SSAM), is proposed to explore the structure information among features and only requires the component functions to be continuous and bounded, which are not necessary to be in reproducing kernel Hilbert spaces.
A Novel Family of Sparsity-Aware Robust Adaptive Filters Based on a Logistic Distance Metric
TL;DR: In this paper , a logistic distance metric-based robust cost function was proposed, and the corresponding logistic metric adaptive filter (LDMAF) has been developed, which provides negligible weight update when the desired signals are affected by significant outliers, resulting in low steady-state misalignment.
10
Modal-Regression-Based Broad Learning System for Robust Regression and Classification.
TL;DR: Wang et al. as mentioned in this paper proposed a modal-regression-based broad learning system (MRBLS) to tackle the regression and classification tasks of data corrupted by noise and outliers.
8
Best subset selection for high-dimensional non-smooth models using iterative hard thresholding
TL;DR: In this paper , the authors consider non-smooth loss functions with quantile check loss and the hinge loss and establish the geometric convergence of IHT up to the statistical precision of the model.
4
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.
•Book
Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers
Stephen Boyd,Neal Parikh,Eric Chu,Borja Peleato,Jonathan Eckstein +4 more
- 23 May 2011
TL;DR: It is argued that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas.
Model selection and estimation in regression with grouped variables
Ming Yuan,Yi Lin +1 more
TL;DR: In this paper, instead of selecting factors by stepwise backward elimination, the authors focus on the accuracy of estimation and consider extensions of the lasso, the LARS algorithm and the non-negative garrotte for factor selection.
•Book
Spline models for observational data
Grace Wahba
- 01 Mar 1990
TL;DR: In this paper, a theory and practice for the estimation of functions from noisy data on functionals is developed, where convergence properties, data based smoothing parameter selection, confidence intervals, and numerical methods are established which are appropriate to a number of problems within this framework.
6.9K
What is a support vector machine
TL;DR: Support vector machines are becoming popular in a wide variety of biological applications, but how do they work and what are their most promising applications in the life sciences?