30
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      An approximate empirical Bayesian method for large-scale linear-Gaussian inverse problems

      Preprint
      , ,

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We study Bayesian inference methods for solving linear inverse problems, focusing on hierarchical formulations where the prior or the likelihood function depend on unspecified hyperparameters. In practice, these hyperparameters are often determined via an empirical Bayesian method that maximizes the marginal likelihood function, i.e., the probability density of the data conditional on the hyperparameters. Evaluating the marginal likelihood, however, is computationally challenging for large-scale problems. In this work, we present a method to approximately evaluate marginal likelihood functions, based on a low-rank approximation of the update from the prior covariance to the posterior covariance. We show that this approximation is optimal in a minimax sense. Moreover, we provide an efficient algorithm to implement the proposed method, based on a combination of the randomized SVD and a spectral approximation method to compute square roots of the prior covariance matrix. Several numerical examples demonstrate good performance of the proposed method.

          Related collections

          Most cited references13

          • Record: found
          • Abstract: not found
          • Article: not found

          Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Inverse problems: A Bayesian perspective

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix

                Bookmark

                Author and article information

                Journal
                2017-05-22
                Article
                1705.07646
                04c24824-475a-46a8-89ce-1c7628582b03

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                math.NA stat.CO

                Numerical & Computational mathematics,Mathematical modeling & Computation

                Comments

                Comment on this article