English
Related papers

Related papers: Scaling Textual Gradients via Sampling-Based Momen…

200 papers

Automatic prompt optimization is an important approach to improving the performance of large language models (LLMs). Recent research demonstrates the potential of using LLMs as prompt optimizers, which can generate improved task prompts via…

Computation and Language · Computer Science 2025-01-28 Xinyu Tang , Xiaolei Wang , Wayne Xin Zhao , Siyuan Lu , Yaliang Li , Ji-Rong Wen

The large language models have achieved superior performance on various natural language tasks. One major drawback of such approaches is they are resource-intensive in fine-tuning new datasets. Soft-prompt tuning presents a…

Computation and Language · Computer Science 2023-10-30 Guoxin Chen , Yiming Qian , Bowen Wang , Liangzhi Li

The effectiveness of large language models (LLMs) is closely tied to the design of prompts, making prompt optimization essential for enhancing their performance across a wide range of tasks. Many existing approaches to automating prompt…

Computation and Language · Computer Science 2025-04-08 Sarkar Snigdha Sarathi Das , Ryo Kamoi , Bo Pang , Yusen Zhang , Caiming Xiong , Rui Zhang

Effectively adapting powerful pretrained foundation models to diverse tasks remains a key challenge in AI deployment. Current approaches primarily follow two paradigms:discrete optimization of text prompts through prompt engineering, or…

Computation and Language · Computer Science 2025-08-06 Xiaoming Hou , Jiquan Zhang , Zibin Lin , DaCheng Tao , Shengli Zhang

Recent advances have shown that optimizing prompts for Large Language Models (LLMs) can significantly improve task performance, yet many optimization techniques rely on heuristics or manual exploration. We present LatentPrompt, a…

Computation and Language · Computer Science 2025-08-05 Mateusz Bystroński , Grzegorz Piotrowski , Nitesh V. Chawla , Tomasz Kajdanowicz

Mastering a skill generally relies on both hands-on experience from doers and insightful, high-level guidance by mentors. Will this strategy also work well for solving complex non-convex optimization problems? Here, a common gradient-based…

Computer Vision and Pattern Recognition · Computer Science 2024-12-05 Zixian Guo , Ming Liu , Zhilong Ji , Jinfeng Bai , Yiwen Guo , Wangmeng Zuo

This research investigates prompt designs of evaluating generated texts using large language models (LLMs). While LLMs are increasingly used for scoring various inputs, creating effective prompts for open-ended text evaluation remains…

Computation and Language · Computer Science 2024-06-28 KuanChao Chu , Yi-Pei Chen , Hideki Nakayama

Large language models (LLMs) are increasingly used in learning algorithms, evaluations, and optimization tasks. Recent studies have shown that using LLM-based optimizers to automatically optimize model prompts, demonstrations, predictions…

Computation and Language · Computer Science 2025-10-23 Guowei Xu , Mert Yuksekgonul , Carlos Guestrin , James Zou

The training of modern machine learning models often consists in solving high-dimensional non-convex optimisation problems that are subject to large-scale data. In this context, momentum-based stochastic optimisation algorithms have become…

Optimization and Control · Mathematics 2024-11-06 Kexin Jin , Jonas Latz , Chenguang Liu , Alessandro Scagliotti

In long context scenarios, large language models (LLMs) face three main challenges: higher computational cost, performance reduction, and position bias. Research indicates that LLM performance hinges on the density and position of key…

Computation and Language · Computer Science 2024-08-13 Huiqiang Jiang , Qianhui Wu , Xufang Luo , Dongsheng Li , Chin-Yew Lin , Yuqing Yang , Lili Qiu

Gradient-free prompt optimization methods have made significant strides in enhancing the performance of closed-source Large Language Models (LLMs) across a wide range of tasks. However, existing approaches make light of the importance of…

Computation and Language · Computer Science 2024-10-03 Muchen Yang , Moxin Li , Yongle Li , Zijun Chen , Chongming Gao , Junqi Zhang , Yangyang Li , Fuli Feng

Current LLM alignment methods are readily broken through specifically crafted adversarial prompts. While crafting adversarial prompts using discrete optimization is highly effective, such attacks typically use more than 100,000 LLM calls.…

Machine Learning · Computer Science 2025-03-04 Simon Geisler , Tom Wollschläger , M. H. I. Abdalla , Johannes Gasteiger , Stephan Günnemann

Safety of Large Language Models (LLMs) has become a critical issue given their rapid progresses. Greedy Coordinate Gradient (GCG) is shown to be effective in constructing adversarial prompts to break the aligned LLMs, but optimization of…

Computation and Language · Computer Science 2024-11-11 Yiran Zhao , Wenyue Zheng , Tianle Cai , Xuan Long Do , Kenji Kawaguchi , Anirudh Goyal , Michael Shieh

Large Language Models (LLMs) have demonstrated exceptional abilities across a broad range of language-related tasks, including generating solutions to complex reasoning problems. An effective technique to enhance LLM performance is…

Computation and Language · Computer Science 2024-12-25 Shuzhang Cai , Twumasi Mensah-Boateng , Xander Kuksov , Jing Yuan , Shaojie Tang

Despite recent advances in text-to-image generation, models still struggle to accurately render prompt-specified text with correct spatial layout -- especially in multi-span, structured settings. This challenge is driven not only by the…

Computer Vision and Pattern Recognition · Computer Science 2026-04-28 Dongxing Mao , Yilin Wang , Linjie Li , Zhengyuan Yang , Alex Jinpeng Wang

Large Language Models (LLMs) have demonstrated strong capabilities in various natural language processing tasks; however, their application to graph-related problems remains limited, primarily due to scalability constraints and the absence…

Machine Learning · Computer Science 2025-05-08 Hyun Lee , Chris Yi , Maminur Islam , B. D. S. Aritra

Stochastic gradient descent (SGD) is an inherently sequential training algorithm--computing the gradient at batch $i$ depends on the model parameters learned from batch $i-1$. Prior approaches that break this dependence do not honor them…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-06-05 Saeed Maleki , Madan Musuvathi , Todd Mytkowicz , Olli Saarikivi , Tianju Xu , Vadim Eksarevskiy , Jaliya Ekanayake , Emad Barsoum

Prompt engineering is a new paradigm for enhancing the performance of trained neural network models. For optimizing text-style prompts, existing methods usually individually operate small portions of a text step by step, which either breaks…

Computation and Language · Computer Science 2023-10-03 Yujian Betterest Li , Kai Wu

In this paper, we propose a novel accelerated stochastic gradient method with momentum, which momentum is the weighted average of previous gradients. The weights decays inverse proportionally with the iteration times. Stochastic gradient…

Machine Learning · Computer Science 2020-06-02 Liang Liu , Xiaopeng Luo

Temporal Sentence Grounding (TSG), which aims to localize moments from videos based on the given natural language queries, has attracted widespread attention. Existing works are mainly designed for short videos, failing to handle TSG in…

Computer Vision and Pattern Recognition · Computer Science 2023-12-29 Houlun Chen , Xin Wang , Hong Chen , Zihan Song , Jia Jia , Wenwu Zhu