paper
Formalizing the Binding Problem
paperactiveprovisional
formalizing-the-binding-problem-9ff9dd26·1 events·first seen 14d agoAliases: Formalizing the Binding Problem
Co-occurring entities
More like this (12)
Formal Proof SearchBeyond the Commitment Boundary: Probing Epiphenomenal Chain-of-Thought in Large Reasoning ModelsFodor and Pylyshyn's Systematicity Challenge Still StandsOperadic consistency: a label-free signal for compositional reasoning failures in LLMsGame-Theoretic EquilibriaShannon-Hartley TheoremConcrete Problems in AI SafetyLatent Reasoning with Normalizing FlowsCausally Evaluating the Learnability of Formal Language TasksQuantifying Faithful Confidence Expression in Large Reasoning ModelsPolyak–Łojasiewicz Conditionformal argumentation semantics
Recent events (1)
Information-theoretic formalization of the binding problem in Vision Transformers
Researchers introduce a formal information-theoretic framework for the binding problem — the challenge of associating features (color, shape) with the correct objects in multi-object scenes. They develop a probing method to measure binding information in model representations and apply it to several pre-trained Vision Transformers, examining components like the [CLS] token and spatial tokens across datasets with feature sharing, occlusion, and natural features. Results position binding information as a key factor in visual recognition and reasoning quality, and suggest current ViT architectures have limited binding capability, consistent with known failure modes.