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.
A singular foliation on a complete riemannian manifold M is said to be riemannian if each geodesic that is perpendicular at one point to a leaf remains perpendicular to every leaf it meets. We prove that the regular leaves are equifocal, i.e., the end point map of a normal foliated vector field has constant rank. This …
We give reconstruction formulas inverting the geodesic X-ray transform over functions (call it I0) and solenoidal vector fields on surfaces with negative curvature and strictly convex boundary. These formulas generalize the Pestov-Uhlmann formulas in [Pestov-Uhlmann, IMRN '04] (established for simple surfaces) to ca…
This article concerns cotangent-lifted Lie group actions; our goal is to find local and ``semi-global'' normal forms for these and associated structures. Our main result is a constructive cotangent bundle slice theorem that extends the Hamiltonian slice theorem of Marle, Guillemin and Sternberg. The result applies to a…
Improved physics-integrated generative models with noise robustness and fidelity.
problem Enhancing generative models to produce outputs that comply with physical laws and improve generalization.
method Integrating variational autoencoder with planar normalizing flow and attention mechanisms to learn latent posterior distributions and mitigate noise.
result Significant improvement in reconstruction quality and robustness against noise.
This paper is concerned with the question of reconstructing a vector in a finite-dimensional real Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We analyze various Lipschitz bounds of the nonlinear analysis map and we establish theoretical performance bo…
Reconstructing signature features from randomized vector fields in differential equations.
problem Reconstructing signature features from controlled differential equations with random vector fields.
method Using controlled ordinary differential equations driven by continuous bounded variation curves, the study explores the extent to which signature features can be reconstructed from the non-linear flow of these equations.
result The number of signature features that can be reconstructed from the non-linear flow of controlled ordinary differential equations with random vector fields is exponential in the hidden dimension, under certain conditions.
In this note we answer a question of G. Lecué, by showing that column normalization of a random matrix with iid entries need not lead to good sparse recovery properties, even if the generating random variable has a reasonable moment growth. Specifically, for every 2≤p≤c1logd we construct a random vector …
Reconstructing polytopes with fixed facet directions from support function evaluations.
problem Reconstructing polytopes with known facet directions from limited data.
method Least-squares estimate via convex quadratic program, combinatorial characterization for uniqueness, algorithm convergence.
result The least-squares estimate for a fixed simplicial normal fan is a convex quadratic program, and the solution is unique under certain conditions.
We introduce the problem of reconstructing a sequence of multidimensional real vectors where some of the data are missing. This problem contains regression and mapping inversion as particular cases where the pattern of missing data is independent of the sequence index. The problem is hard because it involves possibly m…
The paper explores Parseval frames on vector bundles, proving their existence for certain cases.
problem Existence of Parseval frames on vector bundles.
method Using G-bundles and algebraic topology, the authors prove the existence of Parseval frames for orientable vector bundles and provide conditions for smaller size frames.
result The existence of Parseval frames for orientable vector bundles and conditions for smaller size frames.
We present a generalization of Minkowski's classic theorem on the reconstruction of tetrahedra from algebraic data to homogeneously curved spaces. Euclidean notions such as the normal vector to a face are replaced by Levi-Civita holonomies around each of the tetrahedron's faces. This allows the reconstruction of both s…
We develop a non-relativistic twistor theory, in which Newton--Cartan structures of Newtonian gravity correspond to complex three-manifolds with a four-parameter family of rational curves with normal bundle O⊕O(2). We show that the Newton--Cartan space-times are unstable under the general K…
Belief Propagation outperforms other algorithms in reconstructing binary symmetric channel trees.
problem Reconstructing binary symmetric channel trees with bounded memory.
method Combining recursive reconstruction, information theory, and optimal transport.
result Any recursive algorithm with bounded memory for the reconstruction problem on binary symmetric channel trees has a phase transition strictly below the Belief Propagation threshold.