Exact posterior score estimation for solving linear inverse problems
problem Solving linear inverse problems
method Derive the exact posterior score and use it as a denoising training objective
result EPS outperforms training-free and training-based baselines on various metrics
New method uses diffusion models for Bayesian inverse problems.
problem Solving Bayesian inverse problems with linear-Gaussian models.
method Decoupled Diffusion Sequential Monte Carlo (DDSMC) method.
result Asymptotically exact solution demonstrated on various data types.
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.
Survey on inverse exponential Radon transform methods.
problem Analytical methods for inverse exponential Radon transform.
method Derivation of classical inversion formula, finite Hilbert transform, exact reconstruction from partial measurements, diverging-beam data.
result Exact reconstruction from 180 degree data using finite Hilbert transform.
New method for debiased inference without assuming exact solutions in inverse problems.
problem Dealing with inverse problems where exact solutions may not exist.
method Nonparametric instrumental variable analysis without structural equations.
result Valid inference on functionals of inverse problems without assuming exact solutions.
A new method approximates the exact posterior score for diffusion models.
problem Training-free guidance of diffusion models for image restoration and inverse problems.
method Presented a novel expression for the exact posterior score, leveraging it to compute step sizes on the fly.
result Demonstrated competitive performance with fewer time steps compared to state-of-the-art techniques.
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.
Right inverse found for Cartan differential in rank-1 symmetric spaces.
problem Finding a right inverse for the Cartan differential in symmetric spaces.
method Integral operator approach to the Cartan differential on exact forms.
result Extension of Gauss linking integral to rank-1 symmetric spaces.
The language of Lagrangian submanifolds is used to extend a geometric characterization of the inverse problem of the calculus of variations on tangent bundles to regular Lie algebroids. Since not all closed sections are locally exact on Lie algebroids, the Helmholtz conditions on Lie algebroids are necessary but not su…
Unified framework recovers exact input from SOM activation patterns.
problem Generating high-dimensional data from Self-Organizing Maps (SOMs).
method Inverting SOM activation patterns to recover input, using linear system and Tikhonov regularization.
result MUSIC framework produces coherent semantic transitions and maintains high classifier confidence.
This paper concerns the inverse mean curvature flow of convex hypersurfaces which are Lipschitz in general. After defining a weak solution, we study the evolution of the singularity by looking at the blow-up tangent cone around each singular point. We prove the cone also evolves by the inverse mean curvature flow and e…
Let M be a manifold, possibly with boundary. We show that the deRham differential from k-forms to exact (k+1)-forms has a continuous right inverse when both spaces are given the weak Whitney topology. This antidifferential operator is given a fairly explicit formula depending on the choice of a suitable good cover of M…
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…
Novel Bayesian framework for Poisson inverse problems using Bregman geometry.
problem Solving Poisson inverse problems with non-Euclidean geometry and positivity constraints.
method Develops a Monte Carlo sampling algorithm that accounts for Bregman geometry, data augmentations, and conditional conjugacy properties.
result Efficient sampling via Gibbs steps and Hessian Riemannian Langevin Monte Carlo (HRLMC) for positivity constraints.
The article concerns the problem if a~given system of differential equations is identical with the Euler--Lagrange system of an~appropriate variational integral. Elementary approach is applied. The main results involve the determination of the first--order variational integrals related to the second--order Euler--Lagra…
Bayesian framework for image inversion using regularization by denoising.
problem Image inversion and regularization in imaging tasks.
method Bayesian approach with Langevin-within-split Gibbs sampling.
result Demonstrates the effectiveness of the proposed method through numerical experiments.
In distributed optimization and distributed numerical linear algebra, we often encounter an inversion bias: if we want to compute a quantity that depends on the inverse of a sum of distributed matrices, then the sum of the inverses does not equal the inverse of the sum. An example of this occurs in distributed Newton's…
We endow the group of automorphisms of an exact Courant algebroid over a compact manifold with an infinite dimensional Lie group structure modelled on the inverse limit of Hilbert spaces (ILH). We prove a slice theorem for the action of this Lie group on the space of generalized metrics. As an application, we show that…
Algorithm samples from Bingham distribution efficiently.
problem Sampling from the Bingham distribution on a sphere.
method Rejection sampling with polynomial approximation.
result Exact samples from Bingham distribution in polynomial time.
Unified framework for forward and inverse PDE problems in multiphase media.
problem Non-differentiable inverse problems in discrete-valued material fields.
method GenPANIS: Latent-variable generative framework preserving discrete microstructures.
result Unified bidirectional inference with minimal labeled pairs and physics-aware decoder.
This work discovers algebraic structures from data using a differentiable measure.
problem Discovering discrete algebraic rules from data.
method Formalizes the problem through Cayley-table completion and uses HyperCube operator-valued tensor factorization.
result Derives an absolute lower bound for the differentiable measure of algebraic complexity, proving it is attained only for group structures.
Improved causal discovery methods for large graphs without strict assumptions.
problem Sub-optimal solutions due to faithfulness assumption violations.
method Super-structure estimation and local search strategies.
result The proposed method scales to hundreds of nodes with high accuracy.
We study the problem of inverting a deep generative model with ReLU activations. Inversion corresponds to finding a latent code vector that explains observed measurements as much as possible. In most prior works this is performed by attempting to solve a non-convex optimization problem involving the generator. In this …
Modeling driver trajectories using inverse reinforcement learning and random utility.
problem Modeling rational driver behavior in road networks from sparse sensor data.
method Apply random utility theory to model unknown reward function, introduce extended state, and use Markov decision process.
result Maximum entropy inverse reinforcement learning is a special case of the proposed approach.
A new fast method simulates stochastic volatility models.
problem Simulating stochastic volatility models efficiently.
method Karhunen-Loève expansions to express stochastic volatility as sine series, followed by analytical derivation of integrals.
result Simulation is several hundred times faster than existing methods.
Self Normalizing Flows improve normalizing flows by reducing computational complexity.
problem Efficient gradient computation in normalizing flows, especially in Jacobian determinant terms.
method Introducing Self Normalizing Flows that replace expensive terms with learned approximate inverses.
result Models can be trained more quickly and perform better than functionally constrained counterparts.
Exact recovery method for community detection in Gaussian mixtures with dependent noise.
problem Community detection in Gaussian mixtures with dependent and heterogeneous noise.
method Maximum likelihood estimator (MLE) for constrained quadratic optimization problem, using Σ-whitened separation and local inequalities. result Sharp exact-recovery threshold and no-gap mechanism in the unknown-size setting.
Four new methods for computing generalized chi-square distribution.
problem Computing the generalized chi-square distribution accurately and efficiently.
method Two exact and two approximate methods, with software for cdf, pdf, and inverse cdf.
result Comparison of methods' accuracy and speed, identifying best for different cases.
EiGLasso speeds up sparse Kronecker-sum covariance estimation.
problem Sparse Kronecker-sum inverse covariance estimation challenges in scalability and parameter identification.
method Newton's method combined with eigendecomposition of sample and feature graphs, approximating Hessian for speed.
result Two to three orders-of-magnitude speed-up on simulated and real-world data.
SKT improves EKI for Bayesian inverse problems with non-Gaussian targets.
problem Efficiently solving Bayesian inverse problems with expensive forward models and non-Gaussian posterior distributions.
method Embedding EKI and FAKI within a Bayesian annealing scheme to adapt tpCN sampler.
result Significant improvements in convergence rate compared to standard SMC and pCN.
Solving a bilevel optimization problem is at the core of several machine learning problems such as hyperparameter tuning, data denoising, meta- and few-shot learning, and training-data poisoning. Different from simultaneous or multi-objective optimization, the steepest descent direction for minimizing the upper-level c…
Rex solves the inverse problem for ODE/SDE solvers, improving precision and stability.
problem Inversion of ODE/SDE solvers is inaccurate and impractical for precision applications.
method Rex uses Lawson methods to convert explicit Runge-Kutta schemes into algebraically reversible ones.
result Rex achieves near-machine-precision reconstruction and improves generative models.
A generic degenerate Lagrangian system of even and odd variables on an arbitrary smooth manifold is examined in terms of the Grassmann-graded variational bicomplex. Its Euler-Lagrange operator obeys Noether identities which need not be independent, but satisfy first-stage Noether identities, and so on. However, non-tri…
This study explores magnetic trajectories on the Heisenberg group, finding symmetries and solutions.
problem Understanding magnetic geodesics on the Heisenberg group with invariant Lorentz force.
method Analyzing the Heisenberg Lie group with a non-commutative product, deriving magnetic equations, identifying symmetries, and solving variational problems.
result Magnetic trajectories are solutions to a variational problem, providing explicit examples of Lagrangians.
Dual-space sampling tackles ill-conditioned inverse problems with Bayesian methods.
problem Bayesian inference in constrained inverse problems with ill-conditioned solutions.
method Dual-space posterior sampling using ADMM and SVGD.
result Well-calibrated uncertainty estimates and posterior contraction with increasing data.
New formula for implied volatility from Black-Scholes model.
problem Computing implied volatility from Black-Scholes model.
method Analytical solution using inverse Gaussian distribution.
result Explicit formulas for implied volatility with high precision.
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.
Exact risk and learning rate curves derived for adaptive SGD on high-dimensional problems.
problem Analyzing risk and learning rate dynamics in high-dimensional optimization problems.
method Developed a framework to give exact expressions for risk and learning rate curves using ODEs.
result Exact expressions for risk and learning rate curves, with detailed analysis of two adaptive learning rates.
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.
TERA method speeds up derivative Gaussian processes in high dimensions.
problem High-dimensional function evaluations and gradient computations are computationally expensive.
method TERA uses exact gradient reduction to decouple n and d from the computational cost. result TERA achieves state-of-the-art predictive accuracy with orders of magnitude faster computation.
The abstract introduces a new A∞ duality via LSFT algebra.
problem Legendrian knot duality and its A∞ extension. method Using Ng's LSFT algebra, the abstract upgrades duality to a quasi-isomorphism of A∞ bimodules over Aug+. result Explicit construction of homotopy inverse for the A∞ Sabloff map. Study on Čech-de Rham obstruction in diffeological spaces.
problem Obstruction to Čech-de Rham map being an isomorphism in diffeological spaces.
method Higher topos theory, homotopy pullback diagrams, Čech-de Rham bicomplex, ∞-stack cohomology. result New exact sequences in all higher degrees and conceptual proof of cohomology agreement.
RADIS uses deep regression to create efficient importance sampling for model inversion and emulation.
problem Efficiently sampling from posterior distributions for model inversion and emulation.
method RADIS uses a deep architecture of nested importance sampling schemes to construct a non-parametric emulator that mimics the posterior distribution.
result RADIS asymptotically converges to an exact sampler under mild conditions and can be used as a surrogate model.
Develops exact and invariant study-based decompositions for network meta-analysis.
problem Lack of exact contribution decompositions in network meta-analysis.
method Contrast-space projection formulation of NMA, study-based definition of direct and indirect evidence.
result Exact covariance-aware decompositions of NMA estimator into direct and indirect contributions.
Study simulates Variance Gamma processes for energy derivatives pricing.
problem Simulating Variance Gamma processes for accurate energy derivative pricing.
method Three-step procedure to relate self-decomposability to increments, derived from Qu et al. (2019). Exact simulation of skeleton of Variance Gamma and symmetric Variance Gamma driven Ornstein-Uhlenbeck processes.
result Exact simulation of Variance Gamma and related processes without numerical inversion.
The paper calculates heat kernel and closed geodesic asymptotics for nilpotent coverings.
problem Heat kernel and closed geodesic asymptotics for nilpotent coverings.
method Finite-dimensional rational Floquet-Bloch theory, Pytlik functional, and spectral sums.
result Genuinely local, pointwise higher-order heat-kernel expansions.
The paper analyzes multivariate Hawkes processes and their induced population processes.
problem Analyzing the time-dependent joint probability distribution of multivariate Hawkes processes.
method Exact and asymptotic analysis of general multivariate Hawkes processes and their induced population processes.
result Full characterization of the time-dependent joint transform of the multivariate population process and its intensity process.
Proves new inequality linking spectral numbers of Lagrangians and their reductions.
problem Understanding spectral properties of Lagrangian submanifolds.
method Develops inverse reduction inequalities for spectral numbers.
result Proof of inequality between spectral numbers of Lagrangian and its reductions.