paper-with-me

홈 › Papers

A.X K2 Technical Report

2026-08-31 · Cheolseung Baek, Dhammiko Arya, Eunki Kim, Gun Song, Gyoungeun Han, Hyunho Yang, Hyunjun Eun, Jin Kim, Junyoung Park, Juyun Wee, Minki Hong, Minkyung Park, Minsang Kim, Minsoo Kang, SaeRom Kim, Sangjin Kim, Sangyeol Lee, Seojin Lee, Seokhwan Jo, Seokyoung Hong, Seongho Choi, Seonghye Cho, Seongmin Ok, Sereimony Sek, Seungmo Cho, Seungsik Kim, Singon Kim, Sohee Park, Sooyeon Park, Subin Yi, Sungbin Yoon, Sungeun Lee, Sung Jun Cheon, Sungwan Kim, Sunwoo Lee, Tae Yoon Kim, Wonbeom Jang, Yohan Ra, Yong-jin Han, Youngjin Kim, Youngrang Kim, Yujin Kang, Yujin Lee arxiv

We introduce A.X K2, a 688B-parameter Mixture-of-Experts (MoE) language model trained from scratch as a high-performance foundation for \emph{agentic} applications. Trained on approximately 8.5T tokens---fewer than its predecessor, A.X K1---on a smaller but higher-quality mixture with substantially expanded agentic and software-engineering data, it nonetheless improves over A.X K1 across the board, by over 30 percentage points on some benchmarks, reflecting large gains in token efficiency. To support long contexts efficiently, we introduce Sparse Gated Attention (SGA), which combines sparse attention with gated attention, and adopt Gated Norm (GN) to stabilize large-scale training. SGA is trained natively at 128K through a \emph{sparse} indexer warmup that optimizes the indexer against its own sparse top-$k$ selection rather than the dense attention distribution, making adaptation markedly cheaper: each query reads only 2,048 positions, yet long-context quality is unchanged and A.X K2 scores 94.6 on RULER out to 256K. The outlier suppression of GN in turn keeps 4-bit NVFP4 serving within one point of FP8 accuracy. A simple yet effective Think-Fusion recipe further lets users switch between thinking and non-thinking modes within a single unified model. Extensive evaluations show that A.X K2 performs competitively against strong open-weight baselines, matching or exceeding them on math and Korean-language benchmarks.

📄 PDF Abstract BibTeX arXiv:2608.30181

Code (4)

SKT-AI/A.X-K2 ★ 11
Tavish9/awesome-daily-AI-arxiv ★ 114
arxivsub/arXivSub_daily_arxiv ★ 4
🤗 skt/A.X-K2 ★ 106

Similar Papers 제목 키워드 기반

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

Technical Report with Proofs for A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments

2025-06-12 · Philipp Bär, Moe T. Wynn, Sander J. J. Leemans

This technical report provides proofs for the claims in the paper "A Full Picture in Conformance Checking: Efficiently Summarizing All Optimal Alignments".

All