atlas

Research map / Graph learning / Graph algorithms and clustering

Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivity

NeurIPS 2016 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 187 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use ReLU activation instead of bounded activations in the random-network kernel approximationrandom initialization of networks from computation skeletons · theoretical kernel approximation (ReLU skeleton)required width r for kernel approximationHelped
Stack many consecutive fully connected layers (depth increases) with a non-linear activationfully connected skeleton kernel · theoretical limit of compositional kernellimiting kernel formHurt
Replace two consecutive fully connected layers with a single layer with composed activationfully connected skeletons · theoretical kernel equivalencepreserved dual kernelNo clear effect
Use random initialization with a small variance correction (bias-aware scaling) for the representation layerrandom networks · theoretical kernel approximationkernel approximation accuracyNo clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy