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,742 papers · 148 categories

Trend · papers per month

233466698931 · Jun 202019922001200920172026
48 results for Gel'fand's inverse problem

Study solves Gel'fand's inverse problem in non-smooth spaces with Ricci curvature bounds.

problem Determining a Riemannian manifold from heat kernel on subsets.
method Analyzes mRCD(K,N){ m RCD}(K,N) spaces with synthetic Ricci curvature bounds.
result Unique solvability of Gel'fand's inverse problem for compact mRCD(K,N){ m RCD}(K,N) spaces.

Study shows stability of Schrödinger operator spectral data on a manifold.

problem Determining a manifold and potential function from spectral data.
method Approximation of spectral data on a subset to determine manifold and potential.
result Quantitative stability estimate for Schrödinger operator inverse problem.

Stable solution found for manifold topology from boundary data.

problem Determining manifold properties from boundary data and eigenvalues.
method Quantitative stability estimates and unique continuation for the wave operator.
result Eigenvalues and boundary values determine a metric space close to the manifold.

Proves a Gel'fand-Kolmogoroff type result for vector bundles and polynomial functions.

problem Characterizing vector bundles and polynomial functions using differential operators.
method Analyzes the associative structure of symbols of differential operators and their eigenvectors.
result Derives a Gel'fand-Kolmogoroff type result for the algebra of symbols of differential operators.

We study the moduli spaces of polygons in R^2 and R^3, identifying them with subquotients of 2-Grassmannians using a symplectic version of the Gel'fand-MacPherson correspondence. We show that the bending flows defined by Kapovich-Millson arise as a reduction of the Gel'fand-Cetlin system on the Grassmannian, and with t…

1996-02-29abs ↗pdf ↗

By using the Weil-Gel'fand-Zak transform of Faddeev's quantum dilogarithm, we propose a new state-integral model for the Teichmüller TQFT, where the circle valued state variables live on the edges of oriented leveled shaped triangulations.

2013-05-18abs ↗pdf ↗

During the last decades algebraization of space turned out to be a promising tool at the interface between Mathematics and Theoretical Physics. Starting with works by Gel'fand-Kolmogoroff and Gel'fand-Naimark, this branch developed as from the fortieth in two directions: algebraic characterization of usual geometric sp…

2009-03-20abs ↗pdf ↗

