10.1162/153244302760200713
From MaRDI portal
Publication:4779565
DOI10.1162/153244302760200713zbMATH Open1007.68157OpenAlexW2111377143MaRDI QIDQ4779565FDOQ4779565
Authors: Tong Zhang 
Publication date: 27 November 2002
Published in: CrossRef Listing of Deleted DOIs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/153244302760200713
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 (34)
- On the generalization error of fixed combinations of classifiers
- Nonparametric Conditional Density Estimation Using Piecewise-Linear Solution Path of Kernel Quantile Regression
- 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
- Learning Finite-Dimensional Coding Schemes with Nonlinear Reconstruction Maps
- Generalization performance of Lagrangian support vector machine based on Markov sampling
- Sequence classification via large margin hidden Markov models
- Optimality of SVM: novel proofs and tighter bounds
- Kernel selection with spectral perturbation stability of kernel matrix
- Consistency and generalization bounds for maximum entropy density estimation
- Quantile-slicing estimation for dimension reduction in regression
- On combining machine learning with decision making
- Learning rates of regression with \(q\)-norm loss and threshold
- Refined Rademacher Chaos Complexity Bounds with Applications to the Multikernel Learning Problem
- Generalization ability of fractional polynomial models
- Generalization bounds for learning with linear, polygonal, quadratic and conic side knowledge
- Compressed classification learning with Markov chain samples
- Generalization Bounds for Some Ordinal Regression Algorithms
- A note on different covering numbers in learning theory.
- Title not available (Why is that?)
- Modal additive models with data-driven structure identification
- Learning performance of regularized regression with multiscale kernels based on Markov observations
- Title not available (Why is that?)
- Logistic regression with weight grouping priors
- SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
- On the proliferation of support vectors in high dimensions*
- A boosting approach for supervised Mahalanobis distance metric learning
- Dimensionality-Dependent Generalization Bounds for k-Dimensional Coding Schemes
- 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)
