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

64128192256 · Jun 202619922001200920172026
48 results for manifold reconstruction

New condition for reconstructing Morse functions on 3D manifolds.

problem Reconstructing Morse functions with specific level sets.
method Studied a necessary and sufficient condition for reconstruction.
result New condition strengthens previous sufficient conditions.

In this article we extend the computational geometric curve reconstruction approach to curves in Riemannian manifolds. We prove that the minimal spanning tree, given a sufficiently dense sample, correctly reconstructs the smooth arcs and further closed and simple curves in Riemannian manifolds. The proof is based on th…

2010-12-15abs ↗pdf ↗

Study reconstructs Morse-Bott functions with specific preimage conditions on 3D manifolds.

problem Reconstructing Morse-Bott functions with prescribed preimages on 3D manifolds.
method Conditions and approach based on previous work by Sharko and others.
result New result on reconstruction of nice smooth functions with specified preimages.

Optimally estimate distances on surfaces using reconstructed meshes.

problem Estimating intrinsic distances on smooth submanifolds.
method Reconstruction of the surface using a tangential Delaunay complex, and Isomap variant.
result Minimax optimality achieved for distance estimation.

This paper reconstructs complex graph signals using kernel methods on manifolds.

problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.

Researchers reconstruct simple Riemannian manifolds from boundary wave arrival times.

problem Reconstructing Riemannian manifolds from unknown interior sources and arrival times.
method Discrete metric approximation using labeled Gromov--Hausdorff distance.
result Finite-time approximations converge to the true Riemannian manifold.

Paper reconstructs compact Riemannian manifolds from travel time data.

problem Reconstructing compact Riemannian manifolds from partial travel time data.
method Embedding in function space, studying distance function regularity.
result Reconstruction of compact Riemannian manifolds from travel time data.

3-manifold triangulation can be reconstructed from its intersection matrix.

problem Reconstructing the triangulation of 3-manifolds from their intersection matrix.
method Using the intersection matrix of a simplicial complex to determine the triangulation of a 3-manifold up to isomorphism.
result The intersection matrix is sufficient to determine the triangulation of a 3-manifold up to isomorphism.

We prove that a potential qq can be reconstructed from the Dirichlet-to-Neumann map for the Schrodinger operator Δg+q-Δ_g + q in a fixed admissible 3-dimensional Riemannian manifold (M,g)(M,g). We also show that an admissible metric gg in a fixed conformal class can be constructed from the Dirichlet-to-Neumann map for $Δ_…

2010-11-02abs ↗pdf ↗

We give a completely formalized definition of a notion of " general manifold ". It turns out that " gluing data " form an equivalence-partially ordered set (e-pos), which is a special instance of an ordered groupoid. We state and prove reconstruction theorems, allowing to reconstruct general manifolds and their mor-phi…

2016-05-25abs ↗pdf ↗

We consider the problem of developing a method to reconstruct a potential qq from the partial data Dirichlet-to-Neumann map for the Schrödinger equation (Δg+q)u=0(-Δ_g+q)u=0 on a fixed admissible manifold (M,g)(M,g). If the part of the boundary that is inaccessible for measurements satisfies a flatness condition in one directio…

2015-11-10abs ↗pdf ↗

Given a Morse 2-function f:X4S2f: X^4 \to S^2, we give minimal conditions on the fold curves and fibers so that X4X^4 and ff can be reconstructed from a certain combinatorial diagram attached to S2S^2. Additional remarks are made in other dimensions.

2012-02-16abs ↗pdf ↗

Reconstruct flows and manifolds from their boundary actions on circles.

problem Understanding and reconstructing flows and manifolds from their boundary actions.
method Reconstructing flows and manifolds from actions on circles with invariant almost laminations.
result Reconstructs flows and manifolds from their boundary actions, including pseudo-Anosov flows in 3-manifolds.

Researchers reconstruct algebraic maps onto curves based on prescribed Reeb graphs.

problem Reconstructing smooth real algebraic maps onto curves with specific Reeb graphs.
method Developed a method to reconstruct functions from general finite graphs, focusing on curves.
result Reconstructed functions from prescribed Reeb graphs, providing a new approach in real algebraic geometry.

Reconstruction error is a prevalent score used to identify anomalous samples when data are modeled by generative models, such as (variational) auto-encoders or generative adversarial networks. This score relies on the assumption that normal samples are located on a manifold and all anomalous samples are located outside…

2019-05-28abs ↗pdf ↗

