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

3773110146 · May 202619922001200920172026
48 results for radial kernel

Paper proves MS convergence for radially symmetric kernels with large bandwidths.

problem Proving convergence of mean shift algorithm with radially symmetric kernels.
method Analyzes convergence of mean shift algorithm with radially symmetric, positive definite kernels.
result Guaranteed convergence for sufficiently large bandwidth in any dimension.

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.

The paper develops heat kernel comparison theorems and applies them to spectral geometry.

problem Developing mathematical tools for spectral geometry.
method Established weighted heat kernel comparison theorems for manifolds with bounded radial curvatures.
result Two eigenvalue comparison theorems for the first Dirichlet eigenvalue of the Witten-Laplacian.

Stochastic gradient descent optimizes Nyström samples for kernel matrix approximation.

problem Optimizing Nyström samples for kernel matrix approximation.
method Stochastic gradient descent applied to multisets of landmark points (Nyström samples) using a surrogate criterion (radial SKD).
result Local minimization of the radial SKD yields improved Nyström approximation accuracy.

Method learns radial basis function distributions from samples.

problem Learning radial basis function distributions from training samples.
method Projected particle Langevin optimization method with distributionally robust optimization.
result Empirical measure of Langevin particles converges to a reflected Itô diffusion-drift process.

New Fourier features improve high-precision approximation in large-scale problems.

problem Designing scalable, high-precision Fourier features for large-scale kernel methods.
method Introducing a new family of quadrature rules that accurately approximate the Gaussian measure in higher dimensions.
result Improved approximation bounds with new Fourier features.

Adaptive RBF-KAN improves KANs by dynamically adjusting kernel parameters.

problem Efficiently approximating multivariate functions using learnable univariate edge functions.
method Integrates LOOCV-based kernel scale estimation with adaptive kernel learning.
result Adaptive RBF-KAN outperforms fixed kernel KANs on various benchmark functions.

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…

2016-03-09abs ↗pdf ↗

In this paper, we study the spectrum and the eigenvectors of radial kernels for mixtures of distributions in Rn\mathbb{R}^n. Our approach focuses on high dimensions and relies solely on the concentration properties of the components in the mixture. We give several results describing of the structure of kernel matrices …

2019-06-25abs ↗pdf ↗

AEN-RBF kernel improves robustness in Bayesian optimization for complex systems.

problem Bayesian optimization struggles with outliers in RBF kernel, leading to poor performance.
method Proposes AEN-RBF kernel function, demonstrating improved robustness and convergence.
result The AEN-RBF kernel function reduces mean squared prediction error and improves convergence.

In this paper, we propose a novel adaptive kernel for the radial basis function (RBF) neural networks. The proposed kernel adaptively fuses the Euclidean and cosine distance measures to exploit the reciprocating properties of the two. The proposed framework dynamically adapts the weights of the participating kernels us…

2019-05-09abs ↗pdf ↗

Study Brownian motions and heat kernel bounds on Kähler and quaternion Kähler manifolds.

problem Understanding Brownian motions and heat kernel bounds on specific geometric manifolds.
method Sharp Laplacian comparison theorems and Cheeger-Yau type lower bounds for heat kernels.
result Sharp Cheeger-Yau type lower bounds for heat kernels and Dirichlet eigenvalues of metric balls.

The paper proves a nonlocal version of the Alexandrov Theorem for smooth boundaries.

problem Proving the nonlocal version of the Alexandrov Theorem for sets with smooth boundaries.
method Formulated a necessary and sufficient condition for the theorem to hold, used a specific formula for the tangential derivative of the nonlocal mean curvature, and applied the method of moving planes.
result The only set with smooth boundary and constant nonlocal mean curvature is an Euclidean ball.

Proposes LRR and LRLR for improving stock prediction accuracy.

problem Improving stock prediction accuracy through nonparametric classification.
method Local radial regression and logistic regression variant.
result LRLR outperforms LPoR and MS-kk-NN in real-world stock datasets.

