Pages that link to "Item:Q2426613"
From MaRDI portal
The following pages link to Statistical performance of support vector machines (Q2426613):
Displaying 40 items.
- Spatio-temporal convolution kernels (Q298357) (← links)
- Fast rates for empirical vector quantization (Q351685) (← links)
- Inverse statistical learning (Q364201) (← links)
- Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
- Consistency of support vector machines using additive kernels for additive models (Q433246) (← links)
- Oracle properties of SCAD-penalized support vector machine (Q433741) (← links)
- Cox process functional learning (Q500875) (← links)
- Optimal learning rates of \(l^p\)-type multiple kernel learning under general conditions (Q526680) (← links)
- Sparsity in multiple kernel learning (Q620564) (← links)
- Estimating conditional quantiles with the help of the pinball loss (Q637098) (← links)
- Classification with non-i.i.d. sampling (Q652859) (← links)
- Learning rates for kernel-based expectile regression (Q669274) (← links)
- Concentration estimates for the moving least-square method in learning theory (Q719353) (← links)
- Oracle inequalities for support vector machines that are based on random entropy numbers (Q731974) (← links)
- Optimal weighted nearest neighbour classifiers (Q741805) (← links)
- Asymptotic normality of support vector machine variants and other regularized kernel methods (Q765834) (← links)
- Regularization in kernel learning (Q847647) (← links)
- Multi-kernel regularized classifiers (Q870343) (← links)
- Learning from dependent observations (Q958916) (← links)
- Fast learning rates for plug-in classifiers (Q995418) (← links)
- Convergence rates of generalization errors for margin-based classification (Q1021988) (← links)
- Penalized empirical risk minimization over Besov spaces (Q1952004) (← links)
- Fast generalization error bound of deep learning without scale invariance of activation functions (Q2055056) (← links)
- Robust machine learning by median-of-means: theory and practice (Q2196199) (← links)
- Nonasymptotic bounds for vector quantization in Hilbert spaces (Q2343956) (← links)
- A penalized criterion for variable selection in classification (Q2370521) (← links)
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder) (Q2373576) (← links)
- The new interpretation of support vector machines on statistical learning theory (Q2379242) (← links)
- Optimal dyadic decision trees (Q2384139) (← links)
- Simultaneous adaptation to the margin and to complexity in classification (Q2456017) (← links)
- Optimal rates of aggregation in classification under low noise assumption (Q2469663) (← links)
- Bandwidth selection in kernel empirical risk minimization via the gradient (Q2515491) (← links)
- Classifiers of support vector machine type with \(\ell_1\) complexity regularization (Q2642804) (← links)
- Measuring the Capacity of Sets of Functions in the Analysis of ERM (Q2805728) (← links)
- Theory of Classification: a Survey of Some Recent Advances (Q3373749) (← links)
- Consistency and convergence rate for nearest subspace classifier (Q4603717) (← links)
- Large‐margin classification with multiple decision rules (Q4970185) (← links)
- Learning Rates of <i>l<sup>q</sup></i> Coefficient Regularization Learning with Gaussian Kernel (Q5175497) (← links)
- Learning Rates for Classification with Gaussian Kernels (Q5380881) (← links)
- Fast convergence rates of deep neural networks for classification (Q6078714) (← links)