The inverse-free extreme learning machine (ELM) algorithm proposed in [4] was based on an inverse-free algorithm to compute the regularized pseudo-inverse, which was deduced from an inverse-free recursive algorithm to update the inverse of a Hermitian matrix. Before that recursive algorithm was applied in [4], its impr…
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 “inversion algorithms”
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.
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.
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.
New algorithms speed up inverse reinforcement learning by solving MDPs once.
problem Slow convergence in Maximum Entropy Inverse Reinforcement Learning.
method Deep Inverse Q-learning with constraints exploiting Q-learning.
result Up to several orders of magnitude speedup compared to existing methods.
New method solves linear inverse problems using diffusion models.
problem Linear inverse problems in various domains.
method Posterior sampling with latent diffusion models.
result Provable sample recovery in linear models, outperforming previous methods.
NF-ULA combines Langevin Monte Carlo with normalizing flows for imaging inverse problems.
problem Solving inverse problems in imaging with uncertainty quantification.
method Langevin Monte Carlo with normalizing flow prior.
result NF-ULA outperforms competing methods for severely ill-posed inverse problems.
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.
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.
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…
Paper solves inverse optimal transport problem with convex optimization and neural network.
problem Learning the cost function for optimal transport from observed data.
method Unconstrained convex optimization, Sinkhorn-Knopp algorithm, and deep neural network parameterization.
result Novel framework avoids repeated OT solving, demonstrating efficiency and accuracy.
Enhances inverse design optimization with machine learning and reduced fidelity simulations.
problem Limited compute resources in inverse design optimization.
method Synergy of multi-fidelity simulations, machine learning, and search space reduction.
result Significant computational resource savings and improved optimization performance.
This paper proposes the recursive and square-root BLS algorithms to improve the original BLS for new added inputs, which utilize the inverse and inverse Cholesky factor of the Hermitian matrix in the ridge inverse, respectively, to update the ridge solution. The recursive BLS updates the inverse by the matrix inversion…
Advanced optimization algorithms such as Newton method and AdaGrad benefit from second order derivative or second order statistics to achieve better descent directions and faster convergence rates. At their heart, such algorithms need to compute the inverse or inverse square root of a matrix whose size is quadratic of …
Inverse design of multilayer nanoparticles using artificial neural networks and genetic algorithmeess.SP
New method designs multilayer nanoparticles using AI.
problem Difficult to design multilayer nanoparticles by trial and error.
method Combines genetic algorithm and neural network for inverse design.
result Successfully designs multilayer nanoparticles efficiently.
We consider the problem of joint estimation of structured inverse covariance matrices. We perform the estimation using groups of measurements with different covariances of the same unknown structure. Assuming the inverse covariances to span a low dimensional linear subspace in the space of symmetric matrices, our aim i…
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…
The paper proposes differentially private sliced inverse regression algorithms for high-dimensional data.
problem Privacy concerns in high-dimensional data analysis.
method Differentially private sliced inverse regression algorithms designed for privacy preservation.
result Achieves minimax lower bounds up to logarithmic factors.
Sliced inverse regression (SIR) is a pioneer tool for supervised dimension reduction. It identifies the effective dimension reduction space, the subspace of significant factors with intrinsic lower dimensionality. In this paper, we propose to refine the SIR algorithm through an overlapping slicing scheme. The new algor…
In recent works, both sparsity-based methods as well as learning-based methods have proven to be successful in solving several challenging linear inverse problems. However, sparsity priors for natural signals and images suffer from poor discriminative capability, while learning-based methods seldom provide concrete the…
New method for PKM inverse dynamics second derivatives efficiently.
problem Efficient computation of PKM inverse dynamics second derivatives.
method Recursive Lie-group formulation for serial robots adapted to PKM topology.
result Efficient computation of second time derivatives for PKM.
The paper addresses human-like decision-making in multi-agent systems using bounded risk-sensitive Markov Games.
problem Modeling human-like decision-making in multi-agent systems with risk-seeking and loss-aversion behaviors.
method Forward policy design and inverse reward learning with iterative reasoning and cumulative prospect theory.
result The proposed algorithms demonstrate both risk-averse and risk-seeking behaviors in multi-agent systems.
Efficiently solves inverse PDE problems with Gaussian processes.
problem Solving inverse problems in linear PDEs with noisy data.
method Gaussian process regression with algebraic priors.
result High accuracy and computational efficiency achieved.
DPMC improves inverse problem solving with MCMC, reducing error in noisy conditions.
problem Inaccurate posterior approximation in inverse problems with high noise levels.
method DPMC uses Annealed MCMC to sample through a series of intermediate distributions, reducing accumulated error.
result DPMC outperforms DPS in various inverse problems, reducing error and evaluations.
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.
Study tackles inverse problems on low-dimensional manifolds, proving stability and proposing a reconstruction algorithm.
problem Inverse problems in infinite-dimensional spaces with nonlinear and ill-posed nature.
method Assumption of low-dimensional manifold, proving stability, proposing Landweber-type algorithm.
result Global convergence of the proposed algorithm, Lipschitz stability for specific inverse problems.
Recent applications of machine learning algorithms in the seismic domain have shown great potential in different areas such as seismic inversion and interpretation. However, such algorithms rarely enforce geophysical constraints - the lack of which might lead to undesirable results. To overcome this issue, we have deve…
A new PGA algorithm ensures stable, robust, and noise-immune solutions for non-negative inverse problems.
problem Stable convergence and suboptimal solutions in inverse problems due to negative values and high sensitivity to hyperparameters.
method A novel multiplicative update proximal gradient algorithm (SSO-PGA) that enforces non-negativity and boundedness through a learnable sigmoid-based operator.
result Significantly surpasses traditional PGA and other state-of-the-art algorithms in performance and stability.
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.
This paper considers the problem of inverse reinforcement learning in zero-sum stochastic games when expert demonstrations are known to be not optimal. Compared to previous works that decouple agents in the game by assuming optimality in expert strategies, we introduce a new objective function that directly pits expert…
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.
Survey of deep learning methods for inverse problems, highlighting theoretical challenges.
problem Addressing theoretical gaps in deep learning for inverse problems.
method Survey of existing theoretical developments and open problems.
result Highlighting ongoing challenges in deep learning for inverse problems.
Scaling Up Bayesian Uncertainty Quantification for Inverse Problems using Deep Neural Networksstat.CO
New algorithm speeds up Bayesian UQ for high-dimensional inverse problems.
problem Computational inefficiency in Bayesian inference for high-dimensional inverse problems.
method Deep neural network-based autoencoder for dimension reduction and emulation phase.
result Computational efficiency up to three orders of magnitude with scalable Bayesian UQ.
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.
Rewriting history improves RL algorithms for solving multiple tasks.
problem Improving sample efficiency in multi-task reinforcement learning.
method Introducing hindsight relabeling as inverse RL to generalize goal-relabeling techniques.
result Relabeling data using inverse RL accelerates learning in multi-task settings.
A new algorithm improves posterior sampling for linear inverse problems.
problem Efficiently sampling from posterior distributions in noisy linear inverse problems.
method Proposes \pddim, a DDIM-type sampler that separately samples along singular directions of the measurement operator.
result The method converges to the Bayesian posterior conditioned on the measurements.
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in with arbitrary dimension .…
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.
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.
We show that strictly convex surfaces expanding by the inverse Gauss curvature flow converge to infinity in finite time. After appropriate rescaling, they converge to spheres. We describe the algorithm to find our main test function.
New algorithm reduces performance loss in IRL with mismatched transition dynamics.
problem Performance degradation in inverse reinforcement learning due to mismatched transition dynamics.
method Proposed a robust Maximum Causal Entropy (MCE) IRL algorithm leveraging robust reinforcement learning insights.
result Empirically demonstrated stable performance improvement under transition dynamics mismatches.
Proposes stabilized weights for causal inference using isotonic calibration.
problem Stability and bias issues in inverse propensity weighting.
method Post-hoc isotonic calibration of inverse propensity weights.
result Improves performance of doubly robust estimators of average treatment effect.
Develops a fast algorithm for fitting multilevel factor models.
problem Fitting multilevel factor models with covariance structure.
method Novel expectation-maximization algorithm tailored for multilevel factor models.
result Shows efficient computation of inverse of positive definite MLR matrix.
Improved PDMP samplers for multi-modal distributions using tempering.
problem Struggles of PDMP samplers with multi-modal or heavy-tailed distributions.
method Tempering PDMPs by interpolating between a tractable and posterior distribution.
result PDMP samplers can be improved to sample from multi-modal distributions.
Federated Sufficient Dimension Reduction Through High-Dimensional Sparse Sliced Inverse Regressionstat.ML
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.
We propose an algorithmic framework for convex minimization problems of a composite function with two terms: a self-concordant function and a possibly nonsmooth regularization term. Our method is a new proximal Newton algorithm that features a local quadratic convergence rate. As a specific instance of our framework, w…
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.
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 …