# Blackboard Intelligence Can Surpass Autoregressive on Globally Constrained Problems

Authors: Woosang Jeon, Jaeyeon Kim, Sham Kakade, Yilun Du, Amrit Singh Bedi, Arun Kumar Chithanar, Chul Lee, Taehyeong Kim, Sitan Chen.

Uses a fixed, revisable output and model confidence to search over candidate solutions with a frozen fine-tuned diffusion checkpoint. Evaluates logic and scheduling problems where global constraints can make irrevocable left-to-right commitments costly.

First public: 2026-09-30.
ArXiv initial submission: 2026-09-30.

[Original paper](https://arxiv.org/abs/2609.38806) · [Reading-list entry](https://latent-implicit-thinking.github.io/papers/2609.38806/)
[Preprint BibTeX](https://latent-implicit-thinking.github.io/papers/2609.38806/citation.bib) · [Preprint CSL-JSON](https://latent-implicit-thinking.github.io/papers/2609.38806/citation.csl.json) · [JSON record](https://latent-implicit-thinking.github.io/papers/2609.38806/record.json)

## Approaches

- [Alternative generation methods](https://latent-implicit-thinking.github.io/topics/alternative-reasoning-schedules/): Change how intermediate steps are generated, revised, or searched—for example, by refining several steps in parallel. These are related approaches: some still produce written chains of thought.

Summary and categories are editorial. Read the original paper to verify claims and limitations. A citation to a paper does not, by itself, establish that a later method builds on it.

Reading-list version 0.9.5; literature checked through 2026-10-18.