paper.dinq.meAI 与前沿科学顶会 · 学术新星雷达
登录 DINQ
返回新星榜
NB

Nicolas Boizard

COLM 2026×2ICLR 2026多模态数据与预训练可解释性评测与基准效率与系统
新星分新星
73
一作贡献30
核心/参与24
方向广度13
合作网络6
1 一作 · 3 篇 · COLM 2026 / ICLR 2026

获取完整研究档案

首次获取该候选人的完整档案及 StartLux 评估共 20 积分;每位用户单独解锁,之后查看免费。主动刷新 20 积分。

联系方式

实时查找电子邮箱,费用不超过20积分;未找到邮箱不扣费。

2026 顶会论文

3
一作COLM 2026Poster· Poster Session 6· Imperial Ballroom· #28

BidirLM: From Text to Omnimodal Bidirectional Encoders by Adapting and Composing Causal LLMs

Nicolas Boizard · Théo Deschamps-Berger · Hippolyte Gisserot-Boukhlef · CELINE HUDELOT · Pierre Colombo

Build state-of-the-art omnimodal (text, audio, image) bidirectional encoders by composing and adapting causal LLMs through masking objectives, contrastive training, and weight merging.

摘要

Transforming causal generative language models into bidirectional encoders offers a powerful alternative to BERT-style architectures. However, current approaches remain limited: they lack consensus on optimal training objectives, suffer from catastrophic forgetting at scale, and fail to flexibly integrate the vast ecosystem of specialized generative models. In this work, through systematic ablations on the Gemma3 and Qwen3 families, we identify the key factors driving successful adaptation, highlighting the critical role of an often-omitted prior masking phase. To scale this process without original pre-training data, we introduce a dual strategy combining linear weight merging with a lightweight multi-domain data mixture that mitigates catastrophic forgetting. Finally, we augment our encoders by merging them with specialized causal models, seamlessly transferring modality- and domain-specific capabilities. This open-source recipe, designed for any causal decoder LLM, yields BidirLM, a family of five encoders that outperform alternatives on text, vision, and audio representation benchmarks.

多模态数据与预训练可解释性bidirectional encoderscausal LLM adaptationmasked next-token predictioncontrastive learningOpenReview
作者位次 #2/5COLM 2026Poster· Poster Session 5· Imperial Ballroom· #36

BERT-as-a-Judge: A Robust Alternative to Lexical Methods for Efficient Reference-Based LLM Evaluation

Hippolyte Gisserot-Boukhlef · Nicolas Boizard · Emmanuel Malherbe · CELINE HUDELOT · Pierre Colombo

We introduce BERT-as-a-Judge, a lightweight encoder-based evaluation method for scalable, semantically robust, reference-based LLM benchmarking.

摘要

Accurate evaluation is central to the large language model (LLM) ecosystem, guiding model selection and downstream adoption across diverse use cases. In practice, however, evaluating generative outputs typically relies on rigid lexical methods to extract and assess answers, which can conflate a model’s true problem-solving ability with its compliance with predefined formatting guidelines. While recent LLM-as-a-Judge approaches mitigate this issue by assessing semantic correctness rather than strict structural conformity, they also introduce substantial computational overhead, making evaluation costly. In this work, we first systematically investigate the limitations of lexical evaluation through a large-scale empirical study spanning 36 models and 15 downstream tasks, demonstrating that such methods correlate poorly with human judgments. To address this limitation, we introduce BERT-as-a-Judge, an encoder-driven approach for assessing answer correctness in reference-based generative settings, robust to variations in output phrasing, and requiring only lightweight training on synthetically annotated question-candidate-reference triplets. We show that it consistently outperforms the lexical baseline while matching the performance of much larger LLM judges, providing a compelling trade-off between the two and enabling reliable, scalable evaluation. Finally, through extensive experimentation, we provide detailed insights into BERT-as-a-Judge’s performance to offer practical guidance for practitioners, and release all project artifacts to foster downstream adoption.

评测与基准效率与系统检索与知识Large language modelsGenerative tasksEvaluationLexical vs. semantic assessmentOpenReview

常见合作者