concept
active
concept:probabilistic-gate-selectionProbabilistic Gate Selection
Each gate maintains a 16-dimensional probability distribution over binary operations, updated via gradient descent
Neighborhood — ranked by edge-count
Frameworks (1)
framework
- Deep Differentiable Logic Gate NetworksimplementsFramework by Petersen et al. using logic gates as neurons with differentiable training, integrated into DiffLogic CA
Concepts (2)
concept
- 16 Possible Binary Operationsassociated_withThe complete set of possible operations for a two-input binary gate over which DLGN learns a distribution
- Pass-Through Gate Biasassociated_withInitial gate distribution biased toward pass-through gates A and B to facilitate training stability
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.
- Choosing among candidate models based on model evidence.
- Algorithm used to calibrate per-latent threshold boost values for consistent first-attempt difficulty
- Measure of expected sensory input, core to linking value and surprise.
- Fundamental discrete computation units used as neurons in DLGN and DiffLogic CA
- The paper frames the self-prior as a probabilistic body schema capturing visual–proprioceptive associations
- Interpretive claim based on circuit analysis across experiments
- Named technique in DiffLogic CA where fixed-structure logic circuits replace Sobel filters for neighborhood perception