paper-with-me

Papers

Mellum2 Technical Report

2026-05-29 · Marko Kojic, Ivan Bondyrev, Aral de Moor, Joseph Shtok, Petr Borovlev, Kseniia Lysaniuk, Madeeswaran Kannan, Ivan Dolgov, Nikita Pavlichenko arxiv

We present Mellum 2, an open-weight 12B-parameter Mixture-of-Experts (MoE) language model with 2.5B active parameters per token. Mellum 2 is a general-purpose language model specialized in software engineering, spanning code generation and editing, debugging, multi-step reasoning, tool use and function calling, agentic coding, and conversational programming assistance, and it is the successor to the completion-focused 4B dense Mellum model. The architecture builds on the Mixture-of-Experts (64 experts, 8 active) and combines Grouped-Query Attention with 4 KV heads, Sliding Window Attention on three of every four layers, and a single Multi-Token Prediction head that doubles as both an auxiliary pre-training objective and a built-in draft model for speculative decoding; each choice was validated by ablation with inference efficiency on commodity GPUs as a design constraint. Pre-training spans approximately 10.6 trillion tokens through a three-phase curriculum that progressively shifts the mixture from diverse web data toward curated code and mathematical content, optimized with Muon under FP8 hybrid precision and a Warmup-Hold-Decay schedule with linear decay to zero. The pre-trained base is extended to a 128K context window via a layer-selective YaRN and then post-trained in two stages (supervised fine-tuning followed by RLVR), yielding two released variants: an Instruct model that answers directly and a Thinking model that emits an explicit reasoning trace before its final answer. Across code generation, math and reasoning, tool use, knowledge, and safety benchmarks, Mellum 2 is competitive with open-weight baselines in the 4B-14B range while running at the per-token compute of a 2.5B dense model. We release the base, instruct, and thinking checkpoints, together with this report on the architecture decisions, data pipeline, and training recipe behind them, under the Apache 2.0 license.

📄 PDF Abstract BibTeX arXiv:2605.31268

Code (0)

등록된 구현이 없습니다.

Tasks

Code Generation

Similar Papers 제목 키워드 기반

Mellum: Production-Grade in-IDE Contextual Code Completion with Multi-File Project Understanding

2025-10-07 · Nikita Pavlichenko, Iurii Nazarov, Ivan Dolgov, Ekaterina Garanina 외 arxiv

We present the Mellum models family, open-weight code completion models designed for interactive use in JetBrains IDEs. Mellums have 4B parameters, adopt a Llama-style architecture, and are pre-trained on ~4T tokens of p…

Code Completion

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)

2024-06-06 · Peter Macgregor, He Sun

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient graph algorithms. This technical report presents the newly implemented component on locality sensitive hashing, kernel density esti…

ClusteringDensity Estimation

Duplicate Bug Report Detection With a Combination of Information Retrieval and Topic Modeling

2013-04-08 · 27th IEEE/ACM International Conference on Automated Software Engineering 2013 4 · Anh Tuan Nguyen, Tung Thanh Nguyen, Tien N. Nguyen, David Lo 외

Detecting duplicate bug reports helps reduce triaging efforts and save time for developers in fixing the same issues. Among several automated detection approaches, text-based information retrieval (IR) approaches have be…

DescriptiveInformation RetrievalRetrieval

Technical Report: The effect of Input Parameters on Falsification of Cyber-Physical Systems

2022-09-15 · Zahra Ramezani, Knut Åkesson

The aim of this technical report is to investigate the effect of input parameters on the falsification of cyber-physical systems (CPSs).

Spectral Toolkit of Algorithms for Graphs: Technical Report (1)

2023-04-05 · Peter Macgregor, He Sun

Spectral Toolkit of Algorithms for Graphs (STAG) is an open-source library for efficient spectral graph algorithms, and its development starts in September 2022. We have so far finished the component on local graph clust…

ClusteringGraph Clustering