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

3571106141 · Jun 202019922001200920172026
48 results for Translation-invariant kernels

We explore the connection between Hilbertian metrics and positive definite kernels on the real line. In particular, we look at a well-known characterization of translation invariant Hilbertian metrics on the real line by von Neumann and Schoenberg (1941). Using this result we are able to give an alternate proof of Boch…

2013-02-18abs ↗pdf ↗

Kernel methods have been widely applied to machine learning and other questions of approximating an unknown function from its finite sample data. To ensure arbitrary accuracy of such approximation, various denseness conditions are imposed on the selected kernel. This note contributes to the study of universal, characte…

2013-10-21abs ↗pdf ↗

Paper advances sparse regularisation theory for measures with new kernel insights.

problem Estimating sparse measures from noisy observations using continuous sparse regularisation.
method Develops new continuous sparse regularisation theory on measures with Beurling-LASSO, introduces kernel switch analysis.
result Proves the ``sinc-4'' kernel satisfies a technical LPC assumption for error bounds.

Wiatowski and Bölcskei, 2015, proved that deformation stability and vertical translation invariance of deep convolutional neural network-based feature extractors are guaranteed by the network structure per se rather than the specific convolution kernels and non-linearities. While the translation invariance result appli…

2016-04-29abs ↗pdf ↗

We propose a principled method for kernel learning, which relies on a Fourier-analytic characterization of translation-invariant or rotation-invariant kernels. Our method produces a sequence of feature maps, iteratively refining the SVM margin. We provide rigorous guarantees for optimality and generalization, interpret…

2017-10-27abs ↗pdf ↗

Devoted to multi-task learning and structured output learning, operator-valued kernels provide a flexible tool to build vector-valued functions in the context of Reproducing Kernel Hilbert Spaces. To scale up these methods, we extend the celebrated Random Fourier Feature methodology to get an approximation of operator-…

2016-05-09abs ↗pdf ↗

We study the space of generalized translation invariant valuations on a finite-dimensional vector space and construct a partial convolution which extends the convolution of smooth translation invariant valuations. Our main theorem is that McMullen's polytope algebra is a subalgebra of the (partial) convolution algebra …

2014-06-17abs ↗pdf ↗

The study analyzes prediction errors in systems with memory kernels, providing bounds and stability results.

problem Prediction errors in stochastic dynamical systems with memory kernels.
method Analysis of generalized Langevin equations (GLEs) with Volterra equations, integrating synchronized noise coupling and weighted norms.
result Prediction discrepancies decay at a rate determined by the memory kernel's decay, quantitatively bounded by kernel estimation errors.

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).

BSA-TNP improves NP scalability and accuracy for spatiotemporal data.

problem Scalability and accuracy trade-off in Neural Processes.
method Introduces KRBlocks, group-invariant attention biases, and BSA for scalable spatiotemporal inference.
result BSA-TNP matches or exceeds accuracy of best models while training faster.

Convolution and pooling improve kernel methods in image classification.

problem Understanding the interplay between approximation and generalization in convolutional architectures.
method Characterized RKHS of kernels with convolution, pooling, and downsampling, computed generalization error.
result Convolution and pooling operations trade off approximation with generalization power.

The decomposition of the space of continuous and translation invariant valuations into a sum of SO(n) irreducible subspaces is obtained. A reformulation of this result in terms of a Hadwiger type theorem for continuous translation invariant and SO(n)-equivariant tensor valuations is also given. As an application, symme…

2010-08-23abs ↗pdf ↗

New calculus for pseudodifferential operators on manifolds with cylindrical ends.

problem Analyzing layer potentials on manifolds with cylindrical ends.
method Introducing and studying two classes of pseudodifferential operators.
result Spectrally invariant property of the 'essentially translation invariant calculus'.

Study on adaptivity to kernel regularity in bandit problems.

problem Adaptation to unknown kernel regularity in continuum-armed bandit problems.
method Derive adaptivity lower bound and verify with minimax non-adaptive kernelised bandit algorithms.
result Impossibility of achieving optimal cumulative regret in different RKHSs with varying regularities.

The study analyzes spectral algorithms for kernel methods and derives generalization error.

problem Estimating generalization error of spectral algorithms for kernel methods.
method Considered spectral algorithms including KRR and GD, derived generalization error as a functional of learning profile.
result Showed the loss localizes on certain spectral scales and conjectured universality of the loss for noisy observations.

We prove that the focal set generated by the reflection of a point source off a translation invariant surface consists of two sets: a curve and a surface. The focal curve lies in the plane orthogonal to the symmetry direction containing the source, while the focal surface is translation invariant. This is done by const…

2005-10-23abs ↗pdf ↗

The study classifies holomorphic projective connections on complex threefolds.

