An overview of the preliminary results of the project is provided below according to the work planed during the first period:
▪ We identified potential application scenarios where information-theoretic tools, and in particular information measures, can let to potential applications of deep learning to engineering areas. The identified applications areas include--but are not limited to--statistical data anonymization, Smart Grids, healthcare for diagnosis based on Magnetic Resonance Imaging (MRI), and communication networks, among others.
▪ A central part of the work focused on the estimation of information measures of continuous distributions. The estimation of information measures based on samples is a fundamental problem in statistics and machine learning. In our work, we analyze estimates of Shannon information measures in high-dimensional Euclidean spaces, computed from a finite number of samples. In particular, we shown to be infeasible if the corresponding information measure is unbounded, clearly showing the necessity of additional assumptions on the underlying distributions. Subsequently, we derived sufficient conditions that enable confidence bounds for the estimation of differential entropy.
▪ We devised fully parameterized, differentiable estimators of the mutual information based on variational bounds. The flexibility of the proposed approach also allows us to construct estimators for mutual information between either discrete or continuous variables. We further apply it to guide the training of neural networks for real-world tasks. Our experiments on a large variety of tasks, including disentangled representations, domain adaptation, fair classification, demonstrate the effectiveness of information measures to train deep neural networks.
▪ On the other hand, from a theoretical perspective, our work focused on investigating fundamental connections between generalization beyond the training distribution and the information that is propagated across the layers in the network. We elucidated through information-theoretic tools a mathematical characterization of the sets of feasible (and unfeasible) tradeoffs between complexity and relevance for distributed and collaborative Information bottleneck problems and for binary detection frameworks.