concept
active
concept:hierarchical-equality-taskHierarchical Equality Task
Task where the input is a sequence w,x,y,z and the label is (w=x)=(y=z); used to test relational reasoning in developmental/cognitive psychology.
Neighborhood — ranked by edge-count
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- An ordering of texts via spatial cues like indentation, size, and placement, implying importance.
- Three synthetic arithmetic datasets of increasing complexity requiring 1, 2, or 3 operations to verify correctness.
- DAS achieves 100% IIA on hierarchical equality task with |N|=16, intervention size 8, Layer 1finding0.754DAS discovers a perfect alignment between the feed-forward network and the Both Equality Relations high-level model.
- Effective interactions between subgraphs, enabling local order amid global disorder; characteristic of biological multiscale systems
- Brute-force search achieves best IIA of 0.60 on hierarchical equality Both Equality Relations in Layer 1finding0.748DAS substantially outperforms brute-force search (1.00 vs 0.60 IIA) on the hierarchical equality task.
- The color property that different colors in a composition must have unequal, hierarchically graded areas—often a geometric progression—with one dominant and others in decreasing amounts.
- A controlled six-level hierarchy of factual tasks increasing in complexity from simple city-location recall to double-counting constraints.