Learning Theory
From MaRDI portal
Publication:5473616
DOI10.1007/b137542zbMath1137.68564OpenAlexW4246660828MaRDI QIDQ5473616
Publication date: 22 June 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137542
Related Items (31)
Machine learning with kernels for portfolio valuation and risk management ⋮ Statistical consistency of coefficient-based conditional quantile regression ⋮ Learning from binary labels with instance-dependent noise ⋮ Fully online classification by regularization ⋮ Classifiers of support vector machine type with \(\ell_1\) complexity regularization ⋮ Learning with sample dependent hypothesis spaces ⋮ Multi-kernel regularized classifiers ⋮ Learning with coefficient-based regularization and \(\ell^1\)-penalty ⋮ Error analysis on regularized regression based on the maximum correntropy criterion ⋮ Radial kernels and their reproducing kernel Hilbert spaces ⋮ Optimal learning rates for least squares regularized regression with unbounded sampling ⋮ Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations ⋮ Robust support vector quantile regression with truncated pinball loss (RSVQR) ⋮ Learning rates for regularized least squares ranking algorithm ⋮ Ranking and empirical minimization of \(U\)-statistics ⋮ Learning rates of regularized regression for exponentially strongly mixing sequence ⋮ Concentration estimates for learning with unbounded sampling ⋮ Generalization Analysis of Fredholm Kernel Regularized Classifiers ⋮ Comment ⋮ Convergence analysis of online algorithms ⋮ Simultaneous adaptation to the margin and to complexity in classification ⋮ Optimal rates of aggregation in classification under low noise assumption ⋮ Orthogonality from disjoint support in reproducing kernel Hilbert spaces ⋮ Learning rates for regularized classifiers using multivariate polynomial kernels ⋮ Learning from dependent observations ⋮ Learning rates for multi-kernel linear programming classifiers ⋮ Approximation with polynomial kernels and SVM classifiers ⋮ A local Vapnik-Chervonenkis complexity ⋮ Oracle inequalities for support vector machines that are based on random entropy numbers ⋮ Theory of Classification: a Survey of Some Recent Advances ⋮ Analysis of support vector machines regression
This page was built for publication: Learning Theory