We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.15920")
get_code_for_paper("2006.15920")
have("2006.15920")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.15920.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.15920)
Connect an agent — have() is free.