Improved Sparse Coding Under the Influence of Perceptual Attention
Bibliographic record
Abstract
Sparse coding has established itself as a useful tool for the representation of natural data in the neuroscience as well as signal-processing literature. The aim of this letter, inspired by the human brain, is to improve on the performance of the sparse coding algorithm by trying to bridge the gap between neuroscience and engineering. To this end, we build on the localized perception-action cycle in cognitive neuroscience by categorizing it under the umbrella of perceptual attention, which lends itself to increase gradually the contrast between relevant information and irrelevant information. Stated in another way, irrelevant information is filtered away, while relevant information about the environment is enhanced from one cycle to the next. We may thus think in terms of the information filter, which, in a Bayesian context, was introduced in the literature by Fraser (1967). In a Bayesian context, the information filter provides a method for algorithmic implementation of perceptual attention. The information filter may therefore be viewed as the basis for improving the algorithmic performance of sparse coding. To support this performance improvement, the letter presents two computer experiments. The first experiment uses simulated (real-valued) data that are generated to purposely make the problem challenging. The second uses real-life radar data that are complex valued, hence the proposal to introduce Wirtinger calculus into derivation of the new algorithm.
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.001 | 0.007 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| 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.001 | 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".