Sarim-Hash/qwen35-4b-winner-v2-dpo

VISIONPricing:Input $0.4 / Cached $0.08 / Output $0.8Concurrent Unit Cost:1Model Size:4.5BQuant:BF16Context Size:32kTool Calling:SupportedPublished:Aug 30, 2026Architecture:Transformer Featherless Exclusive Cold

Sarim-Hash/qwen35-4b-winner-v2-dpo is a 4.5 billion parameter language model, initialized from Winner-v2 SFT and fine-tuned using a full-parameter DPO (Direct Preference Optimization) policy. This model was specifically developed and evaluated as 'q4b-g2-dpo' in ICLR persuasion debate experiments. It is a full fine-tune, not a LoRA adapter, and is designed for tasks benefiting from preference-based optimization.

Loading preview...

Model Overview

Sarim-Hash/qwen35-4b-winner-v2-dpo is a 4.5 billion parameter language model that has undergone a full fine-tuning process using a Direct Preference Optimization (DPO) policy. This model is a direct descendant of the Winner-v2 SFT initialization.

Key Characteristics

  • Full-Parameter DPO Policy: The model utilizes a comprehensive DPO policy, indicating a focus on aligning its outputs with human preferences or specific desired behaviors.
  • Experimental Origin: It was specifically developed and evaluated as 'q4b-g2-dpo' within the context of ICLR persuasion debate experiments, suggesting its potential for tasks involving nuanced language generation and argumentative reasoning.
  • Full Fine-Tune: Unlike LoRA adapters, this model represents a complete fine-tuning of all its parameters, which can lead to more integrated and robust performance for its intended applications.
  • Artifact: The provided weight file (model.safetensors) represents the evaluated final checkpoint from its development process.

Potential Use Cases

Given its DPO fine-tuning and experimental background in persuasion debates, this model could be particularly well-suited for:

  • Generating persuasive arguments or counter-arguments.
  • Tasks requiring nuanced language and preference alignment.
  • Research into DPO methods and their application in specific domains.