Search arXivSearch

arXiv · 2003.01411

Divergences. Scale invariant Divergences. Applications to linear inverse problems. N.M.F. Blind deconvolution

Abstract

This book deals with functions allowing to express the dissimilarity (discrepancy) between two data fields or ''divergence functions'' with the aim of applications to linear inverse problems. Most of the divergences found in the litterature are used in the field of information theory to quantify the difference between two probability density functions, that is between positive data whose sum is equal to one. In such context, they take a simplified form that is not adapted to the problems considered here, in which the data fields are non-negative but with a sum not necessarily equal to one. In a systematic way, we reconsider the classical divergences and we give their forms adapted to inverse problems. To this end, we will recall the methods allowing to build such divergences, and propose some generalizations. The resolution of inverse problems implies systematically the minimisation of a divergence between physical measurements and a model depending of the unknown parameters. In the context image reconstruction, the model is generally linear and the constraints that must be taken into account are the non-negativity as well as (if necessary) the sum constraint of the unknown parameters. To take into account in a simple way the sum constraint, we introduce the class of scale invariant or affine invariant divergences. Such divergences remains unchanged when the model parameters are multiplied by a constant positive factor. We show the general properties of the invariance factors, and we give some interesting characteristics of such divergences.An extension of such divergences allows to obtain the property of invariance with respect to both the arguments of the divergences; this characteristic can be used to introduce the smoothness regularization of inverse problems, that is a regularisation in the sense of Tikhonov.We then develop in a last step, minimisation methods of the divergences subject to non-negativity and sum constraints on the solution components. These methods are founded on the Karush-Kuhn-Tucker conditions that must be fulfilled at the optimum. The Tikhonov regularization is considered in these methods.Chapter 11 associated with Appendix 9 deal with the application to the NMF, while Chapter 12 is dedicated to the Blind Deconvolution problem.In these two chapters, the interest of the scale invariant divergences is highlighted.

Explore related subjects

Keep this discovery

BibTeXRIS

Henri Lantéri. 2020-03-03. Divergences. Scale invariant Divergences. Applications to linear inverse problems. N.M.F. Blind deconvolution. https://arxiv.org/abs/2003.01411

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC