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

3978116155 · Jun 202019922001200920172026
48 results for Conjugate Kernels

The computational and storage complexity of kernel machines presents the primary barrier to their scaling to large, modern, datasets. A common way to tackle the scalability issue is to use the conjugate gradient algorithm, which relieves the constraints on both storage (the kernel matrix need not be stored) and computa…

2016-02-22abs ↗pdf ↗

Study shows deterministic equivalent for neural network kernel convergence.

problem Understanding convergence of neural network kernels.
method Analyzes empirical spectral distribution of Conjugate Kernel, proving convergence to a deterministic limit.
result Obtains a deterministic equivalent for the Stieltjes transform and resolvent of the Conjugate Kernel.

Regularized least-squares (kernel-ridge / Gaussian process) regression is a fundamental algorithm of statistics and machine learning. Because generic algorithms for the exact solution have cubic complexity in the number of datapoints, large datasets require to resort to approximations. In this work, the computation of …

2019-11-14abs ↗pdf ↗

We characterize the conjugate linearized Ricci flow and the associated backward heat kernel on closed three--manifolds of bounded geometry. We discuss their properties, and introduce the notion of Ricci flow conjugated constraint sets which characterizes a way of Ricci flow averaging metric dependent geometrical data. …

2007-10-17abs ↗pdf ↗

Sharp Li-Yau equality proven for shrinking Ricci solitons without curvature assumptions.

problem Classifying shrinking Ricci solitons without curvature or volume restrictions.
method Proving the sharp Li-Yau equality for conjugate heat kernel on shrinking Ricci solitons.
result Several estimates and classification of four-dimensional, non-compact shrinking Ricci solitons.

We study the geodesic X-ray transform XX on compact Riemannian surfaces with conjugate points. Regardless of the type of the conjugate points, we show that we cannot recover the singularities and therefore, this transform is always unstable (ill-posed). We describe the microlocal kernel of XX and relate it to the con…

2014-02-22abs ↗pdf ↗

In this article we derive Harnack estimates for conjugate heat kernel in an abstract geometric flow. Our calculation involves a correction term D. When D is nonnegative, we are able to obtain a Harnack inequality. Our abstract formulation provides a unified framework for some known results, in particular including corr…

2014-08-18abs ↗pdf ↗

Study heavy-tailed weights' impact on neural network's spectral distribution.

problem Analyzing spectral distribution of conjugate kernel matrices with heavy-tailed weights.
method Computed limiting eigenvalue distribution through moments, considering heavy-tailed distributions and nonlinear activation functions.
result Heavy-tailed weights induce strong correlations, leading to fundamentally different spectral behavior.

We discuss a natural form of Ricci--flow conjugation between two distinct general relativistic data sets given on a compact n3n\geq 3-dimensional manifold ΣΣ. We establish the existence of the relevant entropy functionals for the matter and geometrical variables, their monotonicity properties, and the associated conve…

2010-06-08abs ↗pdf ↗

Study eigenvalue distributions of neural kernels for linear-width networks.

problem Eigenvalue distributions of neural kernels in linear-width networks.
method Asymptotic analysis of Conjugate Kernel and Neural Tangent Kernel under random initialization and approximate orthogonality.
result Eigenvalue distributions converge to deterministic limits, described by recursive fixed-point equations.

We prove rates of convergence in the statistical sense for kernel-based least squares regression using a conjugate gradient algorithm, where regularization against overfitting is obtained by early stopping. This method is directly related to Kernel Partial Least Squares, a regression method that combines supervised dim…

2010-09-29abs ↗pdf ↗

We propose and study kernel conjugate gradient methods (KCGM) with random projections for least-squares regression over a separable Hilbert space. Considering two types of random projections generated by randomized sketches and Nyström subsampling, we prove optimal statistical results with respect to variants of norms …

2018-11-05abs ↗pdf ↗

Study on conjugate points in a CC^*-algebra's Grassmann manifold.

problem Characterizing conjugate points in a CC^*-algebra's Grassmann manifold.
method Analyzes connections and geodesics in the Riemannian metric induced by the Killing form.
result Points that are tangent conjugate in the classical setting may not be conjugate in a CC^*-algebra's Grassmann manifold.

New recommendations improve Gaussian process accuracy and stability.

problem Numerical instabilities and poor test likelihoods in iterative Gaussian process learning.
method Investigated CG tolerance, preconditioner rank, and Lanczos decomposition rank. Recommended small CG tolerance and large root decomposition size.
result L-BFGS-B optimizer achieves convergence with fewer gradient updates, improving Gaussian process accuracy.

In this paper, we study how to get the Ricci expanders from W+-functional through the heat kernel estimate of the conjugate heat equation to the type III singularity of Ricci flow. The Gaussian upper and lower bounds are established for the related heat kernel in accordance to the interesting work of Cao-Zhang for the …

2010-08-04abs ↗pdf ↗

Study of eigenvalues in nonlinear kernels for classification of separable data.

problem Understanding the applicability of linear equivalents in nonlinearly separable data classification.
method Analysis of conjugate kernels and their quadratic equivalents for a canonical nonlinearly separable dataset (XOR problem).
result Identification of regimes where nonlinear kernels deviate from linear equivalents, leading to label-aligned eigenspaces.

