Kernel Recursive Maximum Versoria Criterion Algorithm Using Random Fourier Features
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Reproducing Hilbert space (RKHS)-based adaptive algorithms have attracted increased attention in machine learning and nonlinear signal processing with applications in visible light communications, radar, radio frequency communications and others. However, performance of RKHS-based algorithms is highly sensitive to a suitable learning criterion. In this regard, the Versoria criterion-based adaptive filtering has gained interest in recent works due to its superior convergence characteristics as compared to the popular criterion such as minimum mean square error, and maximum correntropy criterion. Therefore, in this brief, a novel random Fourier feature (RFF)-based kernel recursive maximum Versoria criterion (KRMVC) algorithm is proposed. Convergence analysis is presented next for the proposed RFF-KRMVC algorithm as guarantees of the promised performance benefits. Lastly, the analytical results are validated by corresponding computer-simulations over practical application-scenarios considered in this brief.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it