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

4693139185 · Jun 202019922001200920172026
48 results for kernel triviality

Paper proves non-triviality of Johnson kernel torsion subgroup.

problem Non-triviality of the torsion subgroup of the abelianized Johnson kernel.
method Action of mapping class group on Malcev Lie algebra, diagrammatic techniques.
result Proves non-triviality of the torsion subgroup with a purely 2-dimensional proof.

Gradient descent benefits from tangent kernel advantages under specific conditions.

problem Comparing gradient descent with tangent kernel methods in learning.
method Analysis of gradient descent and tangent kernel methods under different conditions.
result Gradient descent can achieve small error only if tangent kernel methods have a non-trivial advantage, but this advantage can be very small.

We investigate the prescribed Q-curvature flow for GJMS operators with non-trivial kernel on compact manifolds of even dimension. When the total Q-curvature is negative, we identify a conformally invariant condition on the nodal domains of functions in the kernel of the GJMS operator, allowing us to prove the global ex…

2012-03-14abs ↗pdf ↗

We address the question: Does there exist a non-trivial knot with a trivial Jones polynomial? To find such a knot, it is almost certainly sufficient to find a non-trivial braid on four strands in the kernel of the Burau representation. I will describe a computer algorithm to search for such a braid.

2000-12-12abs ↗pdf ↗

Study de Rham homomorphism for Lipschitz cohomologies on metric simplicial complexes.

problem Triviality of de Rham homomorphism kernel and non-increasing monotonicity of parameters.
method Regularization in Lipschitz de Rham calculus on metric simplicial complexes with bounded geometry.
result Explicit specification of non-trivial cohomology classes for a sequence of parameters.

New kernels from ELU and GELU networks reveal non-trivial fixed points.

problem Understanding fixed-point dynamics in deep neural networks with ELU and GELU activations.
method Deriving covariance functions and analyzing fixed-point dynamics of ELU and GELU networks.
result ELU and GELU networks exhibit non-trivial fixed-point dynamics, explaining implicit regularization in overparameterized models.

Quantum kernel methods can lead to trivial models due to exponential concentration of kernel values.

problem Exponential concentration of quantum kernel values can lead to trivial models in QML.
method Analyzing the resources needed to accurately estimate quantum kernel values and identifying four sources of concentration.
result Quantum kernel values can be exponentially concentrated, leading to trivial models.

The paper proves conditions for the triviality of L2L^2-harmonic forms on Riemannian manifolds.

problem Conditions for the triviality of L2L^2-harmonic forms on Riemannian manifolds.
method Study of a covariant Schrödinger operator HX,VH_{X,V} and its L2L^2-kernel.
result Sufficient conditions for the triviality of the L2L^2-kernel of HX,VH_{X,V}.

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 ↗

We prove that the first complex homology of the Johnson subgroup of the Torelli group TgT_g is a non-trivial unipotent TgT_g-module for all g4g\ge 4 and give an explicit presentation of it as a $\Sym H_1(T_g,\C)$-module when g6g\ge 6. We do this by proving that, for a finitely generated group GG satisfying an assumpti…

2011-01-07abs ↗pdf ↗

Detecting the emergence of abrupt property changes in time series is a challenging problem. Kernel two-sample test has been studied for this task which makes fewer assumptions on the distributions than traditional parametric approaches. However, selecting kernels is non-trivial in practice. Although kernel selection fo…

2019-01-18abs ↗pdf ↗

The X-ray transform on the periodic slab [0,1]×Tn[0,1]\times\mathbb T^n, n0n\geq0, has a non-trivial kernel due to the symmetry of the manifold and presence of trapped geodesics. For tensor fields gauge freedom increases the kernel further, and the X-ray transform is not solenoidally injective unless n=0n=0. We characterize t…

2017-07-05abs ↗pdf ↗

Bayesian nonparametric models, such as Gaussian processes, provide a compelling framework for automatic statistical modelling: these models have a high degree of flexibility, and automatically calibrated complexity. However, automating human expertise remains elusive; for example, Gaussian processes with standard kerne…

2015-10-26abs ↗pdf ↗

It is an open problem whether Kirk's σσ invariant is the complete obstruction to a link map S2S2S4S^2\cup S^2\to S^4 being link homotopically trivial. With the objective of constructing counterexamples, Li proposed a link homotopy invariant ωω that is defined on the kernel of σσ and also obstructs link nullhomotopy. We …

2016-09-20abs ↗pdf ↗

A well-recognized limitation of kernel learning is the requirement to handle a kernel matrix, whose size is quadratic in the number of training examples. Many methods have been proposed to reduce this computational cost, mostly by using a subset of the kernel matrix entries, or some form of low-rank matrix approximatio…

2014-11-05abs ↗pdf ↗

This work challenges the Neural Tangent Kernel's role in overparameterized neural networks, especially with large width and depth.

problem The Neural Tangent Kernel's behavior in overparameterized neural networks with large width and depth is unclear.
method Experimental and theoretical analysis of ReLU networks with large width and depth.
result The aggregate norm of hidden neuron deviations does not vanish in infinitely-wide ReLU networks, indicating non-trivial behavior.

This paper presents a new exact sequence for orbifold braid groups and mapping class groups.

