SCORE: Replacing Layer Stacking with Contractive Recurrent Depth
Guillaume Godin

TL;DR
SCORE introduces a recurrent, ODE-inspired approach to replace traditional layer stacking in neural networks, improving training efficiency and reducing parameters through a contractive update mechanism.
Contribution
It proposes a novel recurrent formulation called SCORE that replaces layer stacking with a contractive iterative process inspired by ODEs, enhancing stability and efficiency.
Findings
Improves convergence speed across architectures.
Reduces parameter count via shared weights.
Simple Euler integration balances cost and performance.
Abstract
Residual connections are central to modern deep neural networks, enabling stable optimization and efficient information flow across depth. In this work, we propose SCORE (Skip-Connection ODE Recurrent Embedding), a discrete recurrent alternative to classical layer stacking. Instead of composing multiple independent layers, SCORE iteratively applies a single shared neural block using an ODE (Ordinary Differential Equation)-inspired contractive update: ht+1 = (1 - dt) * ht + dt * F(ht) This formulation can be interpreted as a depth-by-iteration refinement process, where the step size dt explicitly controls stability and update magnitude. Unlike continuous Neural ODE approaches, SCORE uses a fixed number of discrete iterations and standard backpropagation without requiring ODE solvers or adjoint methods. We evaluate SCORE across graph neural networks (ESOL molecular solubility), multilayer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning in Materials Science · Advanced Graph Neural Networks · Electrocatalysts for Energy Conversion
