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

Mark Lemley

COLM 2026×2安全效率与系统检索与知识多模态评测与基准
新星分贡献者
49
一作贡献0
核心/参与24
方向广度10
合作网络3
0 一作 · 2 篇 · COLM 2026

获取完整研究档案

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

联系方式

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

2026 顶会论文

2
作者位次 #2/9COLM 2026Poster· Poster Session 2· Grand Ballroom· #109

Estimating near-verbatim extraction risk in language models with decoding-constrained beam search

A. Feder Cooper · Mark Lemley · Christopher De Sa · Lea Duesterwald · Allison Casasola · Jamie Hayes · Katherine Lee · Daniel E. Ho · Percy Liang

We introduce an efficient method for estimating near-verbatim probabilistic extraction risk, which was considered intractable in prior work

摘要

Recent work shows that standard greedy-decoding extraction methods for quantifying memorization in LLMs miss how extraction risk varies across sequences. Probabilistic extraction--computing the probability of generating a target suffix given a prefix under a decoding scheme--addresses this, but is tractable only for verbatim memorization, missing near-verbatim instances that pose similar privacy and copyright risks. Quantifying near-verbatim extraction risk is expensive: the set of near-verbatim suffixes is combinatorially large, and reliable Monte Carlo (MC) estimation can require ~100,000 samples per sequence. To mitigate this cost, we introduce decoding-constrained beam search, which yields deterministic lower bounds on near-verbatim extraction risk at a cost comparable to ~20 MC samples per sequence. Across experiments, our approach surfaces information invisible to verbatim methods: many more extractable sequences, substantially larger per-sequence extraction mass, and patterns in how near-verbatim extraction risk manifests across model sizes and types of text.

安全效率与系统检索与知识memorizationprobabilistic extractionnear-verbatimOpenReview
作者位次 #2/9COLM 2026Poster· Poster Session 1· Grand Ballroom· #120

Extracting memorized pieces of (copyrighted) books from open-weight language models

A. Feder Cooper · Mark Lemley · Allison Casasola · Ahmed M Ahmed · Aaron Gokaslan · Amy B. Cyphert · Christopher De Sa · Daniel E. Ho · Percy Liang

We develop new methods and visualizations for surfacing memorization of (copyrighted) books in open-weight LLMs, revealing far more memorization than previously understood

摘要

Plaintiffs and defendants in copyright lawsuits make sweeping, opposing claims about the extent to which large language models (LLMs) memorize protected expression from books in their training data. We show that these polarized positions dramatically oversimplify the relationship between memorization and copyright. To do so, we develop a technique to measure memorization of books, which we apply to 200 books and 14 open-weight LLMs. Through over 3000 experiments, we show that memorization varies both by model and book. While we find that most LLMs do not memorize most books either in whole or in part, there are notable exceptions. Llama 3.1 70B entirely memorizes some books, like Harry Potter and the Sorcerer's Stone; memorization is so extensive that one can deterministically extract the whole book almost verbatim using the book's first few words as an initial prompt. We discuss why our results have significant implications for copyright cases, though not ones that unambiguously favor either side.

多模态评测与基准memorizationextractioncopyrightbooksOpenReview

常见合作者