Table of Contents
Fetching ...

Dialectics for Artificial Intelligence

Zhengmian Hu

TL;DR

The paper advances an information-theoretic framework in which concepts are not fixed labels but reversible information objects tied to an agent’s total experience. It introduces determinations as algorithmic-parity structures that ensure mutual recoverability and defines excess information to measure the redundancy of splitting experience into parts. Dialectics is formulated as a compute-grounded optimization: competing concepts absorb new patches to minimize a description-length loss, enabling growth, contraction, splitting, and merging of concepts. The work further develops practical methods (grounded splits, seeds, and computable surrogates like LLM log-probabilities) and sketches an infrastructure (common ontology server) for cross-agent alignment and verification, aiming to operationalize concept discovery, communication, and coordination at scale. Collectively, the framework unifies clustering, segmentation, and representation learning under a single, testable principle: concepts emerge as low-complexity, reproducible explanations of experience that compete under a shared compression objective.

Abstract

Can artificial intelligence discover, from raw experience and without human supervision, concepts that humans have discovered? One challenge is that human concepts themselves are fluid: conceptual boundaries can shift, split, and merge as inquiry progresses (e.g., Pluto is no longer considered a planet). To make progress, we need a definition of "concept" that is not merely a dictionary label, but a structure that can be revised, compared, and aligned across agents. We propose an algorithmic-information viewpoint that treats a concept as an information object defined only through its structural relation to an agent's total experience. The core constraint is determination: a set of parts forms a reversible consistency relation if any missing part is recoverable from the others (up to the standard logarithmic slack in Kolmogorov-style identities). This reversibility prevents "concepts" from floating free of experience and turns concept existence into a checkable structural claim. To judge whether a decomposition is natural, we define excess information, measuring the redundancy overhead introduced by splitting experience into multiple separately described parts. On top of these definitions, we formulate dialectics as an optimization dynamics: as new patches of information appear (or become contested), competing concepts bid to explain them via shorter conditional descriptions, driving systematic expansion, contraction, splitting, and merging. Finally, we formalize low-cost concept transmission and multi-agent alignment using small grounds/seeds that allow another agent to reconstruct the same concept under a shared protocol, making communication a concrete compute-bits trade-off.

Dialectics for Artificial Intelligence

TL;DR

The paper advances an information-theoretic framework in which concepts are not fixed labels but reversible information objects tied to an agent’s total experience. It introduces determinations as algorithmic-parity structures that ensure mutual recoverability and defines excess information to measure the redundancy of splitting experience into parts. Dialectics is formulated as a compute-grounded optimization: competing concepts absorb new patches to minimize a description-length loss, enabling growth, contraction, splitting, and merging of concepts. The work further develops practical methods (grounded splits, seeds, and computable surrogates like LLM log-probabilities) and sketches an infrastructure (common ontology server) for cross-agent alignment and verification, aiming to operationalize concept discovery, communication, and coordination at scale. Collectively, the framework unifies clustering, segmentation, and representation learning under a single, testable principle: concepts emerge as low-complexity, reproducible explanations of experience that compete under a shared compression objective.

Abstract

Can artificial intelligence discover, from raw experience and without human supervision, concepts that humans have discovered? One challenge is that human concepts themselves are fluid: conceptual boundaries can shift, split, and merge as inquiry progresses (e.g., Pluto is no longer considered a planet). To make progress, we need a definition of "concept" that is not merely a dictionary label, but a structure that can be revised, compared, and aligned across agents. We propose an algorithmic-information viewpoint that treats a concept as an information object defined only through its structural relation to an agent's total experience. The core constraint is determination: a set of parts forms a reversible consistency relation if any missing part is recoverable from the others (up to the standard logarithmic slack in Kolmogorov-style identities). This reversibility prevents "concepts" from floating free of experience and turns concept existence into a checkable structural claim. To judge whether a decomposition is natural, we define excess information, measuring the redundancy overhead introduced by splitting experience into multiple separately described parts. On top of these definitions, we formulate dialectics as an optimization dynamics: as new patches of information appear (or become contested), competing concepts bid to explain them via shorter conditional descriptions, driving systematic expansion, contraction, splitting, and merging. Finally, we formalize low-cost concept transmission and multi-agent alignment using small grounds/seeds that allow another agent to reconstruct the same concept under a shared protocol, making communication a concrete compute-bits trade-off.

Paper Structure

This paper contains 137 sections, 8 theorems, 169 equations, 10 figures.

Key Result

Theorem 1

For any fixed $n\ge 2$ and strings $x_{1:n}$, the optimal value of the constrained problem eq:one-var-completion-opt is $\max_{i\in[n]} K(x_i \mid x_{-i})$, up to logarithmic slack. Equivalently, there exists a string $x_{n+1}$ such that

Figures (10)

  • Figure 1: A 2-way determination between concepts $(A,B)$: each concept is recoverable from the other. The square denotes an algorithmic parity node / determination node, each edge carries a binary string (a concept).
  • Figure 2: A 3-way determination among concepts $(A,B,C)$: any two concepts determine the remaining one.
  • Figure 3: A determination between $(A,B)$ given a shared context $z$ (attached to the determination node with an additional arc).
  • Figure 4: A pivot move for two adjacent 3-way determinations. Left: $(A,B,D,E)$ form a network with two determination nodes that share $C$ as a bridge. Right: same strings $(A,B,D,E)$ form a different network with (usually a different string) $F$ as a bridge.
  • Figure 5: Left: a two-node chain where $A$ is linked to $(X,I)$ and $I$ is linked to $(P_1,P_2)$. Right: the same network redrawn to emphasize a two-stage "decomposition" reading: $A$ relates to $(X,I)$, and $I$ relates to $(P_1,P_2)$. The two drawings are equivalent.
  • ...and 5 more figures

Theorems & Definitions (17)

  • Definition 1: Algorithmic parity structure / determination
  • Theorem 1: One-variable completion cost
  • Theorem 2: Non-universality of pivot moves
  • Lemma 1: Complexity-difference identity in a determination
  • Theorem 3: Ground complexity controls excess
  • proof : Proof of \ref{['prop:one-var-completion']}
  • proof : Proof of \ref{['prop:pivot-not-always']}
  • Lemma 2: Spectral mixing for $G_p$ HooryLinialWigderson2006
  • Lemma 3: Sampler bound from mixing
  • proof
  • ...and 7 more