Wayfinder-qwen-eff
An efficient code search agent based on Qwen
2 min read
The model is built on Qwen3.6-35B-A3B (35 billion parameters, 3 billion active per token) and trained to solve code search tasks within codebases. After supervised fine-tuning, the authors performed 10 steps of reinforcement learning, rewarding the model for finding the correct files with minimal overhead. The result is an agent that uses roughly half as many tokens and search steps as the base version while maintaining the exact same recall. This model is useful for developers and engineers automating work with large repositories and looking to reduce LLM query costs.
Key features
- Maintains a Recall@12 of 0.743 on complex long queries while cutting token usage in half.
- Reduces the number of search steps by an average of 2.6 per session.
- Trained using a combined reward for accuracy and efficiency.
- Weights are provided in bf16 safetensors format with the standard tokenizer and chat template of the base model.
What you can do
- Apply the agent to automated file search tasks and navigation across large codebases.
- Set up efficient handling for long text prompts and technical descriptions of 120 words or more.
- Integrate the model into development pipelines to reduce token costs during information retrieval.
Example
The model is used as a search sub-agent for working with a codebase. For best results, providing detailed, long-form task briefs is recommended, as performance and accuracy drop on short single-line prompts.
Read more
Details• Metrics: Recall@12 is 0.743, averaging 5.3 steps and 106k tokens per search compared to 7.9 steps and 213k for the base version.
• Training: LoRA (rank 64) in the first stage and 10 RL steps on a pool of 1,046 tasks.
• Limitations: efficiency drops on short single-line prompts; long descriptions are required.
• License: derivative model under the Muse Model License with mandatory attribution.










Comments