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

Trend · papers per month

59118177236 · May 202619922001200920172026
48 results for explicit inverse

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.

A new VAE approach solves inverse problems without explicit inverse mapping.

problem Solving inverse problems without explicit inverse mapping.
method Discarding the encoder in VAE architecture, directly optimizing latent variables.
result The latent variables can exhibit mutually independent properties without an encoding process.

The paper shows how to use hyperplanes and hyperballs interchangeably using inversive geometry.

problem Tackles the interchangeability of hyperplanes and hyperballs in discriminative boundaries.
method Applies inversive geometry to transform Euclidean data into spherical data and back, providing explicit formulae.
result Shows a duality between hyperspherical caps and hyperballs, providing explicit formulae to map between them.

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.

With respect to the Dirac operator and the conformally invariant Laplacian, an explicit description of the inverse Penrose transform on Riemannian twistor spaces is given. A Dolbeault representative of cohomology on the twistor space is constructed from a solution of the field equation on the base manifold.

1995-02-05abs ↗pdf ↗

A new GP model for non-Gaussian data with explicit inverse warping.

problem Limited expressiveness and computational complexity of Gaussian processes for non-Gaussian data.
method Compositionally-warped Gaussian processes (CWGP) with explicit inverse warping.
result CWGP provides more accurate predictions and shorter computation times than traditional warped GPs.

Study on contact Hamiltonian functions for singular contact structures.

problem Understanding infinitesimal contact transformations on singular contact structures.
method Showed injectivity and provided an explicit local formula for the inverse map.
result Explicit local formula for the inverse map when contact structure has singularities of the first type.

The Stone-Weierstrass theorem aids in solving inverse problems on specific manifolds.

problem Inverse problems on holomorphically separable Kähler manifolds and conformally transversally anisotropic manifolds.
method Application of the Stone-Weierstrass theorem to show uniqueness in inverse problems.
result Generalization and simplification of earlier results in inverse problems.

Flow Annealing Posterior Sampling unifies stochastic-process regression and PDE inverse problems.

problem Function-space posterior sampling for stochastic processes and inverse problems.
method Flow Annealing Posterior Sampling (FAPS) using pretrained function-space flow-matching priors.
result Coherent posterior samples with accurate uncertainty quantification.

Review of diffusion priors for solving imaging inverse problems.

problem Solving inverse problems in imaging using diffusion priors.
method Categorizes approaches into explicit approximation and variational inference, sequential monte carlo, and decoupled data consistency.
result Systematic comparison of performance trade-offs across inverse problems.

Study of CR twistor model Q2,2Q^{2,2} and its sections.

problem Classify and describe projective lines and hyperplane sections of the CR twistor model.
method Explicit projective methods, classification of lines and sections, use of involution jj.
result Complete relative classification of smooth quadric sections and explicit non-spherical CR structures.

We introduce and study a new Radon-like transform that averages projected differential p-forms in R^n over affine (n-k)-planes. We then prove an explicit inversion formula for our transform on the space of rapidly-decaying smooth p-forms. Our transform differs from the one in Gelfand-Graev-Shapiro. Moreover, if it can …

2008-07-22abs ↗pdf ↗

Improved diffusion sampling for inverse problems with faster and more robust inference.

problem High computational cost and lack of robustness in diffusion posterior sampling.
method Amortized variational inference with explicit likelihood guidance.
result Improved trade-off between inference speed and robustness to unseen degradations.

The paper explores how ReLU DNNs can represent MPC policies and vice versa.

problem Representing MPC policies as ReLU DNNs and vice versa.
method Developed an approximate method for identifying input-space in ReLU nets resulting in PWA functions over polyhedral regions. Studied inverse multiparametric linear or quadratic programs for reconstruction of constraints and cost functions given a PWA function.
result Identification and representation of MPC policies as ReLU DNNs and vice versa.

The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.

problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.

Given a bounded domain MM in Rn\mathbb{R}^n with a conformally Euclidean metric g=ρdx2g=ρ\,dx^2, in this paper we consider the inverse problem of recovering a semigeodesic neighborhood of a domain ΓMΓ\subset \partial M and the conformal factor ρρ in the neighborhood from the travel time data (defined below) and the Carte…

2014-09-28abs ↗pdf ↗

MDNs offer a data-efficient alternative to diffusion and flow models for multimodal scientific learning.

problem Capturing multimodal conditional uncertainty in scientific inverse problems.
method Mixture Density Networks (MDNs) as explicit parametric density estimators.
result MDNs achieve superior generalization, interpretability, and sample efficiency in scientific tasks.

New method learns physical meanings in learned representations for better downstream tasks.

problem Lack of explicit physical meanings in learned representations from self-supervised learning.
method Analysis-by-synthesis approach with coordinated sampling and training.
result Trained models can control articulatory synthesizers to speak like humans and generalize well.

