Papers with optimizer
MALLM-GAN: Multi-Agent Large Language Model as Generative Adversarial Network for Synthesizing Tabular Data (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing models for tabular data generation require large amounts of data to train effectively. |
| Approach: | They propose a framework to generate tabular data powered by large language models that emulates a Generative Adversarial Network. |
| Outcome: | The proposed framework outperforms state-of-the-art models while keeping privacy of real data. |
Towards Comprehensive Patent Approval Predictions:Beyond Traditional Document Classification (2022.acl-long)
Copied to clipboard
| Challenge: | a new framework for patent approval prediction is proposed to address this problem . novelty scores are based on comparing an application with millions of prior arts . |
| Approach: | They propose a framework that unifies the document classifier with handcrafted features, particularly time-dependent novelty scores. |
| Outcome: | The proposed framework unifies the document classifier with handcrafted features, particularly time-dependent novelty scores. |
LoRA-MGPO: Mitigating Double Descent in Low-Rank Adaptation via Momentum-Guided Perturbation Optimization (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Low-Rank Adaptation (LoRA) adapts large language models by training only a small fraction of parameters, but as the rank of the low-rank matrices increases, LoRA exhibits an unstable “double descent” phenomenon, which delays convergence and impairs generalization by causing instability due to the attraction to sharp local minima. |
| Approach: | They propose a framework that incorporates Momentum-Guided Perturbation Optimization (MGPO) MGPO stabilizes training dynamics by mitigating double descent phenomenon and guiding weight perturbations using momentum vectors from the optimizer’s state. |
| Outcome: | The proposed framework improves performance on natural language understanding benchmarks and shows that it improves convergence and generalization. |
Towards Efficient LLM Grounding for Embodied Multi-Agent Collaboration (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for grounding large language models suffer from inefficient querying . Existing approaches that rely on physical verification or self-reflection suffer from excessive querying. |
| Approach: | They propose a framework that introduces Reinforced Advantage feedback for efficient self-refinement of plans. |
| Outcome: | The proposed framework surpasses baselines in success rate and significantly decreases interaction steps of agents and query rounds of LLMs. |
GLaPE: Gold Label-agnostic Prompt Evaluation for Large Language Models (2024.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have explored leveraging the LLM itself as an optimizer to identify optimal prompts that maximize task accuracy. |
| Approach: | They propose a gold label-agnostic prompt evaluation method to reduce dependence on gold labels. |
| Outcome: | The proposed method produces more effective prompts even without gold labels. |
With Measured Words: Simple Sentence Selection for Black-Box Optimization of Sentence Compression Algorithms (2021.eacl-main)
Copied to clipboard
| Challenge: | Sentence Compression is the task of generating a shorter, yet grammatical, version of a given sentence, preserving the essence of the original sentence. |
| Approach: | They propose a Black-Box Optimizer for Compression to find the best candidates for compression . they use a black-box compression algorithm to predict how well each sentence could be compressed . |
| Outcome: | The proposed algorithm improves both accuracy and Rouge-F1-score on three datasets. |
Should I try multiple optimizers when fine-tuning a pre-trained Transformer for NLP tasks? Should I tune their hyperparameters? (2024.eacl-long)
Copied to clipboard
| Challenge: | NLP research has explored different neural model architectures and sizes, datasets, training objectives, and transfer-learning techniques. |
| Approach: | They propose to use a variant of Stochastic Gradient Descent (SGD) to select among numerous variants, often with minimal or no tuning of the optimizer’s hyperparameters. |
| Outcome: | Experiments with five GLUE datasets, two models and seven popular optimizers show that tuning just the learning rate is as good as tuning all the hyperparameters. |
HqeKV: Towards Hybrid Quantization and Eviction for KV Cache in Long-Context LLM Inference (2026.findings-acl)
Copied to clipboard
| Challenge: | autoregressive inference requires repeated computation across transformer layers. |
| Approach: | They propose a hybrid compression framework built on both quantization and eviction . they propose varying importance metric and flexible conversion policies to reduce memory overhead . |
| Outcome: | The proposed framework outperforms state-of-the-art methods under memory constraints. |
Sharpness-Aware Minimization for Topic Models with High-Quality Document Representations (2025.naacl-long)
Copied to clipboard
Tung Nguyen, Tue Le, Hoang Tran Vuong, Quang Duc Nguyen, Duc Anh Nguyen, Linh Ngo Van, Sang Dinh, Thien Huu Nguyen
| Challenge: | Recent advances in topic models have significantly enhanced the performance compared to conventional probabilistic approaches. |
| Approach: | They propose to use a topic model optimization method to improve generalization and performance. |
| Outcome: | The proposed method improves topic models on popular benchmark datasets. |
CAME: Confidence-guided Adaptive Memory Efficient Optimization (2023.acl-long)
Copied to clipboard
| Challenge: | Existing memory-efficient methods require second-moment estimates of the per-parameter gradients to maintain their performance. |
| Approach: | They propose to use memory-efficient optimizers to reduce memory usage by preserving second-moment estimates of gradients. |
| Outcome: | The proposed method achieves fast convergence and lower memory usage across training tasks. |
Do We Always Need Query-Level Workflows? Rethinking Agentic Workflow Generation for Multi-Agent Systems (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches generate workflows either at task level or query level, but their relative costs and benefits remain unclear. |
| Approach: | They propose a query-level workflow generation framework that generates tasks at task level and query level. |
| Outcome: | The proposed framework reduces token usage by up to 83% compared to existing approaches . it maintains competitive performance with an average degradation of just 0.61% compared with existing approaches across multiple datasets . |
Improving Sharpness-Aware Minimization with Fisher Mask for Better Generalization on Language Models (2022.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for fine-tuning pretrained language models suffer from poor generalization . however, they add a perturbation to each model parameter equally, which is sub-optimal . |
| Approach: | They propose a sharpness-aware minimization optimization procedure that introduces a Fisher mask to improve the efficiency of SAM. |
| Outcome: | The proposed method outperforms the vanilla sharpness-aware minimization method on GLUE and SuperGLUE benchmarks. |
Universal Prompt Optimizer for Safe Text-to-Image Generation (2024.naacl-long)
Copied to clipboard
| Challenge: | Existing studies based on image checker, model fine-tuning and embedding blocking are impractical in real-world applications. |
| Approach: | They propose a novel reward function measuring toxicity and text alignment of generated images and train the optimizer through Proximal Policy Optimization. |
| Outcome: | The proposed model reduces the likelihood of various models in generating inappropriate images, with no significant impact on text alignment. |
Full Parameter Fine-tuning for Large Language Models with Limited Resources (2024.acl-long)
Copied to clipboard
| Challenge: | Large Language Models (LLMs) require massive GPU resources for training. |
| Approach: | They propose a parameter-efficient optimization that fuses the gradient computation and parameter update in one step to reduce memory usage. |
| Outcome: | The proposed method reduces memory usage to 10.8% compared to the standard approach. |
Enhancing LLM Knowledge Learning through Generalization (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Continued pre-training on paraphrased data has shown empirical promise for enhancing knowledge acquisition, but this approach is costly and unreliable as it relies on external models or manual effort for rewriting. |
| Approach: | They propose formatting-based data augmentation which diversifies documents conveying the same knowledge by altering document formats rather than their content. |
| Outcome: | The proposed methods improve generalization to diverse paraphrased contexts and enhance pre-training and instruction tuning. |
SAGE: Sign-Adaptive Gradient for Memory-Efficient LLM Optimization (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to train LLMs consume memory equivalent to twice the model size, resulting in a hybrid design that reverts to AdamW and negates the memory gains. |
| Approach: | They propose a new, memory-efficient O(d) adaptive scale that replaces AdamW in a hybrid structure that combines a Lion-style update direction with a memory-saving adaptive scale. |
| Outcome: | The proposed model outperforms existing methods on LLMs up to 1.3B parameters while significantly reducing optimizer state memory. |
Better Embeddings with Coupled Adam (2025.acl-long)
Copied to clipboard
| Challenge: | Anisotropic Embeddings Large Language Models exhibit undesirable yet poorly understood feature of anisotropy. |
| Approach: | They propose an algorithm that uses the second moment in Adam to mitigate anisotropic embeddings . they propose an embeddable matrix and unembedding matrix to map the input and output tokens based on weight tying . |
| Outcome: | The proposed model improves quality and performance on large datasets. |