Divide-and-conquer for debiased l₁-norm support vector machine in ultra-high dimensions
From MaRDI portal
(Redirected from Publication:4558508)
Divide-and-conquer for debiased \(l 1\)-norm support vector machine in ultra-high dimensions
Divide-and-conquer for debiased \(l 1\)-norm support vector machine in ultra-high dimensions
Recommendations
- An error bound for L₁-norm support vector machine coefficients in ultra-high dimension
- Variable selection for support vector machines in moderately high dimensions
- OnL1-Norm Multiclass Support Vector Machines
- The doubly regularized support vector machine
- Support vector machine and its bias correction in high-dimension, low-sample-size settings
Cites work
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
- A Bahadur representation of the linear support vector machine
- A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
- A note on margin-based loss functions in classification
- A partially linear framework for massive heterogeneous data
- An error bound for L₁-norm support vector machine coefficients in ultra-high dimension
- An introduction to support vector machines and other kernel-based learning methods.
- Asymptotic Equivalence of Regularization Methods in Thresholded Parameter Space
- Asymptotic normality of Powell's kernel estimator
- Communication-efficient algorithms for statistical optimization
- Communication-efficient sparse regression
- Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
- Convexity, Classification, and Risk Bounds
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
- Fast rates for support vector machines using Gaussian kernels
- High dimensional thresholded regression and shrinkage effect
- High-dimensional generalized linear models and the lasso
- scientific article; zbMATH DE number 5957245 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Inverses of Band Matrices and Local Convergence of Spline Projections
- Nearly unbiased variable selection under minimax concave penalty
- On asymptotically optimal confidence regions and tests for high-dimensional models
- Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
- Oracle properties of SCAD-penalized support vector machine
- Statistical behavior and consistency of classification methods based on convex risk minimization.
- Statistical performance of support vector machines
- Support-vector networks
- The Adaptive Lasso and Its Oracle Properties
- Variable selection for support vector machines in moderately high dimensions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Weak convergence and empirical processes. With applications to statistics
Cited in
(38)- Sparse high-dimensional fractional-norm support vector machine via DC programming
- The backbone method for ultra-high dimensional sparse machine learning
- A divide-and-combine method for large scale nonparallel support vector machines
- An error bound for L₁-norm support vector machine coefficients in ultra-high dimension
- Partitioned Approach for High-dimensional Confidence Intervals with Large Split Sizes
- Learning data-adaptive non-parametric kernels
- Distributed inference for linear support vector machine
- A review of distributed statistical inference
- Distributed estimation with empirical likelihood
- Distributed learning for sketched kernel regression
- Robust distributed multicategory angle-based classification for massive data
- A communication efficient distributed one-step estimation
- Statistical inference and distributed implementation for linear multicategory SVM
- Adaptive distributed support vector regression of massive data
- Two-stage online debiased Lasso estimation and inference for high-dimensional quantile regression with streaming data
- A selective review on statistical methods for massive data computation: distributed computing, subsampling, and minibatch techniques
- Online two-way estimation and inference via linear mixed-effects models
- Online updating Huber robust regression for big data streams
- The statistical rate for support matrix machines under low rankness and row (column) sparsity
- Support vector machine in big data: smoothing strategy and adaptive distributed inference
- Sparse additive support vector machines in bounded variation space
- Federated double machine learning for high-dimensional semiparametric models
- Distributed learning for high-dimensional factor augmented regression models
- Robust Inference for Federated Meta-Learning
- Federated Adaptive Causal Estimation (FACE) of Target Treatment Effects
- Sparse and debiased adaptive Huber regression in distributed data: aggregated and communication-efficient approaches
- Distributed Estimation of Principal Support Vector Machines for Sufficient Dimension Reduction
- Distributed empirical likelihood inference with or without Byzantine failures
- Sparse estimation and inference for prediction-powered semi-supervised linear regression
- A Simple Divide-and-Conquer-based Distributed Method for the Accelerated Failure Time Model
- Convolution smoothing and online updating estimation for support vector machine
- Byzantine-robust distributed support vector machine
- Distributed Mallows model averaging for ridge regressions
- Distributed Nyström approximation with convex Lipschitz loss
- Efficient Distributed Learning over Decentralized Networks with Convoluted Support Vector Machine
- Penalized empirical likelihood over decentralized networks
- Renewable ℓ 1 -Regularized Linear Support Vector Machine with High-Dimensional Streaming Data
- Debiased magnitude-preserving ranking: learning rate and bias characterization
This page was built for publication: Divide-and-conquer for debiased \(l_1\)-norm support vector machine in ultra-high dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558508)
