Sparse additive support vector machines in bounded variation space
From MaRDI portal
Recommendations
- Sparse additive machine with ramp loss
- Sparse support vector machines in reproducing kernel Banach spaces
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming
- Variable selection for support vector machines via smoothing spline ANOVA
- Multikernel regression with sparsity constraint
Cites work
- A Bahadur representation of the linear support vector machine
- A consistent information criterion for support vector machines in diverging model spaces
- Adaptive piecewise polynomial estimation via trend filtering
- An error bound for L₁-norm support vector machine coefficients in ultra-high dimension
- Analysis of support vector machine classification
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Consistency of support vector machines using additive kernels for additive models
- Convexity, Classification, and Risk Bounds
- Distributed inference for linear support vector machine
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Divide-and-conquer for debiased \(l_1\)-norm support vector machine in ultra-high dimensions
- Doubly penalized estimation in additive regression with high-dimensional data
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
- Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness
- Fast rates for support vector machines using Gaussian kernels
- Generalized additive models
- Generalized Additive Models: Some Applications
- High-dimensional additive modeling
- scientific article; zbMATH DE number 5190601 (Why is no real title available?)
- scientific article; zbMATH DE number 45848 (Why is no real title available?)
- scientific article; zbMATH DE number 1181255 (Why is no real title available?)
- scientific article; zbMATH DE number 6860790 (Why is no real title available?)
- Learning rates for the risk of kernel-based quantile regression estimators in additive models
- Local Rademacher complexities
- Locally adaptive regression splines
- Minimax-optimal rates for sparse additive models over kernel classes via convex programming
- Multi-kernel regularized classifiers
- On Smoothest Interpolants
- Quantile smoothing splines
- Robust high dimensional learning for Lipschitz and convex losses
- Simultaneous analysis of Lasso and Dantzig selector
- Sparsity in multiple kernel learning
- Spline function smooth support vector machine for classification
- Spline solutions to L\(^1\) extremal problems in one and several variables
- Statistical inference in sparse high-dimensional additive models
- Support-vector networks
- The doubly regularized support vector machine
- Variable selection for support vector machines in moderately high dimensions
This page was built for publication: Sparse additive support vector machines in bounded variation space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663350)
