Challenge: Large language models (LLMs) have demonstrated remarkable capabilities across various domains since the release of ChatGPT . a key challenge in developing these general capabilities is efficiently sourcing diverse, high-quality data.
Approach: They introduce Flaming-hot Initiation with Regular Execution (FIRE) sampling to efficiently find good responses by promoting diversity.
Outcome: The proposed method enhances inference-time generation quality and benefits training in the alignment stage.

Similar Papers

Fighting Fire with Fire: The Dual Role of LLMs in Crafting and Detecting Elusive Disinformation (2023.emnlp-main)

Copied to clipboard

Challenge: Recent ubiquity and disruptive impacts of large language models have raised concerns about their potential to be misused.
Approach: They propose a strategy that leverages LLMs' generative and emergent reasoning capabilities to counter human-written and LLM-generated disinformation.
Outcome: The proposed strategy synthesizes authentic and deceptive LLM-generated content through paraphrase-based and perturbation-based prefix-style prompts, respectively.
Large Language Models Are Bad Dice Players: LLMs Struggle to Generate Random Numbers from Statistical Distributions (2026.acl-long)

Copied to clipboard

Challenge: Existing large language models lack a functional internal sampler to faithfully sample from specified probability distributions . lack of robust sampling mechanisms across diverse application scenarios is a critical functional requirement .
Approach: They propose to use a dual-protocol design to disentangle failure modes . batch generation achieves only modest statistical validity, while independent requests collapse almost entirely .
Outcome: The proposed model fails to enforce uniform answer-position constraints and violates demographic targets in attribute-constrained text-to-image prompt synthesis.
When Life Gives You Samples: The Benefits of Scaling up Inference Compute for Multilingual LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: Recent advances in large language models have shifted focus toward scaling inference-time compute.
Approach: They propose to scale inference-time compute in a multilingual, multi-task setting . they propose to use m-ArenaHard-v2.0 prompts to sample multiple outputs in parallel .
Outcome: The proposed solutions achieve an average +6.8 jump in win-rates for 8B models on m-ArenaHard-v2.0 prompts in non-English languages against proprietary models like Gemini.
Batch Prompting: Efficient Inference with Large Language Model APIs (2023.emnlp-industry)

Copied to clipboard

Challenge: Performing inference on large volumes of samples can be computationally and financially costly.
Approach: They propose a prompting approach that enables large language models to run inference in batches instead of one sample at a time.
Outcome: The proposed prompting reduces both token and time costs while retaining downstream performance.
Selecting Better Samples from Pre-trained LLMs: A Case Study on Question Generation (2023.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated impressive prowess in natural language generation.
Approach: They propose a method to select high-quality questions from LLM-generated candidates using round-trip and prompt-based scoring.
Outcome: The proposed approach can select high-quality questions from a set of LLM-generated candidates without modification of the underlying model nor rely on human annotations.
On Weaponization-Resistant Large Language Models with Prospect Theoretic Alignment (2025.coling-main)

Copied to clipboard

Challenge: Existing safeguards for large language models are inadequate for open-weight models as minimal fine-tuning can bypass them.
Approach: They propose a framework that prioritizes maximizing generative utility rather than a singular optimization metric and integrates prospect theory into LLM training to strengthen LLMs against misuse and weaponization.
Outcome: The proposed framework strengthens LLMs against misuse and weaponization while maintaining high performance even after extensive fine-tuning.
Let’s Sample Step by Step: Adaptive-Consistency for Efficient Reasoning and Coding with LLMs (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for improving the correctness of output from large language models generate a constant number of samples per question, but Adaptive-Consistency reduces sample budget by up to 7.9 times with an average accuracy drop of less than 0.1%.
Approach: They propose a model-agnostic technique that dynamically adjusts the number of samples per question using a lightweight stopping criterion.
Outcome: The proposed technique reduces sample budget by 7.9 times with an average accuracy drop of less than 0.1%.
Rethinking the Role of Prompting Strategies in LLM Test-Time Scaling: A Perspective of Probability Theory (2025.acl-long)

Copied to clipboard

Challenge: Recent studies have shown that scaling test-time compute can also effectively improve reasoning.
Approach: They propose a probabilistic method to efficiently predict scaling performance and identify the best prompting strategy under large sampling times.
Outcome: The proposed method significantly improves the scaling performance of majority voting on large language models.
FLAMES: Improving LLM Math Reasoning via a Fine-Grained Analysis of the Data Synthesis Pipeline (2025.findings-emnlp)

Copied to clipboard

Challenge: Recent work improving LLM math reasoning with synthetic data uses unique setups, making comparison of data synthesis strategies impractical.
Approach: They propose a framework for LLM assessment of math reasoning with synthetic data . they use 10 existing data synthesis strategies and multiple other factors to study performance .
Outcome: The proposed data synthesis strategies outperform public datasets on OlympiadBench, CollegeMath, GSMPlus and MATH.
LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) are increasingly lengthy and require longer prompts . this paper presents a coarse-to-fine prompt compression method to reduce cost and increase performance.
Approach: They propose a coarse-to-fine prompt compression method that maintains semantic integrity under high compression ratios and a token-level iterative compression algorithm to better model the interdependence between compressed contents.
Outcome: The proposed method yields state-of-the-art performance and allows for up to 20x compression with little performance loss over four datasets from different scenarios.

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