What is recorded here?
Derived saliency conservation relations for homogeneous feedforward networks and used positive flow scores with iterative pruning to reduce premature whole-layer collapse without training data.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Conservation assumes the stated homogeneous feedforward setting. The maximal-critical-compression theorem requires positive conservative scores re-evaluated for every removal; practical finite batches of pruning are not automatically the same theorem. Avoiding an empty layer is not a theorem of useful accuracy, connected information flow in arbitrary architectures or hardware speedup. Empirical finite schedules are reported separately.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Hidenori Tanaka; Daniel Kunin; Daniel L. K. Yamins; Surya Ganguli
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
SynFlow: data-free iterative pruning with conserved synaptic-flow scores
Derived saliency conservation relations for homogeneous feedforward networks and used positive flow scores with iterative pruning to reduce premature whole-layer collapse without training data.
Scientific scope
Conservation assumes the stated homogeneous feedforward setting. The maximal-critical-compression theorem requires positive conservative scores re-evaluated for every removal; practical finite batches of pruning are not automatically the same theorem. Avoiding an empty layer is not a theorem of useful accuracy, connected information flow in arbitrary architectures or hardware speedup. Empirical finite schedules are reported separately.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Hidenori Tanaka; Daniel Kunin; Daniel L. K. Yamins; Surya Ganguli
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.