Interpreting and Disentangling Feature Components of Various Complexity from DNNs
원문 초록
This paper aims to define, quantify, and analyze the feature complexity that is learned by a DNN. We propose a generic definition for the feature complexity. Given the feature of a certain layer in the DNN, our method disentangles feature components of different complexity orders from the feature. We further design a set of metrics to evaluate the reliability, the effectiveness, and the significance of over-fitting of these feature components. Furthermore, we successfully discover a close relationship between the feature complexity and the performance of DNNs. As a generic mathematical tool, the feature complexity and the proposed metrics can also be used to analyze the success of network compression and knowledge distillation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
DVFL-Net: A Lightweight Distilled Video Focal Modulation Network for Spatio-Temporal Action Recognition
The Trilemma of Truth in Large Language Models
G$^{2}$D: Boosting Multimodal Learning with Gradient-Guided Distillation
FedBKD: Distilled Federated Learning to Embrace Gerneralization and Personalization on Non-IID Data
Tackling Data Heterogeneity in Federated Learning through Knowledge Distillation with Inequitable Aggregation
GNN's Uncertainty Quantification using Self-Distillation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.