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.

169,042 papers · 148 categories

Trend · papers per month

166332497663 · Jun 202019922001200920172026
48 results for local manifold approximation

The study provides conditions for approximating Riemannian manifolds with polyhedral metrics.

problem Approximating Riemannian manifolds with polyhedral metrics.
method Conditions on curvature tensors for Lipschitz and local polyhedral approximations.
result Conditions are sufficient for local polyhedral approximations, conjectured to be sufficient for global approximations.

Locally approximating groups of homeomorphisms reveal manifold properties.

problem Understanding the structure and properties of homeomorphism groups on manifolds.
method Analyzing dense subgroups in Euclidean charts and interpreting first-order arithmetic.
result Locally approximating groups of homeomorphisms uniquely determine manifold properties.

In statistical dimensionality reduction, it is common to rely on the assumption that high dimensional data tend to concentrate near a lower dimensional manifold. There is a rich literature on approximating the unknown manifold, and on exploiting such approximations in clustering, data compression, and prediction. Most …

2017-06-26abs ↗pdf ↗

Directly approximates functions on unknown data manifolds without complex computations.

problem Function approximation on unknown data-defined manifolds with conservative results from traditional methods.
method Direct approach using graph Laplacian and local approximation techniques without eigen-decomposition or atlas.
result Universal estimates for smooth functions without prior knowledge of the target function.

The paper introduces a method for dimension reduction using sub-Riemannian geometry.

problem Dimension reduction for manifold learning and surface reconstruction.
method Combining local linear approximations of a point cloud to obtain lower dimensional bundles.
result Sub-Riemannian geodesics can successfully be applied to problems like constructing an approximating submanifold and computing distances.

Paper studies Transformer learning theory for Euclidean and Riemannian domains.

problem Understanding and optimizing Transformer networks for regression tasks.
method Constructive approximation framework using softmax partition of unity and attention mechanism.
result Transformer can achieve uniform ε-approximation error with minimal parameters.

This paper introduces a new method for semi-supervised learning on high dimensional nonlinear manifolds, which includes a phase of unsupervised basis learning and a phase of supervised function learning. The learned bases provide a set of anchor points to form a local coordinate system, such that each data point xx on…

2009-06-29abs ↗pdf ↗

Improved bounds for function approximation in nonlinear sets.

problem Achieving high probability error with limited samples in nonlinear function approximation.
method Restricting model class to a neighbourhood of the best approximation and estimating sample complexity using tangent and normal spaces' complexities and curvature.
result Improved worst-case bounds for sample complexity in more general sets like tensor networks and neural networks.

The paper projects unknown manifolds onto hyperspheres for efficient function approximation.

problem Function approximation from data on unknown manifolds with added errors.
method Projects unknown manifold onto hypersphere and uses localized spherical polynomial kernels.
result Optimal rates of approximation for rough functions are given.

The paper explores transferring functions from one data space to another.

problem Approximating a function on a new data set using a learned function from an old data set.
method Transfer learning from one data space to another, focusing on subsets of the target data space.
result Local smoothness of the function and its lifting are related.

We study generalized complex manifolds from the point of view of symplectic and Poisson geometry. We start by showing that every generalized complex manifold admits a canonical Poisson structure. We use this fact, together with Weinstein's classical result on the local normal form of Poisson manifolds, to prove a local…

2004-12-04abs ↗pdf ↗

Piecewise flat approximations for curvature in Euclidean and non-Euclidean spaces.

problem Approximating local extrinsic curvature on discrete manifolds.
method Constructing discrete curvature forms on piecewise flat manifolds, using weighted sums of hinge angles.
result Converges to smooth curvature values as mesh refinement occurs, favorably comparing with other discrete approaches.

In order to avoid the curse of dimensionality, frequently encountered in Big Data analysis, there was a vast development in the field of linear and nonlinear dimension reduction techniques in recent years. These techniques (sometimes referred to as manifold learning) assume that the scattered input data is lying on a l…

2016-06-22abs ↗pdf ↗

NormLIME improves feature importance explanations for deep neural networks.

problem Improving local feature explanations for deep learning models.
method NormLIME aggregates local models into global and class-specific interpretations.
result NormLIME outperforms other feature importance metrics in human user studies and numerical experiments.

The study establishes equivalence of conditions on metric manifolds with finite volume.

