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

178356534712 · Jun 202019922001200920172026
48 results for finite dimensional approximation

We show in this note that the Sobolev Discrepancy introduced in Mroueh et al in the context of generative adversarial networks, is actually the weighted negative Sobolev norm .H˙1(νq)||.||_{\dot{H}^{-1}(ν_q)}, that is known to linearize the Wasserstein W2W_2 distance and plays a fundamental role in the dynamic formulation of…

2018-05-16abs ↗pdf ↗

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 ↗

We propose a method for pricing American options whose pay-off depends on the moving average of the underlying asset price. The method uses a finite dimensional approximation of the infinite-dimensional dynamics of the moving average process based on a truncated Laguerre series expansion. The resulting problem is a fin…

2010-11-16abs ↗pdf ↗

New method for finite approximations improves inference efficiency and applicability.

problem Challenges in Bayesian nonparametric inference due to infinite dimensionality.
method Automated Independent Finite Approximation (AIFA) for finite-dimensional approximations of CRMs and NCRMs.
result AIFA provides more efficient and straightforward derivations and parallel computing compared to Truncated Finite Approximations (TFAs).

Generalizes neural networks for infinite-dimensional mappings, including PDE solutions.

problem Learning mappings between infinite-dimensional spaces and finite-dimensional approximations.
method Graph kernel network architecture with message passing for kernel integration.
result Competitive performance compared to state-of-the-art solvers for PDEs.

Investigates the impact of finite VC dimension on neural network approximation and learning.

problem The influence of VC dimension on neural network approximation and learning from samples.
method Analysis of high-dimensional geometry and statistical learning theory, focusing on VC dimension.
result Finite VC dimension is beneficial for uniform convergence of empirical errors but not for approximation of functions from a probability distribution.

Study Gaussian approximation for deep neural networks with random weights.

problem Understanding the distribution of deep neural networks with random weights.
method Established Gaussian approximation bounds in Wasserstein-1 norm.
result Convergence rates of order n(1/6)L1+εn^{-({1}/{6})^{L-1} + ε} for deep networks with proportional layer widths.

We develop a new theoretical framework to analyze the generalization error of deep learning, and derive a new fast learning rate for two representative algorithms: empirical risk minimization and Bayesian deep learning. The series of theoretical analyses of deep learning has revealed its high expressive power and unive…

2017-05-29abs ↗pdf ↗

We show that the Kuratowski imbedding of a Riemannian manifold in L^\infty, exploited in Gromov's proof of the systolic inequality for essential manifolds, admits an approximation by a (1+C)-bi-Lipschitz (onto its image), finite-dimensional imbedding for every C>0. Our key tool is the first variation formula thought of…

2009-02-18abs ↗pdf ↗

We show that finite-width deep ReLU neural networks yield rate-distortion optimal approximation (Bölcskei et al., 2018) of polynomials, windowed sinusoidal functions, one-dimensional oscillatory textures, and the Weierstrass function, a fractal function which is continuous but nowhere differentiable. Together with thei…

2018-06-05abs ↗pdf ↗

The paper introduces Causal Neural Operators to approximate operators in stochastic analysis.

problem Leveraging temporal structure in non-linear operators for deep learning models.
method Designing a deep learning model framework for infinite-dimensional linear metric spaces.
result Causal Neural Operators can uniformly approximate Hölder or smooth trace class operators.

Let M be a compact Riemannian manifold without boundary and let H be a self-adjoint generalized Laplace operator acting on sections in a bundle over M. We give a path integral formula for the solution to the corresponding heat equation. This is based on approximating path space by finite dimensional spaces of geodesic …

2007-03-09abs ↗pdf ↗

This study approximates distances between Gaussian processes and covariance operators using RKHS.

problem Approximating distances between Gaussian processes and covariance operators from finite samples.
method Using reproducing kernel Hilbert space (RKHS) covariance and cross-covariance operators, the study shows how to consistently and efficiently estimate Sinkhorn divergence from finite samples.
result Convergence rates are dimension-independent and of the same order as Hilbert-Schmidt distance.

Infinite-dimensional SBDMs improve image generation across multiple resolutions.

problem Efficient image generation at high resolutions and across different levels.
method Developed SBDMs in infinite-dimensional setting, using trace class operators and operator networks.
result Improved efficiency and generalization across resolution levels.

New algorithms improve GP inference without approximations, achieving better results.

problem Inexact stochastic optimization methods in Gaussian Processes leading to biased results.
method Exact stochastic inference for GPs with finite dimensional RKHS, extending to infinite dimensions.
result Achieves better experimental results than existing methods in constrained resource settings.

