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

4385128170 · May 202619922001200920172026
48 results for Interpolation theorem

The paper proves approximation and interpolation theorems for maxfaces with singularities.

problem Proving approximation and interpolation theorems for maxfaces with singularities.
method Surveying and applying Enneper--Weierstrass representation formula methods to maxfaces, incorporating singularity criteria.
result Existence of maxfaces with prescribed singularities and maxfaces with dense image singular set.

We show that stochastic interpolation flow maps are Lipschitz with a sharp constant.

problem High dimensional sampling and transport problems.
method Investigating stochastic interpolation flow for generating data samples.
result Stochastic interpolation flow maps are Lipschitz with a sharp constant matching optimal transport maps.

The Mittag-Leffler theorem is extended to meromorphic curves and minimal surfaces.

problem Extending the Mittag-Leffler theorem to meromorphic curves and minimal surfaces.
method Established a Mittag-Leffler-type theorem for meromorphic curves and minimal immersions, including interpolation and approximation.
result Complete minimal ends in R^5 are generically embedded, and open Riemann surfaces are characterized for minimal surfaces.

Continuous family of elliptic operators' projections maintain Cauchy data spaces.

problem Maintaining Cauchy data spaces for a continuous family of elliptic operators.
method Elementary tools and classical results applied to operator graphs, Sobolev spaces, and Green's formula.
result Orthogonalized Calderón projections form a continuous family of projections.

The paper characterizes vector fields as interpolating sesqui-harmonic maps on Riemannian manifolds.

problem Characterizing vector fields as interpolating sesqui-harmonic maps on Riemannian manifolds.
method Characterization theorem and critical point condition for interpolating sesqui-harmonic vector fields.
result Conditions for vector fields to be interpolating sesqui-harmonic maps on compact manifolds.

A family of interpolating graphs $\calC (S, ξ)$ of complexity ξξ is constructed for a surface SS and 2ξξ(S)-2 \leq ξ\leq ξ(S). For ξ=2,1,ξ(S)1ξ= -2, -1, ξ(S) -1 these specialise to graphs quasi-isometric to the marking graph, the pants graph and the curve graph respectively. We generalise Theorems of Brock-Farb and Behrstock-Mins…

2007-06-19abs ↗pdf ↗

We extend to any simply connected Kähler manifold with non-positive sectional curvature some conditions for interpolation in C\mathbb{C} and in the unit disk given by Berndtsson, Ortega-Cerdà and Seip. The main tool is a comparison theorem for the Hessian in Kähler geometry due to Greene, Wu and Siu, Yau.

2001-03-07abs ↗pdf ↗

The abstract proves the existence of CMC-1 surfaces with any complex structure in hyperbolic space.

problem Proving the existence of CMC-1 surfaces with arbitrary complex structures in hyperbolic space.
method Using a jet interpolation theorem and a uniform approximation theorem for holomorphic null curves.
result Existence of complete densely immersed CMC-1 surfaces in hyperbolic space with arbitrary complex structure.

In this article, a proof of the interpolation inequality along geodesics in pp-Wasserstein spaces is given. This interpolation inequality was the main ingredient to prove the Borel-Brascamp-Lieb inequality for general Riemannian and Finsler manifolds and led Lott-Villani and Sturm to define an abstract Ricci curvature…

2013-11-21abs ↗pdf ↗

The spectral flow theorem is applied to operators on finite intervals.

problem Operators on finite intervals without boundary conditions are not Fredholm.
method Interpolation theory is used to define boundary conditions making the operators Fredholm. The spectral flow theorem is applied to find the Fredholm index.
result The Fredholm index is given by the spectral flow of the operator path.

The abstract discusses families of holomorphic maps to Oka manifolds with approximation theorems.

problem Approximating \(J_b\)-holomorphic maps to Oka manifolds.
method Constructing continuous or smooth families of \(J_b\)-holomorphic maps to Oka manifolds with approximation on compact Runge sets.
result Runge and Mergelyan approximation theorems and Weierstrass interpolation theorem for families of open Riemann surfaces.

Randomly sampled interpolators achieve zero generalization error with enough data.

problem Understanding the high generalization ability of machine learning models.
method Algebraic geometry tools to prove zero generalization error for random interpolators.
result Generalization error of randomly sampled interpolators becomes zero once the number of training samples exceeds a geometric threshold.

In this paper, we prove a uniform approximation theorem with interpolation for complete conformal minimal surfaces with finite total curvature in the Euclidean space Rn\mathbb{R}^n (n3)(n\ge 3). As application, we obtain a Mittag-Leffler type theorem for complete conformal minimal immersions MRnM\to\mathbb{R}^n on any ope…

2019-06-05abs ↗pdf ↗

GNNs outperform NNs in interpolating bandlimited functions on Euclidean cubes.

problem Interpolating bandlimited functions on Euclidean cubes using GNNs vs. NNs.
method Investigates optimal GNN configurations and weights for function interpolation.
result GNNs require fewer weights and samples to interpolate bandlimited functions compared to NNs.

Unified framework explains why overfitting is benign in interpolating learning.

problem Understanding why overfitting is benign in highly overparameterized models.
method Spectral-transport stability framework.
result Sharp benign-overfitting criterion and explicit phase-transition rates.

The paper improves stability estimates for soap bubble theorem in curved domains.

problem Stability estimates for the Soap Bubble Theorem in curved domains.
method Leveraging Gagliardo-Nirenberg-type interpolation inequalities.
result Optimal stability estimates for LrL^r deviations of mean curvature from being constant.

