A scalable estimator of sets of integral operators

Abstract

We propose a scalable method to find a subspace H of low-rank tensors that simultaneously approximates a set of integral operators. The method can be seen as a generalization of the Tucker-2 decomposition model, which was never used in this context. In addition, we propose to construct a convex set C ⊂ H as the convex hull of the observed operators. It is a minimax optimal estimator under the Nikodym metric. We then provide an efficient algorithm to compute projection on C. We observe a good empirical behavior of the method in simulations. The main aim of this work is to improve the identifiability of complex linear operators in blind inverse problems.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…