problem Understanding the relationship between orbifold braid groups and mapping class groups.
method Developed an exact sequence and used presentations of orbifold mapping class groups to determine the kernel.
result The kernel of the orbifold braid group is non-trivial and provides a new presentation.

New bounds for KRR condition number reveal overfitting phenomena.

problem Characterizing overfitting in KRR with varying kernel spectral decay.
method Derived new bounds for kernel matrices, enhanced test error bounds, and identified feature independence role.
result Identified tempered and catastrophic overfitting phenomena.

We consider the problem of Bayesian optimization (BO) in one dimension, under a Gaussian process prior and Gaussian sampling noise. We provide a theoretical analysis showing that, under fairly mild technical assumptions on the kernel, the best possible cumulative regret up to time TT behaves as Ω(T)Ω(\sqrt{T}) and $O(\s…

2018-05-30abs ↗pdf ↗

We study the effect of Nielsen moves and their geometric counterparts, handle slides, on good boundary links. A collection of links, universal for 4-dimensional surgery, is shown to admit Seifert surfaces with trivial Lagrangian. They are good boundary links, with Seifert matrices of a more general form than in known c…

2019-01-17abs ↗pdf ↗

New method uses kernel methods to approximate ground states of quantum Hamiltonians efficiently.

problem Approximating ground states of quantum Hamiltonians using neural networks is computationally expensive.
method Introduces a statistical learning approach using kernel methods to make optimization trivial.
result Ground state properties of arbitrary gapped quantum Hamiltonians can be reached with polynomial resources.

Zero-inflated datasets, which have an excess of zero outputs, are commonly encountered in problems such as climate or rare event modelling. Conventional machine learning approaches tend to overestimate the non-zeros leading to poor performance. We propose a novel model family of zero-inflated Gaussian processes (ZiGP) …

2018-03-13abs ↗pdf ↗

Learning linear combinations of multiple kernels is an appealing strategy when the right choice of features is unknown. Previous approaches to multiple kernel learning (MKL) promote sparse kernel combinations to support interpretability and scalability. Unfortunately, this 1-norm MKL is rarely observed to outperform tr…

2010-02-27abs ↗pdf ↗

This paper generalizes regularized regression problems in a hyper-reproducing kernel Hilbert space (hyper-RKHS), illustrates its utility for kernel learning and out-of-sample extensions, and proves asymptotic convergence results for the introduced regression models in an approximation theory view. Algorithmically, we c…

2018-09-26abs ↗pdf ↗

New RL method handles large state-action spaces with complex models.

problem Complex models and large state-action spaces in reinforcement learning.
method π-KRVI, an optimistic modification of least-squares value iteration using kernel ridge regression.
result First order-optimal regret guarantees under general settings, improving over state of the art.

The paper explores how kernel eigenalignments affect generalization in KRR.

problem Achieving robust generalization in kernel methods.
method Direct connection between generalization and matrix eigenvectors/eigenvalues, focusing on finite-sample settings.
result Strong generalization requires increasing eigenvector alignment, eigenvalue magnitude, or gaps between eigenvalues.

We introduce and study new invariants associated with Laplace type elliptic partial differential operators on manifolds. These invariants are constructed by using the off-diagonal heat kernel; they are not pure spectral invariants, that is, they depend not only on the eigenvalues but also on the corresponding eigenfunc…

2014-08-10abs ↗pdf ↗

New method tackles high-dimensional contextual bandits with flexible kernel models.

problem Maximizing rewards in decision-making scenarios with many features.
method Introduces stochastic assumptions and no-regret learning for Gaussian kernels.
result Achieves no-regret learning even with feature dimensions growing with samples.

The paper analyzes heat kernel asymptotics for real powers of Laplacians on manifolds.

problem Analyzing the small-time behavior of heat kernels for real powers of Laplacians.
method Analyzes asymptotics on the diagonal and away from it, proving non-triviality and non-locality of coefficients.
result Logarithmic terms appear only if the manifold dimension is odd and the power is rational with even denominator.

Study kernels of mapping class group representations on surface configuration spaces.

problem Understanding kernels of mapping class group representations on surface configuration spaces.
method Relate kernels to a natural twisted intersection pairing and analyze specific examples.
result Identify subrepresentations and find faithful representations for certain configurations.

In this paper, we introduce a geometric structure called top, which is a trivialized bundle of plane pencils over a Riemannian 3-manifold, defined as the set of kernels of a circle of 1-forms (e.g. of contact and integrable forms) with particular properties with respect to the metric. We classify the manifolds which ad…

2007-06-21abs ↗pdf ↗

Uniform heat kernel and diffusion bridge asymptotics for sub-Riemannian geometry.

problem Analyzing sub-Riemannian heat kernels and their derivatives on incomplete manifolds.
method Localized asymptotic analysis, focusing on minimizing geodesics and the non-abnormal cut locus.
result Uniform bounds and expansions for heat kernels and their derivatives on compacts, including the diffusion bridge measure.

Improves regression efficiency by separating material and immaterial parts of responses.

problem Improving estimation efficiency in nonlinear multivariate regressions.
method Kernel envelope (KENV) estimator for nonparametric response envelopes in reproducing kernel Hilbert space.
result KENV achieves lower in-sample prediction risk than kernel ridge regression in non-trivial immaterial components.