The Lack of Convexity of the Relevance-Compression Function
Albert E Parker, Tomas Gedeon, Alexander Dimitrov

TL;DR
This paper explores the non-convex nature of the relevance-compression function in information bottleneck problems, linking it to phase transitions and challenging assumptions of convexity similar to rate-distortion curves.
Contribution
It demonstrates that the relevance-compression function can be non-convex and varies in convexity, unlike the convex rate-distortion curve, and relates this to phase transitions in the Lagrangian.
Findings
Relevance-compression function can be non-convex.
Convexity changes are linked to phase transitions.
The behavior differs from traditional rate-distortion curves.
Abstract
In this paper we investigate the convexity of the relevance-compression function for the Information Bottleneck and the Information Distortion problems. This curve is an analog of the rate-distortion curve, which is convex. In the problems we discuss in this paper, the distortion function is not a linear function of the quantizer, and the relevance-compression function is not necessarily convex (concave), but can change its convexity. We relate this phenomena with existence of first order phase transitions in the corresponding Lagrangian as a function of the annealing parameter.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Infrared Target Detection Methodologies · Advanced Data Compression Techniques