We consider the moduli space M_r of polygons with fixed side lengths in five-dimensional eucledian space. We analyze the local structure of its singularities and exhibit a real-analytic equivalence between M_r and a weighted quotient of the n-fold product of the quaternionic projective line HP^1 by the diagonal PSL(2,H…

2002-02-17abs ↗pdf ↗

In this paper we consider two inverse problems on a closed connected Riemannian manifold (M,g)(M,g). The first one is a direct analog of the Gel'fand inverse boundary spectral problem. To formulate it, assume that MM is divided by a hypersurface ΣΣ into two components and we know the eigenvalues λjλ_j of the Laplace ope…

2007-09-13abs ↗pdf ↗

Study tackles inverse problems on low-dimensional manifolds, proving stability and proposing a reconstruction algorithm.

problem Inverse problems in infinite-dimensional spaces with nonlinear and ill-posed nature.
method Assumption of low-dimensional manifold, proving stability, proposing Landweber-type algorithm.
result Global convergence of the proposed algorithm, Lipschitz stability for specific inverse problems.

In "The {G}el'fand-{K}alinin-{F}uks class and characteristic classes of transversely symplectic foliations" arXiv:0910.3414, Kotschick and Morita showed that the Gel'fand-Kalinin-Fuks class in $\ds\HGF{7}{2}{}{8}$ is decomposed as a product ηωη\wedge ω of some leaf cohomology class ηη and a transverse symplectic class…

2014-07-17abs ↗pdf ↗

We consider the anisotropic Calderon problem of recovering a conductivity matrix or a Riemannian metric from electrical boundary measurements in three and higher dimensions. In the earlier work \cite{DKSaU}, it was shown that a metric in a fixed conformal class is uniquely determined by boundary measurements under two …

2013-05-06abs ↗pdf ↗

In \cite{KOT:MORITA}, Kotschick and Morita showed that the Gel'fand-Kalinin-Fuks class in $\ds \HGF{7}{2}{}{8}$ is decomposed as a product ηωη\wedge ω of some leaf cohomology class ηη and a transverse symplectic class ωω. In other words, the Kontsevich homomorphism $\dsω\wedge :\HGF{5}{2}{0}{10} \rightarrow\HGF{7}{2}…

2014-07-03abs ↗pdf ↗

A general construction of an sh Lie algebra from a homological resolution of a Lie algebra is given. It is applied to the space of local functionals equipped with a Poisson bracket, induced by a bracket for local functions along the lines suggested by Gel'fand, Dickey and Dorfman. In this way, higher order maps are con…

1997-02-25abs ↗pdf ↗

The geometric approach [1312.1262] to iterated variations of local functionals -- e.g., of the (master-)action functional -- resulted in an extension of the deformation quantisation technique to the set-up of Poisson models of field theory [IHES/M/15/13]. It also allowed of a rigorous proof ([1312.1262],[1210.0726]) fo…

2014-10-01abs ↗pdf ↗

For a one-parameter family of simple metrics of constant curvature (4κ for κ(1,1)κ\in (-1,1)) on the unit disk MM, we first make explicit the Pestov-Uhlmann range characterization of the geodesic X-ray transform, by constructing a basis of functions making up its range and co-kernel. Such a range characterization also t…

2019-06-22abs ↗pdf ↗

The main aim of this paper is to study soliton surfaces immersed in Lie algebras associated with ordinary differential equations (ODE's) for elliptic functions. That is, given a linear spectral problem for such an ODE in matrix Lax representation, we search for the most general solution of the wave function which satis…

2011-06-10abs ↗pdf ↗

The paper establishes correspondences between quaternionic spinors, Minkowski flags, and hyperbolic horospheres.

problem Understanding geometric correspondences in 4D hyperbolic geometry.
method Explicit bijective correspondences using Clifford matrices and bilinear forms.
result Lambda lengths generalize to quaternionic values in 4D hyperbolic space and satisfy a non-commutative Ptolemy equation.

We provide a Geometric Quantisation formulation of the AJ-conjecture for the Teichmüller TQFT, and we prove it in detail in the case of the knot complements of 414_{1} and 525_2. The conjecture states that the level-NN Andersen-Kashaev invariant, JM,K(b,N)J^{(\mathrm{b},N)}_{M,K}, is annihilated by the non-homogeneous $\hat{…

2017-11-30abs ↗pdf ↗

New method improves estimation of complex models from conditional moment restrictions.

problem Estimation of complex models from conditional moment restrictions.
method Functional Generalized Empirical Likelihood (GEL) with a practical method.
result The method achieves state-of-the-art performance on two problems.

We construct a local action of the group of rational maps from S2S^2 to GL(n,C)GL(n,C) on local solutions of flows of the ZS-AKNS sl(n,C)sl(n,C)-hierarchy. We show that the actions of simple elements (linear fractional transformations) give local Bäcklund transformations, and we derive a permutability formula from different fact…

1998-05-18abs ↗pdf ↗

The biological processes involved in a drug's mechanisms of action are oftentimes dynamic, complex and difficult to discern. Time-course gene expression data is a rich source of information that can be used to unravel these complex processes, identify biomarkers of drug sensitivity and predict the response to a drug. H…

2019-07-27abs ↗pdf ↗

We introduce DeepMoD, a Deep learning based Model Discovery algorithm. DeepMoD discovers the partial differential equation underlying a spatio-temporal data set using sparse regression on a library of possible functions and their derivatives. A neural network approximates the data and constructs the function library, b…

2019-04-20abs ↗pdf ↗

New method for estimating parameters in inverse problems using double robustness.

problem Estimating parameters defined as linear functionals of solutions to linear inverse problems.
method Source condition double robust inference method that uses iterated Tikhonov regularized adversarial estimators.
result Asymptotic normality of the parameter of interest as long as either the primal or dual inverse problem is sufficiently well-posed.

MCGDiff uses SGM to guide SMC for solving ill-posed linear inverse problems.

problem Solving ill-posed linear inverse problems in Bayesian settings.
method Exploiting SGM structure, defining a sequence of intermediate problems, and using SMC methods.
result MCGDiff outperforms competing methods in Bayesian ill-posed inverse problems.

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.

Machine learning models solve inverse eigenvalue problems for symmetric potentials and refractive indices.

problem Solving inverse eigenvalue problems for symmetric potentials and refractive indices.
method Supervised regression models (k-Nearest Neighbours, Random Forests, Multi-Layer Perceptron) trained on eigenvalue datasets.
result Machine learning methods can numerically solve inverse eigenvalue problems under appropriate parameter tuning.

Proof of convergence for multi-objective optimization using inverse reinforcement learning.

problem Proving convergence in multi-objective optimization problems.
method Wasserstein inverse reinforcement learning with projective subgradient method and gradient descent.
result Convergence of inverse reinforcement learning for multi-objective optimization.

Study solves inverse problems for real principal type operators using unique data sets and ray transforms.

problem Determining coefficients in real principal type equations from boundary data.
method Unique data sets, bicharacteristic ray transforms, and propagation of singularities.
result Global uniqueness results for determining coefficients in nonlinear real principal type equations.

Variational Gaussian Processes solve linear inverse problems efficiently.

problem Solving inverse problems where indirect observations are corrupted by noise.
method Variational Bayesian methods with Gaussian process priors and inducing variables.
result Posterior contraction rates can be attained by correctly tuned variational procedures.

Study solves inverse problems for equations with fractional nonlinearities.

problem Solving inverse problems for semilinear elliptic equations with fractional power nonlinearities.
method Higher order linearization method adapted for fractional order.
result Results of previous studies remain valid for general power nonlinearities.

Paper explores stability, regularization, and gradient flows for stochastic inverse problems.

problem Recovering random probability distributions from measurements.
method Direct inversion, variational formulation with regularization, and optimization via gradient flows.
result The choice of metric impacts stability and properties of the optimizer.

New method tackles video inverse problems using image diffusion models.

problem Spatio-temporal degradation in video inverse problems.
method Leverages image diffusion models to treat time dimension as batch dimension, introduces batch-consistent diffusion sampling.
result Achieves state-of-the-art reconstructions for various spatio-temporal degradations.

Deep neural networks solve noisy, complex problems accurately.

problem Reconstructing solutions from noisy, high-dimensional, non-linear inverse problems.
method Restricting infinite-dimensional forward operators to finite-dimensional spaces, training neural networks to approximate these operators robustly to noise.
result Deep neural networks can accurately solve high-dimensional, noisy, non-linear inverse problems.