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,657 papers · 148 categories

Trend · papers per month

3977931,1901,586 · Jun 202019922001200920172026
48 results for Kernel learning

Survey of kernels, RKHS, and their applications in machine learning.

problem Understanding kernels and their applications in machine learning.
method Review of historical context, mathematical definitions, and practical applications of kernels.
result Comprehensive overview of kernels, RKHS, and their applications.

Sparse Kernel Flows learns dynamical systems from data.

problem Learning dynamical systems from limited data.
method Sparse Kernel Flows: trains optimal kernel from a dictionary of kernels.
result Sparse Kernel Flows can learn from 132 chaotic systems.

Constructing the adjacency graph is fundamental to graph-based clustering. Graph learning in kernel space has shown impressive performance on a number of benchmark data sets. However, its performance is largely determined by the chosen kernel matrix. To address this issue, the previous multiple kernel learning algorith…

2019-03-14abs ↗pdf ↗

New method for learning with non-Euclidean data using decomposable kernels.

problem Difficulty in using classical kernels for non-Euclidean data.
method Reproducing kernel Krein space (RKKS) methods for kernels that admit a positive decomposition.
result Invariant kernels can be used for learning in non-Euclidean spaces.

The study investigates kernel-target alignment in tree ensemble kernels.

problem The degree of kernel-target alignment affects the performance of tree ensemble kernels in kernel learning.
method Eigenanalysis of the kernel matrix and sensitivity analysis via landmark learning.
result Good performance of tree ensemble kernels is associated with strong kernel-target alignment.

Kernel methods are ubiquitous tools in machine learning. However, there is often little reason for the common practice of selecting a kernel a priori. Even if a universal approximating kernel is selected, the quality of the finite sample estimator may be greatly affected by the choice of kernel. Furthermore, when direc…

2015-06-29abs ↗pdf ↗

Deep kernel learning provides an elegant and principled framework for combining the structural properties of deep learning algorithms with the flexibility of kernel methods. By means of a deep neural network, we learn a parametrized kernel operator that can be combined with a differentiable kernel algorithm during infe…

2019-05-28abs ↗pdf ↗

This paper improves neural network generalization by dynamically learning kernel parameters.

problem Improving neural network generalization and adaptability.
method Diagonal adaptive kernel model that learns kernel eigenvalues and output coefficients during training.
result The diagonal adaptive kernel model significantly improves generalization over fixed-kernel methods.

