We lifted 1 functions out of this paper's own repositories and ran 1 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| moonshotai/moba | canonical | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| calc_chunks | Ran | moonshotai/moba/moba/moba_efficient.py code served (permissive licence) · get_code("13feeec986c3d78b") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Scaling the effective context length is essential for advancing large language models (LLMs) toward artificial general intelligence (AGI). However, the quadratic increase in computational complexity inherent in traditional attention mechanisms presents a prohibitive overhead. Existing approaches either impose strongly biased structures, such as sink or window attention which are task-specific, or radically modify the attention mechanism into linear approximations, whose performance in complex reasoning tasks remains inadequately explored. In this work, we propose a solution that adheres to the ``less structure'' principle, allowing the model to determine where to attend autonomously, rather than introducing predefined biases. We introduce Mixture of Block Attention (MoBA), an innovative approach that applies the principles of Mixture of Experts (MoE) to the attention mechanism. This novel architecture demonstrates superior performance on long-context tasks while offering a key advantage: the ability to seamlessly transition between full and sparse attention, enhancing efficiency without the risk of compromising performance. MoBA has already been deployed to support Kimi's long-context requests and demonstrates significant advancements in efficient attention computation for LLMs. Our code is available at https://github.com/MoonshotAI/MoBA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2502.13189")
get_code_for_paper("2502.13189")
have("2502.13189")
Connect an agent — have() is free.