Bourbaki: Self-Generated and Goal-Conditioned MDPs for Theorem Proving

Documenti analoghi

• Decoding as Optimisation on the Probability Simplex: From Top-K to Top-P (Nucleus) to Best-of-K Samplers
  di: Ji, Xiaotong, et al.
  Pubblicazione: (2026)
• Scalable Power Sampling: Unlocking Efficient, Training-Free Reasoning for LLMs via Distribution Sharpening
  di: Ji, Xiaotong, et al.
  Pubblicazione: (2026)
• The Model Knows, the Decoder Finds: Future Value Guided Particle Power Sampling
  di: Nguyen, Tu, et al.
  Pubblicazione: (2026)
• The $\mathbf{Y}$-Combinator for LLMs: Solving Long-Context Rot with $λ$-Calculus
  di: Roy, Amartya, et al.
  Pubblicazione: (2026)
• Risk-Controlled Lean-as-Judge for Natural-Language Mathematical Reasoning
  di: Bourigault, Pauline, et al.
  Pubblicazione: (2026)