The success of kernel-based learning methods depend on the choice of kernel. Recently, kernel learning methods have been proposed that use data to select the most appropriate kernel, usually by combining a set of base kernels. We introduce a new algorithm for kernel learning that combines a {\em continuous set of base …

2011-12-20abs ↗pdf ↗

New kernels capture both local and non-local interactions efficiently.

problem Designing kernels that capture both local and non-local interactions while remaining computationally tractable.
method Spectral truncation kernels based on CC^*-algebra.
result Spectral truncation kernels induce interactions across the data function domain and reduce computational cost.

Quantum kernel machines need to use more complex kernels to fully exploit their potential.

problem Current quantum kernels struggle with complex learning tasks due to limited degrees of freedom.
method Propose using operator-valued kernels and CC^*-algebraic representations to enhance quantum kernels.
result Quantum operator-valued kernels can reveal structural dependencies that scalar-valued kernels miss.

Paper proposes a new method to learn distribution kernels via entropy maximization.

problem Challenges in applying kernel methods to distribution regression tasks.
method Proposes a novel objective for unsupervised learning of data-dependent distribution kernels based on entropy maximization.
result Demonstrates the effectiveness of the learned kernel across different modalities.

We introduce scalable deep kernels, which combine the structural properties of deep learning architectures with the non-parametric flexibility of kernel methods. Specifically, we transform the inputs of a spectral mixture base kernel with a deep architecture, using local kernel interpolation, inducing points, and struc…

2015-11-06abs ↗pdf ↗

Kernels are powerful and versatile tools in machine learning and statistics. Although the notion of universal kernels and characteristic kernels has been studied, kernel selection still greatly influences the empirical performance. While learning the kernel in a data driven way has been investigated, in this paper we e…

2019-02-26abs ↗pdf ↗

New approach to learning kernels from data using AIT principles.

problem Learning kernels from data in machine learning.
method Sparse Kernel Flows method based on AIT principles.
result Sparse Kernel Flows aligns with MDL principle and offers a robust theoretical foundation.

Neural networks can learn kernel machines with a data-dependent kernel.

problem Can neural networks in the rich feature learning regime learn a kernel machine?
method Demonstrated silent alignment effect in neural networks, showing they can learn a kernel machine with a data-dependent kernel.
result Neural networks in the rich feature learning regime can learn a kernel machine with a data-dependent kernel due to silent alignment.

Unified framework combines trace-induced quantum kernels for improved machine learning models.

problem Improving performance of quantum machine learning models using trace-induced kernels.
method Developed a unified framework combining various trace-induced quantum kernels, including global fidelity and local projected kernels, as Lego kernels.
result Local projected kernels can achieve comparable performance to global fidelity kernels with fewer quantum resources.

GPs with neural network dual kernels improve reinforcement learning performance.

problem Combining the strengths of DNNs and GPs for reinforcement learning.
method Apply GPs with neural network dual kernels to solve reinforcement learning tasks.
result GPs with neural network dual kernels perform at least as well as conventional methods on the mountain-car problem.

Multiple Kernel Learning, or MKL, extends (kernelized) SVM by attempting to learn not only a classifier/regressor but also the best kernel for the training task, usually from a combination of existing kernel functions. Most MKL methods seek the combined kernel that performs best over every training example, sacrificing…

2016-03-04abs ↗pdf ↗

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 ↗

This paper uses machine learning to select kernels for machine learning models on various devices.

problem Traditional kernel auto-tuning is limited for machine learning research with changing network topologies and hyperparameters.
method Combines auto-tuning and machine learning to select kernels for SYCL on various devices.
result Initial results show high performance kernel selection with little developer effort.

Kernel approximation methods create explicit, low-dimensional kernel feature maps to deal with the high computational and memory complexity of standard techniques. This work studies a supervised kernel learning methodology to optimize such mappings. We utilize the Discriminant Information criterion, a measure of class …

2019-09-23abs ↗pdf ↗

KSOS improves kernel learning for dynamical systems via global optimization.

problem Challenges in selecting optimal kernels and tuning parameters in traditional kernel-based methods.
method Global optimization framework with kernel-based surrogate functions.
result KSOS consistently outperforms gradient descent in predicting dynamical systems.

Efficient and accurate low-rank approximations of multiple data sources are essential in the era of big data. The scaling of kernel-based learning algorithms to large datasets is limited by the O(n^2) computation and storage complexity of the full kernel matrix, which is required by most of the recent kernel learning a…

2016-01-17abs ↗pdf ↗

New method for efficient personalized learning in mobile health.

problem Efficient and personalized learning in mobile health.
method Proposes a novel generative process on kernel composition for online Gaussian Process regression.
result Trajectories of kernel evolutions can be transferred between users to improve learning and kernels are meaningful for mHealth prediction.

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 ↗

Unified framework for spectral methods, kernel learning, and manifold unfolding.

problem Tackles the unification and optimization of spectral dimensionality reduction methods.
method Unified spectral methods as kernel PCA, kernel learning by SDP, and detailed explanation of MVU variants.
result Unified understanding and optimization of manifold learning techniques.

Kernel learning methods are among the most effective learning methods and have been vigorously studied in the past decades. However, when tackling with complicated tasks, classical kernel methods are not flexible or "rich" enough to describe the data and hence could not yield satisfactory performance. In this paper, vi…

2019-10-07abs ↗pdf ↗

Neural network learns kernel functions for survival analysis and prediction intervals.

problem Predicting survival times for individuals based on similar training subjects.
method Develops a neural network framework to learn kernel functions for kernel survival analysis and uses these to construct valid prediction intervals.
result Neural network survival estimators are competitive with existing methods and provide valid prediction intervals.

Meta-KeL learns kernels from offline data to improve sequential decision-making.

problem Adaptive confidence sets for prediction functions in sequential decision-making tasks.
method Meta-KeL: meta-learning a kernel from offline data; structured sparsity estimator for unknown kernel combinations.
result Valid confidence sets that become as tight as those given the true unknown kernel with increasing offline data.

Adaptive kernels from neural networks improve model performance.

problem Improving neural network performance through adaptive kernels.
method Deriving adaptive kernels from infinite-width neural networks using feature learning and gradient flow training.
result Adaptive kernels achieve lower test loss compared to traditional kernels.

The generalization performance of kernel methods is largely determined by the kernel, but common kernels are stationary thus input-independent and output-independent, that limits their applications on complicated tasks. In this paper, we propose a powerful and efficient spectral kernel learning framework and learned ke…

2019-09-11abs ↗pdf ↗

Regularized empirical risk minimization using kernels and their corresponding reproducing kernel Hilbert spaces (RKHSs) plays an important role in machine learning. However, the actually used kernel often depends on one or on a few hyperparameters or the kernel is even data dependent in a much more complicated manner. …

2017-09-22abs ↗pdf ↗

This work introduces a new quantum kernel, quantum tangent kernel, for improved performance.

problem Improving quantum machine learning performance beyond conventional methods.
method Developed a deep parameterized quantum circuit and used first-order expansion for training.
result The quantum tangent kernel outperforms conventional quantum kernel methods for ansatz-generated datasets.

Kernel VICReg improves SSL in RKHS, capturing nonlinear structures.

problem Limited ability of existing SSL methods to handle nonlinear dependencies.
method Kernel VICReg framework in RKHS, kernelizing VICReg objectives.
result Kernel VICReg mitigates representational collapse and improves performance.