This research improves neural likelihood approximation for Bayesian inverse problems.

problem Challenges in modeling and inference for high-dimensional Bayesian inverse problems.
method Develops a strictly convex approximation framework for neural likelihood.
result Empirical minimizers converge to the true likelihood as sample size increases.

In this paper we show how to augment classical methods for inverse problems with artificial neural networks. The neural network acts as a prior for the coefficient to be estimated from noisy data. Neural networks are global, smooth function approximators and as such they do not require explicit regularization of the er…

2017-12-27abs ↗pdf ↗

We give an explicit estimate of the distance of a closed, connected, oriented and immersed hypersurface of a space form to a geodesic sphere and show that the spherical closeness can be controlled by a power of an integral norm of the traceless second fundamental form, whenever the latter is sufficiently small. Further…

2015-04-22abs ↗pdf ↗

AIRL learns robust, generalizable reward functions from demonstrations.

problem Learning robust reward functions from demonstrations for changing environments.
method Adversarial Inverse Reinforcement Learning (AIRL) with hierarchical disentangled rewards.
result Generalizable policies and comparable results to state-of-the-art methods.

Study crosscap transpositions on non-orientable surfaces, providing explicit formulae.

problem Understanding the action of crosscap transpositions on multicurves in non-orientable surfaces.
method Explicit formulae for crosscap transpositions and their inverses on multicurves in Ng,nN_{g,n}.
result Explicit formulae for crosscap transpositions and their inverses on multicurves in non-orientable surfaces.

In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or semi-Pfaffian cases, which depend only on the combinatoric data representing the objects…

2012-04-25abs ↗pdf ↗

This work enhances collaborative inference privacy by minimizing conditional entropy and boosting robustness against model inversion attacks.

problem Privacy leakage in collaborative inference systems via model inversion attacks.
method Theoretical proof and derivation of a differentiable measure for bounding conditional entropy, followed by a CEM algorithm to maximize it.
result Theoretical proof and experimental validation show that CEM consistently boosts inversion robustness without compromising feature utility or efficiency.

We give a generalization of the Penrose transform on Hermitian manifolds with metrics locally conformally equivalent to Bochner-Kähler metrics. We also give an explicit formula for the inverse transform. This paper is a generalization of "The Twistor correspondence of the Dolbeault complex over $\C^n$" (dg-ga/9501004) …

1996-10-21abs ↗pdf ↗

The well-known Funk metric F(x,y) is projectively flat with constant flag curvature K=-1/4 and the Hilbert metric H(x,y):=(F(x,y)+F(x,-y))/2 is projectively flat with constant curvature K=-1. These metrics are the special solutions to Hilbert's Fourth Problem. In this paper, we construct a non-trivial R-flat spray usin…

2001-09-05abs ↗pdf ↗

We give a combinatorial proof of the quasi-invertibility of CFDD^(IZ)\widehat{CFDD}(\mathbb{I}_\mathcal{Z}) in bordered Heegaard Floer homology, which implies a Koszul self-duality on the dg-algebra A(Z)\mathcal{A}(\mathcal{Z}), for each pointed matched circle Z\mathcal{Z}. This is done by giving an explicit description of a r…

2014-03-25abs ↗pdf ↗

Study finds finitely many non-congruent polygonal domains with same Steklov spectrum.

problem Inverse Steklov problem on convex polygons.
method Analysis of Steklov eigenvalues and isoperimetric bounds.
result For almost all convex polygonal domains, there exist at most finitely many non-congruent domains with the same Steklov spectrum.

We formulate a statistical analogy of regular Lagrange mechanics and Finsler geometry derived from Grisha Perelman's functionals generalized for nonholonomic Ricci flows. There are elaborated explicit constructions when nonholonomically constrained flows of Riemann metrics result in Finsler like configurations, and inv…

2007-01-22abs ↗pdf ↗

For a given Markov process XX and survival function H\overline{H} on R+\mathbb{R}^+, the inverse first-passage time problem (IFPT) is to find a barrier function b:R+[,+]b:\mathbb{R}^+\to[-\infty,+\infty] such that the survival function of the first-passage time τb=inf{t0:X(t)<b(t)}τ_b=\inf \{t\ge0:X(t)<b(t)\} is given by H\overline{H}. In …

2013-06-12abs ↗pdf ↗

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

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.

Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs with or without boundary. Explicit formulas are derived for the cycle, torus, a…

2003-09-04abs ↗pdf ↗

Inverse metric matrices on Siegel-Jacobi spaces are calculated for Berezin quantization.

problem Calculating inverse metric matrices on Siegel-Jacobi spaces.
method Inversion of metric matrices on XnJ{\mathcal{X}}^J_n and ildeXnJ ilde{\mathcal{X}}^J_n.
result Explicit calculations of inverse metric matrices for n=2n=2.