claim
active
claim:importance-minimality-works-with-p-1-since-splitting-a-causally-important-subcomponent-would-still-raise-the-lossImportance-minimality works with p>1 since splitting a causally important subcomponent would still raise the loss
Contrast with SDL.
Source paper
extracted_from(2025) · Lucius Bushnaq · Dan Braun · Lee Sharkey
Neighborhood — ranked by edge-count
Papers (1)
paper
Methods (1)
method
- Penalizes causal importance values above 0 with p-norm; works with p>1.
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.
- Definitional principle guiding VPD: subcomponents should encode narrow, targeted computational roles rather than distributed, multi-purpose functionality.
- Core mechanism statement.
- Basis of phenomenological argument.
- Better bases may give sparsity.
- Causal importance is related but not identical to causal dependence because of self-repairclaim0.734Related work distinction.
- Parlog's merge process for client-server is unnecessarily complex; Linda's tuple operations remain flexible across problem variants.
- Foundational claim unifying action and perception within single optimization framework.
- SPD avoids shrinkage because importance norm penalizes mask probability, not singular valuesclaim0.728Mechanism.