Policy optimization by marginal-map probabilistic inference in generative models
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
While most current planning methods have focused on the development of scalable approximate algorithms, they often neglect the important aspect of providing algorithmic performance guarantees, or their tightness is sacrificed to improve efficiency. In contrast, we address a challenging problem of solving POMDP planning problems approximately with a focus on solution quality to estimate the quality of such approximations and to decide when a satisfactory plan is available. 1) We demonstrate that the original task of optimizing POMDP controllers can be approached by its reformulation as the equivalent problem of marginal-MAP inference in a novel single-DBN generative model, which guarantees that the control policies computed by probabilistic inference over this model are optimal in the traditional sense. 2) We further solve a POMDP problem approximately with bounded performance guarantees by translating a corresponding marginal-MAP inference problem into its variational form, and developing two Bayesian variational inference algorithms to (i) approximate the marginal-MAP inference, and (ii) compute the upper bound of the solution. 3) The proposed approach to optimizing parameters of POMDP controllers by marginal-MAP inference with bounded performance guarantees is evaluated on several POMDP benchmark problems and the performance of the implemented variational algorithms is compared to previously developed methods.
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.001 |
| 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