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

Trend · papers per month

56112167223 · Jun 202019922001200920172026
48 results for analytic kernels

Analytic Kähler potentials yield analytic Bergman kernels.

problem Characterizing Bergman kernels for analytic Kähler potentials.
method Linear recursive formula for Bergman kernel coefficients, simplified from Charles's work.
result Bergman kernels are analytic symbols with phase determined by Kähler potential polarization.

Improved two-sample testing using L1L^1 geometry for analytic kernels.

problem Detecting differences between distributions.
method Use L1L^1 distance between kernel-based distribution representatives to improve testing power.
result Better detection of differences between distributions using L1L^1 norm.

Wide neural networks can learn complex functions like gravitational force law.

problem Learning complex functions like gravitational force law with neural networks.
method Extending theoretical bounds to analytic functions on the sphere using SGD and ReLU networks.
result Wide ReLU networks can learn analytic functions efficiently with proportional number of samples.

The paper solves heat kernel asymptotics on non-degenerate CR manifolds.

problem Existence of small-time asymptotics for the heat kernel of the Kohn Laplacian on CR manifolds.
method Analytic methods and spectral theory for CR manifolds.
result Established small-time asymptotics for the heat kernel and analytic torsion on non-degenerate CR manifolds.

We consider the problem of learning a set from random samples. We show how relevant geometric and topological properties of a set can be studied analytically using concepts from the theory of reproducing kernel Hilbert spaces. A new kind of reproducing kernel, that we call separating kernel, plays a crucial role in our…

2012-04-16abs ↗pdf ↗

The paper defines functions that induce bounded composition operators on RKHSs with analytic positive definite functions.

problem Characterizing functions that induce bounded composition operators on RKHSs.
method Intrinsic properties of RKHSs and asymptotic properties of orthogonal polynomials.
result Only affine transforms can induce bounded composition operators in a large class of RKHSs.

Quantum neural tangent kernels help understand variational quantum circuits in machine learning.

problem Designing and predicting performance of variational quantum circuits.
method Using quantum neural tangent kernels and dynamical equations for loss functions.
result Analytical solutions for training dynamics in variational quantum circuits.

Optimal kernel improves estimation accuracy in modal statistical methods.

problem Estimation accuracy of kernel-based modal statistical methods depends on the kernel used.
method The study theoretically shows an optimal kernel that minimizes asymptotic error criterion.
result An optimal kernel minimizes the error criterion when using an optimal bandwidth.

Paper improves MMD estimation for analytical mean embeddings.

problem Improving MMD estimation for distributions with analytical mean embeddings.
method Proposes a tighter concentration result for MMD estimation under semi-explicit settings and extends to unbounded kernels.
result Demonstrates efficiency in real-world applications like index replication and calibration.

The Gaussian kernel is never positive-definite on Riemannian symmetric spaces.

problem Proving the non-positive-definiteness of the Gaussian kernel on non-Euclidean symmetric spaces.
method Developed new geometric and analytical arguments to rigorously characterize the positive-definiteness of the Gaussian kernel.
result L ⁣p^{\!\scriptscriptstyle p}-\hspace{0.02cm}Godement theorems provide necessary and sufficient conditions for positive-definiteness.

We show that under very general assumptions the partial Bergman kernel function of sections vanishing along an analytic hypersurface has exponential decay in a neighborhood of the vanishing locus. Considering an ample line bundle, we obtain a uniform estimate of the Bergman kernel function associated to a singular metr…

2016-01-03abs ↗pdf ↗

A new method for non-rigid point set registration reduces computational complexity.

problem Efficiently registering non-rigid point sets with large numbers of points.
method Structured Analytic Coherent Point Drift (Analytic-CPD) reformulates CPD for structured analytic mappings.
result Analytic-CPD reduces computational complexity by controlling the deformation model's dimensionality.

Study on how kernel regression models generalize to out-of-distribution data.

problem Understanding generalization in machine learning models under distributional shifts.
method Replica method from statistical physics to derive analytical formula for generalization error.
result Identified overlap matrix as key determinant of generalization performance under distribution shift.

We consider Laplacians acting on sections of homogeneous vector bundles over symmetric spaces. By using an integral representation of the heat semi-group we find a formal solution for the heat kernel diagonal that gives a generating function for the whole sequence of heat invariants. We argue that the obtained formal s…

2007-08-01abs ↗pdf ↗

Nonlinear kernel regression models are often used in statistics and machine learning because they are more accurate than linear models. Variable selection for kernel regression models is a challenge partly because, unlike the linear regression setting, there is no clear concept of an effect size for regression coeffici…

2015-08-05abs ↗pdf ↗

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multip…

2010-05-04abs ↗pdf ↗

We propose a new analytical approximation to the χ2χ^2 kernel that converges geometrically. The analytical approximation is derived with elementary methods and adapts to the input distribution for optimal convergence rate. Experiments show the new approximation leads to improved performance in image classification and …

2012-06-18abs ↗pdf ↗

Gaussian processes are rich distributions over functions, which provide a Bayesian nonparametric approach to smoothing and interpolation. We introduce simple closed form kernels that can be used with Gaussian processes to discover patterns and enable extrapolation. These kernels are derived by modelling a spectral dens…

2013-02-18abs ↗pdf ↗

We consider Laplacians acting on sections of homogeneous vector bundles over symmetric spaces. By using an integral representation of the heat semi-group we find a formal solution for the heat kernel diagonal that gives a generating function for the whole sequence of heat invariants. We show explicitly that the obtaine…

2007-01-17abs ↗pdf ↗

The paper proves a conjecture about the Bergman metric of real analytic domains.

problem Proving the Cheng-Yau conjecture for real analytic pseudoconvex domains.
method Localization of Bergman kernels, extension theorem, and Einstein metrics.
result The Bergman metric of a bounded pseudoconvex domain with real-analytic boundary is Einstein if and only if the domain is biholomorphic to the unit ball.

Kernel-based function approximation improves reinforcement learning performance.

problem Average reward reinforcement learning in infinite horizon settings.
method Optimistic algorithm based on kernel ridge regression.
result No-regret performance guarantees and confidence intervals for kernel-based predictions.

Paper introduces new regression methods for consistent estimation of biophysical parameters.

problem Estimating biophysical parameters while respecting auxiliary variables.
method Linear and nonlinear kernel-based regression models with consistency constraints.
result Models provide closed-form solutions and successfully estimate chlorophyll content.

New approach interprets Nyström for kernel machines with geometric insight.

problem No comparative study over Nyström-based kernel machine approaches.
method Developed a new approach with geometric interpretation, showing equivalence to existing methods.
result Proposed approach offers insights into approximation errors and accuracy.

Modern machine learning models are typically trained using Stochastic Gradient Descent (SGD) on massively parallel computing resources such as GPUs. Increasing mini-batch size is a simple and direct way to utilize the parallel computing capacity. For small batch an increase in batch size results in the proportional red…

2018-06-15abs ↗pdf ↗

This work explores variably scaled kernels to improve non-stationary Gaussian processes.

problem Limited ability of stationary kernels to represent heterogeneous correlation structures.
method Introduces variably scaled kernels to modify correlation structures explicitly.
result Improved reconstruction accuracy and better uncertainty estimates for non-stationary data.

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.

Kernel clustering algorithm improved for large datasets using incomplete Cholesky factorization.

problem Large memory usage in kernel-based clustering for large-scale datasets.
method Approximate the kernel matrix using incomplete Cholesky factorization and apply linear kk-means clustering.
result The proposed method achieves similar performance to kernel kk-means clustering but handles large-scale datasets efficiently.