Quantitative convergence analysis of kernel based large-margin unified machines (Q2191836): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 10:21, 17 December 2024

scientific article

Language	Label	Description	Also known as
English	Quantitative convergence analysis of kernel based large-margin unified machines	scientific article

Statements

scholarly article

0 references

Quantitative convergence analysis of kernel based large-margin unified machines (English)

0 references

0 references

0 references

Communications on Pure and Applied Analysis

0 references

publication date

26 June 2020

0 references

zbMATH Keywords

LUMs

0 references

convergence rates

0 references

kernel methods

0 references

regularization

0 references

projection operator

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.3934/cpaa.2020180

0 references

Theory of Reproducing Kernels

0 references

The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

0 references

Convexity, Classification, and Risk Bounds

0 references

0 references

Support-vector networks

0 references

A decision-theoretic generalization of on-line learning and an application to boosting

0 references

Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

Data-Dependent Generalization Bounds for Multi-Class Classification

0 references

Hard or Soft Classification? Large-Margin Unified Machines

0 references

Distance-Weighted Discrimination

0 references

ONLINE LEARNING WITH MARKOV SAMPLING

0 references

Learning theory estimates via integral operators and their approximations

0 references

10.1162/153244302760185252

0 references

Estimating conditional quantiles with the help of the pinball loss

0 references

Fast rates for support vector machines using Gaussian kernels

0 references

Optimal aggregation of classifiers in statistical learning.

0 references

0 references

Online minimum error entropy algorithm with unbounded sampling

0 references

Another Look at Distance-Weighted Discrimination

0 references

Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators

0 references

Multi-kernel regularized classifiers

0 references

Learning rates of least-square regularized regression

0 references

SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming

0 references

0 references

Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions

0 references

Logistic classification with varying gaussians

0 references

Conditional quantiles with varying Gaussians

0 references

Approximation analysis of learning algorithms for support vector regression and quantile regression

0 references

0 references

Statistical behavior and consistency of classification methods based on convex risk minimization.

0 references

Learning rates for regularized least squares ranking algorithm

0 references

The covering number in learning theory

0 references

Capacity of reproducing kernel spaces in learning theory

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.3934/CPAA.2020180

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2191836

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2191836&oldid=38933379"