arXiv Computation and Language By Zhiyun Shi

Write Facts the Way Models Read Them: Lifting the Two-Hop Curse

Read the original on arXiv Computation and Language →

The paper introduces Legible, a fine‑tuning technique that aligns a language model’s internal representation of a newly added fact with the model’s own reading of that fact, thereby restoring the model’s ability to perform two‑hop reasoning. By adding a loss term that forces the bridge phrase to match the model’s internal entity representation, Legible improves the model’s composition of learned facts and significantly boosts bridge accuracy across several large‑language‑model families. The method achieves these gains without requiring multi‑hop training data, outperforming prior approaches such as CaKE and RippleEdits on benchmark tests.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Aug 13

Hybrid-Policy Self-Editing for Composable Unstructured Knowledge Editing

arXiv:2608. 11660v1 Announce Type: cross Abstract: Large language models (LLMs) achieve remarkable performance across natural language tasks, yet they are trained on static corpora and their knowledge quickly becomes outdated in a fast-changing world.

By Tianci Liu, Zihan Dong, Tianchun Li, Yi-Chung Chen, Qiming Cao, Xingchen Wang, Shiyang Wang, Zichen Miao, Linjun Zhang, Haoyu Wang, Jing Gao
arXiv AI
Oct 28

Don't Pick a Winner: Knowledge Conflicts Need a Prior, Not a Rule

The paper introduces a retrieval‑augmented language model that resolves disagreements between retrieved context and the model’s own knowledge by incorporating a prior over the reliability of the context rather than a fixed rule. Experiments on the GRACE benchmark show that this prior‑based approach outperforms existing baselines by up to 26 points, achieving higher overall scores on both Qwen3.5‑35B‑A3B and Llama‑3.1‑8B. The method also demonstrates superior performance on the ClashEval benchmark, confirming the theoretical advantage of evidence‑based conflict resolution.

By Minh Pham Van, Cong Tran
arXiv AI
Oct 16

Knowledge That Is Linear Before Fine-Tuning Generalizes After It

The study investigates how well language models can generalize from fine‑tuned facts by distinguishing active facts—those that support further learning—from inert facts. Using a novel relabeling experiment (e.g., mapping Paris → Europe to Paris → crab), the authors fine‑tune models on a subset of subjects and test whether the learned mapping extends to unseen subjects sharing the same original answer. Across eleven models and 70 relations, they find a strong correlation (Pearson r = 0.87–0.92) between the linear readability of the original relation in pretrained representations and the model’s ability to generalize, a relationship that persists after controlling for various factors and remains robust to label randomization and semantic category changes.

By Faridoun Mehri, Hinrich Sch\"utze