Challenge: LLM-based generative optimization has shown remarkable potential in improving agentic systems, but the current approach of prompting with the trajectories on the whole training dataset becomes untenable as datasets grow.
Approach: They propose a scalable framework that divides large optimization tasks into manageable subsets and performs targeted optimizations.
Outcome: The proposed framework outperforms conventional approach by 1.6-8.6% while reducing average prompt token consumption by 56.3%.

Similar Papers

Split-Merge: Scalable and Memory-Efficient Merging of Expert LLMs (2025.emnlp-main)

Copied to clipboard

Challenge: a zero-shot merging framework for large language models consolidates specialized domain experts into a single model without any further training.
Approach: They propose a zero-shot merging framework that consolidates specialized domain experts into a single model without further training.
Outcome: Experiments on code generation, mathematical reasoning, medical question answering, and instruction-following benchmarks confirm the versatility and effectiveness of the proposed framework.
Integrate the Essence and Eliminate the Dross: Fine-Grained Self-Consistency for Free-Form Language Generation (2024.acl-long)

Copied to clipboard

Challenge: Existing methods to improve output quality without aggregating input tokens are limited by the complexity of aggregation of responses.
Approach: They propose to extract and integrate segment-level commonalities from candidate samples to enhance performance of LLMs in open-ended and reasoning tasks.
Outcome: The proposed method improves performance on reasoning, code generation and mathematical reasoning tasks without requiring additional models and overlooking the knowledge present among the candidates.
AutoMixAlign: Adaptive Data Mixing for Multi-Task Preference Optimization in LLMs (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to align large language models rely on large ablation studies, heuristics, or human intuition to produce models with strong performance across tasks.
Approach: They propose an algorithm that mixes datasets during LLM training to balance performance across multiple tasks.
Outcome: The proposed algorithm outperforms existing methods on multitask alignment setups and achieves convergence rate of O(1/T) in the convex case.
MergeIT: From Selection to Merging for Efficient Instruction Tuning (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for instruction tuning rely on LLMs to score instruction quality . existing methods rely only on Llms to rank instruction quality, but this approach is expensive and time-consuming .
Approach: They propose a novel LLM-based Merging strategy for better Instruction Tuning that shifts the focus from selection to synthesis.
Outcome: The proposed method reduces time and computational cost while preserving diversity and reducing redundancy.
Selecting and Merging: Towards Adaptable and Scalable Named Entity Recognition with Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Existing approaches to align large language models with information extraction tasks are costly and not all training data benefits target domains.
Approach: They propose a framework which dynamically Selects and Merges expert models at inference time and combines experts beneficial to target domains.
Outcome: The proposed framework outperforms the unified model by 10% on multiple benchmarks.
Global Adaptive Momentum Meets Local Personalized Perturbation: Efficient Federated LLM Fine-Tuning with Zeroth-Order Gradients (2026.acl-long)

Copied to clipboard

Challenge: federated fine-tuning of large language models provides privacy-preserving approach to deploying pervasive generative AI services.
Approach: They propose a federated framework for fine-tuning large language models . they propose unified optimization and local personalized perturbation for ZO gradients .
Outcome: The proposed framework outperforms existing methods for integrating ZO gradients in federated learning over diverse heterogeneous data settings.
CARMA: Enhanced Compositionality in LLMs via Advanced Regularisation and Mutual Information Alignment (2025.emnlp-main)

Copied to clipboard

Challenge: Large language models (LLMs) struggle with compositional generalisation, limiting their ability to systematically combine learned components to interpret novel inputs.
Approach: They propose a method that enhances stability and robustness of compositional reasoning in large language models (LLMs) by regularising and preserving layer-wise stability constraints.
Outcome: The proposed method reduces variability, stabilizes token representations, and improves compositional reasoning.
EvoRoute: Experience-Driven Self-Routing LLM Agent Systems (2026.acl-long)

Copied to clipboard

Challenge: EvoRoute is a self-evolving model routing paradigm that transcends static, pre-defined model assignments.
Approach: They propose a model routing paradigm that transcends static, pre-defined model assignments.
Outcome: Experiments on GAIA and BrowseComp+ show that EvoRoute reduces execution cost and latency by over 70%.
AgentTuning: Enabling Generalized Agent Abilities for LLMs (2024.findings-acl)

Copied to clipboard

Challenge: Open large language models (LLMs) with great performance in various tasks are far inferior to commercial models such as ChatGPT and GPT-4 when acting as agents to tackle complex tasks in the real world.
Approach: They propose a method to enhance the agent capabilities of LLMs while maintaining their general abilities.
Outcome: The AgentLM-70B is comparable to GPT-3.5-turbo on unseen agent tasks, demonstrating generalized agent capabilities.
Balancing Speciality and Versatility: a Coarse to Fine Framework for Supervised Fine-tuning Large Language Model (2024.findings-acl)

Copied to clipboard

Challenge: Aligned Large Language Models exhibit remarkable versatility, capable of handling diverse real-world tasks.
Approach: They propose a coarse to fine framework to fine-tune aligned Large Language Models to achieve a balance between speciality and versatility.
Outcome: The proposed framework outperforms baseline methods across diverse tasks and model scales.

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