Kirchenbauer
A researcher who in 2023 proposed a text watermarking scheme based on green lists. This work is a classic contribution in the field of text watermarking.
Timeline (last 90 days)
textGrain is in the same lineage as the green-list scheme proposed by Kirchenbauer et al. in 2023, and its academic name is "key-based pseudorandom watermarking".
The hash-based green-list/red-list watermarking method was proposed by Kirchenbauer et al. in 2023.
The KGW watermarking scheme was proposed by the University of Maryland in 2023 (Kirchenbauer et al.).
KGW算法由马里兰大学研究者Kirchenbauer等人于2023年在ICML上正式发表，是学术界引用量最高、影响力最大的LLM文本水印方案之一
Kirchenbauer方案在绿名单token的logits上加上一个固定偏置δ（通常取1-2之间）
Kirchenbauer方案通常将前一个token的ID与保密密钥拼接后输入哈希函数（如SHA-256）生成伪随机数种子，前γ比例（通常γ=0.5）的token归入绿名单
Kirchenbauer等人的水印算法在生成每个token时，根据前文的哈希值将词汇表划分为绿名单和红名单，并轻微提升绿名单token被选中的概率
Kirchenbauer方案在模型原始logits上为绿名单token加上一个通常取1-2之间的固定偏置δ，再进行softmax归一化后采样
All Facts (8)
textGrain is in the same lineage as the green-list scheme proposed by Kirchenbauer et al. in 2023, and its academic name is "key-based pseudorandom watermarking".
50%UnverifiedThe hash-based green-list/red-list watermarking method was proposed by Kirchenbauer et al. in 2023.
50%UnverifiedThe KGW watermarking scheme was proposed by the University of Maryland in 2023 (Kirchenbauer et al.).
50%UnverifiedKGW算法由马里兰大学研究者Kirchenbauer等人于2023年在ICML上正式发表，是学术界引用量最高、影响力最大的LLM文本水印方案之一
50%UnverifiedKirchenbauer方案在绿名单token的logits上加上一个固定偏置δ（通常取1-2之间）
50%UnverifiedKirchenbauer方案通常将前一个token的ID与保密密钥拼接后输入哈希函数（如SHA-256）生成伪随机数种子，前γ比例（通常γ=0.5）的token归入绿名单
50%UnverifiedKirchenbauer等人的水印算法在生成每个token时，根据前文的哈希值将词汇表划分为绿名单和红名单，并轻微提升绿名单token被选中的概率
50%UnverifiedKirchenbauer方案在模型原始logits上为绿名单token加上一个通常取1-2之间的固定偏置δ，再进行softmax归一化后采样
50%