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

Trend · papers per month

58117175233 · Jun 202019922001200920172026
48 results for constant kernel

The paper studies Lipschitz bounds for integral kernels under differentiability assumptions.

problem Understanding the Lipschitz continuity of feature maps associated with integral kernels.
method Analyzes differentiability assumptions to derive explicit formulas for Lipschitz constants and conditions for non-Lipschitz continuity.
result Explicit formulas and conditions for Lipschitz continuity of feature maps associated with various kernels.

Study on kernel regression risk in high dimensions using Pinsker bound.

problem Kernel regression risk in high-dimensional inner product spaces.
method Investigation of Pinsker bound for kernel regression on sphere Sd\mathbb{S}^{d} with sample size n=αdγ(1+od(1))n = αd^γ(1+o_{d}(1)).
result Exact minimax risk and Pinsker constant identified for kernel regression.

Study classifies solutions to specific equations on half-space and ball.

problem Classifying nonnegative solutions to QQ-flat and constant TT-curvature equations.
method Introduced a biharmonic Poisson kernel and derived its explicit representation formula.
result Established classification theorems for solutions on R+n+1\mathbb{R}_+^{n+1} and Bn+1\mathbb{B}^{n+1}.

Wide neural networks become linear, with constant tangent kernel, due to Hessian scaling.

problem Understanding the linearity of large non-linear models and the tangent kernel.
method Analyzing the scaling properties of the Hessian matrix of neural networks as their width increases.
result The constancy of the tangent kernel is due to the scaling properties of the Hessian matrix.

The paper studies estimating the normalizing constant using queries to a black-box function in RKHS.

problem Estimating the normalizing constant of a function in a reproducing kernel Hilbert space.
method Combines Bayesian quadrature and Bayesian optimization approaches, considering different levels of difficulty based on the parameter λ.
result The difficulty of estimating the normalizing constant varies between Bayesian quadrature and Bayesian optimization, even with noisy function evaluations.

We study the construction of coresets for kernel density estimates. That is we show how to approximate the kernel density estimate described by a large point set with another kernel density estimate with a much smaller point set. For characteristic kernels (including Gaussian and Laplace kernels), our approximation pre…

2017-10-11abs ↗pdf ↗

The paper examines how adversarial training and noise affect neural network performance.

problem Overfitting in adversarial training and data augmentation.
method Adversarial training and data augmentation with noise in the context of regularized regression in RKHS.
result Appropriate regularization can prevent overfitting and improve performance.

In this paper, we systematically study the heat kernel of the Ricci flows induced by Ricci shrinkers. We develop several estimates which are much sharper than their counterparts in general closed Ricci flows. Many classical results, including the optimal Logarithmic Sobolev constant estimate, the Sobolev constant estim…

2019-01-17abs ↗pdf ↗

We prove Gray--Moser stability theorems for complementary pairs of forms of constant class defining symplectic pairs, contact-symplectic pairs and contact pairs. We also consider the case of contact-symplectic and contact-contact structures, in which the constant class condition on a one-form is replaced by the conditi…

2004-07-26abs ↗pdf ↗

We obtain a local Sobolev constant estimate for integral Ricci curvature, which enables us to extend several important tools such as the maximal principle, the gradient estimate, the heat kernel estimate and the L2L^2 Hessian estimate to manifolds with integral Ricci lower bounds, without the non-collapsing conditions.

2016-01-29abs ↗pdf ↗

Sharp fractional Sobolev inequalities on closed manifolds identified.

problem Critical fractional Sobolev embedding on closed Riemannian manifolds.
method Intrinsic heat-kernel based framework, determining optimal coefficients, proving sharp inequalities.
result Sharp pp-power inequality and almost sharp inequality established.

This work analyzes when contrastive models are close to PCA or kernel methods.

problem Understanding when contrastive models are equivalent to kernel methods or PCA.
method Analyzing the training dynamics of two-layer contrastive models with non-linear activation.
result Wide contrastive models with cosine similarity based losses are close to PCA.

Bayesian Gaussian Processes improve exoplanet transit and Hubble constant inference.

problem Improving exoplanet transit and Hubble constant inference using Bayesian Gaussian Processes.
method Kernel-, mean- and noise-marginalised Gaussian Processes with evidence-based model comparison and transdimensional sampling.
result Inferred Hubble constant H0H_0 values from cosmic chronometers, baryon acoustic oscillations and combined datasets are 66±6kms1Mpc166 \pm 6\, \mathrm{km}\,\mathrm{s}^{-1}\,\mathrm{Mpc}^{-1}, 67±10kms1Mpc167 \pm 10\, \mathrm{km}\,\mathrm{s}^{-1}\,\mathrm{Mpc}^{-1} and 69±6kms1Mpc169 \pm 6\, \mathrm{km}\,\mathrm{s}^{-1}\,\mathrm{Mpc}^{-1}, respectively.

