Paper uses SGD for solving linear inverse problems, improving empirical performance.
problem Solving statistical inverse problems in science and engineering.
method Stochastic Gradient Descent (SGD) for linear inverse problems, with smoothing techniques.
result Consistency and finite sample bounds for excess risk demonstrated.
New methods tackle statistical inverse problems with random data.
problem Statistical inverse problems with random experimental design.
method Spectral regularization, regularization by projection, convex penalties.
result Minimax rates in expectation and probability for convergence.
The paper analyzes Tikhonov regularization in Hilbert scales for statistical inverse problems.
problem Statistical inverse problems in Hilbert scales with general noise.
method Tikhonov regularization scheme with conditional stability estimates and high probability error bounds.
result Explicit rates of convergence for oversmoothing and regular cases over defined regularity classes.
Paper addresses travel time tomography stability and statistical inversion.
problem Determining conformal factors of metrics from geodesic lengths.
method Established forward and inverse stability estimates; applied to Bayesian statistical inversion.
result Consistency of statistical inversion technique for travel time tomography.
Statistical analysis of algorithm unrolling for inverse problems.
problem Designing deep neural networks to solve inverse problems efficiently.
method Analysis of gradient descent network (GDN) unrolling depth and statistical performance.
result The optimal statistical performance of GDNs requires unrolling depth of order log(n)/log(ρ_n^-1), where ρ_n is the convergence rate.
Statistical methods remain relevant for ODE inverse problems, especially with sparse data.
problem The relevance of statistical methods in the era of deep learning for ODE inverse problems.
method Employed physics-informed neural networks (PINN) and manifold-constrained Gaussian process inference (MAGI) to compare statistical and deep learning approaches.
result Statistically principled methods outperform deep learning models in tasks like parameter inference and trajectory reconstruction.
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.
The inverse Ising problem seeks to reconstruct the parameters of an Ising Hamiltonian on the basis of spin configurations sampled from the Boltzmann measure. Over the last decade, many applications of the inverse Ising problem have arisen, driven by the advent of large-scale data across different scientific disciplines…
This work analyzes the generalization properties of learned reconstruction methods for inverse problems.
problem Understanding the reliability and stability of learned reconstruction methods for inverse problems.
method Develops a general framework to interpret learned reconstruction methods in statistical learning context and performs their sample error analysis.
result Estimates the dependence of learned operators on training data, providing insights into their generalization properties.
New methods tackle complex inverse problems with scalable optimization-based MCMC.
problem Estimating high-dimensional model parameters and hyperparameters in nonlinear hierarchical statistical inverse problems.
method Optimization-based Markov chain Monte Carlo (MCMC) methods using RTO and pseudo-marginal MCMC.
result Efficient sampling tools for hierarchical Bayesian inversion with robust performance to model parameter dimensions.
Develops statistical framework for resolving reward function ambiguity in inverse reinforcement learning.
problem Non-uniqueness of reward functions in inverse reinforcement learning.
method Entropy regularization combined with least-squares reconstruction of the reward from the soft Bellman residual.
result Least-squares reward function is unique and consistent with the expert policy.
Bayesian geoacoustic inversion improved using MDN.
problem Efficiently solving Bayesian geoacoustic inversion problems.
method Deriving geoacoustic statistics from multidimensional posterior density using MDN, training the network on the whole parameter space.
result The network provides reliable predictions and good generalization performance, solving problems in seconds.
Study improves estimation of functions from noisy data using convex penalties.
problem Estimating functions from noisy point evaluations of linear operators.
method Tikhonov regularization with convex and p-homogeneous penalty functionals. result Derives concentration rates for regularized solutions in symmetric Bregman distance.
Paper introduces a new measure of conditional dependence avoiding matrix inversions.
problem Measuring conditional dependence between two phenomena influenced by a confounder.
method Uses U-statistics pruning to avoid matrix inversions and re-interpret independence.
result Proposes a novel measure of conditional dependence that avoids matrix inversions.
We study a non-linear statistical inverse learning problem, where we observe the noisy image of a quantity through a non-linear operator at some random design points. We consider the widely used Tikhonov regularization (or method of regularization, MOR) approach to reconstruct the estimator of the quantity for the non-…
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.
Gradient descent and SGD solve nonlinear inverse problems efficiently.
problem Solving nonlinear inverse problems with random design.
method Gradient descent and SGD with mini-batching, under classical assumptions.
result Achieves optimal convergence rates in RKHS framework.
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.
We state the problem of inverse reinforcement learning in terms of preference elicitation, resulting in a principled (Bayesian) statistical formulation. This generalises previous work on Bayesian inverse reinforcement learning and allows us to obtain a posterior distribution on the agent's preferences, policy and optio…
New spatiotemporal Besov process improves CT image reconstruction and other inverse problems.
problem Handling abrupt changes and sharp contrasts in spatiotemporal data.
method Generalized Besov process (STBP) with Q-exponential process for temporal correlation.
result STBP outperforms traditional methods in dynamic reconstruction and inverse problems.
Study rates of convergence for approximate solutions to linear ill-posed problems in Hilbert scales.
problem Linear ill-posed inverse problems with noisy data.
method Approximate reconstructions from random noisy data using regularization schemes in Hilbert scale.
result Explicitly established error bounds for smooth regression functions.
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…
This paper presents a unified geometric framework for the statistical analysis of a general ill-posed linear inverse model which includes as special cases noisy compressed sensing, sign vector recovery, trace regression, orthogonal matrix estimation, and noisy matrix completion. We propose computationally feasible conv…
Optical flow refers to the visual motion observed between two consecutive images. Since the degree of freedom is typically much larger than the constraints imposed by the image observations, the straightforward formulation of optical flow as an inverse problem is ill-posed. Standard approaches to determine optical flow…
Framework uses deep learning and statistical models to solve PDEs with discontinuous coefficients.
problem Solving PDEs with discontinuous coefficients.
method Two-stage physics-informed deep learning and statistical mixture models.
result Framework achieves adaptability and accurate parameter identification.
Paper develops a method to learn optimal sparsity-promoting regularizers for linear inverse problems.
problem Solving linear inverse problems with sparse solutions.
method Bilevel optimization framework to select an optimal synthesis operator B. result Established well-posedness and theoretical guarantees for the learning process.
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.
We consider a statistical inverse learning problem, where we observe the image of a function f through a linear operator A at i.i.d. random design points Xi, superposed with an additive noise. The distribution of the design points is unknown and can be very general. We analyze simultaneously the direct (estimati…
New method bypasses assumptions for unbiased estimation of complex system interactions.
problem Inferring pair-wise and higher-order interactions from observational data.
method Cross-disciplinary approach using Targeted Learning for unbiased estimation.
result Universal estimator of all-order symmetric interactions without parametric assumptions.
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.
IDA adapts to non-iid data in federated learning for medical imaging.
problem Statistical heterogeneity in federated learning data, especially in medical imaging.
method IDA (Inverse Distance Aggregation) is a novel adaptive weighting approach for clients based on meta-information.
result IDA outperforms Federated Averaging in handling unbalanced and non-iid data in federated learning.
Characterizing statistical properties of solutions of inverse problems is essential for decision making. Bayesian inversion offers a tractable framework for this purpose, but current approaches are computationally unfeasible for most realistic imaging applications in the clinic. We introduce two novel deep learning bas…
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.
We consider basic conceptual questions concerning the relationship between statistical estimation and causal inference. Firstly, we show how to translate causal inference problems into an abstract statistical formalism without requiring any structure beyond an arbitrarily-indexed family of probability models. The forma…
New algorithm reduces dimensionality in federated learning.
problem Estimating central dimension reduction subspace and variable selection in federated learning.
method Federated sparse sliced inverse regression, convex optimization, linearized alternating direction method of multipliers.
result Upper bound of statistical error rate established under heterogeneous setting.
Neural network solves inverse problem in multiscale mechanics.
problem Identifying elastic properties of random materials.
method Artificial neural networks trained on processed databases.
result Robust identification method validated with synthetic and real data.
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.
New framework recovers reward and rationality parameters from game behavior.
problem Statistical ambiguity in identifying reward and rationality parameters in competitive games.
method Blind Inverse Game Theory (Blind-IGT) using entropy-regularized Quantal Response Equilibrium and Normalized Least Squares (NLS) estimator.
result Optimal convergence rate of O(N−1/2) for joint parameter recovery. Many problems in machine learning and statistics can be formulated as (generalized) eigenproblems. In terms of the associated optimization problem, computing linear eigenvectors amounts to finding critical points of a quadratic function subject to quadratic constraints. In this paper we show that a certain class of con…
The paper tackles inverse uncertainty quantification in neutron noise analysis.
problem Uncertainty in estimating material properties from noisy neutron correlation measurements.
method Surrogate models and inverse uncertainty quantification to account for measurement error and model bias.
result Improved prediction of neutron correlations and quantification of uncertainties.
Many mathematical imaging problems are posed as non-convex optimization problems. When numerically tractable global optimization procedures are not available, one is often interested in testing ex post facto whether or not a locally convergent algorithm has found the globally optimal solution. When the problem is formu…
Scalability of statistical estimators is of increasing importance in modern applications and dimension reduction is often used to extract relevant information from data. A variety of popular dimension reduction approaches can be framed as symmetric generalized eigendecomposition problems. In this paper we outline how t…
Unified derivation of diffusion models using PDEs for inverse problems.
problem Solving inverse problems in physics-based applications.
method Deriving diffusion models using PDEs for a unified approach.
result Unified derivation and new class of variance preserving models.
Sharp statistical theory for conditional diffusion models.
problem Lack of theoretical foundation for conditional diffusion models.
method Sharp statistical theory with approximation of conditional score function.
result Sample complexity bound that adapts to data distribution smoothness.
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.
Proposes a method to learn both constraints and objective functions from data.
problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.
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…
New framework uses score-based priors to solve ill-conditioned polynomial equations, improving signal recovery from noisy data.
problem Recovering signals from low-order moments in inverse problems, especially ill-conditioned polynomial equations.
method Integrates score-based diffusion priors with moment-based estimators to regularize and solve nonlinear inverse problems.
result Diffusion priors improve recovery from third-order moments and make super-resolution MTD feasible.