aspireai.
PUBLIC EDITION

Agaram 2.5B was pretrained from scratch on 50 billion tokens that were 58 percent Tamil, and its tokenizer needs 1.55 tokens per Tamil word where Qwen2.5 needs 9.44

AspireAI community · arXiv
Agaram 2.5B is a Tamil-first language model trained from scratch rather than adapted from an existing multilingual checkpoint. The base model is 2.53 billion parameters and saw 50 billion tokens, 58 percent of them Tamil, using a tokenizer that encodes a Tamil word in 1.55 tokens against Qwen2.5's 9.44. It chats in Tamil script, romanized Tanglish and English, and calls tools: it picked the expected tool on all 25 prompts of a tool set whose schemas appear in training, with exact arguments on 16 of those. On FLORES it scored chrF 56.9 into Tamil and 55.4 into English, above Sarvam-1 in all six translation directions measured and above Google's Gemma 4 E4B-it with 2.53B parameters against E4B's 4.5B effective parameters. Weights and GGUF files are released under Apache-2.0. The honest caveat is in the paper's own abstract: factual knowledge and reliable refusal of harmful requests remain open problems.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.