The aim of this paper is to show how the homotopy type of compact metric spaces can be reconstructed by the inverse limit of an inverse sequence of finite approximations of the corresponding space. This recovering allows us to define inverse persistence as a new kind of persistence process.
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
48 results for “approximate inverses”
Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to compute the inverse or inverse square root of a matrix whose size is quadratic of …
Computational method approximates homology groups of compact metric spaces.
problem Computing homology groups of compact metric spaces.
method Inversely sequence of finite topological spaces, inverse limit, homeomorphic copy, strong deformation retract.
result Approximates homology groups of compact metric spaces.
The paper uses polyhedral expansions to capture the shape of compact metric spaces.
problem Capturing the shape of compact metric spaces using finite approximations.
method Inverse sequences of polyhedra based on finite approximations of a compact metric space.
result Proves the General Principle and computes inverse persistent homology groups.
New method uses Gaussian ODE filtering to approximate likelihoods for fast ODE inverse problems.
problem Intractable forward models in likelihood-free inference, especially for ODEs.
method Gaussian ODE filtering to construct local Gaussian likelihood approximations.
result New solvers outperform standard likelihood-free approaches on benchmark systems.
A new method uses mixture approximations to improve diffusion models for Bayesian inverse problems.
problem Approximating posterior distributions in Bayesian inverse problems with intractable likelihoods.
method Proposes a mixture-based approximation of intermediate posterior distributions and uses Gibbs sampling for practical sampling.
result Validated the approach on image inverse problems and audio source separation, demonstrating improved performance.
Finite approximations help reconstruct countable metric and ultrametric spaces.
problem Reconstructing countable metric and ultrametric spaces.
method Topological reconstruction using inverse limits of finite spaces.
result Countable metric and ultrametric spaces can be reconstructed as finite approximations.
Adaptive operator learning reduces costs in Bayesian inverse problems.
problem Reducing computational costs in Bayesian inverse problems governed by PDEs.
method Adaptive operator learning framework that gradually reduces modeling error.
result The approach significantly reduces computational costs while maintaining inversion accuracy.
In this paper, we address the inverse problem, or the statistical machine learning problem, in Markov random fields with a non-parametric pair-wise energy function with continuous variables. The inverse problem is formulated by maximum likelihood estimation. The exact treatment of maximum likelihood estimation is intra…
Rank-1 Approximation of Inverse Fisher for Natural Policy Gradients in Deep Reinforcement Learningcs.LG
Paper presents a rank-1 approximation method for natural policy gradients in deep RL.
problem Computing natural gradients requires inverting the Fisher Information Matrix, which is computationally expensive.
method Develops a rank-1 approximation to the inverse Fisher Information Matrix for efficient natural policy optimization.
result The rank-1 approximation converges faster and has similar sample complexity to stochastic policy gradient methods.
Gaussian process regression helps approximate Bayesian inverse problems efficiently.
problem Computational intractability of Bayesian posterior distributions in inverse problems.
method Gaussian process regression to build a surrogate model for the likelihood.
result Error between true and approximate posterior can be bounded by weighted -norm error between true and approximate likelihood.
New method tackles incomplete data in RBM inverse Ising problems.
problem Computing data and model expectations in inverse Ising problems with missing observations.
method Combines mean-field approximation, persistent contrastive divergence, and spatial Monte Carlo integration.
result Effective and accurate tuning of model parameters compared to conventional methods.
ASTRA improves TDA by more accurately approximating iHVP.
problem Improving insights into training data attribution.
method ASTRA uses EKFAC-preconditioner on Neumann series iterations to accurately approximate iHVP.
result Improving iHVP approximation significantly improves TDA performance.
Many iterative and non-iterative methods have been developed for inverse problems associated with Ising models. Aiming to derive an accurate non-iterative method for the inverse problems, we employ the tree-reweighted approximation. Using the tree-reweighted approximation, we can optimize the rigorous lower bound of th…
Bayesian Deep Learning tackles inverse problems with neural networks and approximate computations.
problem Solving inverse problems with indirect measurements and uncertainties.
method Bayesian Deep Learning, using neural networks and approximate computations.
result Effective solutions for inverse problems using Bayesian Deep Learning.
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.
A new method for target propagation using iterative approximations converges fast and is more biologically plausible.
problem Improving target propagation methods for neural networks.
method Iterative approximate inverses and local auto-encoders.
result The method converges exponentially fast under certain conditions.
DPMC improves inverse problem solving with MCMC, reducing error in noisy conditions.
problem Inaccurate posterior approximation in inverse problems with high noise levels.
method DPMC uses Annealed MCMC to sample through a series of intermediate distributions, reducing accumulated error.
result DPMC outperforms DPS in various inverse problems, reducing error and evaluations.
The paper introduces a new Wasserstein distance for approximating posteriors in inverse problems.
problem Approximating posterior measures in inverse problems using conditional Wasserstein distances.
method Introduces a conditional Wasserstein distance with restricted couplings and derives its dual.
result Shows that conditional Wasserstein GANs can yield favorable properties for posterior sampling.
Method solves Bayesian inverse problems in function space without assuming log-concavity.
problem Bayesian inverse problems in infinite-dimensional nonlinear settings.
method Score-based diffusion models as a prior, Langevin-type MCMC on function spaces.
result Provable convergence bound for posterior sampling, dependent on score approximation.
Bayesian inverse problems solved with Gaussian models for PDEs.
problem Solving inverse problems with limited data for PDEs.
method Constructing PDE-informed Gaussian priors for Bayesian inversion.
result PDE-informed Gaussian priors outperform traditional priors.
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 fast method approximates likelihood scores for noisy linear inverse problems.
problem Solving noisy linear inverse problems efficiently.
method Proposes a simple closed-form approximation to the likelihood score for diffusion and flow-based models.
result Significantly faster than baseline methods while maintaining competitive or better reconstruction performances.
New method uses diffusion models for inverse problems without approximations.
problem Solving complex inverse problems in high dimensions.
method Ensemble-based algorithm using diffusion models without approximations.
result Empirically validated method gives more accurate reconstructions.
Inverse Particle Filtermath.OC
Develops an inverse particle filter for cognitive systems.
problem Tracking cognitive adversaries in counter-adversarial applications.
method Global filtering approach using Monte Carlo methods and differentiable I-PF.
result Demonstrates convergence to optimal inverse filter and improved estimation performance.
Inversion-free natural gradient method for Riemannian manifolds.
problem Hindered by the need for Euclidean space, Fisher information matrix inversion, and computational cost.
method Intrinsic, inversion-free natural gradient method on Riemannian manifolds, using moving approximation of inverse FIM.
result Almost-sure convergence rates and sub-quadratic storage complexity for large-scale applications.
Parameter estimation for model-based clustering using a finite mixture of normal inverse Gaussian (NIG) distributions is achieved through variational Bayes approximations. Univariate NIG mixtures and multivariate NIG mixtures are considered. The use of variational Bayes approximations here is a substantial departure fr…
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.
Paper introduces STSL, a second-order Tweedie sampler for efficient posterior sampling in inverse problems.
problem Computational challenges in sampling from posterior distributions using latent diffusion models.
method Introduces STSL, a novel second-order Tweedie sampler with tractable reverse process.
result STSL achieves 4X and 8X reduction in neural function evaluations compared to state-of-the-art solvers.
We consider the inverse problem of reconstructing the posterior measure over the trajec- tories of a diffusion process from discrete time observations and continuous time constraints. We cast the problem in a Bayesian framework and derive approximations to the posterior distributions of single time marginals using vari…
LazyDINO efficiently solves high-dimensional Bayesian inverse problems with fast and scalable solutions.
problem High-dimensional nonlinear Bayesian inverse problems with expensive parameter-to-observable maps.
method LazyDINO combines derivative-informed neural surrogates and lazy map variational inference for efficient posterior approximation.
result Significant cost reduction in amortized Bayesian inversion, achieving one to two orders of magnitude improvement.
New sampling method for Heston model reduces complexity.
problem Efficient sampling for Heston model's time integrated variance.
method Series expansion, change of measure, Chebyshev polynomial approximations.
result Strong, efficient sampling scheme established for Heston model.
A new method improves convergence in low-rank approximation.
problem Efficiently solving large-scale numerical linear algebra problems.
method Error-Powered Sketched Inverse Iteration (EPSI) Method.
result Convergence rate improves at least linearly with sketch size.
Ginger: An Efficient Curvature Approximation with Linear Complexity for General Neural Networkscs.LG
Ginger efficiently approximates curvature with linear complexity for neural networks.
problem Quadratic memory and cubic time complexity for computing curvature matrices in deep learning.
method Ginger uses eigendecomposition to maintain the inverse of the generalized Gauss-Newton matrix, achieving linear memory and time complexity.
result Ginger provides an effective and efficient curvature approximation for non-convex objectives.
This paper proposes a method to approximate non-Gaussian likelihoods in Gaussian Processes.
problem Approximating non-Gaussian likelihoods in Gaussian Processes.
method Proposes a piece-wise constant approximation for the inverse-link function.
result Yields a closed form solution for the SVGP lower bound.
Paper generalizes tensor-train approximation for complex random variables.
problem Characterizing intractable high-dimensional random variables.
method Extends inverse Rosenblatt transform to general reference measures and integrates into deep variable transformation framework.
result Deep inverse Rosenblatt transport significantly expands tensor approximations for complex random variables.
This paper explores the computational hardness of generating latent vectors for generative models.
problem Computational hardness of generating latent vectors for generative models.
method Established lower bounds for exact and approximate model inversion under strong exponential time hypothesis (SETH) and exponential time hypothesis (ETH).
result Lower bounds for computational complexity of exact and approximate model inversion.
WARPd method solves inverse problems with approximate sharpness conditions.
problem Reconstruction of signals from undersampled and noisy measurements.
method First-order method based on primal-dual iterations with restart-reweight scheme.
result WARPd achieves stable linear convergence under generic approximate sharpness condition.
We conduct a study of the aliased spectral densities of Matérn covariance functions on a regular grid of points, providing clarity on the properties of a popular approximation based on stochastic partial differential equations; while others have shown that it can approximate the covariance function well, we find that i…
Neural networks approximate high-dimensional functions better than theory predicts.
problem Current theory struggles to explain why small neural networks work well in high-dimensional inverse problems.
method Bounding complexity required for neural networks to approximate Hölder or uniformly continuous functions on high-dimensional sets.
result A general theoretical framework explaining empirical successes of smaller networks in inverse problems.
Inference amortization methods share information across multiple posterior-inference problems, allowing each to be carried out more efficiently. Generally, they require the inversion of the dependency structure in the generative model, as the modeller must learn a mapping from observations to distributions approximatin…
A new method for efficient Gaussian process inference using sparse approximations.
problem Scalable and accurate inference for latent Gaussian processes.
method Variational approximation with sparse inverse Cholesky factors and double Kullback-Leibler minimization.
result The proposed method can achieve highly accurate approximations with polylogarithmic time complexity.
RePS improves diffusion models for solving inverse problems efficiently.
problem Solving inverse problems with incomplete or noisy measurements.
method Restart for Posterior Sampling (RePS) using pre-trained diffusion models.
result RePS achieves faster convergence and superior reconstruction quality.
Bayesian inverse problems use generative models for efficient inference.
problem Efficiently solving inverse problems with limited data and expert knowledge.
method Generative models trained on databases, Laplace approximation for prior density.
result Bayes estimates are consistent, not dependent on generative model quality.
Latent-IMH improves Bayesian inference for expensive operators.
problem Efficient sampling from posterior distributions in inverse problems with computationally expensive operators.
method Metropolis-Hastings independence sampler using approximate and exact operators.
result Latent-IMH outperforms existing methods in computational efficiency.
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.
A new method uses DMs as priors for imaging problems, offering more accurate reconstructions.
problem Accurate probabilistic imaging for complex inverse problems.
method Markov chain Monte Carlo algorithm using DMs as plug-and-play priors for solving Bayesian inverse problems.
result Offers more accurate reconstructions and posterior estimation compared to existing methods.
It has long been agreed by academics that the inversion method is the method of choice for generating random variates, given the availability of the quantile function. However for several probability distributions arising in practice a satisfactory method of approximating these functions is not available. The main focu…