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

101203304405 · Jun 202019922001200920172026
48 results for inverse limits

The aim of the paper is to investigate the relation between inverse limit of branched manifolds and codimension zero laminations. We give necessary and sufficient conditions for such an inverse limit to be a lamination. We also show that codimension zero laminations are inverse limits of branched manifolds. The inverse…

2012-04-28abs ↗pdf ↗

Linear flows on inverse limits of tori are defined and it is shown that two linear flows on an inverse limit of tori are equivalent if and only if there is an automorphism of the inverse limit generating the equivalence.

1999-06-24abs ↗pdf ↗

We show that the Bruschlinsky group with the winding order is a homeomorphism invariant for a class of one-dimensional inverse limit spaces. In particular we show that if a presentation of an inverse limit space satisfies the Simplicity Condition, then the Bruschlinsky group with the winding order of the inverse limit …

2000-05-16abs ↗pdf ↗

New flow expands hypersurfaces in hyperbolic space, showing round limiting shape for certain powers.

problem Understanding the limiting shape of hypersurfaces expanding in hyperbolic space.
method Introduced shifted inverse curvature flow with positive power pp for a smooth curvature function.
result For 0<p10<p\leq 1, limiting shape is always round as maximal existence time is approached.

In this article we consider the anisotropic Calderon problem and related inverse problems. The approach is based on limiting Carleman weights, introduced in Kenig-Sjoestrand-Uhlmann (Ann. of Math. 2007) in the Euclidean case. We characterize those Riemannian manifolds which admit limiting Carleman weights, and give a c…

2008-03-25abs ↗pdf ↗

This study improves uncertainty quantification in seismic inversion.

problem Uncertainty in seismic inversion due to limited data and model diversity.
method Integrates ensemble methods with importance sampling.
result More accurate uncertainty quantification in velocity models.

An inverse limit of a sequence of covering spaces over a given space XX is not, in general, a covering space over XX but is still a lifting space, i.e. a Hurewicz fibration with unique path lifting property. Of particular interest are inverse limits of finite coverings (resp. finite regular coverings), which yield fi…

2017-08-02abs ↗pdf ↗

Study transverse measures on infinite type hyperbolic surfaces.

problem Characterize the cone of transverse measures on infinite type hyperbolic surfaces.
method Use inverse limits and geodesic laminations to describe and construct cones of transverse measures.
result Explicit descriptions and bases of cones of transverse measures exist for many laminations.

New method uses neural networks to identify sources from limited data in complex systems.

problem Identifying sources from noisy and limited data in high-dimensional systems.
method Calibrating deep neural network surrogates to ensemble simulations and using Bayesian optimization for source identification.
result Reliable source identification with uncertainty quantification using limited data and auxiliary processes.

Inverts operator on hyperbolic surfaces, constructing invariant distributions.

problem Constructing explicit inversion formula for X-ray normal operator.
method First, inversion formula for attenuated normal operator on Poincaré disk and closed hyperbolic surfaces. Then, explicit construction of invariant distributions.
result Explicit construction of invariant distributions with prescribed pushforward.

New method uses CNN for seismic inversion uncertainty quantification.

problem Uncertainty quantification in seismic inversion for noisy data.
method Plug-and-Play Stein Variational Gradient Descent (PnP-SVGD) with CNN denoiser.
result High-resolution, trustworthy posterior samples for subsurface structures.

Study uses machine learning to solve photoacoustic tomography's inverse problem.

problem Solving the full inverse problem in photoacoustic tomography.
method Developed an approach using variational autoencoders for Bayesian estimation of the posterior distribution.
result Evaluated the approach with numerical simulations and compared it to a Bayesian solution.

Using an inverse system of metric graphs as in: J. Cheeger and B. Kleiner, "Inverse limit spaces satisfying a Poincaré inequality", we provide a simple example of a metric space XX that admits Poincaré inequalities for a continuum of mutually singular measures.

2014-03-20abs ↗pdf ↗

Paper presents a unique method to recover signals from their bispectrum.

problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.

In extension theory, in particular in dimension theory, it is frequently useful to represent a given compact metrizable space X as the limit of an inverse sequence of compact polyhedra. We are going to show that, for the purposes of extension theory, it is possible to replace such an X by a better metrizable compactum …

2017-03-13abs ↗pdf ↗

