paper-with-me

홈 › Papers

Optimality Implies Kernel Sum Classifiers are Statistically Efficient

2019-01-25 · Raphael Arkady Meyer, Jean Honorio

We propose a novel combination of optimization tools with learning theory bounds in order to analyze the sample complexity of optimal kernel sum classifiers. This contrasts the typical learning theoretic results which hold for all (potentially suboptimal) classifiers. Our work also justifies assumptions made in prior work on multiple kernel learning. As a byproduct of our analysis, we also provide a new form of Rademacher complexity for hypothesis classes containing only optimal classifiers.

📄 PDF Abstract BibTeX arXiv:1901.09087

Code (0)

등록된 구현이 없습니다.

Tasks

Learning Theory

Similar Papers 제목 키워드 기반

The Optimality of Kernel Classifiers in Sobolev Space

2024-02-02 · Jianfa Lai, Zhifan Li, Dongming Huang, Qian Lin

Kernel methods are widely used in machine learning, especially for classification problems. However, the theoretical analysis of kernel classification is still limited. This paper investigates the statistical performance…

Classification

On Kernel Derivative Approximation with Random Fourier Features

2018-10-11 · Zoltan Szabo, Bharath K. Sriperumbudur

Random Fourier features (RFF) represent one of the most popular and wide-spread techniques in machine learning to scale up kernel algorithms. Despite the numerous successful applications of RFFs, unfortunately, quite lit…

Universal expressiveness of variational quantum classifiers and quantum kernels for support vector machines

2022-07-12 · Jonas Jäger, Roman V. Krems

Machine learning is considered to be one of the most promising applications of quantum computing. Therefore, the search for quantum advantage of the quantum analogues of machine learning models is a key research goal. He…

BIG-bench Machine Learning

Wide and Deep Neural Networks Achieve Optimality for Classification

2022-04-29 · Adityanarayanan Radhakrishnan, Mikhail Belkin, Caroline Uhler

While neural networks are used for classification tasks across domains, a long-standing open problem in machine learning is determining whether neural networks trained using standard procedures are optimal for classifica…

Classification

The Minimax Rate of HSIC Estimation for Translation-Invariant Kernels

2024-03-12 · Florian Kalinke, Zoltan Szabo

Kernel techniques are among the most influential approaches in data science and statistics. Under mild conditions, the reproducing kernel Hilbert space associated to a kernel is capable of encoding the independence of $M…

Translation