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

Sinead Williamson

ICLR 2026×4COLM 2026×2理论与学习动力学检索与知识推理对齐与偏好多模态
新星分资深
36
一作贡献0
核心/参与26
方向广度13
合作网络12
0 一作 · 6 篇 · ICLR 2026 / COLM 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

6
作者位次 #3/6COLM 2026Poster· Poster Session 5· Grand Ballroom· #107

CLaRa: Bridging Retrieval and Generation with Continuous Latent Reasoning

Jie He · Richard He Bai · Sinead Williamson · Jeff Z. Pan · Navdeep Jaitly · Yizhe Zhang

Retrieval augmented generation; Continuous tokens

摘要

Retrieval-augmented generation (RAG) enhances large language models (LLMs) with external knowledge but still suffers from long contexts and disjoint retrieval–generation optimization. Within the standard retrieve-then-rerank pipeline, the reranking stage directly determines what context the generator receives, yet this critical interface remains separately optimized. In this work, we propose CLaRa (Continuous Latent Reasoning), a unified framework that performs embedding-based compression and joint optimization in a shared continuous space. To obtain semantically rich and retrievable compressed vectors, thereby reducing the document length fed into the generator, we introduce SCP, a key-preserving compressor pretraining framework based on question-answering and paraphrase supervision. CLaRa then trains the reranker and generator end-to-end via a single language modeling loss, with gradients flowing through both modules using a differentiable top-k estimator. Theoretically, this unified optimization aligns retrieval relevance with answer quality. Experiments across multiple QA benchmarks show that CLaRa achieves state-of-the-art compression and reranking performance, even at a text compression rate of 16, outperforming text-based fine-tuned baselines. We pulish the code on https://github.com/apple/ml-clara.

检索与知识推理对齐与偏好Retrieval augmented generationText compressionContinuous latent reasoningOpenReview 项目页
作者位次 #4/4COLM 2026Poster· Poster Session 5· Grand Ballroom· #121

What do your logits know?

Masha Fedzechkina · Eleonora Gualdoni · Rita Ramos · Sinead Williamson

We show that top logit values can leak task-irrelevant information present in an image-based query, in some cases revealing as much information as direct projections of the full residual stream

摘要

Recent work has shown that probing model internals can reveal a wealth of information not apparent from the model generations. This poses a risk of unintentional or malicious information leakage, where model users are able to learn information that the model owner assumed was inaccessible. Using vision-language models as a testbed, we present the first systematic comparison of information retained at different representational levels as it is compressed from the rich information encoded in the residual stream through two natural bottlenecks: low-dimensional projections of the residual stream obtained using tuned lens, and the final top-k logits most likely to impact model's answer. We show that even easily accessible bottlenecks defined by the model's top logit values can leak task-irrelevant information present in an image-based query, in some cases revealing as much information as direct projections of the full residual stream.

多模态可解释性效率与系统probingdecision-makingVLMOpenReview

常见合作者