Reinforcing feature distributions of hidden units of Boltzmann machine using correlations
Bibliographic record
Abstract
This paper introduces and analyses the method of applying Neuroscience methods to Boltzmann Machine, involving a combination of cognitive psychology, information theory, and dynamical systems. We utilized the emergent property of the probability of hidden layers to find the pattern of how units are behaving when stimulated by the visual layer and research into enhancing the predictive encoding capability of the encoding layer. We measure the connections and links between the units of the encoding layer by approximating it with the probability distribution of two units' activation behaviours. For example, the portion of the Auditory cortex responsible for processing auditory information, such as music, differs from the sections responsible for processing visual information, although they can still be linked and active concurrently. Besides, Neurons can modify their connections by learning new information and reinforcing the connections that have been utilized more frequently, and forgetting the connections if the probability distributions of two units diverge much. The Boltzmann machine is the probabilistic inference machine for ground truth using the free energy principle. The latter has stepped further from the concept to interpret cortical responses as a fundamental of intelligent agency. With simple and random interactions of each neuron, this 'intelligent agency' could achieve sophisticated functions in a specific area of a brain. Randomness is also a vital aspect of learning since it may achieve balance and embrace regularities according to Ramsey's Theory.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.000 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".