Recommendations
- Covering numbers for support vector machines
- Covering numbers for real-valued function classes
- Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators
- scientific article; zbMATH DE number 2087696
- A note on different covering numbers in learning theory.
Cited in
(41)- On the generalization error of fixed combinations of classifiers
- Nonparametric Conditional Density Estimation Using Piecewise-Linear Solution Path of Kernel Quantile Regression
- Hinge-minimax learner for the ensemble of hyperplanes
- Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks
- Explainable online ensemble of deep neural network pruning for time series forecasting
- Generalization performance of Lagrangian support vector machine based on Markov sampling
- Sequence classification via large margin hidden Markov models
- Gradient-induced variable selection in reproducing kernel Hilbert space for survival analysis
- Optimality of SVM: novel proofs and tighter bounds
- Kernel selection with spectral perturbation stability of kernel matrix
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Consistency and generalization bounds for maximum entropy density estimation
- Quantile-slicing estimation for dimension reduction in regression
- On combining machine learning with decision making
- Attribute-efficient learning of halfspaces with malicious noise: near-optimal label complexity and noise tolerance
- Generalization bounds of incremental SVM
- Learning rates of regression with q-norm loss and threshold
- Understanding generalization of functional linear regression from non-i.i.d. sample viewpoint
- Generalization ability of fractional polynomial models
- Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge
- Learning finite-dimensional coding schemes with nonlinear reconstruction maps
- Compressed classification learning with Markov chain samples
- Mirror descent algorithms with nearly dimension-independent rates for differentially-private stochastic saddle-point problems
- A note on different covering numbers in learning theory.
- Generalization Bounds for Some Ordinal Regression Algorithms
- scientific article; zbMATH DE number 1827090 (Why is no real title available?)
- Modal additive models with data-driven structure identification
- Learning performance of regularized regression with multiscale kernels based on Markov observations
- Generalization bounds of adversarial bipartite ranking with pairwise perturbation
- Logistic regression with weight grouping priors
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- A boosting approach for supervised Mahalanobis distance metric learning
- On the proliferation of support vectors in high dimensions*
- Bayesian scalar-on-image regression with a spatially varying single-layer neural network prior
- Refined Rademacher chaos complexity bounds with applications to the multikernel learning problem
- Large margin cost-sensitive learning of conditional random fields
- Nonparametric regression with modified ReLU networks
- Learning rates for multi-kernel linear programming classifiers
- Optimal convergence rate of the universal estimation error
- Learning Bounds for Kernel Regression Using Effective Data Dimensionality
- Hybrid learning based on Fisher linear discriminant
This page was built for publication: 10.1162/153244302760200713
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4779565)