Study evaluates Tree-Ring Watermarking in rectified flow-based models, revealing detection and separability limitations.

problem Detecting and separating Tree-Ring Watermarks in rectified flow-based models.
method Extensive experimentation comparing SD 2.1 and FLUX.1-dev models with various text guidance configurations and augmentation attacks.
result Inversion limitations affect watermark recovery and statistical separation.

We show, analytically and numerically, that wealth distribution in the Bouchaud-Mézard network model of the economy is described by a three-parameter generalized inverse gamma distribution. In the mean-field limit of a network with any two agents linked, it reduces to the inverse gamma distribution.

2012-08-13abs ↗pdf ↗

Improved inverse problem solving with data consistency in diffusion models.

problem Speed and data consistency issues in diffusion model-based inverse problems.
method Data Consistent Direct Diffusion Bridges (CDDB) that ensures data consistency without fine-tuning.
result CDDB outperforms inconsistent DDB in perception and distortion metrics.

Generative model creates frictional surfaces from friction laws.

problem Designing frictional interfaces with prescribed behavior is challenging.
method Uses Variational Autoencoders (VAEs) to infer surface topographies from friction laws.
result Efficiently generates candidate topographies without contact simulations.

A new data-adaptive prior stabilizes kernel learning in operators.

problem Learning kernels in operators from data is ill-posed due to nonlocal dependence.
method Introduces a data-adaptive prior to stabilize the Bayesian posterior mean.
result The data-adaptive prior achieves a stable posterior with small noise limits.

If pricing kernels are assumed non-negative then the inverse problem of finding the pricing kernel is well-posed. The constrained least squares method provides a consistent estimate of the pricing kernel. When the data are limited, a new method is suggested: relaxed maximization of the relative entropy. This estimator …

2003-10-15abs ↗pdf ↗

SINGD improves KFAC for memory-efficiency and stability in low-precision training.

problem Memory inefficiency and numerical instability of KFAC in low-precision training.
method Formulated inverse-free KFAC update and imposed structures in Kronecker factors.
result SINGD is memory-efficient and numerically robust, often outperforming AdamW in half precision.

In the limit of infinite number of nodes (agents), the Itô-reduced Bouchaud-Mézard network model of economic exchange has a time-independent mean and a steady-state inverse gamma distribution. We show that for a finite number of nodes the mean is actually distributed as a time-dependent lognormal and inverse gamma is q…

2017-04-07abs ↗pdf ↗

The flow of a torus by inverse mean curvature keeps total curvature bounded until singularity.

problem Understanding the behavior of a torus under inverse mean curvature flow until singularity.
method Analyzing the evolution of a rotationally symmetric embedded torus in R3\mathbb{R}^{3} by inverse mean curvature flow.
result The total curvature remains bounded until the singular time TmaxT_{\max}.

Solenoids are ``inverse limits'' of the circle, and the classical knot theory is the theory of tame embeddings of the circle into the 3-space. We give some general study, including certain classification results, of tame embeddings of solenoids into the 3-space as the ``inverse limits'' of the tame embeddings of the ci…

2006-11-29abs ↗pdf ↗

In this paper we define the pp-adic framed braid group F,n{\mathcal F}_{\infty,n}, arising as the inverse limit of the modular framed braids and we give topological generators for F,n{\mathcal F}_{\infty, n}. We also give geometric interpretations for the pp-adic framed braids. We then construct a pp-adic Yokonuma-Hec…

2006-04-10abs ↗pdf ↗

Paper introduces variational inference for Bayesian inverse problems with gamma hyperpriors.

problem Bayesian inverse problems with sparse solutions.
method Variational iterative alternating scheme for hierarchical models with gamma hyperpriors.
result Accurate reconstruction and meaningful uncertainty quantification.

Bayesian framework learns prior from data to quantify uncertainty in MRI reconstruction.

problem Quantifying uncertainty in deep learning solutions for inverse problems.
method Adopting denoising score matching to learn prior from data, using it in an annealed Hamiltonian Monte-Carlo scheme.
result The approach yields high-quality reconstructions and assesses uncertainty on specific features.

This paper tackles regularization parameter learning in inverse problems using data-driven bilevel optimization.

problem Finding optimal regularization parameters in inverse problems.
method Data-driven bilevel optimization approach, analyzing performance in large data samples.
result The approach can reduce computational cost through online numerical schemes based on stochastic gradient descent.