Consistency of the kernel density estimator requires that the kernel bandwidth tends to zero as the sample size grows. In this paper we investigate the question of whether consistency is possible when the bandwidth is fixed, if we consider a more general class of weighted KDEs. To answer this question in the affirmativ…

2017-05-24abs ↗pdf ↗

We propose a method for nonparametric density estimation that exhibits robustness to contamination of the training sample. This method achieves robustness by combining a traditional kernel density estimator (KDE) with ideas from classical MM-estimation. We interpret the KDE based on a radial, positive semi-definite ke…

2011-07-15abs ↗pdf ↗

The study proves that sets with constant nonlocal curvature are composed of equal balls under certain conditions.

problem Characterizing sets with constant nonlocal curvature.
method Analyzing measurable sets in R^d with constant nonlocal h-mean curvature under a suitable integrability assumption.
result Finite unions of equal balls are the only sets with constant nonlocal curvature under the given conditions.

Kernel means are frequently used to represent probability distributions in machine learning problems. In particular, the well known kernel density estimator and the kernel mean embedding both have the form of a kernel mean. Unfortunately, kernel means are faced with scalability issues. A single point evaluation of the …

2015-03-01abs ↗pdf ↗

Kernel methods are widespread in machine learning; however, they are limited by the quadratic complexity of the construction, application, and storage of kernel matrices. Low-rank matrix approximation algorithms are widely used to address this problem and reduce the arithmetic and storage cost. However, we observed tha…

2015-05-03abs ↗pdf ↗

Paper develops deep learning for metocean variable extremes.

problem Estimating multivariate joint extremes of metocean variables.
method SPAR model with GP distribution for radial tail, kernel density for angular variable, deep neural networks for GP parameters.
result The method provides good description of metocean variables joint extremes.

We introduce the convolutional spectral kernel (CSK), a novel family of non-stationary, nonparametric covariance kernels for Gaussian process (GP) models, derived from the convolution between two imaginary radial basis functions. We present a principled framework to interpret CSK, as well as other deep probabilistic mo…

2019-05-23abs ↗pdf ↗

The GMM (generalized min-max) kernel was recently proposed (Li, 2016) as a measure of data similarity and was demonstrated effective in machine learning tasks. In order to use the GMM kernel for large-scale datasets, the prior work resorted to the (generalized) consistent weighted sampling (GCWS) to convert the GMM ker…

2016-07-12abs ↗pdf ↗

New method uses multiple kernels to improve SVGD performance.

problem Sub-optimal performance of single kernel in SVGD.
method Combines multiple kernels to approximate optimal kernel, using Kernelized Stein Discrepancy (KSD) and constructing Multiple Kernel SVGD (MK-SVGD).
result Consistently matches or outperforms competing methods in experiments.

Deep neural nets optimize kernel parameters for non-parametric two-sample tests.

problem Determining if two samples come from the same distribution.
method Deep kernels trained to maximize test power, adapting to distribution smoothness and shape.
result Deep kernels outperform simpler kernels in high dimensions and complex data.

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.

Researchers prove long-time existence for two landmark Brownian motion.

problem Proving long-time existence of Brownian motion on configurations of two landmarks.
method Classification and analysis of long-time existence for configurations of exactly two landmarks, using a radial kernel.
result For configurations of exactly two landmarks, long-time existence is possible for certain kernels, but not for others.

Novel algorithm identifies nonlinear Granger causal relationships using kernel ridge regression.

problem Identification of nonlinear Granger causal relationships.
method Flexible plug-in architecture with kernel ridge regression using radial basis function.
result Kernel ridge regression in mlcausality achieves competitive AUC scores and more finely calibrated p-values.

This paper presents a distance-based discriminative framework for learning with probability distributions. Instead of using kernel mean embeddings or generalized radial basis kernels, we introduce embeddings based on dissimilarity of distributions to some reference distributions denoted as templates. Our framework exte…

2018-03-01abs ↗pdf ↗

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.