Most state-of-the-art graph kernels only take local graph properties into account, i.e., the kernel is computed with regard to properties of the neighborhood of vertices or other small substructures. On the other hand, kernels that do take global graph propertiesinto account may not scale well to large graph databases.…

2017-03-07abs ↗pdf ↗

We study the subelliptic heat kernel of the sub-Laplacian on a 2n+1-dimensional anti-de Sitter space H2n+1 which also appears as a model space of a CR Sasakian manifold with constant negative sectional curvature. In particular we obtain an explicit and geometrically meaningful formula for the subelliptic heat kernel. T…

2012-04-16abs ↗pdf ↗

Paper analyzes SGD in kernel regression, showing it outperforms offline methods.

problem Performance of SGD in kernel regression compared to offline methods.
method Analyzes Stochastic Gradient Descent (SGD) in kernel regression under misspecified models.
result SGD achieves min-max optimal rates up to constants, avoiding saturation.

We prove the following gradient inequality for the subelliptic heat kernel on nilpotent Lie groups GG of H-type: PtfKPt(f)|\nabla P_t f| \le K P_t(|\nabla f|) where PtP_t is the heat semigroup corresponding to the sublaplacian on GG, \nabla is the subelliptic gradient, and KK is a constant. This extends a result of H.-…

2009-04-11abs ↗pdf ↗

Paper studies kernel hyperparameters for clustering, proposing an efficient search method.

problem Challenges in tuning kernel parameters for clustering, especially for RBF kernels.
method Derives a lower bound for RBF kernel parameters, proposes an efficient hyperparameter search algorithm.
result Proposes an efficient algorithm for hyperparameter search in kernel clustering, improving upon grid search.

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.

Analog arrays are a promising upcoming hardware technology with the potential to drastically speed up deep learning. Their main advantage is that they compute matrix-vector products in constant time, irrespective of the size of the matrix. However, early convolution layers in ConvNets map very unfavorably onto analog a…

2018-07-03abs ↗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.

Let (M,g)(M,\,g) be a Poincareˊ\acute{\text{e}}-Einstein manifold with a smooth defining function. In this note, we prove that there are infinitely many asymptotically hyperbolic metrics with constant QQ-curvature in the conformal class of an asymptotically hyperbolic metric close enough to gg. These metrics are paramet…

2012-05-29abs ↗pdf ↗

We establish refinements of the classical Kato inequality for sections of a vector bundle which lie in the kernel of a natural injectively elliptic first-order linear differential operator. Our main result is a general expression which gives the value of the constants appearing in the refined inequalities. These consta…

1999-09-21abs ↗pdf ↗

Changing kernel bandwidth during training improves kernel regression performance.

problem Improving kernel regression performance with varying model complexity.
method Investigated changing the bandwidth of a translational-invariant kernel during training for kernel regression using gradient descent.
result Kernel regression exhibits double descent behavior with decreasing model complexity (bandwidth).

We estimate the heat kernel on a closed Riemannian manifold MM, with dim(M)3dim(M)\geq 3, evolving under the Ricci-harmonic map flow and the result depends on some constants arising from a Sobolev imbedding theorem. In a special case, when the scalar curvature satisfies a certain natural inequality, we obtain, as a corolla…

2013-08-31abs ↗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.

The paper examines the optimality of kernel methods in high-dimensional clustering.

problem Understanding the optimality of kernel methods in high-dimensional data clustering.
method High-dimensional Gaussian clustering, exponential kernel function, kernel k-means, semi-definite relaxation.
result The exponential kernel function optimally recovers clusters in high-dimensional data, matching information-theoretic limits up to a factor of √2.

The paper explores the identifiability and interpretability of Gaussian process models using different kernel structures.

problem Identifiability and interpretability issues in Gaussian process models.
method The paper examines both single-output and multi-output Gaussian process models using additive and multiplicative mixtures of Matérn kernels.
result The smoothness of a mixture of Matérn kernels is determined by the least smooth component, and none of the mixing weights or parameters are identifiable.

We derive a local Gaussian upper bound for the ff-heat kernel on complete smooth metric measure space (M,g,efdv)(M,g,e^{-f}dv) with nonnegative Bakry-Émery Ricci curvature, which generalizes the classic Li-Yau estimate. As applications, we obtain a sharp Lf1L_f^1-Liouville theorem for ff-subharmonic functions and an Lf1L_f^1-u…

2014-01-23abs ↗pdf ↗

New research sets the minimax lower bound for KSD estimation at sqrt(n).

problem Estimating goodness-of-fit using Kernel Stein Discrepancy (KSD) on high-dimensional spaces.
method Two complementary results proving the minimax lower bound of KSD estimation.
result The minimax lower bound of KSD estimation is n^(-1/2), indicating exponential difficulty with dimensionality.