concept
active
concept:hard-lossHard Loss
Loss computed using discrete binary gate outputs, used to verify convergence to true discrete circuit
Neighborhood — ranked by edge-count
Concepts (1)
concept
- Hard Inferenceassociated_withPost-training inference mode where each gate uses only its most probable discrete operation for fast binary execution
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.
- Loss computed using continuous relaxations of logic gates during training
- In machine learning, a function measuring the distance between current and desired output; analogous to stress.
- The deadening effect of modern processes that prevent people from acting according to their feeling for the whole, damaging the global whole.
- One of two contrastive objectives analyzed; shown to be minimized by PMI kernel representation up to scaling
- Loss function used in both experiments: sum of squared differences between predicted and target grid
- Chalmers' problem: why structural/functional criteria should correlate with subjective experience; acknowledged as unsolvable in 3rd person.
- The central topic, treated as a dynamic, agential process rather than static storage.
- Alexander's quote from Notes (with footnote #19); Steenson invokes it twice: once to honor, once to critique.