Proves approximation and interpolation for regular immersions directed by algebraically elliptic cones.

problem Approximation and interpolation for regular immersions directed by algebraically elliptic cones.
method Uses homotopy-theoretic necessary and sufficient conditions for approximation and interpolation.
result Homotopy-theoretic conditions for approximation and interpolation are satisfied in many cases of interest.

The null energy condition is characterized via convexity of entropy in Lorentzian manifolds.

problem Characterizing the null energy condition in Lorentzian manifolds.
method Characterization via convexity of the relative entropy along displacement interpolations on null hypersurfaces.
result The null energy condition is characterized in terms of convexity of the relative entropy.

The study establishes comparison theorems for weighted Finsler manifolds and spacetimes.

problem Analyzing weighted Finsler manifolds and spacetimes with curvature conditions.
method Using weight function and εε-range, the Bonnet-Myers theorem, Laplacian comparison theorem, and Bishop-Gromov volume comparison theorem are formulated.
result New comparison theorems for weighted Finsler manifolds and spacetimes are derived, including those for weighted Riemannian manifolds.

We investigate the properties of multidimensional probability distributions in the context of latent space prior distributions of implicit generative models. Our work revolves around the phenomena arising while decoding linear interpolations between two random latent vectors -- regions of latent space in close proximit…

2018-06-05abs ↗pdf ↗

We prove comparison theorems for the sub-Riemannian distortion coefficients appearing in interpolation inequalities. These results, which are equivalent to a sub-Laplacian comparison theorem for the sub-Riemannian distance, are obtained by introducing a suitable notion of sub-Riemannian Bakry-Émery curvature. The model…

2019-06-19abs ↗pdf ↗

Gromov has shown how to construct holomorphic maps of the plane to a complex manifold with prescribed values on a lattice. In the present paper, a similar interpolation theorem for pseudo-holomorphic maps from the cylinder S to an almost-complex manifold (M,J) is proved. Properties of the space of pseudo-holomorphic ma…

2010-06-09abs ↗pdf ↗

Let (M.F) be a complete Finsler manifold and P be a minimal and compact submanifold of M. Ric_k(x), x in M is a differential invariant that interpolates between the flag curvature and the Ricci curvature. We prove that if on any geodesic c(t) emanating orthogonally from P we have \int_{0}^{\infty}\mathbf{Ric}_{k}(t)>0,…

2013-04-10abs ↗pdf ↗

This paper shows how forward rate interpolations are equivalent to discount factor interpolations in yield curve construction.

problem The challenge of choosing between different interpolation methods for yield curve construction.
method Demonstrates the equivalence between forward rate interpolations and discount factor interpolations.
result Some popular interpolation methods on forward rates are equivalent to classical interpolation methods on discount factors.

Let MM be an open Riemann surface and let ΛMΛ\subset M be a closed discrete subset. In this paper, we prove the existence of complete conformal minimal immersions MRnM\to\mathbb{R}^n, n3n\ge 3, with prescribed values on ΛΛ and whose generalized Gauss map MCPn1M\to\mathbb{CP}^{n-1}, n3n\ge 3, avoids nn hyperplanes of $\m…

2019-12-28abs ↗pdf ↗

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the linear span of the data points. This is at the core of kernel methods in machine learning as it makes…

2018-09-26abs ↗pdf ↗

The paper proposes a method for generating uniform interpolations on data manifolds.

problem Generating high-quality interpolations between data samples on complex manifolds.
method Autoencoder network with interpolation network, regularized by a Riemannian metric.
result The method generates interpolations that remain within the manifold's distribution.

Kolmogorov-Arnold Networks promise scalable performance in high dimensions.

problem Curse of dimensionality in multilayer perceptrons.
method Kolmogorov-Arnold representation theorem and interpolation methods.
result Kolmogorov-Arnold Networks achieve true freedom from the curse of dimensionality.

The paper develops theory for holomorphic null curves in SL2(C).

problem Developing theory for holomorphic null curves in SL2(C).
method Establish Runge, Mergelyan, Mittag-Leffler, and Carleman type theorems for holomorphic null immersions.
result Proves every open Riemann surface admits a proper holomorphic null embedding into SL2(C).

Near-interpolating models grow norms quickly, affecting generalization.

problem Understanding the trade-off between interpolation and generalization in near-interpolating models.
method Random matrix theory and eigendecay analysis of data covariance matrix.
result Near-interpolating models exhibit rapid norm growth and worse generalization trade-offs.

Critical points of scale-invariant curvature energies in 4D are analytic.

problem Analyzing critical points of curvature energies in 4D manifolds.
method Applying Noether's theorem to identify conservation laws and lower order elliptic system of PDEs, then using integrability by compensation and interpolation theory.
result Critical points of scale-invariant curvature energies in 4D are analytic.

Deep neural networks can interpolate any dataset in the overparametrized regime.

problem Interpolating any dataset with deep neural networks in the overparametrized regime.
method Proving universal approximations and interpolating any dataset with deep neural networks, considering specific conditions on activation functions.
result Interpolation of any dataset is possible in the overparametrized regime with deep neural networks.

SoftKI combines SKI and variational methods for scalable GP regression.

problem Scalable Gaussian Process regression on high-dimensional datasets.
method SoftKI approximates kernel via softmax interpolation from a smaller number of learned points.
result SoftKI is competitive with other approximated GP methods for modest data dimensions.