problem Characterizing metric spaces with a metric fundamental class.
method Analyzing three conditions on metric manifolds with finite volume.
result Conditions (1), (2), and (3) are equivalent for metric manifolds with finite Nagata dimension.

This paper continues our exploration of homology cobordism of 3-manifolds using our recent results on Cheeger-Gromov rho-invariants associated to amenable representations. We introduce a new type of torsion in 3-manifold groups we call hidden torsion, and an algebraic approximation we call local hidden torsion. We cons…

2011-01-21abs ↗pdf ↗

SBMs learn manifold-like structures by mixing samples with a non-conservative field.

problem How SBMs learn data distributions on low-dimensional manifolds.
method Investigating linear approximations and subspaces of local feature vectors during diffusion.
result SBMs mix samples by a non-conservative field within the manifold, maintaining manifold-like structure.

We announce new results concerning the asymptotic behavior of the Betti numbers of higher rank locally symmetric spaces as their volumes tend to infinity. Our main theorem is a uniform version of the Lück Approximation Theorem \cite{luck}, which is much stronger than the linear upper bounds on Betti numbers given by Gr…

2011-04-29abs ↗pdf ↗

A 3D almost-Riemannian manifold is a generalized Riemannian manifold defined locally by 3 vector fields that play the role of an orthonormal frame, but could become collinear on some set $\Zz$ called the singular set. Under the Hormander condition, a 3D almost-Riemannian structure still has a metric space structure, wh…

2014-07-02abs ↗pdf ↗

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.

The paper provides Gaussian approximations for decentralized Federated Learning.

problem Lack of asymptotic statistical guarantees for local SGD in Federated Learning.
method Two generalized Gaussian approximation results for local SGD trajectories.
result Valid multiplier bootstrap procedures and Gaussian bootstrap-based tests for detecting adversarial attacks.

Groups of importance in group theory have flexible stability properties.

problem Stability and flexibility of groups in geometric and combinatorial group theory.
method Establishing Kirchberg's Local Lifting Property and Lubotzky--Shalom's Property FD for specific groups.
result Groups like 33-manifold groups, limit groups, and certain one-relator groups are very flexibly stable.

Let KK be a closed polydisc or ball in $\C^n$, and let YY be a quasi projective algebraic manifold which is Zariski locally equivalent to $\C^p$, or a complement of an algebraic subvariety of codimension 2\ge 2 in such manifold. If rr is an integer satisfying (nr+1)(pr+1)2(n-r+1) (p-r+1)\geq 2 then every holomorphic map from …

2006-10-06abs ↗pdf ↗

The Oeljeklaus-Toma (OT-) manifolds are complex manifolds constructed by Oeljeklaus and Toma from certain number fields, and generalizing the Inoue surfaces SmS_m. On each OT-manifold we construct a holomorphic line bundle with semipositive curvature form and trivial Chern class. Using this form, we prove that the OT-m…

2010-09-06abs ↗pdf ↗

Develops BV function and finite perimeter set theory on Riemannian manifolds.

problem Theory of BV functions and finite perimeter sets on arbitrary Riemannian manifolds.
method Localization framework combining Euclidean and metric measure space techniques.
result Recovery of key Euclidean results in Riemannian setting.

Unified view of federated learning and distributed RL using local stochastic approximation.

problem Finding the root of an operator composed of local operators in a network of agents with dependent data.
method Local stochastic approximation over a network of agents with Markov process-dependent data.
result Convergence rates of local stochastic approximation for both constant and time-varying step sizes, within a logarithmic factor of independent data.

Study on local convergence of min-max algorithms to differential equilibria on Riemannian manifolds.

problem Solving zero-sum differential games on Riemannian manifolds.
method Analysis of two simultaneous min-max algorithms, ττ-GDA and ττ-SGA, to differential Stackelberg and Nash equilibria, with conditions for linear convergence and asymptotic approximation.
result Established sufficient conditions for linear convergence of ττ-GDA and demonstrated faster convergence of ττ-SGA in some cases.

A new decentralized algorithm DESTINY solves optimization over Stiefel manifold with single communication round.

problem Decentralized optimization over the Stiefel manifold with private data.
method Gradient tracking with approximate augmented Lagrangian function.
result DESTINY achieves global convergence with a single communication round.