Limited angle CT reconstruction is an under-determined linear inverse problem that requires appropriate regularization techniques to be solved. In this work we study how pre-trained generative adversarial networks (GANs) can be used to clean noisy, highly artifact laden reconstructions from conventional techniques, by …

2019-10-03abs ↗pdf ↗

We study the problem of estimating a manifold from random samples. In particular, we consider piecewise constant and piecewise linear estimators induced by k-means and k-flats, and analyze their performance. We extend previous results for k-means in two separate directions. First, we provide new results for k-means rec…

2012-09-05abs ↗pdf ↗

We show that on a two-dimensional compact nontrapping Riemannian manifold with strictly convex boundary, a piecewise constant function can be recovered from its integrals over geodesics. We adapt the injectivity proof which uses variations through geodesics to recover the function and we improve this result when the ma…

2019-01-07abs ↗pdf ↗

Reconstructing manifolds from partial distance and heat kernel data.

problem Reconstructing a manifold from noisy distance measurements and heat kernel data.
method Approximate reconstruction of a manifold from partial distance and heat kernel data with noise.
result A stable reconstruction of the manifold can be achieved from noisy heat kernel data.

The paper recovers contact forms from boundary data using vector fields and Lyapunov functions.

problem Recovering contact forms from boundary data.
method Using vector fields and Lyapunov functions, the paper describes boundary data and proves reconstruction of (X,β)(X, β) up to diffeomorphism.
result Boundary data allow for the reconstruction of (X,β)(X, β) up to a diffeomorphism of XX.

Proposes a novel method for generating hard negatives near time series data boundaries.

problem Challenges in generating effective negative samples for time series anomaly detection.
method Reconstruction-driven boundary negative generation framework using reinforcement learning.
result Improves anomaly representation learning and achieves competitive detection performance.

We reconstruct a Riemannian manifold and a Hermitian vector bundle with compatible connection from the hyperbolic Dirichlet-to-Neumann operator associated with the wave equation of the connection Laplacian. The boundary data is local and the reconstruction is up to the natural gauge transformations of the problem. As a…

2015-09-09abs ↗pdf ↗

It is well-known that a compact Riemannian spin manifold can be reconstructed from its canonical spectral triple which consists of the algebra of smooth functions, the Hilbert space of square integrable spinors and the Dirac operator. It seems to be a folklore fact that the metric can be reconstructed up to conformal e…

2007-04-17abs ↗pdf ↗

Researchers prove rigidity of 2D manifolds from boundary geodesic lengths.

problem Reconstructing a Riemann surface from boundary geodesic lengths.
method Re-casting lens data as generalized Riemannian circles and solving a system of equations.
result Essentially optimal results on boundary and lens rigidity for 2D manifolds.

This work connects LLE, factor analysis, and probabilistic PCA through a stochastic perspective.

problem Exploring the theoretical connection between LLE, factor analysis, and probabilistic PCA.
method Solving the stochastic linear reconstruction of LLE using expectation maximization.
result LLE, factor analysis, and probabilistic PCA are shown to be connected through a stochastic perspective.

Proposes a new framework for image generation using classification latent space representations.

problem Combining discriminative and dense representations for image generation and reconstruction.
method Discriminative modeling framework using manipulated supervised latent representations.
result Higher classification accuracy and visually realistic image generation compared to existing models.

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 shows stability of metric reconstruction for orbifolds from spectral data.

problem Determining the metric structure of collapsing orbifolds from spectral data.
method Improved quantitative unique continuation for wave operator on Riemannian manifolds.
result Quantitative stability of inverse problem for Riemannian orbifolds.

A new method integrates autoencoders with geometry regularization for manifold learning.

problem Extracting simplified low-dimensional representations that capture intrinsic geometry in data.
method Integrates autoencoders with a geometric regularization term based on diffusion potential distances.
result The method preserves intrinsic structure, enables out-of-sample extension, and faithful reconstruction.

We study the geometric Whitney problem on how a Riemannian manifold (M,g)(M,g) can be constructed to approximate a metric space (X,dX)(X,d_X). This problem is closely related to manifold reconstruction where a smooth nn-dimensional submanifold SRmS\subset {\mathbb R}^m, m>nm>n needs to be constructed to approximate a point clo…

2015-08-04abs ↗pdf ↗

Algorithm reconstructs vertex positions in random geometric graphs with improved accuracy.

problem Reconstructing vertex positions in random geometric graphs with high accuracy.
method Hybrid of graph distances and short-range estimates based on common neighbors.
result Algorithm reconstructs vertex positions with error of O(nβ)O(n^β), improving over previous results.