PILOT: Planning via Internalized Latent Optimization Trajectories for Large Language Models
Haoyu Zheng, Yun Zhu, Yuqian Yuan, Bo Yuan, Wenqiao Zhang, Siliang Tang, Jun Xiao
TL;DR
PILOT tackles the fragility of long-horizon reasoning in compact LLMs by internalizing strategic planning as latent guidance. It learns an instance-specific anchor via a lightweight Hyper-Network and injects it at a pivot layer to steer reasoning without modifying backbone weights, achieving near-zero decoding overhead. Across mathematical and coding benchmarks, PILOT delivers consistent gains, especially on complex tasks such as MATH500, and demonstrates robustness under distribution shifts and cross-domain transfer. The approach couples a construct-and-verify data pipeline with energy-aware injection to maintain manifold-consistent updates, offering a scalable path to reliable, fast internal planning in LLMs.
Abstract
Strategic planning is critical for multi-step reasoning, yet compact Large Language Models (LLMs) often lack the capacity to formulate global strategies, leading to error propagation in long-horizon tasks. Our analysis reveals that LLMs possess latent reasoning capabilities that can be unlocked when conditioned on explicit plans from a teacher model; however, runtime reliance on external guidance is often impractical due to latency and availability constraints. To bridge this gap, we propose PILOT (Planning via Internalized Latent Optimization Trajectories), a non-invasive framework designed to internalize the strategic oversight of large models into intrinsic Latent Guidance. Instead of altering backbone weights, PILOT employs a lightweight Hyper-Network to synthesize a query-conditioned Latent Guidance vector. This vector acts as an internal steering mechanism, guiding the model's representations toward optimal reasoning paths. Extensive experiments on mathematical and coding benchmarks demonstrate that PILOT effectively stabilizes reasoning trajectories, consistently outperforming strong baselines (e.g., +8.9% on MATH500) with negligible inference latency.
