Challenge: Existing methods for QA data generation are limited by the dependence of existing evaluation metrics on ground truth labels.
Approach: They propose a set of unsupervised evaluation metrics for QA data that enable multidimensional assessment based on the relationships among context,question and answer.
Outcome: The proposed method outperforms state-of-the-art methods on public datasets and shows that it produces high-quality and domain-specific QA pairs.

Similar Papers

Direct Judgement Preference Optimization (2025.emnlp-main)

Copied to clipboard

Challenge: Existing judge models are largely trained with supervised finetuning on small data scales to perform limited types of evaluation tasks, limiting generalization.
Approach: They propose to train judge models at large data scales with direct preference optimization . they use four training tasks to form three types of preference pairs targeting different aspects of evaluation .
Outcome: The proposed model outperforms GPT-4o and other similar models on 13 benchmarks.
Benchmarking Direct Preference Optimization for Medical Large Vision–Language Models (2026.findings-eacl)

Copied to clipboard

Challenge: Large vision-language models (LVLMs) are gaining traction in clinical tasks such as diagnostic support, report generation, and medical question answering.
Approach: They present a systematic evaluation of nine DPO variants applied to two leading medical LVLMs.
Outcome: The proposed model improves alignment and reduces severe hallucinations, but yields inconsistent gains over supervised fine-tuning.
Enhancing Machine Translation with Self-Supervised Preference Data (2025.acl-long)

Copied to clipboard

Challenge: Current approaches to constructing preference data rely on human annotations.
Approach: They propose a framework which efficiently constructs translation preference data for iterative training.
Outcome: The proposed framework improves translation preference data on large language models.
Persona-Consistent Dialogue Generation via Pseudo Preference Tuning (2025.coling-main)

Copied to clipboard

Challenge: Existing methods for improving persona consistency in dialogues require external resources.
Approach: They propose a method for enhancing persona consistency in dialogue response generation using direct preference optimization using persona data.
Outcome: The proposed method produces more consistent and natural responses than previous methods.
Enhancing Alignment using Curriculum Learning & Ranked Preferences (2024.findings-emnlp)

Copied to clipboard

Challenge: Direct Preference Optimization (DPO) is an effective technique that leverages pairwise preference data to align LLMs to human preferences.
Approach: They propose to use pairwise preference data to create multiple preference pairs for a given prompt.
Outcome: The proposed method outperforms standard DPO on MTbench, Vicuna bench, and WizardLM with a score of 7.43 on the test sets.
SGDPO: Self-Guided Direct Preference Optimization for Language Model Alignment (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for aligning Large Language Models with human values are limited and results of DPO are not resilient.
Approach: They propose a self-guided direct preference optimization algorithm that incorporates a pilot term to steer the gradient flow during the optimization process.
Outcome: The proposed method can generate human-preferred response up to 9.19% higher than previous methods.
K-order Ranking Preference Optimization for Large Language Models (2025.findings-acl)

Copied to clipboard

Challenge: Existing list-wise methods focus on optimizing list ranking consistency for LLMs to improve ranking abilities.
Approach: They propose to extend the Plackett-Luce model to accommodate top-K ranking by extending the DPO’s Plact-Lucer model to dynamically determine appropriate K for different samples.
Outcome: The proposed model can be extended to accommodate top-K ranking and improve training efficiency.
MPPO: Multi Pair-wise Preference Optimization for LLMs with Arbitrary Negative Samples (2025.coling-main)

Copied to clipboard

Challenge: Existing preference optimization methods such as DPO and KTO are inherently derived from PPO, requiring a reference model that adds GPU memory resources and relies heavily on abundant preference data.
Approach: They propose an algorithm that leverages the average likelihood of model responses to fit the reward function and maximizes the utilization of preference data.
Outcome: The proposed algorithm outperforms DPO, ORPO, and SimPO on MT-Bench and Arena-Hard.
Probability-Consistent Preference Optimization for Enhanced LLM Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances in preference optimization have demonstrated significant potential for improving mathematical reasoning capabilities in large language models.
Approach: They propose a framework that establishes two quantitative metrics for preference selection: surface-level answer correctness and intrinsic token-level probability consistency.
Outcome: The proposed framework outperforms existing outcome-only criterion approaches across a diverse range of LLMs and benchmarks.
ASPO: Adaptive Sentence-Level Preference Optimization for Fine-Grained Multimodal Reasoning (2025.findings-acl)

Copied to clipboard

Challenge: Recent advances have extended DPO to multimodal scenarios, achieving strong performance.
Approach: They propose to use a sentence-level preference optimization technique to optimize individual sentences for more precise preference optimization without additional models or parameters.
Outcome: Experiments show that Adaptive Sentence-level Preference Optimization significantly improves the alignment of multimodal models.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations