Research map / Architectures and efficiency / RNNs and normalization
Random Fully Connected Neural Networks as Perturbatively Solvable Hierarchies
Boris Hanin
Read the paperCheck your idea against 137,217 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.
Closest papers by meaning
- Learning from higher-order correlations, efficiently: hypothesis tests, random features, and neural networks (NeurIPS 2024 · similarity 0.88)
- Which Neural Net Architectures Give Rise to Exploding and Vanishing Gradients? (NeurIPS 2018 · similarity 0.88)
- The power of deeper networks for expressing natural functions (ICLR 2018 · similarity 0.87)
- Flat Channels to Infinity in Neural Loss Landscapes (NeurIPS 2025 · similarity 0.86)
- Deep Linear Network Training Dynamics from Random Initialization: Data, Width, Depth, and Hyperparameter Transfer (ICML 2025 · similarity 0.86)
- Sliding Down the Stairs: How Correlated Latent Variables Accelerate Learning with Neural Networks (ICML 2024 · similarity 0.86)
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.
