mlsanityData to 14 Oct 2026

An Information-theoretic On-line Learning Principle for Specialization in Hierarchical Decision-Making Systems

arXiv 1907.11452 ↗First posted 26 Jul 2019cs.LG cs.IT math.ITcited by 7

Not on the map. Why?

Abstract (arXiv)

Information-theoretic bounded rationality describes utility-optimizing decision-makers whose limited information-processing capabilities are formalized by information constraints. One of the consequences of bounded rationality is that resource-limited decision-makers can join together to solve decision-making problems that are beyond the capabilities of each individual. Here, we study an information-theoretic principle that drives division of labor and specialization when decision-makers with information constraints are joined together. We devise an on-line learning rule of this principle that learns a partitioning of the problem space such that it can be solved by specialized linear policies. We demonstrate the approach for decision-making problems whose complexity exceeds the capabilities of individual decision-makers, but can be solved by combining the decision-makers optimally. The strength of the model is that it is abstract and principled, yet has direct applications in classification, regression, reinforcement learning and adaptive control.

Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 2.

7 papers.