H公司发布NeoMME:去视觉塔的单塔多模态编码器
H Company Releases NeoMME: A Family of 260M and 800M Single-Tower Multimodal Encoders That Drop the Vision Tower and Causal Decoder
小参数多模态检索的新范式,用单塔替代双塔结构并显著降低部署成本,工程细节详实,值得关注端侧部署的同学参考。
Most visual document retrievers in production today are hand-me-downs. ColPali and the models that followed it take a generative vision-language model and repurpose it as an encoder. The result still carries a separately pretrained vision tower and a causal decoder that never generates a token. That is parameter and compute overhead for a task that only needs representations.
如今在生产环境中部署的大多数视觉文档检索器都是沿用旧架构的产物。ColPali 及其后续模型采用生成式视觉-语言模型,并将其重新用作编码器。然而,结果仍然保留了独立预训练的视觉塔和因果解码器,尽管后者从未生成过任何 token。对于仅需表示(representations)的任务而言,这带来了参数和计算量的开销。
H Company has released NeoMME, a family of 260M and 800M bidirectional encoders that drops both components. One Transformer processes multilingual text tokens and raw 32×32 RGB image patches through the same layers, trained from random initialization. The retrieval fine-tune, NeoMME-Retriever, reaches 0.523 nDCG@10 on ViDoRe v3 at 260M parameters.
H Company 发布了 NeoMME,这是一系列包含 2.6 亿和 8 亿双向编码器的模型,去除了上述两个组件。一个 Transformer 通过相同的层处理多语言文本 token 和原始 32×32 RGB 图像块,从随机初始化开始训练。用于检索微调的版本 NeoMME-Retriever 在 ViDoRe v3 数据集上,以 2.6 亿参数达到了 0.523 的 nDCG@10 分数。
Is it deployable? Yes. Every checkpoint ships under Apache 2.0 with day-zero support in Hugging Face Transformers. The 260M model indexes 51.3 pages per second on a single NVIDIA L40S and encodes a query in 78.3 ms on a CPU-only host.
它是否可部署?是的。每个检查点均以 Apache 2.0 许可证发布,并在 Hugging Face Transformers 中获得首日支持。2.6 亿参数的模型在单张 NVIDIA L40S GPU 上每秒可索引 51.3 页,在仅 CPU 的主机上查询编码耗时为 78.3 毫秒。
https://arxiv.org/pdf/2609.01657
https://arxiv.org/pdf/2609.01657
One tower, two modalities
一个塔,两种模态
Text enters through an ALBERT-style factorized embedding: a 256-dimensional lookup projected to model width. Images are split into non-overlapping 32×32 patches and projected by a 2-layer MLP trained from scratch. No patch-merging module, no SigLIP2 tower.
文本通过类似 ALBERT 的分解嵌入进入:一个 256 维的查找表投影到模型宽度。图像被分割为不重叠的 32×32 图像块,并通过从头训练的 2 层 MLP 进行投影。没有图像块合并模块,也没有 SigLIP2 塔结构。
Both models support a 16,384-token context, enough for two standard 3,840×2,160 4K UHD images after patching. Most layers use symmetric sliding-window attention; every sixth layer and the final layer attend globally. The stack uses grouped-query attention, query-key normalization, gated attention, 2D rotary position embeddings, and squared-ReLU MLPs. Exact parameter counts are 262,937,906 and 793,715,032.
这两个模型均支持 16,384 个 token 的上下文长度,足以容纳两张经过分块后的标准 3,840×2,160 4K UHD 图像。大多数层使用对称滑动窗口注意力机制;每第六层以及最后一层采用全局注意力。该堆栈使用了分组查询注意力(grouped-query attention)、查询键归一化、门控注意力、二维旋转位置嵌入(2D rotary position embeddings)以及平方 ReLU MLP。精确的参数数量分别为 262,937,906 和 793,715,032。
The tokenizer is a whitespace-unconstrained BPE with a 131,072-entry vocabulary, trained from scratch. Across 14 target languages in FLORES-200 devtest, it emits 44.4% fewer tokens than ModernBERT.
分词器是一个无空格限制的 BPE,拥有 131,072 个条目的词表,从头训练。在 FLORES-200 devtest 的 14 种目标语言中,其输出的 token 数量比 ModernBERT 少 44.4%。
Trained as a masked diffusion denoiser
作为掩码扩散去噪器进行训练
Pretraining is discrete masked diffusion over text, optionally conditioned on visible image patches. Text-only segments draw a corruption rate uniformly from 0 to 1. Multimodal segments draw from 0.30 to 1, which removes the language-only shortcut and forces the model to read the page.
预训练是在文本上进行的离散掩码扩散过程,可选择性地以可见图像块为条件。纯文本段落的噪声率从 0 到 1 均匀采样。多模态段落的噪声率从 0.30 到 1 采样,这消除了仅依赖语言的捷径,迫使模型阅读页面内容。
A cross-modal ablation probe confirms this works. At 90% masking, visible page patches raise masked-token accuracy by 38.4 points for the 260M model and 40.5 points for the 800M model. Each run processes about 524 billion packed input tokens, roughly 290 billion of them text-only, on 16 and 32 H100 accelerators respectively.
跨模态消融探针证实了这一点有效。在90%掩码率下,可见页面补丁使260M模型的掩码标记准确率提升了38.4个点,800M模型提升了40.5个点。每次运行分别使用16和32块H100加速器处理约5240亿个打包输入令牌,其中纯文本令牌约为2900亿个。
Retrieval results
检索结果
NeoMME-Retriever adds two jointly trained heads on the shared backbone: a mean-pooled dense head with Matryoshka widths, and a late-interaction head projecting every token and patch to 128 dimensions. One forward pass returns both.
NeoMME-Retriever在共享主干网络上增加了两个联合训练的头部:一个具有Matryoshka宽度的均值池化密集头部,以及一个将每个令牌和补丁投影到128维度的晚期交互头部。一次前向传播即可返回两者结果。
On ViDoRe v3, the 260M model scores 0.523 nDCG@10 and the 800M model 0.556. The 260M result sits within 0.002 of ColQwen2.5-v0.2 at 3.75B parameters, and 26.1 points above the best other sub-300M model. The 800M model lands 0.9 points behind the similarly sized Vultron Retriever Flash. On ViDoRe v1 and v2 the models reach 0.860/0.522 and 0.874/0.559 nDCG@5.
在ViDoRe v3上,260M模型得分为0.523 nDCG@10,800M模型为0.556。260M的结果与拥有37.5亿参数的ColQwen2.5-v0.2相差仅0.002,且比表现最好的其他参数量低于300M的模型高出26.1分。800M模型落后于同规模的Vultron Retriever Flash 0.9分。在ViDoRe v1和v2上,模型分别达到0.860/0.522和0.874/0.559的nDCG@5得分。
Text retrieval is weaker. On BEIR-15, late interaction reaches 0.4881 and 0.5126, against 0.5722 for LateOn at 149M parameters. The authors attribute this partly to supervision scale: NeoMME saw roughly 430K text query examples, against roughly 660M contrastive examples for mLateOn.
文本检索能力较弱。在BEIR-15数据集上,晚期交互方法得分分别为0.4881和0.5126,而拥有1.49亿参数的LateOn得分为0.5722。作者将此部分归因于监督规模:NeoMME仅看到约43万个文本查询示例,而mLateOn则有约6.6亿个对比示例。
Storage and throughput
存储与吞吐量
Late-interaction indexes are expensive. A 2048×2048 page yields 4,162 vectors, about 1.5 MB per ViDoRe v3 document in float32. Two methods bring that down. Hierarchical token pooling at factor 10 with int8 queries and documents gives 39.0 kB per page, a 39.4× reduction retaining 99.16% of baseline nDCG@10. Pool factor 8 with int8 queries and binary documents gives 6.0 kB, a 255.5× reduction retaining 95.19%.
晚期交互索引成本高昂。一个2048×2048的页面会产生4,162个向量,在float32精度下,每个ViDoRe v3文档约占1.5 MB。有两种方法可降低这一开销。采用因子为10的分层令牌池化,配合int8精度的查询和文档,每页仅需39.0 kB,减少了39.4倍,同时保留了基线nDCG@10的99.16%。采用因子为8的池化,配合int8精度的查询和二进制文档,每页仅需6.0 kB,减少了255.5倍,同时保留了95.19%的性能。
Indexing is fast for the vector count. At a matched 2048×2048 input on one L40S, NeoMME-260M encodes 51.3 pages per second against ColModernVBERT’s 26.0, a 1.97× gap.
针对向量数量而言,索引速度很快。在单块L40S显卡上,以相同的2048×2048输入处理,NeoMME-260M每秒可编码51.3个页面,而ColModernVBERT仅为26.0,差距为1.97倍。
Interactive explainer
交互式解释器
Key Takeaways
关键要点
- One bidirectional Transformer handles text and raw image patches, with no vision tower and no decoder.
- NeoMME-Retriever-260M scores 0.523 nDCG@10 on ViDoRe v3, beating every evaluated model below 800M.
- It matches 3.75B-parameter ColQwen2.5 on ViDoRe v3 while being 14.4× smaller.
- Token pooling plus asymmetric quantization cut the index from roughly 1.5 MB to 6 kB per page.
- Text-only retrieval and frozen natural-image transfer remain clear weak spots.
- 单个双向Transformer同时处理文本和原始图像补丁,无需视觉塔(vision tower)和解码器。
- NeoMME-Retriever-260M在ViDoRe v3上获得0.523的nDCG@10得分,击败了所有评估中低于800M参数的模型。
- 它在ViDoRe v3上的表现与拥有37.5亿参数的ColQwen2.5相当,但体积小14.4倍。
- 令牌池化结合非对称量化将每个页面的索引大小从约1.5 MB降低至6 kB。
- 纯文本检索和冻结的自然图像迁移仍是明显的薄弱环节。
Check out the Paper, Model Collection and Demo. Also, feel free to follow us on Twitter and don’t forget to join our 150k+ML SubReddit and Subscribe to our Newsletter. Wait! are you on telegram? now you can join us on telegram as well.
查看论文、模型集合和演示。此外,欢迎在 Twitter 上关注我们,别忘了加入我们拥有超过 15 万成员的 ML SubReddit,并订阅我们的新闻通讯。等等!你在 Telegram 上吗?现在你也可以加入我们的 Telegram 群组。
Need to partner with us for promoting your GitHub Repo OR Hugging Face Page OR Product Release OR Webinar etc.? Connect with us
需要与我们合作推广你的 GitHub 仓库、Hugging Face 页面、产品发布或网络研讨会等?请联系我们
The post H Company Releases NeoMME: A Family of 260M and 800M Single-Tower Multimodal Encoders That Drop the Vision Tower and Causal Decoder appeared first on MarkTechPost.
MarkTechPost 上首先发布的文章:H 公司发布 NeoMME:一组包含 2.6 亿和 8 亿参数的单塔多模态编码器,摒弃了视觉塔和因果解码器。
更进一步:量化金融体系
看懂新闻只是起点——沿量化金融路径,把它变成能交付的工程能力