Geometrically studies Moore-Penrose inverse and polar decomposition continuity.
problem Continuity of Moore-Penrose inverse for perturbations by operator ideals.
method Geometric construction using essential codimension and Banach-Lie group action.
result Moore-Penrose inverse is a real analytic map between manifolds.
An iterative method of learning has become a paradigm for training deep convolutional neural networks (DCNN). However, utilizing a non-iterative learning strategy can accelerate the training process of the DCNN and surprisingly such approach has been rarely explored by the deep learning (DL) community. It motivates thi…
We present a non-parametric method to estimate the discount curve from market quotes based on the Moore-Penrose pseudoinverse. The discount curve reproduces the market quotes perfectly, has maximal smoothness, and is given in closed-form. The method is easy to implement and requires only basic linear algebra operations…
New method differentiates square-root Kalman filters robustly.
problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.
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.
A new framework for sparse regression models with slow variations.
problem Parameter estimation for sparse regression models with slow variations.
method Formulated as a mixed-integer optimization problem, then reformulated as a binary convex optimization problem with a novel relaxation technique.
result Efficiently solves the problem to provable optimality using a cutting plane-type algorithm.
New invariant for special alternating links based on graph Laplacian.
problem Developing an invariant for special alternating links.
method Using the Laplacian matrix of the Tait graph, invariant is defined.
result A specific quadratic trace expression is invariant under flype moves.
New ELM algorithms reduce computation time and complexity.
problem Efficient computation of extreme learning machine (ELM) algorithms.
method Developed inverse-free ELM algorithms using recursive matrix inverse and inverse LDL' factorization.
result Proposed algorithms significantly reduce computational complexity.
Proof of convergence for multi-objective optimization using inverse reinforcement learning.
problem Proving convergence in multi-objective optimization problems.
method Wasserstein inverse reinforcement learning with projective subgradient method and gradient descent.
result Convergence of inverse reinforcement learning for multi-objective optimization.
Two new inverse-free ELM algorithms for incremental and decremental learning are proposed.
problem Efficiently updating and removing multiple hidden nodes in ELM.
method Improved inverse-free recursive algorithms for Tikhonov regularization.
result Inverse-free algorithms for ELM with multiple hidden nodes and redundant nodes.
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…
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.
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.
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.
Study shows how optimization affects deep neural network performance as model size increases.
problem Understanding the performance of deep neural networks as model size increases.
method Careful study of learning dynamics for least squares scenario, providing an excess risk bound.
result Excess risk bound depends on the smallest non-zero eigenvalue of the covariance matrix of input features, showing double descent behavior.
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.
The paper studies Möbius inversion on surfaces in Minkowski 3-space.
problem Understanding transformations of surfaces in Minkowski space.
method Definition and properties of Möbius inversion on surfaces in Minkowski 3-space.
result Möbius inversion preserves lines of principal curvature and degenerate metric points but not parabolic sets.
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…
The aim of the paper is to investigate the relation between inverse limit of branched manifolds and codimension zero laminations. We give necessary and sufficient conditions for such an inverse limit to be a lamination. We also show that codimension zero laminations are inverse limits of branched manifolds. The inverse…
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.
The inversion formula for conservative multifractal measures was unveiled mathematically a decade ago, which is however not well tested in real complex systems. In this Letter, we propose to verify the inversion formula using high-frequency turbulent financial data. We construct conservative volatility measure based on…
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.
Global inverse function theorem proved easily using Riemannian geometry.
problem Global inverse function theorem in Riemannian geometry.
method Hopf--Rinow theorem in Riemannian geometry.
result Hadamard's global inverse function theorem is proven easily.
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.
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.
The paper explains how microlocal analysis solves geometric inverse problems.
problem Recovering geometric information from boundary measurements.
method Microlocal analysis applied to three inverse problems.
result Microlocal techniques solve specific inverse problems in Riemannian geometry.
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 constructs solutions for evolving hypersurfaces using inverse spacetime mean curvature.
problem Evolution of hypersurfaces in spacetime.
method Weak solutions for hypersurfaces evolving along inverse spacetime mean curvature in asymptotically flat maximal initial data sets.
result Weak solution detects both future- and past-trapped apparent horizons.
Deep learning methods improve subsurface flow modeling efficiency.
problem Efficiently modeling subsurface flow with uncertain parameters.
method Two categories of deep-learning based inverse modeling methods: surrogate-based and direct.
result Deep-learning methods significantly accelerate subsurface flow modeling.
Two efficient ridge solutions improve BLS for new inputs, enhancing accuracy and speed.
problem Improving BLS for new added inputs in a learning system.
method Proposes recursive and square-root BLS algorithms using inverse and inverse Cholesky factor updates.
result Both proposed ridge solutions improve BLS accuracy and speed, especially with larger lambda.
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.
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.
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.
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.
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.
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.
We give a counterexample of Bowers-Stephenson's conjecture in the spherical case: spherical inversive distance circle packings are not determined by their inversive distances.
We solve image inverse problems using a flow-based noise model.
problem Image inverse problems with complex noise patterns.
method Normalizing flow prior for maximum a posteriori estimation.
result Empirical validation on various inverse problems.
Study on Frobenius manifold structures and inversion symmetry.
problem Understanding inversion symmetry in solutions to Witten-Dijkgraaf-Verlinde-Verlinde equations.
method Using conjugacy relations on Frobenius manifold structures and flat pencils of metrics.
result Geometric interpretation of inversion symmetry.
Paper shows how sparse inversion speeds up log determinant derivatives.
problem Deriving log determinant derivatives for sparse matrices.
method Sparse inversion, selected inversion, accelerates computation.
result Derivative of log determinant can be computed faster with sparse inversion.
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.
Enhances OTA FL algorithms by defining inverse feasibility for linear models.
problem Improving security and privacy in over-the-air federated learning.
method Defines inverse feasibility as an upper bound on condition number, analyzes existing model, proposes new model.
result Proposes a new OTA FL model with enhanced characteristics.
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.
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.
We explore inverse and quanto inverse crypto options, their pricing, and applications.
problem Market incompleteness in crypto options trading.
method Comparison of direct and inverse options, and introduction of currency-protected 'quanto' options.
result Pricing and hedging characteristics of inverse and quanto inverse options in a Black-Scholes framework.
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.
Efficient algorithm removes redundant nodes and obsolete samples in machine learning.
problem Pruning redundant nodes and removing obsolete training samples in machine learning.
method Deduced decremented learning algorithms from incremental learning algorithms, using inverse Cholesterol factor and unitary transformation.
result Proposed decremented learning algorithms efficiently prune redundant nodes and remove obsolete training samples.
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.