paper-with-me

홈 › Papers

Condor: Enhance LLM Alignment with Knowledge-Driven Data Synthesis and Refinement

2025-01-21 · Maosong Cao, Taolin Zhang, Mo Li, Chuyu Zhang, Yunxin Liu, Haodong Duan, Songyang Zhang, Kai Chen

The quality of Supervised Fine-Tuning (SFT) data plays a critical role in enhancing the conversational capabilities of Large Language Models (LLMs). However, as LLMs become more advanced, the availability of high-quality human-annotated SFT data has become a significant bottleneck, necessitating a greater reliance on synthetic training data. In this work, we introduce Condor, a novel two-stage synthetic data generation framework that incorporates World Knowledge Tree and Self-Reflection Refinement to produce high-quality SFT data at scale. Our experimental results demonstrate that a base model fine-tuned on only 20K Condor-generated samples achieves superior performance compared to counterparts. The additional refinement stage in Condor further enables iterative self-improvement for LLMs at various scales (up to 72B), validating the effectiveness of our approach. Furthermore, our investigation into the scaling for synthetic data in post-training reveals substantial unexplored potential for performance improvements, opening promising avenues for future research.

📄 PDF Abstract BibTeX arXiv:2501.12273

Code (1)

internlm/condor 공식 구현 pytorch

Tasks

Synthetic Data GenerationWorld Knowledge

Methods 이 논문이 사용한 방법론

BASE 설명 없음
SFT Shrink and Fine-Tune, or SFT, is a type of distillation that avoids explicit distillation by copying parameters to a student student model and then fine-tuning.…

Similar Papers 제목 키워드 기반

Finding Preference Profiles of Condorcet Dimension $k$ via SAT

2014-02-18 · Christian Geist

Condorcet winning sets are a set-valued generalization of the well-known concept of a Condorcet winner. As supersets of Condorcet winning sets are always Condorcet winning sets themselves, an interesting property of pref…

Closeness Centrality via the Condorcet Principle

2021-12-01 · Oskar Skibski

We uncover a new relation between Closeness centrality and the Condorcet principle. We define a Condorcet winner in a graph as a node that compared to any other node is closer to more nodes. In other words, if we assume …

Non-Stationary Dueling Bandits Under a Weighted Borda Criterion

2024-03-19 · Joe Suk, Arpit Agarwal

In $K$-armed dueling bandits, the learner receives preference feedback between arms, and the regret of an arm is defined in terms of its suboptimality to a $\textit{winner}$ arm. The $\textit{non-stationary}$ variant of …

The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits

2026-03-16 · El Mehdi Saad, Victor Thuot, Nicolas Verzelen arxiv

We study best-arm identification in stochastic dueling bandits under the sole assumption that a Condorcet winner exists, i.e., an arm that wins each noisy pairwise comparison with probability at least $1/2$. We introduce…

Differentially Private Condorcet Voting

2022-06-27 · Zhechen Li, Ao Liu, Lirong Xia, Yongzhi Cao 외

Designing private voting rules is an important and pressing problem for trustworthy democracy. In this paper, under the framework of differential privacy, we propose a novel famliy of randomized voting rules based on the…