---
title: "Source-balanced Capped Fisher: Bounded Evidence Aggregation for User Inference in Language Models"
source: "arXiv AI/CL/LG（论文）"
source_tier: "t2"
url: "https://arxiv.org/abs/2611.07228v1"
permalink: "https://feed.astralor.com/items/itm_0d8837ca332ebb0bf1901138"
published: "2026-11-04T23:33:10.000Z"
score: 59
channel: "tech"
tags: ["推理效率","RAG","Source-balanced Capped Fisher","Bounded Evidence Aggregation","User Inference","Language Models User","Document-level","User"]
---

# Source-balanced Capped Fisher: Bounded Evidence Aggregation for User Inference in Language Models

## At a glance

User inference asks whether a source contributed documents to a language-model update, even when the auditor observes only fresh documents from that source. Document-level scores can provide evidence of participation, b…

## Key points

- User inference asks whether a source contributed documents to a language-model update, even when the auditor observes only fresh documents from that source.
- Document-level scores can provide evidence of participation, but combining this evidence is challenging: documents differ in baseline predictability and in how strongly they reflect information learned from other docume…
- We propose source-balanced capped Fisher (SCF), an aggregation method that uses known nonparticipating sources to assess how unusual each document score is.

## Full text

User inference asks whether a source contributed documents to a language-model update, even when the auditor observes only fresh documents from that source. Document-level scores can provide evidence of participation, but combining this evidence is challenging: documents differ in baseline predictability and in how strongly they reflect information learned from other documents of the same source. We propose source-balanced capped Fisher (SCF), an aggregation method that uses known nonparticipating sources to assess how unusual each document score is. It transforms the resulting reference-tail frequencies into negative-log evidence, caps individual contributions, and averages them within each source. This limits the influence of isolated extreme scores while retaining evidence across multiple documents. We complete the inference procedure with a decision rule that tests source participation using a p-value calibrated against a separate set of known nonparticipating sources. The rule provides finite-sample Type-I error control under source exchangeability. Experiments across four real-world datasets show that SCF achieves the highest AUROC among the evaluated aggregation methods in four domains. With the calibration-based decision rule, SCF delivers consistently competitive detection power across the tested settings, achieving the highest power in many cases, while empirical false-positive rates remain generally close to or below the nominal levels.

---

Verify against the original before citing; curated by Astral Feed: https://feed.astralor.com/items/itm_0d8837ca332ebb0bf1901138