Improves key instance detection in MIL models by using neural network inversion with sparseness constraint.
problem Limited key instance detection performance in attention-based deep MIL models due to skewed attention scores.
method Sparse network inversion with a sparseness constraint incorporated into neural network inversion, solved by proximal gradient method.
result Significantly improved key instance detection performance while maintaining bag-level prediction performance.
We develop a sparse representation method for neural network uncertainty.
problem Estimating model uncertainty in neural networks.
method Sparse representation of model uncertainty using inverse Multivariate Normal Distribution (MND), with a novel sparsification algorithm and analytical sampler.
result The information form of neural networks can be effectively applied for model uncertainty representation, showing competitive performance.
Deep learning has gained great popularity due to its widespread success on many inference problems. We consider the application of deep learning to the sparse linear inverse problem encountered in compressive sensing, where one seeks to recover a sparse signal from a small number of noisy linear measurements. In this p…
Sparse transformer architecture improves accuracy and speed in generative modeling and inverse problems.
problem Improving accuracy and speed in generative modeling and inverse problems.
method Proposes a sparse transformer architecture using regularized Wasserstein proximal operator with L1 prior. result Sparse transformer achieves higher accuracy and faster convergence than classical methods.
New method uses PINNs to solve complex PDEs with sparse measurements.
problem Joint estimation of source and parameters in advection-diffusion equations with limited data.
method Weighted adaptive approach based on neural tangent kernel of PINNs.
result Successful estimation of source function, velocity, and diffusion parameters.
New algorithm improves sparse-view tomography without needing ground-truth data.
problem Poor image reconstructions with sparse projections and non-uniform sensors.
method Unsupervised deep learning with CNN and STN modules.
result Significantly outperforms filtered backprojection in sparse-view scenarios.
Inverse problems in imaging such as denoising, deblurring, superresolution (SR) have been addressed for many decades. In recent years, convolutional neural networks (CNNs) have been widely used for many inverse problem areas. Although their indisputable success, CNNs are not mathematically validated as to how and what …
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.
Algorithms for Gaussian process, marginal likelihood methods or restricted maximum likelihood methods often require derivatives of log determinant terms. These log determinants are usually parametric with variance parameters of the underlying statistical models. This paper demonstrates that, when the underlying matrix …
New method uses generative priors for compressive sensing with sparse solutions.
problem Fundamental linear inverse problem in compressive sensing.
method Sparse Bayesian learning with conditional Gaussianity.
result Ability to learn from few compressed and noisy samples without optimization.
We introduce a methodology to construct parsimonious probabilistic models. This method makes use of Information Filtering Networks to produce a robust estimate of the global sparse inverse covariance from a simple sum of local inverse covariances computed on small sub-parts of the network. Being based on local and low-…
Neural Optimal Design of Experiments improves inverse problem solving efficiency.
problem Optimal experimental design in inverse problems.
method Jointly trains a reconstruction model and design variables in a single loop.
result Significantly reduces computational complexity and improves reconstruction accuracy.
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.
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse covariance matrix of the Gaussian distribution, one can learn the structure of the graph by estimating a sparse inverse covariance matrix from…
Generative neural network designs novel 3D molecules with specified properties.
problem Designing molecules with desired properties in chemistry.
method Conditional generative neural network for 3D molecular structures.
result Demonstrated utility in generating novel molecules with specified motifs or composition.
New method for inferring time series graph from sparse-group log-sum penalty.
problem Inferring conditional independence graph from high-dimensional stationary multivariate Gaussian time series.
method Sparse-group log-sum penalty (LSP) and alternating direction method of multipliers (ADMM) for iterative optimization.
result Local convergence of inverse PSD estimators to the true value with rate of convergence.
Study compares L1 and VG sparsity priors in inverse problems.
problem Sparse regularization in inverse problems with incomplete or corrupted measurements.
method Compared L1 regularization with Variational Garrote (VG), a probabilistic method approximating L0 sparsity.
result VG often achieves lower minimum generalization error and improved stability in strongly underdetermined regimes.
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.
SAGE generates subsurface velocity models from sparse well logs and seismic images.
problem Lack of high-quality subsurface velocity models due to limited data availability.
method Subsurface AI-driven geostatistical extraction using proxy posterior.
result SAGE produces geologically plausible and statistically accurate velocity realizations.
Paper finds sparse representation of functions using inverse scale space flow.
problem Finding sparse representation of L2 functions. method Inverse scale space flow to minimize L2 loss. result Convergence to optimal solution in ideal and noisy cases.
While sparse inverse covariance matrices are very popular for modeling network connectivity, the value of the dense solution is often overlooked. In fact the L2-regularized solution has deep connections to a number of important applications to spectral graph theory, dimensionality reduction, and uncertainty quantificat…
We propose a parallelizable sparse inverse formulation Gaussian process (SpInGP) for temporal models. It uses a sparse precision GP formulation and sparse matrix routines to speed up the computations. Due to the state-space formulation used in the algorithm, the time complexity of the basic SpInGP is linear, and becaus…
Gaussian Markov random fields (GMRFs) are useful in a broad range of applications. In this paper we tackle the problem of learning a sparse GMRF in a high-dimensional space. Our approach uses the l1-norm as a regularization on the inverse covariance matrix. We utilize a novel projected gradient method, which is faster …
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.
Neural networks can approximate positive homogeneous functions, especially with multiple hidden layers.
problem Approximating positive homogeneous functions with neural networks.
method Using scale-invariant ReLU networks with multiple hidden layers.
result Approximation of positive homogeneous functions is possible with neural networks, especially with two hidden layers.
Adversarial robustness improved by sparsity in network weights.
problem How sparsity affects adversarial robustness in neural networks.
method Theoretical proof and experimental validation of adversarial pruning methods.
result Weights sparsity improves adversarial robustness, especially through inheritance from smaller networks.
Carbon capture and storage (CCS) can aid decarbonization of the atmosphere to limit further global temperature increases. A framework utilizing unsupervised learning is used to generate a range of subsurface geologic volumes to investigate potential sites for long-term storage of carbon dioxide. Generative adversarial …
The promise of compressive sensing (CS) has been offset by two significant challenges. First, real-world data is not exactly sparse in a fixed basis. Second, current high-performance recovery algorithms are slow to converge, which limits CS to either non-real-time applications or scenarios where massive back-end comput…
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.
The graphical lasso (glasso) is a widely-used fast algorithm for estimating sparse inverse covariance matrices. The glasso solves an L1 penalized maximum likelihood problem and is available as an R library on CRAN. The output from the glasso, a regularized covariance matrix estimate a sparse inverse covariance matrix e…
Paper tackles estimating initial conditions of spatio-temporal processes from sparse data.
problem Estimating initial conditions of spatio-temporal advection-diffusion processes from sparse data.
method Regularized convex optimization problem with Alternating Direction Method of Multipliers.
result Efficient solutions for non-uniform and shifted uniform sampling schemes.
New method identifies network structure without regularization for sparse teacher couplings.
problem Identifying network structure in inverse Ising problems with model mismatch.
method Ridge linear regression with two-stage estimator.
result Perfect identification of network structure possible without regularization for sparse teacher couplings.
Whereas CNNs have demonstrated immense progress in many vision problems, they suffer from a dependence on monumental amounts of labeled training data. On the other hand, dictionary learning does not scale to the size of problems that CNNs can handle, despite being very effective at low-level vision tasks such as denois…
New method trains sparse Gaussian processes without matrix inversion.
problem Costly training of Gaussian processes at scale.
method Inverse-free approach using matmul-only natural-gradient updates.
result Significantly improved stability and convergence in training.
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.
Develops a method to estimate network difference in high-dimensional time series data.
problem Estimating network differences in high-dimensional data can be unreliable.
method Uses an L1 penalty on the difference of inverse spectral densities to estimate network differences.
result Establishes consistency of the method for sparse network differences.
Iterative shrinkage/thresholding algorithm (ISTA) is a well-studied method for finding sparse solutions to ill-posed inverse problems. In this letter, we present a data-driven scheme for learning optimal thresholding functions for ISTA. The proposed scheme is obtained by relating iterations of ISTA to layers of a simpl…
Sparse representations using data dictionaries provide an efficient model particularly for signals that do not enjoy alternate analytic sparsifying transformations. However, solving inverse problems with sparsifying dictionaries can be computationally expensive, especially when the dictionary under consideration has a …
Proposes a neural network for sparsity regularization in inverse problems using Gaussian mixture.
problem Sparsity in inverse problems with limited significant components.
method Probabilistic sparsity prior as a mixture of degenerate Gaussians, trained with neural network.
result Neural network yields lower mean square error than LASSO, group LASSO, and iterative hard thresholding.
Recently, there has been focus on penalized log-likelihood covariance estimation for sparse inverse covariance (precision) matrices. The penalty is responsible for inducing sparsity, and a very common choice is the convex l1 norm. However, the best estimator performance is not always achieved with this penalty. The …
Solving l1 regularized optimization problems is common in the fields of computational biology, signal processing and machine learning. Such l1 regularization is utilized to find sparse minimizers of convex functions. A well-known example is the LASSO problem, where the l1 norm regularizes a quadratic function. A multil…
Proposes neural networks for solving complex free boundary problems.
problem Solving free boundary and Stefan problems with complex interfaces.
method Physics-informed neural networks for approximating solutions and boundaries.
result Successfully approximates solutions and moving boundaries in various Stefan problems.
Paper proposes a new method for sparse covariance Cholesky factor estimation.
problem Estimating sparse covariance matrices for ordered data.
method Matrix loss penalization approach for sparse Cholesky factor estimation.
result The proposed method outperforms existing regression-based approaches in simulations and real data.
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.
Paper introduces variational inference for Bayesian inverse problems with gamma hyperpriors.
problem Bayesian inverse problems with sparse solutions.
method Variational iterative alternating scheme for hierarchical models with gamma hyperpriors.
result Accurate reconstruction and meaningful uncertainty quantification.
Sparse Inverse Covariance Estimation (SICE) is useful in many practical data analyses. Recovering the connectivity, non-connectivity graph of covariates is classified amongst the most important data mining and learning problems. In this paper, we introduce a novel SICE approach using adaptive thresholding. Our method i…
Paper develops IFTRR to solve sparse generalized eigenvalue problems efficiently.
problem Finding the leading eigenvector with at most k nonzero entries in sparse generalized eigenvalue problems.
method Inverse-free truncated Rayleigh-Ritz method (IFTRR) with a new truncation strategy.
result IFTRR efficiently finds the support set of the leading eigenvector for large scale problems.
FM4PDE learns PDE solutions from sparse data.
problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.