Latent Algorithmic Structure Precedes Grokking: A Mechanistic Study of ReLU MLPs on Modular Arithmetic
Latent Algorithmic Structure Precedes Grokking: A Mechanistic Study of ReLU MLPs on Modular Arithmetic explores This research investigates the internal algorithmic structure of ReLU MLPs during the grokking phenomenon, revealing how weight distributions evolve to enable generalization.. Commercial viability score: 2/10 in LLM Training.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $10K - $14K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Prior WorkGrokking as a Variance-Limited Phase Transition: Spectral Gating and the Epsilon-Stability ThresholdViability: 2.0
- Prior WorkGrokking Finite-Dimensional AlgebraViability: 2.0
- Prior WorkThe Discrete Charm of the MLP: Binary Routing of Continuous Signals in Transformer Feed-Forward LayersViability: 2.0
- Prior WorkTransformers converge to invariant algorithmic coresViability: 2.0
- Higher ViabilityA Systematic Empirical Study of Grokking: Depth, Architecture, Activation, and Regularization