The Theory and Applications of the Stochastic Point Location Problem
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
In this keynote talk, we will survey and explain the state-of-the-art concerning the Stochastic Search on the Line (SSL) problem, also synonymously known as the Stochastic Point Location (SPL) Problem. The SPL was introduced by Oommen in [10], and it has been studied and analyzed by numerous researchers during the last two decades. It involves determining an unknown “point” when all that the learning system stochastically knows is whether the current point that has been chosen is to the left or the right of the unknown point.In this talk, we will explain how the SPL is a fundamental problem in machine learning, optimization and control, and demonstrate that it is also central to the field of AI. The talk will survey the various automata-based and hierarchical techniques that have been used to solve it, including learning from a Stochastic Teacher or a Compulsive Liar, and in symmetric mechanisms. We will then describe how it is all-pervasive in a variety of application domains and discuss these applications.
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.000 |
| 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