Pith. sign in

REVIEW 2 cited by

Quantifying Knowledge Distillation Using Partial Information Decomposition

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.07483 v2 pith:NH6DEQ4P submitted 2024-11-12 stat.ML cs.CVcs.ITcs.LGeess.IVmath.IT

classification stat.MLcs.CVcs.ITcs.LGeess.IVmath.IT
keywords informationknowledgedistillationstudentteachermodelredundantrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Knowledge distillation deploys complex machine learning models in resource-constrained environments by training a smaller student model to emulate internal representations of a complex teacher model. However, the teacher's representations can also encode nuisance or additional information not relevant to the downstream task. Distilling such irrelevant information can actually impede the performance of a capacity-limited student model. This observation motivates our primary question: What are the information-theoretic limits of knowledge distillation? To this end, we leverage Partial Information Decomposition to quantify and explain the transferred knowledge and knowledge left to distill for a downstream task. We theoretically demonstrate that the task-relevant transferred knowledge is succinctly captured by the measure of redundant information about the task between the teacher and student. We propose a novel multi-level optimization to incorporate redundant information as a regularizer, leading to our framework of Redundant Information Distillation (RID). RID leads to more resilient and effective distillation under nuisance teachers as it succinctly quantifies task-relevant knowledge rather than simply aligning student and teacher representations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Decomposing Multivariate Information Rates in Networks of Random Processes

    stat.ME 2025-02 conditional novelty 7.0 of 10

    The authors define Partial Information Rate Decomposition (PIRD), a spectral extension of PID that splits the mutual information rate between random processes into unique, redundant, and synergistic components.

  2. Partial Information Rate Decomposition

    stat.ME 2025-02 conditional novelty 7.0 of 10

    The paper defines Partial Information Rate Decomposition, a spectral lattice method that decomposes mutual information rate for stationary Gaussian processes into redundant, unique, and synergistic dynamic components.

Pith tools