IJCOPE Journal

UGC Logo DOI / ISO Logo

International Journal of Creative and Open Research in Engineering and Management

A Peer-Reviewed, Open-Access International Journal Supporting Multidisciplinary Research, Digital Publishing Standards, DOI Registration, and Academic Indexing.
Journal Information
ISSN: 3108-1754 (Online)
Crossref DOI: Available
ISO Certification: 9001:2015
Publication Fee: 599/- INR
Compliance: UGC Journal Norms
License: CC BY 4.0
Peer Review: Double Blind
Volume 02, Issue 11

Published on: November 2026

BASIL: BAYESIAN ADAPTIVE STATE IMAGINATION AND LEARNING WITH LIVE TELEMETRY HALTING AND IN-CONTEXT RULE INDUCTION

Saurabh Shinde

Prof. Vishal Joshi

Indian Institute of Science Education and Research Bhopal (IISERB), Bhopal Bypass Road, Bhauri, Bhopal 462 066, Madhya Pradesh, India

Article Status

Plagiarism Passed Peer Reviewed Open Access

Available Documents

Abstract

Planning in unfamiliar environments requires an agent to infer governing rules, decide whether additional computation is useful, and determine when to stop searching. We study these questions in Multiverse, a procedural benchmark of two-player connection games with disjoint training, validation, and test rule families. A baseline pre-search value-of-computation predictor has zero-valued labels on 73% of sampled states and a held-out correlation of −0.004 with reference planning gain. BASIL combines three mechanisms: a

rule-conditioned world model with boundary-aware convolutions, a discrete board-state carrier and a symbolic tactical horizon; Live Telemetry Halting (LTH), which predicts a completed-search action-value gap from intermediate search telemetry; and Bayesian

Hypothesis Filtration (BHF), which maintains a posterior over finite rule hypotheses across episodes. In a three-seed validation study, full search scores 0.958 against a greedy opponent and 0.771 against a 100-rollout simulator-search opponent, compared with 0.549 and 0.424 for the fast policy. Against the latter opponent, LTH scores 0.646 using 8.2 rather than 33.9 model expansions per move. On the held-out test split, full-search scores are 0.938 and 0.722, respectively. In six-episode hidden-rule matches, posterior entropy falls from 6.49 to 1.69 bits and posterior-sampled search reaches a score of 0.757 in the final two episodes. These results support adaptive planning within the specified rule grammar, while comparisons with heuristic stopping rules and the cost of symbolic operations delimit the conclusions.

Keywords—Model-based reinforcement learning; Adaptive computation; Monte Carlo tree search; Optimal stopping; Bayesian rule induction; World models

How to Cite this Paper

Shinde, S. (2026). BASIL: Bayesian Adaptive State Imagination and Learning with Live Telemetry Halting and In-Context Rule Induction. International Journal of Creative and Open Research in Engineering and Management, <i>02</i>(11), 1-9. https://doi.org/10.55041/ijcope.v2i11.080

Shinde, Saurabh. "BASIL: Bayesian Adaptive State Imagination and Learning with Live Telemetry Halting and In-Context Rule Induction." International Journal of Creative and Open Research in Engineering and Management, vol. 02, no. 11, 2026, pp. 1-9. doi:https://doi.org/10.55041/ijcope.v2i11.080.

Shinde, Saurabh. "BASIL: Bayesian Adaptive State Imagination and Learning with Live Telemetry Halting and In-Context Rule Induction." International Journal of Creative and Open Research in Engineering and Management 02, no. 11 (2026): 1-9. https://doi.org/https://doi.org/10.55041/ijcope.v2i11.080.

Search & Index

References

Silver, T. Hubert, J. Schrittwieser, I. Antonoglou,

Lai, A. Guez, et al., “A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play,” Science, vol. 362, pp. 1140–1144, 2018, doi: 10.1126/science.aar6404.

Silver, T. Hubert, J. Schrittwieser, I. Antonoglou,

Lai, A. Guez, et al., “A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play,” Science, vol. 362, pp. 1140–1144, 2018, doi: 10.1126/science.aar6404.

Ye, S. Liu, T. Kurutach, P. Abbeel, and Y. Gao, “Mastering Atari games with limited data,” in Proc. Adv. Neural Inf. Process. Syst., vol. 34, 2021,

Hay, S. Russell, D. Tolpin, and S. E. Shimony, “Selecting computations: Theory and applications,” in Proc. 28th Conf. Uncertainty Artif. Intell., 2012,

Ethical Compliance & Review Process

  • •All submissions are screened under plagiarism detection.
  • •Review follows editorial policy.
  • •Authors retain copyright.
  • •Peer Review Type: Double-Blind Peer Review
  • •Published on: Nov 16 2026
CCBYNC

This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. You are free to share and adapt this work for non-commercial purposes with proper attribution.

View License
Scroll to Top