{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/deepseek-v2-a-strong-economical-and-efficient","title":"DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model","arxiv_id":"2405.04434","date":"2024-05-07","proceeding":null,"authors":["DeepSeek-AI","Aixin Liu","Bei Feng","Bin Wang","Bingxuan Wang","Bo Liu","Chenggang Zhao","Chengqi Dengr","Chong Ruan","Damai Dai","Daya Guo","Dejian Yang","Deli Chen","Dongjie Ji","Erhang Li","Fangyun Lin","Fuli Luo","Guangbo Hao","Guanting Chen","Guowei Li","H. Zhang","Hanwei Xu","Hao Yang","Haowei Zhang","Honghui Ding","Huajian Xin","Huazuo Gao","Hui Li","Hui Qu","J. L. Cai","Jian Liang","JianZhong Guo","Jiaqi Ni","Jiashi Li","Jin Chen","Jingyang Yuan","Junjie Qiu","Junxiao Song","Kai Dong","Kaige Gao","Kang Guan","Lean Wang","Lecong Zhang","Lei Xu","Leyi Xia","Liang Zhao","Liyue Zhang","Meng Li","Miaojun Wang","Mingchuan Zhang","Minghua Zhang","Minghui Tang","Mingming Li","Ning Tian","Panpan Huang","Peiyi Wang","Peng Zhang","Qihao Zhu","Qinyu Chen","Qiushi Du","R. J. Chen","R. L. Jin","Ruiqi Ge","Ruizhe Pan","Runxin Xu","Ruyi Chen","S. S. Li","Shanghao Lu","Shangyan Zhou","Shanhuang Chen","Shaoqing Wu","Shengfeng Ye","Shirong Ma","Shiyu Wang","Shuang Zhou","Shuiping Yu","Shunfeng Zhou","Size Zheng","T. Wang","Tian Pei","Tian Yuan","Tianyu Sun","W. L. Xiao","Wangding Zeng","Wei An","Wen Liu","Wenfeng Liang","Wenjun Gao","Wentao Zhang","X. Q. Li","Xiangyue Jin","Xianzu Wang","Xiao Bi","Xiaodong Liu","Xiaohan Wang","Xiaojin Shen","Xiaokang Chen","Xiaosha Chen","Xiaotao Nie","Xiaowen Sun","Xiaoxiang Wang","Xin Liu","Xin Xie","Xingkai Yu","Xinnan Song","Xinyi Zhou","Xinyu Yang","Xuan Lu","Xuecheng Su","Y. Wu","Y. K. Li","Y. X. Wei","Y. X. Zhu","Yanhong Xu","Yanping Huang","Yao Li","Yao Zhao","Yaofeng Sun","Yaohui Li","Yaohui Wang","Yi Zheng","Yichao Zhang","Yiliang Xiong","Yilong Zhao","Ying He","Ying Tang","Yishi Piao","Yixin Dong","Yixuan Tan","Yiyuan Liu","Yongji Wang","Yongqiang Guo","Yuchen Zhu","Yuduan Wang","Yuheng Zou","Yukun Zha","Yunxian Ma","Yuting Yan","Yuxiang You","Yuxuan Liu","Z. Z. Ren","Zehui Ren","Zhangli Sha","Zhe Fu","Zhen Huang","Zhen Zhang","Zhenda Xie","Zhewen Hao","Zhihong Shao","Zhiniu Wen","Zhipeng Xu","Zhongyu Zhang","Zhuoshu Li","Zihan Wang","Zihui Gu","Zilin Li","Ziwei Xie"],"abstract":"We present DeepSeek-V2, a strong Mixture-of-Experts (MoE) language model characterized by economical training and efficient inference. It comprises 236B total parameters, of which 21B are activated for each token, and supports a context length of 128K tokens. DeepSeek-V2 adopts innovative architectures including Multi-head Latent Attention (MLA) and DeepSeekMoE. MLA guarantees efficient inference through significantly compressing the Key-Value (KV) cache into a latent vector, while DeepSeekMoE enables training strong models at an economical cost through sparse computation. Compared with DeepSeek 67B, DeepSeek-V2 achieves significantly stronger performance, and meanwhile saves 42.5% of training costs, reduces the KV cache by 93.3%, and boosts the maximum generation throughput to 5.76 times. We pretrain DeepSeek-V2 on a high-quality and multi-source corpus consisting of 8.1T tokens, and further perform Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) to fully unlock its potential. Evaluation results show that, even with only 21B activated parameters, DeepSeek-V2 and its chat versions still achieve top-tier performance among open-source models.","url_abs":"https://arxiv.org/abs/2405.04434v5","url_pdf":"https://arxiv.org/pdf/2405.04434v5.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":"deepseek-v2-a-strong-economical-and-efficient","repo_url":"https://github.com/deepseek-ai/deepseek-v2","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"deepseek-v2-a-strong-economical-and-efficient","repo_url":"https://github.com/jingyaogong/minimind","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"deepseek-v2-a-strong-economical-and-efficient","repo_url":"https://github.com/shadowpa0327/Palu","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"deepseek-v2-a-strong-economical-and-efficient","repo_url":"https://github.com/MindCode-4/code-3/tree/main/deepseek_v2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"deepseek-v2-a-strong-economical-and-efficient","repo_url":"https://github.com/pwc-1/Paper-8/tree/main/deepseek_v2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null}],"tasks":[{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"mixture-of-experts","task_name":"Mixture-of-Experts"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2405.04434","atlas_url":"https://app.syntology.ai/?focus=2405.04434","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.04434"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.04434"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.04434"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.04434\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2405.04434"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2405.04434\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2405.04434"},"call":"get_concepts_for_paper(arxiv_id=\"2405.04434\")"}],"by_repo":[{"repo":"deepseek-ai/deepseek-v2","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jingyaogong/minimind","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2401.04088","2402.14905"],"harvested_for_calls":[{"arxiv_id":"2401.04088","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2401.04088"},"call":"get_harvested_code_for_paper(arxiv_id=\"2401.04088\")"},{"arxiv_id":"2402.14905","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.14905"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.14905\")"}]},{"repo":"shadowpa0327/Palu","kind":"listed","samples":3,"ran":2,"instrument":1,"unverified":1},{"repo":"MindCode-4/code-3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2406.18321"],"harvested_for_calls":[{"arxiv_id":"2406.18321","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.18321"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.18321\")"}]},{"repo":"pwc-1/Paper-8","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2406.18321"],"harvested_for_calls":[{"arxiv_id":"2406.18321","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2406.18321"},"call":"get_harvested_code_for_paper(arxiv_id=\"2406.18321\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2405.04434.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2405.04434.svg"},"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/MindCode-4/code-3/tree/main/deepseek_v2","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jingyaogong/minimind","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/deepseek-ai/deepseek-v2","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/shadowpa0327/Palu","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pwc-1/Paper-8/tree/main/deepseek_v2","reach":null}],"summary":{"ran_fixture":1,"ran_violates":1,"unverified":1},"n_samples":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":3,"ran":2,"n_ran_checked":1,"n_instrument":1,"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"},"official_not_harvested":{"repositories":["deepseek-ai/deepseek-v2"],"harvested_for_other_papers":[0],"samples_from_other_repositories":3,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"9d1a542959f8346c","code_sha256_prefix":"9d1a542959f8346c","entry":"build_chat","repo":"shadowpa0327/Palu","repo_kind":"listed","path":"run_long_bench.py","file_url":"https://github.com/shadowpa0327/Palu/blob/HEAD/run_long_bench.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"DEP_MISSING","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"tokenizer:MockTokenizer/0/?, prompt:str/0/str, model_name:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/build-chat","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"9d1a542959f8346c"}},{"code_sha256":"4489113b536ca6eb","code_sha256_prefix":"4489113b536ca6eb","entry":"post_process","repo":"shadowpa0327/Palu","repo_kind":"listed","path":"run_long_bench.py","file_url":"https://github.com/shadowpa0327/Palu/blob/HEAD/run_long_bench.py","link_basis":"first_harvest_node","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"response:str/0/str, model_name:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"4489113b536ca6eb"},"code_page":"/code/post-process","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4489113b536ca6eb"}},{"code_sha256":"87b9a0c596eea7a8","code_sha256_prefix":"87b9a0c596eea7a8","entry":"get_pred","repo":"shadowpa0327/Palu","repo_kind":"listed","path":"run_long_bench.py","file_url":"https://github.com/shadowpa0327/Palu/blob/HEAD/run_long_bench.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/get-pred","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"87b9a0c596eea7a8"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"951082d4e15f989689cf16b8ffc7044d10007ea896d6a23980ae798eb8cb7291","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}