ByteDance-Seed/BFS-Prover-V2-32B
BFS-Prover-V2-32B is a 32.8 billion parameter step-level theorem proving system developed by ByteDance-Seed, built upon the Qwen2.5-32B base model. It is specifically designed for Lean4, utilizing a multi-stage expert iteration framework and a planner-enhanced multi-agent tree search for hierarchical reasoning. This model achieves state-of-the-art performance in theorem proving, with 95.08% on miniF2F and 41.4% on ProofNet, making it highly effective for automated mathematical proof generation.
Hugging Face Popular Sampler Settings
Most commonly used values from Featherless users
temperature
This setting influences the sampling randomness. Lower values make the model more deterministic; higher values introduce randomness. Zero is greedy sampling.
–
top_p
This setting controls the cumulative probability of considered top tokens. Must be in (0, 1]. Set to 1 to consider all tokens.
–
top_k
This limits the number of top tokens to consider. Set to -1 to consider all tokens.
–
frequency_penalty
This setting penalizes new tokens based on their frequency in the generated text. Values > 0 encourage new tokens; < 0 encourages repetition.
–
presence_penalty
This setting penalizes new tokens based on their presence in the generated text so far. Values > 0 encourage new tokens; < 0 encourages repetition.
–
repetition_penalty
This setting penalizes new tokens based on their appearance in the prompt and generated text. Values > 1 encourage new tokens; < 1 encourages repetition.
–
min_p
This setting representing the minimum probability for a token to be considered relative to the most likely token. Must be in [0, 1]. Set to 0 to disable.
–