Novel autoencoder method approximates Koopman operator in low dimensions.

problem Challenges in approximating finite Koopman operators using data-driven methods.
method Mori-Zwanzig autoencoder (MZ-AE) for robust Koopman operator approximation.
result Improved predictive capability and robust long-term statistical performance.

GANs learn distributions well from samples, with rates depending on intrinsic dimension.

problem Learning distributions from samples using GANs.
method Oracle inequality, Hölder functions approximation, neural network approximation, integral probability metrics.
result Convergence rates of GANs depend on intrinsic dimension, not ambient dimension.

Paper introduces FNM framework for learning finite-dimensional parametrized models.

problem Efficiently learning finite-dimensional parametrized models from limited data.
method Fourier Neural Mappings (FNMs) framework for operator learning.
result End-to-end learning of PtO maps can be less data-efficient than learning the solution operator first.

High-dimensional models trained on smooth manifolds achieve optimal rates in Wasserstein metrics.

problem Training score-based generative models on complex, low-dimensional manifolds.
method Proves optimal rates for SGMs on smooth manifolds, separating into noise regimes and using ReLU nearest-projection coordinates.
result Optimal intrinsic Wasserstein rates are achieved, with polynomial ambient dependence for families with controlled geometry and density.

This is an expository paper about Seiberg-Witten Floer stable homotopy types. We outline their construction, which is based on the Conley index and finite dimensional approximation. We then describe several applications, including the disproof of the high-dimensional triangulation conjecture.

2013-08-29abs ↗pdf ↗

We study a moduli space of ASD connections over S3×RS^3\times \mathbb{R}. We consider not only finite energy ASD connections but also infinite energy ones. So the moduli space is infinite dimensional in general. We study the (local) mean dimension of this infinite dimensional moduli space. We show the upper bound on the …

2009-09-07abs ↗pdf ↗

Transformers approximate mean-field dynamics of indistinguishable particles.

problem Approximating the dynamics of indistinguishable particles in complex systems.
method Using transformers to model the mean-field dynamics of interacting particle systems.
result Theoretical bounds on the distance between true and transformer-obtained mean-field dynamics.

The space of positively curved hermitian metrics on a positive holomorphic line bundle over a compact complex manifold is an infinite-dimensional symmetric space. It is shown by Phong and Sturm that geodesics in this space can be uniformly approximated by geodesics in the finite dimensional spaces of Bergman metrics. W…

2007-03-17abs ↗pdf ↗

The paper approximates Levi-Civita connection and curvature on 2D manifolds using finite elements.

problem Approximating Levi-Civita connection and curvature on 2D manifolds with finite elements.
method Using Regge finite elements, piecewise polynomial symmetric (0,2)-tensor fields, and distributional sense for non-regular tensors.
result Distributional quantities converge to their smooth counterparts under refinement of triangulation.

Detect changes in noisy dynamical systems using empirical approximations and finite-sample bounds.

problem Change detection in noisy dynamical systems
method Partition-based empirical approximations and finite-state stationary distribution stability
result Finite-sample bound for empirical stationary density

The paper provides guarantees for high-dimensional DML estimators in observational studies.

problem Estimating treatment effects in observational settings with many covariates.
method Debiased machine learning (DML) with finite-sample guarantees.
result Bounding the deviation of finite-sample distribution from asymptotic Gaussian approximation.

Proves a formula for a special invariant of 4-manifolds.

problem Calculating the Bauer-Furuta invariant for connected sums of 4-manifolds.
method Uses a finite dimensional approximation of the Seiberg-Witten monopole map to derive a formula for the families Bauer-Furuta invariant of a fibrewise connected sum.
result Derives a general connected sum formula for the families Bauer-Furuta invariant.

New learning rule for quantum measurement classes overcomes uniform convergence issues.

problem Characterizing learnability of POVM hypothesis classes in quantum settings.
method Introduced a new learning rule called denoised ERM to address uniform convergence issues.
result Characterized learnability conditions and sample complexity bounds for POVM classes.

New RBF networks can approximate any continuous function.

problem Approximating any continuous function on a compact subset.
method Replacing smoothing factors with shifts in RBF networks and proving approximation under certain conditions.
result RBF networks can approximate any continuous function on any compact subset.

The isometry group of a compact n-dimensional hyperbolic manifold is known to be finite. We show that for every n > 2, every finite group is realized as the full isometry group of some compact hyperbolic n-manifold. The cases n = 2 and n = 3 have been proven by Greenberg and Kojima, respectively. Our proof is non const…

2004-06-29abs ↗pdf ↗