AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Learning Tree Structured Potential Games

NeurIPS 2016 · Learning theory and algorithms › Submodular and game algorithms · approach: Zero-sum game learning dynamics · 9 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Model observations as local optima (potential game) instead of global optima (structured prediction) (ablation)Tree-structured potential game learner · Synthetic 6-node chaintree structure recoveryHelped
Model observations as local optima instead of global optima (ablation)Tree-structured potential game learner · Supreme Court 2013 rulingsqualitative agreement with known ideologyHelped
Use approximate neighborhood search with Hamming radius h=1Dual decomposition learner · Congressional Votes (30 senators)recovery of party-consistent structureHelped
Restrict local neighborhoods to Hamming distance h=1 instead of exhaustive enumerationDual decomposition learner · Complexityper-run complexity: O(n2 * MaxIter)Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy