thinker
active
thinker:amir-zur

Amir Zur

Authored
1
Introduces
0
Studies
0
Affiliations
0
Cited by
0

Authored papers (1)

  • Resampling noise in reasoning-chain uncertainty dynamics is almost exactly multinomial, so most of the cost of Forking Paths Analysis re-measures structure that neighboring tokens already contain. On tinyMMLU (n=100) with Llama-3-8B-Instruct and DeepSeek-R1-Distill-Llama-8B, 1.77B tokens of S=200 reference data show log-TVD falling with log S at slopes of −0.4903 (development set), −0.4757 (Llama) and −0.4838 (DeepSeek), against the −1/2 expected under i.i.d. multinomial sampling. Measured replicate TVD sits within 0.98–1.01 of the exact multinomial null. The paper's estimator, a three-stage smoother, exploits this: PELT change-point detection with an exact multinomial cost segments the base path at forking points, Gaussian-kernel-weighted Dirichlet pooling smooths within segments, and cross-validation tunes the penalty and bandwidth. Smoothing S=5 data multiplies effective sample size by 5.0× at 4-token spacing for Llama (22.1× at 1-token spacing) and 4.9× for DeepSeek sentence resampling, falling to about 1× at S=100. Combined with coarser resampling, it cuts total budget to 1/8 with small error increase, roughly 1% of reference cost in the Figure 1 example. Gains shrink at large forks: at a 0.20 threshold smoothing is marginally worse than raw data. The implication is that resampling-based analysis of reasoning should be treated as a statistical estimation problem with a known noise model, not a brute-force sampling problem, and that sampling budgets can be allocated accordingly.

More papers — OpenAlex / S2

Co-authors (11)

Recent mentions (1)