aiqbench analysis
This research proposes PRAM, a coding scheme that embeds information into the random action realizations of stochastic policies without altering their observable distribution. By framing policy behavior as an implicit communication channel, the work enables reliable multi-bit watermarking and trajectory provenance for AI agents. The findings advance theoretical foundations for verifying model integrity and detecting unauthorized modifications in deployed reinforcement learning systems.
Embedding Information in Policy Randomness: Distribution-Preserving Implicit Communication in MDPs
arXiv:2610.15976v1 Announce Type: cross Abstract: This paper investigates a new role of randomness in stochastic policies--as a medium for embedding and communicating information. Specifically, we consider an agent interacting with an environment according to a prescribed stochastic policy. By carefully modulating the random action realizations of the policy, information can be embedded into the agent's behavior without altering the prescribed action distribution. We cast this problem as a channel coding problem, in which the controlled system implicitly serves as a communication channel. We then propose a coding scheme, termed posterior-matching randomness modulation (PRAM), that selects actions according to the message to be transmitted. With the aid of common randomness independent of the control system, PRAM preserves the prescribed action distribution for every state and every message. We further prove that PRAM is asymptotically reliable: the message can be decoded with arbitrarily small error probability as the observed state trajectory becomes sufficiently long. Experiments demonstrate the effectiveness of the proposed framework in applications including multi-bit policy watermarking and trajectory provenance.
Abstract:This paper investigates a new role of randomness in stochastic policies--as a medium for embedding and communicating information. Specifically, we consider an agent interacting with an environment according to a prescribed stochastic policy. By carefully modulating the random action realizations of the policy, information can be embedded into the agent's behavior without altering the prescribed action distribution. We cast this problem as a channel coding problem, in which the controlled system implicitly serves as a communication channel. We then propose a coding scheme, termed posterior-matching randomness modulation (PRAM), that selects actions according to the message to be transmitted. With the aid of common randomness independent of the control system, PRAM preserves the prescribed action distribution for every state and every message. We further prove that PRAM is asymptotically reliable: the message can be decoded with arbitrarily small error probability as the observed state trajectory becomes sufficiently long. Experiments demonstrate the effectiveness of the proposed framework in applications including multi-bit policy watermarking and trajectory provenance.
Information Theory (cs.IT); Artificial Intelligence (cs.AI)
arXiv:2610.15976 [cs.IT]
(or arXiv:2610.15976v1 [cs.IT] for this version)
https://doi.org/10.48550/arXiv.2610.15976 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 261 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026

The Entangled Dimensions of Decision Theory
LessWrong · Jul 30, 2026

Infected Vibe-Coding: How Does an AI react to a Prompt Injection from a Different AI?
LessWrong · Jul 30, 2026
Do AI models assist with human rights violations?
LessWrong · Sep 29, 2026