DeepAI AI Chat
Log In Sign Up

Generalizing the theory of cooperative inference

by   Pei Wang, et al.

Cooperation information sharing is important to theories of human learning and has potential implications for machine learning. Prior work derived conditions for achieving optimal Cooperative Inference given strong, relatively restrictive assumptions. We relax these assumptions by demonstrating convergence for any discrete joint distribution, robustness through equivalence classes and stability under perturbation, and effectiveness by deriving bounds from structural properties of the original joint distribution. We provide geometric interpretations, connections to and implications for optimal transport, and connections to importance sampling, and conclude by outlining open questions and challenges to realizing the promise of Cooperative Inference.


page 1

page 2

page 3

page 4


Sequential Cooperative Bayesian Inference

Cooperation is often implicitly assumed when learning from other agents....

A mathematical theory of cooperative communication

Cooperative communication plays a central role in theories of human cogn...

Optimal partitions and Semi-discrete optimal transport

In the current book I suggest an off-road path to the subject of optimal...

Earth Movers in The Big Data Era: A Review of Optimal Transport in Machine Learning

Optimal Transport (OT) is a mathematical framework that first emerged in...

Characterizing Out-of-Distribution Error via Optimal Transport

Out-of-distribution (OOD) data poses serious challenges in deployed mach...

Efficient Querying for Cooperative Probabilistic Commitments

Multiagent systems can use commitments as the core of a general coordina...

Making transport more robust and interpretable by moving data through a small number of anchor points

Optimal transport (OT) is a widely used technique for distribution align...