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

Trend · papers per month

105209314418 · Jun 202019922001200920172026
48 results for Approximation 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.

The paper proves deep neural networks with analytic activation can approximate any function.

problem Approximating functions with neural networks using analytic activation functions.
method Elementary proofs for real and complex networks, Stone-Weierstrass theorem, Mergelyan's theorem.
result Closure of neural network classes equals space of polynomials for analytic activation.

It was pointed out to us that the proof of a crucial lemma (Lemma 5.3) in the paper is incorrect. Thus the approximation theorem (Theorem 0.1) for L^2 torsion of an amenable covering of a finite simplicial complex remains unproved. However, results and proofs of the first four sections (in particular, the approximation…

2000-08-28abs ↗pdf ↗

Proves theorem for Riemannian manifolds, extending previous work.

problem Proving Quantitative Fatou Theorem on Riemannian manifolds.
method Extending ε-approximation lemma to manifold setting.
result Proves Quantitative Fatou Theorem for Lipschitz domains on Riemannian manifolds.

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.

Universal approximation for stochastic processes using Brownian motion.

problem Approximating stochastic processes with linear functionals.
method Establishing LpL^p-type universal approximation theorems for rough path spaces.
result Linear functionals on the signature of time-extended Brownian motion can approximate any pp-integrable stochastic process.

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.

Paper improves CLT and bootstrap approximations for LSA with decreasing step size.

problem Improving normal approximation and bootstrap methods for LSA with decreasing step sizes.
method Refined Berry-Esseen bounds and multiplier bootstrap procedure for LSA.
result Approximation rates up to 1/n1/\sqrt{n} for LSA rescaled error distribution.

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.

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 ↗

DQNs can approximate optimal Q-functions with high accuracy on compact sets.

problem Approximating optimal Q-functions in continuous-time Markov Decision Processes.
method Stochastic control, FBSDEs, residual network approximation theorems, large deviation bounds, viscosity solutions.
result DQNs can approximate optimal Q-functions on compact sets with arbitrary accuracy and high probability.

In this paper we study the problem of approximation of the L2L^2-topological invariants by their finite dimensional analogues. We obtain generalizations of the theorem of Lück, dealing with towers of finitely sheeted normal coverings. We prove approximation theorems, establishing relations between the homological invar…

1997-03-21abs ↗pdf ↗

Skeleta and other pure subsets of manifold stratified spaces are shown to have neighborhoods which are teardrops of stratified approximate fibrations (under dimension and compactness assumptions). In general, the stratified approximate fibrations cannot be replaced by bundles, and the teardrops cannot be replaced by ma…

2005-01-07abs ↗pdf ↗

The paper extends a theorem to number fields without infinite places.

problem Finiteness properties of arithmetic approximate lattices.
method Geometric and homological finiteness properties for countable approximate groups.
result The finiteness length is finite and can be computed explicitly.

TVS-FNNs can approximate any continuous function on expanded input spaces.

problem Processing a broader range of inputs like sequences and matrices.
method Proving a universal approximation theorem for TVS-FNNs.
result TVS-FNNs can approximate any continuous function on expanded input spaces.

These short lecture notes provide a brief introduction to the field of homology growth. They are composed out of two lectures, which I have given at the Borel seminar 2017 in Les Diablerets. We give a proof of Lück's approximation theorem, discuss generalizations and mention some related open problems. Then we discuss …

2017-09-03abs ↗pdf ↗

New geometric proof of convex function differentiability and approximation.

problem Second-order differentiability of convex functions and their approximations.
method Elementary geometric approach to prove classical and recent results.
result New proofs of Lusin approximation of convex functions and bodies by C1,1C^{1,1} functions.

This paper improves deep neural network approximation for fully connected networks, achieving optimal convergence rates.

problem Improving approximation of fully connected deep neural networks for optimal convergence rates.
method Deriving approximation bounds specifically for a narrower fully connected deep neural network.
result Achieves an optimal rate (up to a logarithmic factor) for fully connected deep neural networks.

The paper analyzes deep ReLU CNNs' approximation properties in 2D space.

problem Establishing L2L^2 approximation properties for deep ReLU CNNs.
method Analysis based on decomposition theorem for convolutional kernels, properties of ReLU activation, and connections with one-hidden-layer ReLU NNs.
result Universal approximation theorem for deep ReLU CNNs with classic structure.

Although stochastic approximation learning methods have been widely used in the machine learning literature for over 50 years, formal theoretical analyses of specific machine learning algorithms are less common because stochastic approximation theorems typically possess assumptions which are difficult to communicate an…

2014-12-18abs ↗pdf ↗

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.

This work provides closed-form solutions and minimum achievable errors for a large class of low-rank approximation problems in Hilbert spaces. The proposed theorem generalizes to the case of bounded linear operators the previous results obtained in the finite dimensional case for the Frobenius norm. The theorem provide…

2018-12-21abs ↗pdf ↗

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

Functional input neural networks approximate continuous functions on weighted spaces.

problem Approximating continuous functions on infinite-dimensional weighted spaces.
method Additive family mapping, non-linear activation, linear readouts, Stone-Weierstrass theorem.
result Global universal approximation of continuous functions on weighted spaces.

In this paper, we prove a Donsker type approximation theorem for the Rosenblatt process, which is a selfsimilar stochastic process exhibiting long range dependence. By using numerical results and simulated data, we show that this approximation performs very well. We use this result to construct a binary market model dr…

2007-03-03abs ↗pdf ↗

Improves Laplace approximation for Bayesian inference on Riemannian manifolds.

problem Inaccurate Gaussian approximations for complex targets and finite-data posteriors.
method Develops alternative variants of the Laplace approximation using a Riemannian metric.
result Exact approximations at the limit of infinite data, improving practical performance.

Complex-valued neural networks can approximate any continuous function.

problem Generalizing the universal approximation theorem to complex-valued networks.
method Characterizing activation functions for complex networks to approximate any continuous function.
result Different activation functions are required for deep vs shallow complex networks to achieve universal approximation.

Real analytic maps can be unstable even if infinitesimal changes are stable.

problem Unstability of real analytic maps despite infinitesimal stability.
method Used a relative version of Whitney's Analytic Approximation Theorem and H. Cartan's Theorems A and B.
result Infinitesimal CωC^{\omega} stability does not imply CωC^{\omega} stability.

NODEs can approximate a wide range of diffeomorphisms with strong guarantees.

problem The approximation power of NODEs under certain conditions.
method Leveraging a structure theorem of the diffeomorphism group.
result NODEs can approximate a large class of diffeomorphisms with a stronger guarantee.

This is an introductory text on the more topological aspects of contact geometry, written for the Handbook of Differential Geometry vol. 2. After discussing (and proving) some of the fundamental results of contact topology (neighbourhood theorems, isotopy extension theorems, approximation theorems), I move on to a deta…

2003-07-17abs ↗pdf ↗