activity
20192025
most citedPerfectly Secure Steganography Using Minimum Entropy Coupling

12 citations · 27 across the 15 of their papers we have counts for

collaborators

16 papers

cs.LG2025

Scalable Decision Making for Games of Imperfect Information

Samuel Sokota, Eugene Vinitsky, Hengyuan Hu +3

Real-world decision-making generally involves hidden information, that is, information that is unknown to one agent but possessed by another. Unfortunately, the presence of large a…

cs.LG2025

Reevaluating Policy Gradient Methods for Imperfect-Information Games

Max Rudolph, Nathan Lichtle, Sobhan Mohammadpour +6

In the past decade, motivated by the putative failure of naive self-play deep reinforcement learning (DRL) in adversarial imperfect-information games, researchers have developed nu…

cs.IT2024

Computing Low-Entropy Couplings for Large-Support Distributions

Samuel Sokota, Dylan Sam, Christian Schroeder de Witt +3

Minimum-entropy coupling (MEC) -- the process of finding a joint distribution with minimum entropy for given marginals -- has applications in areas such as causality and steganogra…

cs.LG2023★ 2 cited

Neural Functional Transformers

Allan Zhou, Kaien Yang, Yiding Jiang +5

The recent success of neural networks as implicit representation of data has driven growing interest in neural functionals: models that can process other neural networks as input b…

cs.AI2023

The Update-Equivalence Framework for Decision-Time Planning

Samuel Sokota, Gabriele Farina, David J. Wu +4

The process of revising (or constructing) a policy at execution time -- known as decision-time planning -- has been key to achieving superhuman performance in perfect-information g…

cs.AI2023

Cheap Talk Discovery and Utilization in Multi-Agent Reinforcement Learning

Yat Long Lo, Christian Schroeder de Witt, Samuel Sokota +2

By enabling agents to communicate, recent cooperative multi-agent reinforcement learning (MARL) methods have demonstrated better task performance and more coordinated behavior. Mos…

cs.LG2023★ 2 cited

Permutation Equivariant Neural Functionals

Allan Zhou, Kaien Yang, Kaylee Burns +5

This work studies the design of neural networks that can process the weights or gradients of other neural networks, which we refer to as neural functional networks (NFNs). Despite…

cs.GT2023

Abstracting Imperfect Information Away from Two-Player Zero-Sum Games

Samuel Sokota, Ryan D'Orazio, Chun Kai Ling +3

In their seminal work, Nayyar et al. (2013) showed that imperfect information can be abstracted away from common-payoff games by having players publicly announce their policies as…

cs.CR2022★ 12 cited

Perfectly Secure Steganography Using Minimum Entropy Coupling

Christian Schroeder de Witt, Samuel Sokota, J. Zico Kolter +2

Steganography is the practice of encoding secret information into innocuous content in such a manner that an adversarial third party would not realize that there is hidden meaning.…

cs.AI2022

Self-Explaining Deviations for Coordination

Hengyuan Hu, Samuel Sokota, David Wu +4

Fully cooperative, partially observable multi-agent problems are ubiquitous in the real world. In this paper, we focus on a specific subclass of coordination problems in which huma…

cs.LG2022★ 6 cited

A Unified Approach to Reinforcement Learning, Quantal Response Equilibria, and Two-Player Zero-Sum Games

Samuel Sokota, Ryan D'Orazio, J. Zico Kolter +5

This work studies an algorithm, which we call magnetic mirror descent, that is inspired by mirror descent and the non-Euclidean proximal gradient algorithm. Our contribution is dem…

cs.LG2022

Learning Intuitive Policies Using Action Features

Mingwei Ma, Jizhou Liu, Samuel Sokota +2

An unaddressed challenge in multi-agent coordination is to enable AI agents to exploit the semantic relationships between the features of actions and the features of observations.…

cs.AI2021

Communicating via Markov Decision Processes

Samuel Sokota, Christian Schroeder de Witt, Maximilian Igl +6

We consider the problem of communicating exogenous information by means of Markov decision process trajectories. This setting, which we call a Markov coding game (MCG), generalizes…

cs.AI2021

Solving Common-Payoff Games with Approximate Policy Iteration

Samuel Sokota, Edward Lockhart, Finbarr Timbers +6

For artificially intelligent learning systems to have widespread applicability in real-world settings, it is important that they be able to operate decentrally. Unfortunately, dece…

cs.LG2020★ 5 cited

Selective Dyna-style Planning Under Limited Model Capacity

Zaheer Abbas, Samuel Sokota, Erin J. Talvitie +1

In model-based reinforcement learning, planning with an imperfect model of the environment has the potential to harm learning progress. But even when a model is imperfect, it may s…

cs.LG2019

Simultaneous Prediction Intervals for Patient-Specific Survival Curves

Samuel Sokota, Ryan D'Orazio, Khurram Javed +2

Accurate models of patient survival probabilities provide important information to clinicians prescribing care for life-threatening and terminal ailments. A recently developed clas…