On the public citation graph
Fast Rates for Support Vector Machines
0 signed · 80 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-0711-5openalex-snapshot
A Probabilistic Theory of Pattern Recognition
inferredcites →https://doi.org/10.1017/cbo9780511662201openalex-snapshot
Function Spaces, Entropy Numbers, Differential Operators
inferredcites →https://doi.org/10.1109/18.796368openalex-snapshot
Minimax nonparametric classification .I. Rates of convergence
inferredcites →https://doi.org/10.1109/18.796369openalex-snapshot
Minimax nonparametric classification. II. Model selection for adaptation
inferredcites →https://doi.org/10.1109/tit.2004.839514openalex-snapshot
Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
inferredcites →https://doi.org/10.1214/009053606000001226openalex-snapshot
Fast rates for support vector machines using Gaussian kernels
inferredcites →https://doi.org/10.1214/aos/1017939240openalex-snapshot
Smooth discrimination analysis
inferredcites →https://doi.org/10.1214/aos/1079120130openalex-snapshot
Statistical behavior and consistency of classification methods based on convex risk minimization
inferredcites →https://doi.org/10.1214/aos/1079120131openalex-snapshot
Optimal aggregation of classifiers in statistical learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11503415_20openalex-snapshot
Exponential Convergence Rates in Classification
inferred← citeshttps://doi.org/10.1007/11776420_28openalex-snapshot
Optimal Oracle Inequality for Aggregation of Classifiers Under Low Noise Condition
inferred← citeshttps://doi.org/10.1007/978-3-642-25002-6_31openalex-snapshot
Fully Online Regularized Classification Algorithm with Strongly Convex Loss
inferred← citeshttps://doi.org/10.1007/s00780-021-00465-4openalex-snapshot
Machine Learning With Kernels for Portfolio Valuation and Risk Management
inferred← citeshttps://doi.org/10.1007/s10208-004-0155-9openalex-snapshot
Learning Rates of Least-Square Regularized Regression
inferred← citeshttps://doi.org/10.1007/s10208-008-9026-0openalex-snapshot
Analysis of Support Vector Machines Regression
inferred← citeshttps://doi.org/10.1007/s10255-005-0229-8openalex-snapshot
On a Strategy to Develop Robust and Simple Tariffs from Motor Vehicle Insurance Data
inferred← citeshttps://doi.org/10.1007/s10444-004-7206-2openalex-snapshot
Approximation with polynomial kernels and SVM classifiers
inferred← citeshttps://doi.org/10.1007/s10444-005-9002-zopenalex-snapshot
Convergence analysis of online algorithms
inferred← citeshttps://doi.org/10.1007/s10444-007-9049-0openalex-snapshot
Learning and approximation by Gaussians on Riemannian manifolds
inferred← citeshttps://doi.org/10.1007/s10444-011-9238-8openalex-snapshot
Concentration estimates for learning with unbounded sampling
inferred← citeshttps://doi.org/10.1007/s10444-012-9288-6openalex-snapshot
Learning with coefficient-based regularization and ℓ1 −penalty
inferred← citeshttps://doi.org/10.1007/s10472-013-9371-9openalex-snapshot
Domain adaptation–can quantity compensate for quality?
inferred← citeshttps://doi.org/10.1007/s10496-010-0278-6openalex-snapshot
Online regularized generalized gradient classification algorithms
inferred← citeshttps://doi.org/10.1007/s10994-018-5715-3openalex-snapshot
Learning from binary labels with instance-dependent noise
inferred← citeshttps://doi.org/10.1007/s11122-006-0005-2openalex-snapshot
Recursive Aggregation of Estimators by the Mirror Descent Algorithm with Averaging
inferred← citeshttps://doi.org/10.1007/s11464-011-0103-3openalex-snapshot
Learning rates for multi-kernel linear programming classifiers
inferred← citeshttps://doi.org/10.1007/s40314-023-02402-xopenalex-snapshot
Robust support vector quantile regression with truncated pinball loss (RSVQR)
inferred← citeshttps://doi.org/10.1016/j.acha.2006.12.001openalex-snapshot
Fully online classification by regularization
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.09.014openalex-snapshot
Learning with sample dependent hypothesis spaces
inferred← citeshttps://doi.org/10.1016/j.ins.2014.09.011openalex-snapshot
Optimal learning rates of lp -type multiple kernel learning under general conditions
inferred← citeshttps://doi.org/10.1016/j.jco.2006.06.007openalex-snapshot
Multi-kernel regularized classifiers
inferred← citeshttps://doi.org/10.1016/j.jco.2008.05.008openalex-snapshot
Learning rates for regularized classifiers using multivariate polynomial kernels
inferred← citeshttps://doi.org/10.1016/j.jco.2009.06.002openalex-snapshot
Oracle inequalities for support vector machines that are based on random entropy numbers
inferred← citeshttps://doi.org/10.1016/j.jco.2010.03.002openalex-snapshot
Radial kernels and their reproducing kernel Hilbert spaces
inferred← citeshttps://doi.org/10.1016/j.jco.2010.10.002openalex-snapshot
Optimal learning rates for least squares regularized regression with unbounded sampling
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.08.030openalex-snapshot
Orthogonality from disjoint support in reproducing kernel Hilbert spaces
inferred← citeshttps://doi.org/10.1016/j.jmva.2008.04.001openalex-snapshot
Learning from dependent observations
inferred← citeshttps://doi.org/10.1016/j.jmva.2016.03.006openalex-snapshot
Statistical consistency of coefficient-based conditional quantile regression
inferred← citeshttps://doi.org/10.1016/j.jspi.2007.09.003openalex-snapshot
Learning rates of regularized regression for exponentially strongly mixing sequence
inferred← citeshttps://doi.org/10.1016/j.jspi.2010.07.011openalex-snapshot
Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations
inferred← citeshttps://doi.org/10.1016/j.neunet.2009.06.042openalex-snapshot
A new learning paradigm: Learning using privileged information
inferred← citeshttps://doi.org/10.1016/j.neunet.2016.07.002openalex-snapshot
A local Vapnik–Chervonenkis complexity
inferred← citeshttps://doi.org/10.1016/j.procir.2016.06.060openalex-snapshot
Intelligent Pattern Recognition of a SLM Machine Process and Sensor Data
inferred← citeshttps://doi.org/10.1016/s1570-579x(06)80011-xopenalex-snapshot
Learning Theory: From Regression to Classification
inferred← citeshttps://doi.org/10.1051/ps:2005018openalex-snapshot
Theory of Classification: a Survey of Some Recent Advances
inferred← citeshttps://doi.org/10.1109/access.2020.2998772openalex-snapshot
Multiple Kernel SVM Based on Two-Stage Learning
inferred← citeshttps://doi.org/10.1109/icnc.2011.6022044openalex-snapshot
The generalization performance of learning algorithms derived simultaneously through algorithmic stability and space complexity
inferred← citeshttps://doi.org/10.1109/tcyb.2014.2346536openalex-snapshot
The Generalization Ability of SVM Classification Based on Markov Sampling
inferred← citeshttps://doi.org/10.1109/tit.2006.871056openalex-snapshot
Minimax-optimal classification with dyadic decision trees
inferred← citeshttps://doi.org/10.1109/tit.2006.881713openalex-snapshot
An Explicit Description of the Reproducing Kernel Hilbert Spaces of Gaussian RBF Kernels
inferred← citeshttps://doi.org/10.1109/tit.2006.883632openalex-snapshot
Online Regularized Classification Algorithms
inferred← citeshttps://doi.org/10.1109/tnnls.2013.2242091openalex-snapshot
Least Square Regularized Regression in Sum Space
inferred← citeshttps://doi.org/10.1109/tnnls.2016.2609441openalex-snapshot
$k$ -Times Markov Sampling for SVMC
inferred← citeshttps://doi.org/10.1109/tsmc.2018.2791511openalex-snapshot
New Incremental Learning Algorithm With Support Vector Machines
inferred← citeshttps://doi.org/10.1137/1.9781611973440.4openalex-snapshot
Selective Sampling on Probabilistic Data
inferred← citeshttps://doi.org/10.1142/s0219530505000625openalex-snapshot
LEARNING RATES FOR DENSITY LEVEL DETECTION
inferred← citeshttps://doi.org/10.1142/s0219530517500063openalex-snapshot
Learning rates for regularized least squares ranking algorithm
inferred← citeshttps://doi.org/10.1155/2023/6566375openalex-snapshot
Theory Analysis for the Convergence of Kernel-Regularized Online Binary Classification Learning Associated with RKBSs
inferred← citeshttps://doi.org/10.1162/0899766053491896openalex-snapshot
SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming
inferred← citeshttps://doi.org/10.1162/neco_a_00028openalex-snapshot
Rademacher Chaos Complexities for Learning the Kernel Problem
inferred← citeshttps://doi.org/10.1162/neco_a_00967openalex-snapshot
Generalization Analysis of Fredholm Kernel Regularized Classifiers
inferred← citeshttps://doi.org/10.1214/009053606000001217openalex-snapshot
Fast learning rates for plug-in classifiers
inferred← citeshttps://doi.org/10.1214/009053607000000055openalex-snapshot
Simultaneous adaptation to the margin and to complexity in classification
inferred← citeshttps://doi.org/10.1214/074921706000000897openalex-snapshot
A new concentration result for regularized risk minimizers
inferred← citeshttps://doi.org/10.17877/de290r-15035openalex-snapshot
On Robustness Properties of Convex Risk Minimization Methods for Pattern Recognition
inferred← citeshttps://doi.org/10.18419/opus-5113openalex-snapshot
Model reduction for nonlinear systems : kernel methods and error estimation
inferred← citeshttps://doi.org/10.2139/ssrn.5240228openalex-snapshot
Super-Fast Rates of Convergence for Neural Networks Classifiers Under the Hard Margin Condition
inferred← citeshttps://doi.org/10.3150/07-bej6044openalex-snapshot
Optimal rates of aggregation in classification under low noise assumption
inferred← citeshttps://doi.org/10.3233/978-1-58603-898-4-15openalex-snapshot
Learning using Large Datasets
inferred← citeshttps://doi.org/10.48550/arxiv.2103.11766openalex-snapshot
Fixes That Fail: Self-Defeating Improvements in Machine-Learning Systems
inferred← citeshttps://doi.org/10.48550/arxiv.math/0505333openalex-snapshot
Recursive Aggregation of Estimators by Mirror Descent Algorithm with Averaging
inferred← citeshttps://doi.org/10.48550/arxiv.math/0507180openalex-snapshot
Fast learning rates for plug-in classifiers under the margin condition
inferred← citeshttps://doi.org/10.5555/1046920.1088710openalex-snapshot
Learning the Kernel Function via Regularization
inferred← citeshttps://doi.org/10.7551/mitpress/7503.003.0170openalex-snapshot
An Oracle Inequality for Clipped Regularized Risk Minimizers
inferred← citeshttps://doi.org/10.7551/mitpress/8996.003.0015openalex-snapshot
The Tradeoffs of Large-Scale Learning
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.