cs.IT · 2026-09-01 · No. 102

Information Theory, 2026-09-01.

1 new papers in cs.IT. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

    Minimax bounds for watermarked and masked recursive discrete distribution estimation

    Millen Kanabar, Michael Gastpar

    cs.IT · cs.LG · math.ST

    Watermarking has been proposed as a way to identify synthetic samples in estimation settings where no metadata is available to distinguish them from real samples, but its precise effects remain unexplored. In the absence of a distinguishing mechanism, it has been shown that adding synthetic samples significantly reduces the marginal efficacy of new real samples. In this work, we study the minimax loss of such recursive discrete distribution...

    arxiv.org/abs/2608.31091 · PDF

This edition is part of The Daily Abstract — cs.IT archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.