{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/minimax-01-scaling-foundation-models-with","title":"MiniMax-01: Scaling Foundation Models with Lightning Attention","arxiv_id":"2501.08313","date":"2025-01-14","proceeding":null,"authors":["MiniMax","Aonian Li","Bangwei Gong","Bo Yang","Boji Shan","Chang Liu","Cheng Zhu","Chunhao Zhang","Congchao Guo","Da Chen","Dong Li","Enwei Jiao","Gengxin Li","Guojun Zhang","Haohai Sun","Houze Dong","Jiadai Zhu","Jiaqi Zhuang","Jiayuan Song","Jin Zhu","Jingtao Han","Jingyang Li","Junbin Xie","Junhao Xu","Junjie Yan","Kaishun Zhang","Kecheng Xiao","Kexi Kang","Le Han","Leyang Wang","Lianfei Yu","Liheng Feng","Lin Zheng","Linbo Chai","Long Xing","Meizhi Ju","Mingyuan Chi","Mozhi Zhang","Peikai Huang","Pengcheng Niu","Pengfei Li","Pengyu Zhao","Qi Yang","Qidi Xu","Qiexiang Wang","Qin Wang","Qiuhui Li","Ruitao Leng","Shengmin Shi","Shuqi Yu","Sichen Li","Songquan Zhu","Tao Huang","Tianrun Liang","Weigao Sun","Weixuan Sun","Weiyu Cheng","Wenkai Li","Xiangjun Song","Xiao Su","Xiaodong Han","Xinjie Zhang","Xinzhu Hou","Xu Min","Xun Zou","Xuyang Shen","Yan Gong","Yingjie Zhu","Yipeng Zhou","Yiran Zhong","Yongyi Hu","Yuanxiang Fan","Yue Yu","Yufeng Yang","Yuhao Li","Yunan Huang","Yunji Li","Yunpeng Huang","Yunzhi Xu","Yuxin Mao","Zehan Li","Zekang Li","Zewei Tao","Zewen Ying","Zhaoyang Cong","Zhen Qin","Zhenhua Fan","Zhihang Yu","Zhuo Jiang","Zijia Wu"],"abstract":"We introduce MiniMax-01 series, including MiniMax-Text-01 and MiniMax-VL-01, which are comparable to top-tier models while offering superior capabilities in processing longer contexts. The core lies in lightning attention and its efficient scaling. To maximize computational capacity, we integrate it with Mixture of Experts (MoE), creating a model with 32 experts and 456 billion total parameters, of which 45.9 billion are activated for each token. We develop an optimized parallel strategy and highly efficient computation-communication overlap techniques for MoE and lightning attention. This approach enables us to conduct efficient training and inference on models with hundreds of billions of parameters across contexts spanning millions of tokens. The context window of MiniMax-Text-01 can reach up to 1 million tokens during training and extrapolate to 4 million tokens during inference at an affordable cost. Our vision-language model, MiniMax-VL-01 is built through continued training with 512 billion vision-language tokens. Experiments on both standard and in-house benchmarks show that our models match the performance of state-of-the-art models like GPT-4o and Claude-3.5-Sonnet while offering 20-32 times longer context window. We publicly release MiniMax-01 at https://github.com/MiniMax-AI.","url_abs":"https://arxiv.org/abs/2501.08313v1","url_pdf":"https://arxiv.org/pdf/2501.08313v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"minimax-01-scaling-foundation-models-with","repo_url":"https://github.com/MiniMax-AI/MiniMax-01","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"mixture-of-experts","task_name":"Mixture-of-Experts"}],"methods":[{"method_slug":"attention","method_name":"Attention"},{"method_slug":"moe","method_name":"MoE"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":"https://app.syntology.ai/?focus=2501.08313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08313"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MiniMax-AI/MiniMax-01","reach":null}],"summary":{"ran_draft_wrong":2,"ran_honours":1},"by_repo_kind":{"listed":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"44e5fac8cbac336d","entry":"modify_gt","repo":"MiniMax-AI/MiniMax-01","repo_kind":"listed","path":"evaluation/MR-NIAH/score.py","file_url":"https://github.com/MiniMax-AI/MiniMax-01/blob/HEAD/evaluation/MR-NIAH/score.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"44e5fac8cbac336d"}},{"code_sha256_prefix":"f53a39974983bad3","entry":"process_log","repo":"MiniMax-AI/MiniMax-01","repo_kind":"listed","path":"evaluation/MR-NIAH/score.py","file_url":"https://github.com/MiniMax-AI/MiniMax-01/blob/HEAD/evaluation/MR-NIAH/score.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f53a39974983bad3"}},{"code_sha256_prefix":"4e54cd947d374327","entry":"score_response","repo":"MiniMax-AI/MiniMax-01","repo_kind":"listed","path":"evaluation/MR-NIAH/score.py","file_url":"https://github.com/MiniMax-AI/MiniMax-01/blob/HEAD/evaluation/MR-NIAH/score.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4e54cd947d374327"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}