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

Trend · papers per month

69138207276 · Jun 202019922001200920172026
48 results for numerical inversion

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.

New findings on mesh group-planes validate Signature-inverse Theorem under specific conditions.

problem Invalidity of existing inverse theorems for mesh group-planes.
method Classification of three and five point meshes, analysis of joint invariant signatures.
result Valid conditions for the Signature-inverse Theorem in mesh group-planes.

The paper derives formulas for option pricing and random walk expectations.

problem Calculating the price of barrier and lookback options.
method Inverse Z-transform, Fourier/Laplace inversion, Wiener-Hopf factorization, and numerical methods.
result Efficient numerical methods for option pricing are developed.

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.

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.

New filters improve radar target inference in complex scenarios.

problem Improving radar target inference in highly non-linear system models.
method Developed inverse cubature Kalman filter (I-CKF), inverse quadrature Kalman filter (I-QKF), and inverse cubature-quadrature Kalman filter (I-CQKF) for non-linear systems.
result Numerical experiments show improved estimation accuracy compared to existing methods.

This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.

problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.

Regularizes 3D inverse scattering with tangent-point energy for better solutions.

problem Ill-conditioned inverse obstacle scattering problems in 3D.
method Tikhonov regularization using tangent-point energy to penalize surface roughness and ensure well-posedness.
result Regularized solutions converge to true solution as noise level decreases.

Develops a new method to compute risk-sharing allocations using Laplace transforms.

problem Complex integrals in computing conditional mean risk-sharing allocations.
method Uses Laplace-Stieltjes transforms to compute risk-sharing allocations from joint transforms.
result Provides closed-form or semi-analytic solutions for a broad class of distributions.

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.

Method estimates sparse inverse covariance and partial correlation matrices efficiently.

problem Sparse high-dimensional inverse covariance and partial correlation matrix estimation.
method Two-stage estimation method using partial regression with positive semi-definiteness.
result Efficient estimation of inverse covariance and partial correlation matrices with derived non-asymptotic rates.

Inverse optimal transport (OT) refers to the problem of learning the cost function for OT from observed transport plan or its samples. In this paper, we derive an unconstrained convex optimization formulation of the inverse OT problem, which can be further augmented by any customizable regularization. We provide a comp…

2020-02-22abs ↗pdf ↗

We consider the problem of joint estimation of structured inverse covariance matrices. We perform the estimation using groups of measurements with different covariances of the same unknown structure. Assuming the inverse covariances to span a low dimensional linear subspace in the space of symmetric matrices, our aim i…

2015-11-20abs ↗pdf ↗

Paired autoencoders solve inverse problems using latent space projections.

problem Solving inverse problems in scientific computing.
method Paired autoencoder framework that projects data and quantity of interest into a latent space.
result Paired autoencoders generate multiple reconstruction metrics and enable latent-space refinement for accurate data fitting.

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 ↗

A new method for efficiently computing derivatives of skew-symmetric matrix exponentials.

problem Efficient computation of derivatives for skew-symmetric matrices.
method Characterization of invertibility, construction of nearby logarithm, and efficient implementation.
result Explicit formulae for differentiation and its inverse of skew-symmetric matrix exponentials.

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.

This study proposes an efficient surrogate for Darcy flow inverse problems.

problem Efficiently constructing accurate surrogate models for high-dimensional complex inverse problems.
method Sequential Bayesian design strategy to acquire a locally accurate surrogate model focusing on high-probability regions.
result The proposed method accelerates inversion accuracy and computational speed.

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.

This paper revisits the Bayesian CMA-ES and provides updates for normal Wishart. It emphasizes the difference between a normal and normal inverse Wishart prior. After some computation, we prove that the only difference relies surprisingly in the expected covariance. We prove that the expected covariance should be lower…

2019-04-02abs ↗pdf ↗

This work characterizes, analytically and numerically, two major effects of the quadratic Wasserstein (W2W_2) distance as the measure of data discrepancy in computational solutions of inverse problems. First, we show, in the infinite-dimensional setup, that the W2W_2 distance has a smoothing effect on the inversion pro…

2019-11-15abs ↗pdf ↗

We study solutions to the inverse mean curvature flow which evolve by homotheties of a given submanifold with arbitrary dimension and codimension. We first show that the closed ones are necessarily spherical minimal immersions and so we reveal the strong rigidity of the Clifford torus in this setting. Mainly we focus o…

2015-11-12abs ↗pdf ↗

A framework uses variational Bayes for solving inverse problems efficiently.

problem Solving inverse problems in various dimensions with flexibility and accuracy.
method Variational Bayes approximations with message passing and factor graph approach.
result Efficient algorithm updates for higher dimensions and computational advantage over MCMC.

A new method simulates square-root processes efficiently.

problem Simulating square-root processes accurately and efficiently.
method Simulate the integrated square-root process instead of the square-root process itself.
result High precision with low number of time steps, and exact limiting Inverse Gaussian distributions.

New criterion for solving inverse Hessian equations, including J-equation.

problem Existence of solutions to inverse Hessian equations, including J-equation.
method Stability of pairs in the sense of Paul, formulated in terms of GIT criterion.
result New numerical criterion for existence of solutions to inverse Hessian equations.

We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propos…

2017-08-14abs ↗pdf ↗

The paper stabilizes invertible neural networks by using Gaussian mixture models.

problem Invertible neural networks can have exploding Lipschitz constants, leading to numerical errors.
method The authors use Gaussian mixture models to stabilize the latent distribution of invertible neural networks.
result Numerical simulations confirm that this modification improves sampling quality in multimodal applications.

By introducing a shape manifold as a solution set to solve inverse obstacle scattering problems we allow the reconstruction of general, not necessarily star-shaped curves. The bending energy is used as a stabilizing term in Tikhonov regularization to gain independence of the parametrization. Moreover, we discuss how se…

2019-03-12abs ↗pdf ↗

Inverse problems arise in a number of domains such as medical imaging, remote sensing, and many more, relying on the use of advanced signal and image processing approaches -- such as sparsity-driven techniques -- to determine their solution. This paper instead studies the use of deep learning approaches to approximate …

2019-01-31abs ↗pdf ↗

A deep learning approach solves probabilistic inverse problems with physical constraints.

problem Solving inverse problems with large inferred vectors and prior samples.
method Uses conditional Wasserstein generative adversarial networks (cWGAN) with full gradient penalty.
result Improves accuracy and robustness in sampling and solving inverse problems.

New methods for ZZ-transform inversion and Wiener-Hopf factorization.

problem Efficient numerical inversion of ZZ-transforms and factorization of functions.
method Sinh-deformations of contours, variable changes, and simplified trapezoid rule.
result High precision and speed in evaluating moments and constructing filters.