Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

128256384512 · Jun 202019922001200920172026
48 results for kernel classification

A new kernel measures brain network similarities, improving disease classification.

problem Lack of edge weight information in existing graph kernels for brain connectivity networks.
method Ordinal pattern kernel for weighted brain connectivity networks.
result The ordinal pattern kernel achieves better classification performance than state-of-the-art graph kernels.

Improved text classification performance through conformal transformations of kernels.

problem Text document categorization in high-dimensional spaces.
method Introduced new Gaussian Cosine kernel and two conformal transformations.
result Conformal transformations significantly improve kernel performance, especially for sub-optimal kernels.

Graph kernels have become an established and widely-used technique for solving classification tasks on graphs. This survey gives a comprehensive overview of techniques for kernel-based graph classification developed in the past 15 years. We describe and categorize graph kernels based on properties inherent to their des…

2019-03-28abs ↗pdf ↗

Study derives error decay rates for kernel classification under source and capacity conditions.

problem Understanding prediction error decay rates for real data sets.
method Derived decay rates for misclassification error under Gaussian design for SVM and ridge classification.
result Rates accurately describe learning curves for data sets satisfying source and capacity conditions.

The paper analyzes kernel classifiers' performance in Sobolev spaces and proves their optimality.

problem Theoretical analysis of kernel classifiers' performance in Sobolev spaces.
method Deriving upper and lower bounds on classification excess risk using kernel regression theory and estimating interpolation smoothness.
result The proposed kernel classifier is optimal in Sobolev spaces, with theoretical bounds confirmed by real data.

A new kernel improves tensor classification accuracy and reduces computation time.

problem Challenges in classifying high-dimensional tensor data.
method Proposes a weighted subspace exponential kernel based on Tucker decomposition.
result The new kernel outperforms existing methods in accuracy and computational efficiency.

Tree ensembles like RF and GBT can be seen as kernels, improving regression and classification performance.

problem Improving kernel methods for tree ensemble based models.
method Investigation of RF and GBT kernels in simulation and real data.
result RF and GBT kernels are competitive to their respective ensembles in higher dimensions, particularly with noisy features.

Quantum SVM improves financial data classification.

problem Classifying financial data using quantum machine learning.
method Application of quantum kernels to financial data, specifically DSEx Broad Index.
result Empirical quantum advantage demonstrated for financial data classification.

Inspired by a growing interest in analyzing network data, we study the problem of node classification on graphs, focusing on approaches based on kernel machines. Conventionally, kernel machines are linear classifiers in the implicit feature space. We argue that linear classification in the feature space of kernels comm…

2010-01-22abs ↗pdf ↗

Random Forest kernels improve performance in various regression and survival tasks.

problem Improving performance of Random Forest in high-dimensional data with noisy features.
method Developed and evaluated data-driven RF kernels for regression, classification, and survival tasks.
result RF kernels are competitive or superior to RF in most scenarios, especially for survival tasks.

This paper uses MIO to select features for kernel SVM classification.

problem Feature selection for kernel SVM classification.
method Mixed-integer optimization (MIO) for feature subset selection.
result The MIO approach can often outperform linear-SVM-based methods in prediction performance.

Graph kernels are kernel methods measuring graph similarity and serve as a standard tool for graph classification. However, the use of kernel methods for node classification, which is a related problem to graph representation learning, is still ill-posed and the state-of-the-art methods are heavily based on heuristics.…

2019-10-06abs ↗pdf ↗

A method selects key genes from tumor transcriptomics data using kernel methods and improves classification performance.

problem Feature selection for tumor classification using gene expression data.
method Multiple Kernel Learning with latent regularization and non-linear dimensionality reduction.
result Improved tumor classification performance on unseen test samples.

Kernel discriminant analysis uses nonlinear embeddings to improve classification.

problem Limited effectiveness of linear discriminant analysis in capturing nonlinear features.
method Study of nonlinear embeddings in kernel discriminant analysis using polynomial and Gaussian kernels, solving generalized eigenvalue problems.
result Polynomial and Gaussian discriminants capture class differences through population moments and randomized projections.

