Opportunistic Information-Bottleneck for Goal-oriented Feature Extraction and Communication
Francesco Binucci, Paolo Banelli, Paolo Di Lorenzo, Sergio Barbarossa

TL;DR
This paper introduces a practical method to adapt the information bottleneck principle for goal-oriented feature extraction, enabling efficient data transmission and inference in neural networks by leveraging a Gaussian assumption in a regression sub-task.
Contribution
It proposes a novel approach to extend the closed-form Gaussian IB solution to general tasks through an opportunistic regression sub-task, facilitating efficient feature extraction for neural networks.
Findings
Effective feature extraction with reduced data size
Improved trade-off between accuracy and complexity
Validated through extensive simulations
Abstract
The Information Bottleneck (IB) method is an information theoretical framework to design a parsimonious and tunable feature-extraction mechanism, such that the extracted features are maximally relevant to a specific learning or inference task. Despite its theoretical value, the IB is based on a functional optimization problem that admits a closed form solution only on specific cases (e.g., Gaussian distributions), making it difficult to be applied in most applications, where it is necessary to resort to complex and approximated variational implementations. To overcome this limitation, we propose an approach to adapt the closed-form solution of the Gaussian IB to a general task. Whichever is the inference task to be performed by a (possibly deep) neural-network, the key idea is to opportunistically design a regression sub-task, embedded in the original problem, where we can safely assume…
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
TopicsCognitive Computing and Networks