The paper analyzes contraction rates for GP regression approximations.

problem Computational infeasibility of exact GP posterior in large-scale applications.
method Lanczos and conjugate gradient approximations of the posterior mean.
result Minimax contraction rates for these approximations in large-scale applications.

We show that the standard stochastic gradient decent (SGD) algorithm is guaranteed to learn, in polynomial time, a function that is competitive with the best function in the conjugate kernel space of the network, as defined in Daniely, Frostig and Singer. The result holds for log-depth networks from a rich family of ar…

2017-02-27abs ↗pdf ↗

Improved Gaussian process regression with tighter log marginal likelihood bounds.

problem Improving predictive performance in Gaussian process regression models.
method Lower bound on log marginal likelihood using conjugate gradients.
result Improved predictive performance compared to other conjugate gradient based approaches.

cvHM framework speeds up GP inference for neural spike train analysis.

problem Scalability issue in approximate inference for latent GP models.
method cvHM framework using Hida-Matérn kernels and conjugate computation variational inference (CVI).
result Linear time inference for latent neural trajectories.

Alternative proof of coisotropic embedding theorem for pre-symplectic manifolds.

problem Proving the coisotropic embedding theorem for pre-symplectic manifolds.
method Recast geometric choice of connection as algebraic embedding into cotangent bundle, identify symplectic thickening as submanifold of Hamiltonian momenta conjugate to kernel directions.
result Alternative proof of the coisotropic embedding theorem.

Multiple kernel learning algorithms are proposed to combine kernels in order to obtain a better similarity measure or to integrate feature representations coming from different data sources. Most of the previous research on such methods is focused on the computational efficiency issue. However, it is still not feasible…

2012-06-27abs ↗pdf ↗

For a sub-Riemannian manifold provided with a smooth volume, we relate the small time asymptotics of the heat kernel at a point yy of the cut locus from xx with roughly "how much" yy is conjugate to xx. This is done under the hypothesis that all minimizers connecting xx to yy are strongly normal, i.e.\ all pieces…

2012-01-14abs ↗pdf ↗

Researchers parallelize neural kernels for large-scale data, achieving state-of-the-art accuracy.

problem Limited scalability of neural kernels on large datasets.
method Massively parallel computation across many GPUs, combined with a distributed, preconditioned conjugate gradients algorithm.
result Achieved state-of-the-art accuracy of 91.2% on CIFAR-5m dataset using neural kernels.

Multiple kernel learning (MKL), structured sparsity, and multi-task learning have recently received considerable attention. In this paper, we show how different MKL algorithms can be understood as applications of either regularization on the kernel weights or block-norm-based regularization, which is more common in str…

2010-11-13abs ↗pdf ↗

Let gg be a Riemannian metric for Rd\mathbf{R}^d (d3d\geq 3) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain MM. The lens rigidity problem is concerned with recovering the metric gg inside MM from the corresponding lens relation on the boundary M\partial M. In this paper…

2014-01-06abs ↗pdf ↗

BKP R package models spatially varying binomial probabilities efficiently.

problem Modeling spatially varying binomial probabilities efficiently.
method Beta Kernel Process (BKP) combining localized kernel-weighted likelihoods with conjugate beta priors.
result Closed-form posterior inference without requiring latent variables or intensive MCMC sampling.

We prove that many complete, noncompact, constant mean curvature (CMC) surfaces f:ΣR3f:Σ\to \R^3 are nondegenerate; that is, the Jacobi operator Δf+Af2Δ_f + |A_f|^2 has no L2L^2 kernel. In fact, if ΣΣ has genus zero and f(Σ)f(Σ) is contained in a half-space, then we find an explicit upper bound for the dimension of the L2L^2 j…

2004-07-09abs ↗pdf ↗

Paper studies the theoretical equivalence between implicit and explicit neural networks in high dimensions.

problem Lack of theoretical analysis of implicit and explicit neural networks.
method Examined high-dimensional implicit neural networks and established their equivalence to explicit networks.
result Equivalence between implicit and explicit neural networks in high dimensions.

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.

The paper derives Harnack inequalities for evolving Riemannian manifolds without dimensionality restrictions.

problem Deriving Harnack inequalities for geometric flows with evolving metrics.
method Probabilistic representation of conjugate semigroups and supercontractivity.
result Established dimension-free Harnack inequalities for geometric flows.

The paper considers the Ricci flow, coupled with the harmonic map flow between two manifolds. We derive estimates for the fundamental solution of the corresponding conjugate heat equation and we prove an analog of Perelman's differential Harnack inequality. As an application, we find a connection between the entropy fu…

2013-10-06abs ↗pdf ↗

Kernel methods are one of the mainstays of machine learning, but the problem of kernel learning remains challenging, with only a few heuristics and very little theory. This is of particular importance in methods based on estimation of kernel mean embeddings of probability measures. For characteristic kernels, which inc…

2016-03-07abs ↗pdf ↗

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.

Let Wn\mathcal{W}^{n} be the class of CC^{\infty } complete simply connected nn-dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let % W\in \mathcal{W}^{n} and let AA be a subset of WW. This article aims at characterization and bu…

2013-11-03abs ↗pdf ↗