Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[LIBRO][B] Mathematical analysis of machine learning algorithms
T Zhang - 2023 - books.google.com
The mathematical theory of machine learning not only explains the current algorithms but
can also motivate principled approaches for the future. This self-contained textbook …
can also motivate principled approaches for the future. This self-contained textbook …
[LIBRO][B] Learning with kernels: support vector machines, regularization, optimization, and beyond
B Schölkopf, AJ Smola - 2002 - books.google.com
A comprehensive introduction to Support Vector Machines and related kernel methods. In
the 1990s, a new type of learning algorithm was developed, based on results from statistical …
the 1990s, a new type of learning algorithm was developed, based on results from statistical …
[LIBRO][B] Neural network learning: Theoretical foundations
M Anthony, PL Bartlett - 2009 - dl.acm.org
This important work describes recent theoretical advances in the study of artificial neural
networks. It explores probabilistic models of supervised learning problems, and addresses …
networks. It explores probabilistic models of supervised learning problems, and addresses …
Empirical bernstein bounds and sample variance penalization
A Maurer, M Pontil - arxiv preprint arxiv:0907.3740, 2009 - arxiv.org
We give improved constants for data dependent and variance sensitive confidence bounds,
called empirical Bernstein bounds, and extend these inequalities to hold uniformly over …
called empirical Bernstein bounds, and extend these inequalities to hold uniformly over …
[LIBRO][B] Learning with kernels
AJ Smola, B Schölkopf - 1998 - Citeseer
Abstract Support Vector (SV) Machines combine several techniques from statistics, machine
learning and neural networks. One of the most important ingredients are kernels, ie the …
learning and neural networks. One of the most important ingredients are kernels, ie the …
[PDF][PDF] Classification with a Reject Option using a Hinge Loss.
We consider the problem of binary classification where the classifier can, for a particular
cost, choose not to classify an observation. Just as in the conventional classification …
cost, choose not to classify an observation. Just as in the conventional classification …
The covering number in learning theory
DX Zhou - Journal of Complexity, 2002 - Elsevier
The covering number of a ball of a reproducing kernel Hilbert space as a subset of the
continuous function space plays an important role in Learning Theory. We give estimates for …
continuous function space plays an important role in Learning Theory. We give estimates for …
Covering number bounds of certain regularized linear function classes
T Zhang - Journal of Machine Learning Research, 2002 - jmlr.org
Recently, sample complexity bounds have been derived for problems involving linear
functions such as neural networks and support vector machines. In many of these theoretical …
functions such as neural networks and support vector machines. In many of these theoretical …
[PDF][PDF] Diffusion kernels on statistical manifolds.
A family of kernels for statistical learning is introduced that exploits the geometric structure of
statistical models. The kernels are based on the heat equation on the Riemannian manifold …
statistical models. The kernels are based on the heat equation on the Riemannian manifold …
Algorithm-dependent generalization bounds for multi-task learning
Often, tasks are collected for multi-task learning (MTL) because they share similar feature
structures. Based on this observation, in this paper, we present novel algorithm-dependent …
structures. Based on this observation, in this paper, we present novel algorithm-dependent …