Classification with Gaussians and convex loss
From MaRDI portal
Publication:2880932
Recommendations
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
- Convexity, Classification, and Risk Bounds
- Learning with convex loss and indefinite kernels
- scientific article; zbMATH DE number 1140602
- Optimal learning with Gaussians and correntropy loss
- Analysis to Neyman-Pearson classification with convex loss function
- High-dimensional regression and classification under a class of convex loss functions
- Convex calibration dimension for multiclass loss matrices
- Convex surrogate minimization in classification
- On the rate of convergence for multi-category classification based on convex losses
Cited in
(30)- Learning with sample dependent hypothesis spaces
- Analysis to Neyman-Pearson classification with convex loss function
- Calibration of \(\epsilon\)-insensitive loss in support vector machines regression
- Learning rates of kernel-based robust classification
- A note on support vector machines with polynomial kernels
- Learning rates for the risk of kernel-based quantile regression estimators in additive models
- Employing different loss functions for the classification of images via supervised learning
- Unregularized online algorithms with varying Gaussians
- Multi-kernel regularized classifiers
- Distributed regularized least squares with flexible Gaussian kernels
- Covering numbers of Gaussian reproducing kernel Hilbert spaces
- Conditional quantiles with varying Gaussians
- Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions
- Optimal learning with Gaussians and correntropy loss
- Quantile regression with \(\ell_1\)-regularization and Gaussian kernels
- An oracle inequality for regularized risk minimizers with strongly mixing observations
- Learnability of Gaussians with flexible variances
- Learning rates of regression with \(q\)-norm loss and threshold
- Convergence analysis for complementary-label learning with kernel ridge regression
- Large margin unified machines with non-i.i.d. process
- Learning rates for classification with Gaussian kernels
- Comparison theorems on large-margin learning
- Learning from non-identical sampling for classification
- Optimal regression rates for SVMs using Gaussian kernels
- Logistic classification with varying gaussians
- A new comparison theorem on conditional quantiles
- Binning in Gaussian kernel regularization
- Learning with convex loss and indefinite kernels
- A study on the error of distributed algorithms for big data classification with SVM
- Online classification with varying Gaussians
This page was built for publication: Classification with Gaussians and convex loss
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880932)
