Pith. sign in

REVIEW 1 cited by

Constructing structured tensor priors for Bayesian inverse problems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.17597 v1 pith:STI322NF submitted 2024-06-25 math.NA cs.LGcs.NAcs.SYeess.SPeess.SYmath.STstat.TH

classification math.NAcs.LGcs.NAcs.SYeess.SPeess.SYmath.STstat.TH
keywords problemsbayesianinversematrixpriorpriorstensorsbelief
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Specifying a prior distribution is an essential part of solving Bayesian inverse problems. The prior encodes a belief on the nature of the solution and this regularizes the problem. In this article we completely characterize a Gaussian prior that encodes the belief that the solution is a structured tensor. We first define the notion of (A,b)-constrained tensors and show that they describe a large variety of different structures such as Hankel, circulant, triangular, symmetric, and so on. Then we completely characterize the Gaussian probability distribution of such tensors by specifying its mean vector and covariance matrix. Furthermore, explicit expressions are proved for the covariance matrix of tensors whose entries are invariant under a permutation. These results unlock a whole new class of priors for Bayesian inverse problems. We illustrate how new kernel functions can be designed and efficiently computed and apply our results on two particular Bayesian inverse problems: completing a Hankel matrix from a few noisy measurements and learning an image classifier of handwritten digits. The effectiveness of the proposed priors is demonstrated for both problems. All applications have been implemented as reactive Pluto notebooks in Julia.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Randomized Tucker-Sketched GMRES

    math.NA 2026-08 conditional novelty 6.0 of 10

    Two sketched GMRES variants in Tucker format, using randomized HOSVD and multilinear Nyström compression, solve tensor linear systems with reduced memory and time, and low-rank compression regularizes inverse problems.

Pith tools