Latent Energy-Based GRPO Reasoning
Teaching small models to reason about graphs through spectral energy alignment
Spectral-R1 trains compact language models to solve graph reasoning tasks by aligning latent representations with spectral energy objectives. Using a Contextual Hamiltonian formulation and Rayleigh Conjugate Descent, the model learns structured reasoning over weighted graphs -- achieving significant accuracy gains with shorter completions.
Key training and evaluation metrics.
Benchmark accuracy across graph topologies.
| Benchmark | Topology | Accuracy | Baseline | Delta |
|---|---|---|---|---|
| JSON Pathfinder | Erdos-Renyi | 41.3% | 24.5% | +16.8pp |
| JSON Pathfinder | Power-law | 33.8% | 18.2% | +15.6pp |
| NLGraph | shortest_path | TBD | -- | Pending |
| Reasoning-Gym | -- | TBD | -- | Pending |
Training pipeline and architecture overview.
| Component | Detail |
|---|---|
| Base Model | LFM2.5-1.2B-Thinking (LiquidAI, hidden=2048, 16 layers) |
| Training | GRPO with FSDP2, vLLM colocate mode |
| Dataset | JSON Pathfinder (curriculum: 25% medium, 35% hard, 40% expert) |
| Spectral Reward | Contextual Hamiltonian + Rayleigh Conjugate Descent solver |
| Compute | kurkin-1 / kurkin-4 (shared NFS) |