In this article, we prove energy quantization for approximate (intrinsic and extrinsic) biharmonic maps into spheres where the approximate map is in . Moreover, we demonstrate that if the norm of the approximate maps does not concentrate, the image of the bubbles are connected without necks.
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,922 papers · 148 categories
Trend · papers per month
48 results for “approximate mapping”
Unified method for CNNs to approximate equivariant maps across various groups.
problem Limited universal approximation theorems for CNNs with specific groups and settings.
method Unified approach to derive universal approximation theorems for equivariant maps by CNNs in diverse settings.
result Ability to handle non-linear equivariant maps between infinite-dimensional spaces for non-compact groups.
Universal approximation theorem for differentiable maps on infinite-dimensional manifolds
problem Approximation of differentiable maps on infinite-dimensional manifolds
method Weighted universal approximation theorem
result Universal approximation theorem for differentiable maps
Method computes harmonic and conformal maps from point clouds.
problem Computing maps from irregular point cloud data.
method Meshless method using cubic lattice approximations.
result Harmonic and conformal maps computed accurately.
Paper approximates fractional harmonic maps with numerical methods.
problem Approximating fractional harmonic maps with constraints and nonlocality.
method Weak compactness results and numerical methods for various PDEs.
result Convergence of numerical approximations for fractional harmonic maps.
TCNs can approximate complex input-output maps with limited memory.
problem Approximating complex input-output maps with limited memory.
method Proved TCNs can approximate a wide class of input-output maps with arbitrary error tolerance.
result Deep ReLU TCNs can approximate input-output maps with finite memory to arbitrary error.
Generalizes neural network approximation to infinite-dimensional manifolds and derivatives.
problem Approximating differentiable maps on infinite-dimensional manifolds.
method Proves a weighted Nachbin theorem to establish universal approximation for differentiable maps, including derivatives.
result Linear functions of the signature can approximate path space functionals including their derivatives.
Kernel approximation via nonlinear random feature maps is widely used in speeding up kernel machines. There are two main challenges for the conventional kernel approximation methods. First, before performing kernel approximation, a good kernel has to be chosen. Picking a good kernel is a very challenging problem in its…
Recently, some works have suggested methods to combine variational probabilistic inference with Monte Carlo sampling. One promising approach is via local optimal transport. In this approach, a gradient steepest descent method based on local optimal transport principles is formulated to transform deterministically point…
The paper shows how to approximate continuous maps to smooth CW complexes.
problem Approximating continuous maps to smooth CW complexes.
method Whitney Approximation Theorem for continuous maps to smooth CW complexes.
result Topological CW complexes are homotopy equivalent to smooth CW complexes.
Deep learning networks are approximated using dynamical systems theory.
problem Understanding the approximation capabilities of deep learning networks.
method Modeling deep residual networks as continuous-time dynamical systems and using approximation theories in .
result Established general sufficient conditions for universal approximation of deep residual networks.
This paper proves neural networks can approximate any infinite-dimensional map with uniform guarantees.
problem Universal approximation of infinite-dimensional maps by neural networks with uniform guarantees.
method Analysis of various infinite analogues of neural networks and their approximation capabilities.
result Any continuous map can be approximated arbitrarily closely by some infinite neural networks with mild topological conditions.
We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. Theorem. Let S be a triangulation of a circle with s vertices. Let f be a simplicial map of the graph S to the plane. The map f is approximab…
We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie and Weiss to study the difference between it and its linear and quadratic approxi…
DMPS uses diffusion maps and LAWGD for efficient generative modeling.
problem Efficiently modeling complex data distributions.
method Diffusion maps for manifold learning and LAWGD for sampling.
result DMPS outperforms other methods on moderate-dimensional data.
A fast and practical method for learning transport maps.
problem Slow and computationally expensive methods for learning transport maps.
method Approximated transport mapping using Gaussian (Bures-Wasserstein) transport and local transport plans.
result Significantly faster and more efficient than existing methods.
This paper uses normalizing flows to approximate transport maps between densities.
problem Approximating transport maps between given densities.
method Construct time-dependent controls using normalizing flows.
result Provides bounds on the number of switches for piecewise constant approximations.
The paper defines approximate fibrations in higher topos theory.
problem Defining approximate fibrations in a new mathematical framework.
method Introducing approximate fibrations for geometric morphisms of -topoi, providing characterizations and comparing to previous definitions.
result Generalization of shape-theoretic characterizations to a topos-theoretical proof.
Paper establishes rates of universal approximation for neural tangent kernels using transport mappings.
problem Universal approximation for neural tangent kernels with microscopic weight changes.
method Generic scheme to approximate functions with NTK using transport mappings, constructed via Fourier transforms.
result Approximation of continuous functions with roughly 1 / δ^(10d) nodes, where δ depends on function continuity.
A new method reduces dimensionality for better likelihood-free parameter estimation.
problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.
We prove the energy identity for min-max sequences of the Sacks-Uhlenbeck and the biharmonic approximation of harmonic maps from surfaces into general target manifolds. The proof relies on Hopf-differential type estimates for the two approximations and on estimates for the concentration radius of bubbles.
Riemannian stochastic gradient descent approximates a diffusion process called Riemannian stochastic modified flow.
problem Improving convergence rate of Riemannian stochastic gradient descent.
method Using stochastic differential geometry, the paper shows RSGD can be approximated by the Riemannian stochastic modified flow (RSMF).
result RSGD can be approximated by the solution to the RSMF driven by an infinite-dimensional Wiener process, increasing the order of approximation.
Compact Random Feature Mapsstat.ML
Kernel approximation using randomized feature maps has recently gained a lot of interest. In this work, we identify that previous approaches for polynomial kernel approximation create maps that are rank deficient, and therefore do not utilize the capacity of the projected feature space effectively. To address this chal…
Study approximates top Lyapunov exponents for surface mapping classes.
problem Approximating topological Lyapunov exponents for surface mapping classes.
method Periodic approximation and joint spectral radius extension.
result Top Lyapunov exponents can be approximated by periodic orbits.
Limits of -harmonic mapsmath.DG
Critical points of approximations of the Dirichlet energy à la Sacks-Uhlenbeck are known to converge to harmonic maps in a suitable sense. However, we show that not every harmonic map can be approximated by critical points of such perturbed energies. Indeed, we prove that constant maps and the rotations of are th…
For the class of approximate harmonic maps from a closed Riemmanian surface to a compact Riemannian manifold , we show that (i) the so-called energy identity holds for weakly convergent approximate harmonic maps , with tension fields bounded in the Morrey spa…
We generalize the results of Song-Zelditch on geodesics in spaces of Kahler metrics on toric varieties to harmonic maps of any compact Riemannian manifold with boundary into the space of Kahler metrics on a toric variety. We show that the harmonic map equation can always be solved and that such maps may be approximated…
The aim of this note is to extend the results in arXiv:1504.02043 to the case of approximate harmonic maps. More precisely, we will proved that the singular strata of an approximate harmonic map are k-rectifiable, and we will show effect bounds on the quantitative strata. In the process we will simplify many o…
Quantum machine learning models can approximate any continuous function.
problem Theoretical understanding of quantum feature maps in machine learning.
method Proving universal approximation property of quantum machine learning models in quantum-enhanced feature spaces.
result Quantum machine learning models are universal approximators of continuous functions.
Geometric Gaussian approximations capture any distribution.
problem Approximating complex probability distributions.
method Geometric Gaussian approximations through diffeomorphisms or exponential maps.
result Geometric Gaussian approximations are universal, capturing any distribution.
LazyDINO efficiently solves high-dimensional Bayesian inverse problems with fast and scalable solutions.
problem High-dimensional nonlinear Bayesian inverse problems with expensive parameter-to-observable maps.
method LazyDINO combines derivative-informed neural surrogates and lazy map variational inference for efficient posterior approximation.
result Significant cost reduction in amortized Bayesian inversion, achieving one to two orders of magnitude improvement.
New method for optimizing complex composite functions with reduced variance.
problem Optimizing multi-level composite functions with nested random and smooth mappings.
method Normalized proximal approximate gradient (NPAG) method with nested stochastic variance reduction.
result Total sample complexity of in expectation and in finite-sum cases.
There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types of principal curves and principal trees, and so on. For each type of approximator…
Develops neural network approximations for infinite-dimensional input-output maps.
problem Approximating input-output maps between infinite-dimensional spaces.
method Combines neural networks and model reduction techniques.
result Proves convergence of the proposed approximation methodology.
We consider the problem of improving kernel approximation via randomized feature maps. These maps arise as Monte Carlo approximation to integral representations of kernel functions and scale up kernel methods for larger datasets. Based on an efficient numerical integration technique, we propose a unifying approach that…
Random feature model approximates PDE solutions efficiently.
problem Approximating solutions to PDEs with high-dimensional inputs and outputs.
method Random feature model applied to infinite-dimensional operators.
result Efficient and accurate approximation of PDE solutions.
We consider in dimension four weakly convergent sequences of approximate biharmonic maps to a Riemannian manifold with bi-tension fields bounded in for . We prove an energy identity that accounts for the loss of hessian energies by the sum of hessian energies over finitely many nontrivial biharmonic ma…
New analysis of stochastic approximation with non-expansive mappings.
problem Finite-time analysis of two-time-scale stochastic approximation with non-expansive mappings.
method Studied two-time-scale stochastic approximation algorithms with non-expansive mappings and projection steps.
result Last-iterate mean square residual error decays at a rate .
Smoothly embed maps with controlled curvature errors.
problem Approximating short maps with smooth isometric immersions.
method δ-approximation of strictly short maps to C^∞-smooth isometric immersions with controlled curvature.
result Achieve isometric immersions with controlled curvature errors.
Machine learning models emulate and approximate complex mappings in model physics.
problem Developing and ensuring accurate physical parameterizations.
method Machine learning tools to emulate and approximate mappings.
result ML can improve parameterizations and enforce physical constraints.
Paper develops polynomial approximations for complex probability densities.
problem Approximating high-dimensional concentrated probability densities.
method Tensor-product spectral polynomials and KR rearrangements.
result Efficient approximation of complex densities using composite maps.
Discrete approximation solves Björling's minimal surface problem.
problem Constructing minimal surfaces from real-analytic curves with specified normal fields.
method Approximate solution by discrete minimal surfaces and discrete isothermic surfaces.
result Approximation error is proportional to the square of the mesh size.
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.
Study topological quantum mechanics on orbifolds with geometric interpretation.
problem Quantum mechanical models on symplectic orbifolds.
method Explicit orbifold version of quantum HKR map and exact semi-classical approximation.
result Geometric and quantum field theoretic interpretation of orbifold algebraic index.
A new diffusion method approximates Schrödinger bridge with improved convergence.
problem Approximating Schrödinger bridge with Langevin diffusion.
method Leveraging Langevin diffusion to approximate Schrödinger bridge.
result The difference between the two approximations is proportional to the score function.
New method uses SoS densities and α-divergences for efficient sequential transport maps.
problem Efficiently generating samples from approximated densities.
method Sequential transport maps using Sum-of-Squares (SoS) densities and α-divergences.
result Convex optimization problems with efficient semidefinite programming solutions.
Study shows only rotations can be approximated by Ginzburg-Landau critical points.
problem Proving not all harmonic maps can be approximated by Ginzburg-Landau critical points.
method Rigidity theorem applied to Ginzburg-Landau energy critical points.
result Only rotations can be approximated by Ginzburg-Landau critical points.
Approximation of conformal mappings and novel applications to shape recognition of planar domainsmath.DG
Our goal is to provide a novel method of representing 2D shapes, where each shape will be assigned a unique fingerprint - a computable approximation to a conformal map of the given shape to a canonical shape in 2D or 3D space (see page 22 for a few examples). In this paper, we make the first significant step in this pr…