The notion of a generalized harmonic inverse mean curvature surface in the Euclidean four-space is introduced. A backward Bäcklund transform of a generalized harmonic inverse mean curvature surface is defined. A Darboux transform of a generalized harmonic inverse mean curvature surface is constructed by a backward Bäck…
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
48 results for “Generalized Inverse”
Seismic inversion method uses GAN to improve efficiency and accuracy.
problem Difficulty in combining geological knowledge with seismic data and assessing uncertainty.
method Generative Adversarial Network (GAN) for seismic inversion.
result GAN-generated models conform to observation data with low uncertainty.
Performance of Machine Learning Methods for Gravity Inversion: Successes and Challengesphysics.geo-ph
CNN outperforms other methods in gravity inversion.
problem Estimating subsurface density from gravitational field data.
method CNN, VAEs, GANs, iterative solvers (GD, GMRES, LGMRES, ICG).
result CNN provides the most reliable reconstructions.
Proves rigidity of circle packings in the plane, generalizing previous work.
problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.
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.
Abstracts a theorem for non-smooth maps in infinite dimensions.
problem Generalizing inverse mapping theorem for non-smooth maps.
method Introduces property A and applies it to non-smooth maps.
result Generalized inverse mapping theorems for non-smooth maps.
Paper proposes efficient image inversion and editing using rectified stochastic differential equations.
problem Inversion and editing of real images using generative models.
method Proposes RF inversion using dynamic optimal control and a linear quadratic regulator, extending to stochastic sampler for Flux.
result Allows state-of-the-art performance in zero-shot inversion and editing, outperforming prior works.
Study inverse problems for twisted geodesic flows on manifolds.
problem Understanding inverse problems for twisted geodesic flows.
method Generalized ray transforms and tensor tomography.
result New insights into rigidity problems for twisted geodesic flows.
New algorithms solve inverse problems using deep learning, converging faster than traditional methods.
problem Solving inverse problems with deep learning models.
method Simple non-convex algorithm for linear and nonlinear inverse problems, with theoretical and empirical support.
result The proposed algorithms converge faster than conventional techniques for certain inverse problems.
Diffusion models tackle noisy inverse problems with posterior sampling.
problem Efficiently solving general noisy inverse problems.
method Approximation of posterior sampling for diffusion models.
result Diffusion models can handle various noise statistics and nonlinear problems.
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 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.
The so-called inverse problem of dynamics is about constructing a potential for a given family of curves. We observe that there is a more general way of posing the problem by making use of ideas of another inverse problem, namely the inverse problem of the calculus of variations. We critically review and clarify differ…
The paper proves a generalized inverse function theorem for curved spaces.
problem Proving a generalized inverse function theorem for curved spaces.
method Obstruction theory for homomorphisms and homotopy transfer theorem for curved algebras.
result A morphism of curved spaces which is a quasi-isomorphism at a point has a local homotopy inverse.
Novel method uses deep generative models for efficient Bayesian inverse problem solving.
problem Efficiently solving inverse problems with large, discrete fields and limited prior information.
method Bayesian inference with deep generative models in low-dimensional latent space.
result Accurate and reliable uncertainty estimates for large-scale inverse problems.
Inversive distance circle packing metric was introduced by P Bowers and K Stephenson \cite{BS} as a generalization of Thurston's circle packing metric \cite{T1}. They conjectured that the inversive distance circle packings are rigid. For nonnegative inversive distance, Guo \cite{Guo} proved the infinitesimal rigidity a…
Given a set of observations generated by an optimization process, the goal of inverse optimization is to determine likely parameters of that process. We cast inverse optimization as a form of deep learning. Our method, called deep inverse optimization, is to unroll an iterative optimization process and then use backpro…
In this note, we give a generalization of the inversion formulas of Pestov-Uhlmann for the geodesic ray transform of functions and vector fields on simple 2-dimensional manifolds of constant curvature. The inversion formulas given here hold for 2-dimensional simple manifolds whose curvatures close to a constant.
Researchers use GANs to infer physics-based inverse problems, quantifying uncertainty and promoting generalizability.
problem Quantifying uncertainty in physics-based inverse problems.
method Trained conditional Wasserstein GANs with U-Net architecture and conditional instance normalization.
result The approach effectively samples from the posterior and promotes generalizability with out-of-distribution samples.
Abstract: Generalizes Milnor-Schwarz lemma to inverse monoids.
problem Applying Milnor-Schwarz lemma to inverse monoids.
method Two proofs provided: elementary and using Vietoris-Rips complex.
result Generalization of Milnor-Schwarz lemma to inverse monoids.
Linear Flows on -Solenoidsmath.DS
Linear flows on inverse limits of tori are defined and it is shown that two linear flows on an inverse limit of tori are equivalent if and only if there is an automorphism of the inverse limit generating the equivalence.
Training-image based geostatistical inversion using a spatial generative adversarial neural networkstat.ML
Probabilistic inversion within a multiple-point statistics framework is often computationally prohibitive for high-dimensional problems. To partly address this, we introduce and evaluate a new training-image based inversion approach for complex geologic media. Our approach relies on a deep neural network of the generat…
Deep learning models for inverse problems are evaluated over time.
problem Solving inverse problems for natural systems from measurements.
method Comparing deep learning approaches on benchmark tasks and proposing neural-adjoint method.
result Neural-adjoint method achieves best performance in many scenarios.
Two new ridge solutions improve BLS on added nodes, achieving better accuracy.
problem Improving the Broad Learning System (BLS) for new nodes.
method Proposed two ridge solutions for BLS output weights, updating efficiently.
result Proposed ridge solutions achieve better testing accuracy than original BLS.
Generative models improve inverse problems by providing tailored priors.
problem Analyzing the error in inverse problems solved with generative priors.
method Quantitative error bounds for minimum Wasserstein-2 generative models.
result The error in the posterior due to the generative prior is bounded by the prior's error in Wasserstein-1 distance.
Proves solvability of general inverse σ_k equations with constant coefficients.
problem Solvability of general inverse σ_k equations with constant coefficients.
method Proves existence of unique solution if a C-subsolution exists.
result Confirms analytical conjecture for deformed Hermitian--Yang--Mills equation.
New method improves image generation for inverse problems using text prompts.
problem Suboptimal performance of existing latent diffusion models for inverse problems.
method Prompt tuning and latent variable projection to optimize text embeddings.
result P2L method outperforms existing methods on various inverse problem tasks.
Paper proves circle packings converge to Riemann mapping for Jordan domains.
problem Proving discrete conformal maps converge to Riemann mapping.
method Establishing solvability theorem for inversive distance circle packings.
result Bowers-Stephenson's conjecture for Jordan domains is proven.
Proves convexity of level sets of general inverse σ_k equations.
problem Convexity of level sets of general inverse σ_k equations.
method Analyzes level sets of degree n general inverse σ_k equations and uses numerical conditions to verify convexity.
result Proves convexity of level sets of general inverse σ_k equations.
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.
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.
Inversive distance circle packing on surfaces was introduced by Bowers-Stephenson as a generalization of Thurston's circle packing and conjectured to be rigid. The infinitesimal and global rigidity of circle packing with nonnegative inversive distance were proved by Guo and Luo respectively. The author proved the globa…
A new machine learning method for Bayesian inverse problems in function spaces.
problem Bayesian inverse problems in function spaces with incompatibility of white noise sources.
method One-step generative transport with amortized neural operator and prior-aligned Gaussian random field.
result Generative operator trained on prior samples and noisy observations generates posterior samples efficiently.
SURGIN uses generative models to infer subsurface flow data efficiently.
problem Inefficient and task-specific inversion methods for subsurface multiphase flow.
method SURGIN integrates U-FNO surrogate with SGM for zero-shot conditional generation.
result Decent inference of heterogeneous geological fields and flow dynamics with uncertainty quantification.
Physics-consistent method improves seismic inversion accuracy.
problem Challenges in seismic full-waveform inversion (FWI) due to ill-posedness and high cost.
method Hybrid approach combining physics-based models with data-driven methodologies, incorporating physics into data augmentation.
result Physics-consistent data-driven inversion yields higher accuracy and better generalization.
The paper studies a flow of Legendre curves, generalizing the inverse curvature flow of regular curves.
problem Analyzing the inverse curvature flow of Legendre curves.
method Investigates the unique existence, monotonicity, and asymptotic behavior of the flow.
result The flow asymptotically converges to a self-similar solution, categorized by initial curve.
New analysis enables inversion of deep generative models with unique solutions.
problem Inverting deep generative models like GANs and VAEs.
method Sparse representation theory and layer-wise inversion pursuit algorithms.
result Invertible solutions for generative models with unique latent vectors.
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.
Solving Linear-Gaussian Bayesian Inverse Problems with Decoupled Diffusion Sequential Monte Carlocs.LG
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.
Develops trace class operators and inverse Laplacian theory for infinite dimensions.
problem Understanding trace class operators and inverse Laplacian on infinite dimensional spaces.
method Presentation of trace class operators and construction of inverse Laplacian on closed manifolds.
result Original trace computations involving the inverse Laplacian on the torus.
We study the inverse optimal control problem in social sciences: we aim at learning a user's true cost function from the observed temporal behavior. In contrast to traditional phenomenological works that aim to learn a generative model to fit the behavioral data, we propose a novel variational principle and treat user …
DIN framework directly models hydraulic conductivity and uncertainty.
problem Modeling hydraulic conductivity and uncertainty in groundwater flow.
method DIN utilizes DDPM as a prior learner, incorporating observational data through conditional injection mechanisms.
result DIN generates multiple constraint-satisfying realizations and accurate uncertainty quantification.
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.
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.
Hierarchical clustering uses OWA operators to generalize linkage methods and avoid dendrogram inversions.
problem Avoiding unaesthetic inversions in hierarchical clustering dendrograms.
method OWA-based linkages combined with the Lance-Williams formula and conditions on weight generators.
result Conditions for weight generators to produce dendrograms without inversions.
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.
EnKG solves inverse problems without derivatives, using diffusion models.
problem Solving inverse problems with derivative-free methods.
method Ensemble Kalman Diffusion Guidance (EnKG) using diffusion models.
result EnKG can solve inverse problems with only forward model evaluations.
The traditional approach of hand-crafting priors (such as sparsity) for solving inverse problems is slowly being replaced by the use of richer learned priors (such as those modeled by generative adversarial networks, or GANs). In this work, we study the algorithmic aspects of such a learning-based approach from a theor…