Update README.md
Browse files
README.md
CHANGED
|
@@ -24,6 +24,10 @@ base_model:
|
|
| 24 |
|
| 25 |
---
|
| 26 |
|
|
|
|
|
|
|
|
|
|
|
|
|
| 27 |
## What is cool
|
| 28 |
|
| 29 |
The base verifier has fixed weights, but its inference process is not exhausted by ordinary left-to-right decoding. A learned continuous proposer can search for hidden-state trajectories and token paths that the verifier can recognize as correct, even if the verifier would rarely or never reach them under standard autoregressive rollout.
|
|
|
|
| 24 |
|
| 25 |
---
|
| 26 |
|
| 27 |
+
## How it was envisaged
|
| 28 |
+
|
| 29 |
+
A machine for constructing candidate inner-machines that bias the verifier toward solution paths its default rollout would miss
|
| 30 |
+
|
| 31 |
## What is cool
|
| 32 |
|
| 33 |
The base verifier has fixed weights, but its inference process is not exhausted by ordinary left-to-right decoding. A learned continuous proposer can search for hidden-state trajectories and token paths that the verifier can recognize as correct, even if the verifier would rarely or never reach them under standard autoregressive rollout.
|