problem Characterizing holomorphic projective connections on complex threefolds.
method Analyzing properties of holomorphic projective connections on complex projective threefolds.
result Holomorphic projective connections on complex threefolds are either flat or translation invariant on abelian threefolds.

Locality helps in learning from high-dimensional data.

problem Understanding how convolutional neural networks learn from high-dimensional data.
method Teacher-student framework for kernel regression with convolutional kernels.
result Locality is key to determining the learning curve exponent in high-dimensional data.

We propose a statistical model for natural language that begins by considering language as a monoid, then representing it in complex matrices with a compatible translation invariant probability measure. We interpret the probability measure as arising via the Born rule from a translation invariant matrix product state.

2017-11-04abs ↗pdf ↗

New method uses non-translation invariant risk measures for fair financial derivative pricing.

problem Inequalities in financial derivative pricing under traditional risk measures.
method Deep reinforcement learning with modified deep hedging algorithm.
result Effective pricing of financial derivatives without price inflation.

Despite their successes, what makes kernel methods difficult to use in many large scale problems is the fact that storing and computing the decision function is typically expensive, especially at prediction time. In this paper, we overcome this difficulty by proposing Fastfood, an approximation that accelerates such co…

2014-08-13abs ↗pdf ↗

In [DM] it was asked whether all flat holomorphic Cartan geometries (G,H) on a complex torus are translation invariant. We answer this affimatively under the assumption that the complex Lie group G is affine. More precisely, we show that every holomorphic Cartan geometry of type (G,H), with G a complex affine Lie group…

2017-10-16abs ↗pdf ↗

We study estimation of (semi-)inner products between two nonparametric probability distributions, given IID samples from each distribution. These products include relatively well-studied classical L2\mathcal{L}^2 and Sobolev inner products, as well as those induced by translation-invariant reproducing kernels, for whic…

2018-03-30abs ↗pdf ↗

We prove that any holomorphic locally homogeneous geometric structure on a complex torus, modelled on a complex homogeneous surface, is translation invariant. We conjecture that this result is true is any dimension. In higher dimension we prove it here for nilpotent models. We also prove that in any dimension the trans…

2015-09-03abs ↗pdf ↗

New tools study curvature measures of convex bodies, revealing structured spaces.

problem Investigate translation invariant curvature measures of convex bodies.
method Introduce new tools to study curvature measures, proving conjectures about their structure.
result Space of curvature measures has length at most 2 as a representation of the general linear group in degrees 0 and n-2.

A Hilbert space embedding for probability measures has recently been proposed, with applications including dimensionality reduction, homogeneity testing, and independence testing. This embedding represents any probability measure as a mean element in a reproducing kernel Hilbert space (RKHS). A pseudometric on the spac…

2009-07-30abs ↗pdf ↗

Let SO+(p,q)\mathrm{SO}^+(p,q) denote the identity connected component of the real orthogonal group with signature (p,q)(p,q). We give a complete description of the spaces of continuous and generalized translation- and SO+(p,q)\mathrm{SO}^+(p,q)-invariant valuations, generalizing Hadwiger's classification of Euclidean isometry-invari…

2016-02-28abs ↗pdf ↗

Two-sample tests using MMD control type I error and achieve optimal power.

problem Developing reliable nonparametric two-sample tests for small sample sizes.
method Maximum Mean Discrepancy (MMD) for constructing novel nonparametric tests, proving non-asymptotic error control and optimality.
result MMDAgg test controls type I error and achieves minimax rate over Sobolev balls, outperforming other tests.

Paper proves Fourier transform for valuations, simplifying previous work.

problem Existence of isomorphism for translation-invariant smooth valuations.
method Directly describes Alesker's isomorphism in terms of Fourier transform on functions.
result Simple proofs of Alesker's Fourier transform properties, including a previously conjectured result.

Paper refines Alesker-Bernig-Schuster theorem, proving Hodge-Riemann relations for Euclidean balls.

problem Understanding translation-invariant valuations and their geometric implications.
method Explicit construction of highest weight vectors and analysis of natural operations on these vectors.
result Proof of Hodge-Riemann relations for Euclidean balls, extending geometric inequalities.

BasisVAE combines VAE and clustering for tabular data analysis.

problem Lack of insights in tabular high-dimensional data analysis.
method Combines VAE with probabilistic clustering prior for joint dimensionality reduction and clustering.
result Learned one-hot basis function representation for translation-invariant features.

Fixed points of mean section operators found in convex bodies.

problem Characterizing fixed points of mean section operators in convex bodies.
method Characterization of rotation equivariant operators using spherical Laplacian mass distribution, and application of Minkowski valuations.
result Euclidean balls are the only fixed points of mean section operators in a C2C^2 neighborhood of the unit ball.