Kernels for structured data are commonly obtained by decomposing objects into their parts and adding up the similarities between all pairs of parts measured by a base kernel. Assignment kernels are based on an optimal bijection between the parts and have proven to be an effective alternative to the established convolut…

2019-08-19abs ↗pdf ↗

OKSVM optimizes RBF kernel hyperparameter for SVMs, improving classification performance.

problem Intrinsic dependence of RBF kernel hyperparameter on SVM performance.
method Gradient descent method for automatic hyperparameter learning and SVM weights adjustment.
result OKSVM outperforms classical SVM regardless of initial RBF hyperparameter values.

New tests for binary classification regression functions without distribution assumptions.

problem Testing regression functions in binary classification without distributional assumptions.
method Conditional kernel mean embeddings and resampling-based framework.
result Distribution-free hypothesis tests with exact type I error control.

New classifier combines locally linear kernels for fast and accurate non-linear classification.

problem Developing a fast and accurate non-linear classifier.
method Combines locally linear classifiers using a 1\ell_1 Multiple Kernel Learning (MKL) problem with scalable MKL training for streaming kernels.
result The resulting classifier achieves high accuracy with fast inference time.

The paper proposes a novel MKL approach for OCC using p\ell_p-norm constraints.

problem Addressing the MKL problem for one-class classification.
method A min-max saddle point Lagrangian optimisation problem is formulated and solved efficiently.
result The proposed method outperforms baselines and other algorithms on various data sets.

Unified view on random walk and Weisfeiler-Leman kernels, improving accuracy.

problem Improving graph kernel methods for better classification accuracy.
method Define and analyze walk-based node refinement methods, relate to Weisfeiler-Leman test, and introduce new walk-based kernels.
result Walk-based kernels are as expressive as Weisfeiler-Leman subtree kernel but support non-strict neighborhood comparison.

Enhances KLR for indefinite kernels with L1L_1-norm regularization.

problem Classifying with indefinite kernels captures more domain-specific information.
method Introduces L1L_1-norm regularization to induce sparsity and a proximal linearized algorithm.
result Superior performance in accuracy and sparsity on multiple datasets.

Deep kernel learning combines the non-parametric flexibility of kernel methods with the inductive biases of deep learning architectures. We propose a novel deep kernel learning model and stochastic variational inference procedure which generalizes deep kernel learning approaches to enable classification, multi-task lea…

2016-11-01abs ↗pdf ↗

We demonstrate that distributed block coordinate descent can quickly solve kernel regression and classification problems with millions of data points. Armed with this capability, we conduct a thorough comparison between the full kernel, the Nyström method, and random features on three large classification tasks from va…

2016-02-17abs ↗pdf ↗

Many leading classification algorithms output a classifier that is a weighted average of kernel evaluations. Optimizing these weights is a nontrivial problem that still attracts much research effort. Furthermore, explaining these methods to the uninitiated is a difficult task. Letting all the weights be equal leads to …

2015-06-04abs ↗pdf ↗

Convolution and pooling improve kernel methods in image classification.

problem Understanding the interplay between approximation and generalization in convolutional architectures.
method Characterized RKHS of kernels with convolution, pooling, and downsampling, computed generalization error.
result Convolution and pooling operations trade off approximation with generalization power.

Study classifies solutions to specific equations on half-space and ball.

problem Classifying nonnegative solutions to QQ-flat and constant TT-curvature equations.
method Introduced a biharmonic Poisson kernel and derived its explicit representation formula.
result Established classification theorems for solutions on R+n+1\mathbb{R}_+^{n+1} and Bn+1\mathbb{B}^{n+1}.

Estimation of facial expressions, as spatio-temporal processes, can take advantage of kernel methods if one considers facial landmark positions and their motion in 3D space. We applied support vector classification with kernels derived from dynamic time-warping similarity measures. We achieved over 99% accuracy - measu…

2013-06-08abs ↗pdf ↗

This paper discovers classification models from sequential data without prior knowledge.

problem Lack of prior knowledge in defining kernels for online classification.
method Adapts GP-based time-series structure discovery with SMC to learn new features from sequential data.
result Improves classification accuracy by 10% on real-world data.