arXiv (All)
open access
Overcoming a Learning Bottleneck in Impartial Games: A Circuit Complexity Approach
Why can neural networks struggle to learn optimal play in a game with a simple, efficient solution algorithm? Motivated by empirical difficulties with parity in impartial games, we use NIM to study a representational bottleneck and three ways around it. We show that a restricted model of shallow, fi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Birth and Death of Entanglement in Hamiltonian-Driven Quantum Games under Decoherence#999048
- D2PPO: Diffusion Policy Policy Optimization with Dispersive Loss#158761
- A Network Formation Game for Katz Centrality Maximization: A Resource Allocation Perspective#1048320
- Collab-Solver: Collaborative Solving Policy Learning for Mixed-Integer Linear Programming#1035305
- Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition Width#985164
Record · ID 1326081
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive