Stochastic Learning-based Weak Estimation and Its Applications
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
Although the field of Artificial Intelligence (AI) has been researched for more than five decades, researchers, scientists and practitioners are constantly seeking superior methods that are applicable for increasingly difficult problems. In this chapter, our aim is to consider knowledge-based novel and intelligent cybernetic approaches for problems in which the environment (or medium) is time-varying. While problems of this sort can be approached from various perspectives, including those that appropriately model the time-varying nature of the environment, in this chapter, we shall concentrate on using new estimation or “training” methods. The new methods that we propose are based on the principles of stochastic learning, and are referred to as the Stochastic Learning Weak Estimators (SLWE). An empirical analysis on synthetic data shows the advantages of the scheme for non-stationary distributions, which is where we claim to advance the state-of-the-art. We also examine how these new methods can be applicable to learning and intelligent systems, and to Pattern Recognition (PR). The chapter briefly reports conclusive results that demonstrate the superiority of the SLWE in two applications, namely in PR and data compression. The application in PR involves artificial data and real-life news reports from the Canadian Broadcasting Corporation (CBC). We also demonstrate its applicabilty in data compression, where the underlying distribution of the files being compressed is, again, modeled as being non-stationary. The superiority of the SLWE in both these cases is demonstrated.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| 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