← Search

Qingwei Lin

50 accepted papers

2026

A Tale of Two Graphs: Separating Knowledge Exploration from Outline Structure for Open-Ended Deep Research

ICML 2026poster

Open-Ended Deep Research (OEDR) pushes LLM agents beyond short-form QA toward long-horizon workflows that iteratively search, connect, and synthesize evidence into structured reports. However, existing OEDR agents largely follow either linear "search-then-generate" accumulation or outline-centric pl…

Cited by 1SourceScholar
2026

DoVer: Intervention-Driven Auto Debugging for LLM Multi-Agent Systems

ICLR 2026poster

Large language model (LLM)–based multi-agent systems are challenging to debug because failures often arise from long, branching interaction traces. The prevailing practice is to leverage LLMs for log-based failure localization, attributing errors to a specific agent and step. However, this paradigm…

Cited by 0SourceScholar
2026

Pretrain Value, Not Reward: Decoupled Value Policy Optimization

ICLR 2026poster

In this paper, we explore how directly pretraining a value model simplifies and stabilizes reinforcement learning from human feedback (RLHF). In reinforcement learning, value estimation is the key to policy optimization, distinct from reward supervision. The value function predicts the \emph{retur…

Cited by 0SourcecodeScholar
2026

RePrompt: Reasoning-Augmented Reprompting for Text-to-Image Generation via Reinforcement Learning

ICLR 2026poster

Despite recent progress in text-to-image (T2I) generation, existing models often struggle to faithfully capture user intentions from short and under-specified prompts. While prior work has attempted to enhance prompts using large language models (LLMs), these methods frequently generate stylistic or…

Cited by 0SourcecodeScholar
2026

Text2Grad: Reinforcement Learning from Natural Language Feedback

ICLR 2026poster

Traditional RLHF optimizes language models with coarse, scalar rewards that mask the fine-grained reasons behind success or failure, leading to slow, opaque learning. Recent work augments RL with textual critiques through prompting or reflection, improving interpretability but leaving model paramete…

Cited by 0SourcecodeScholar
2025

AXIS: Efficient Human-Agent-Computer Interaction with API-First LLM-Based Agents

ACL 2025long

Multimodal large language models (MLLMs) have enabled LLM-based agents to directly interact with application user interfaces (UIs), enhancing agents’ performance in complex tasks. However, these agents often suffer from high latency and low reliability due to the extensive sequential UI interactions…

Cited by 0SourcePDFScholar
2025

AdaptFlow: Adaptive Workflow Optimization via Meta-Learning

EMNLP 2025

Recent advances in large language models (LLMs) have sparked growing interest in agentic workflows—structured sequences of LLM invocations designed to solve complex tasks. However, existing approaches often rely on static templates or manually designed workflows, which limit adaptability to diverse

Cited by 0SourcePDFScholar
2025

DI-BENCH: Benchmarking Large Language Models on Dependency Inference with Testable Repositories at Scale

ACL 2025finding

Large Language Models have advanced automated software development, however, it remains a challenge to correctly infer dependencies, namely, identifying the internal components and external packages required for a repository to successfully run. Existing studies highlight that dependency-related iss…

2025

ExeCoder: Empowering Large Language Models with Executability Representation for Code Translation

EMNLP 2025

Code translation is a crucial activity in the software development and maintenance process, and researchers have recently begun to focus on using pre-trained large language models (LLMs) for code translation. However, existing LLMs only learn the contextual semantics of code during pre-training, neg

Cited by 0SourcePDFScholar
2025

From Reasoning to Answer: Empirical, Attention-Based and Mechanistic Insights into Distilled DeepSeek R1 Models

EMNLP 2025

Large Reasoning Models (LRMs) generate explicit reasoning traces alongside final answers, yet the extent to which these traces influence answer generation remains unclear. In this work, we conduct a three-stage investigation into the interplay between reasoning and answer generation in three distill

Cited by 0SourcePDFScholar
2025

GUI-Actor: Coordinate-Free Visual Grounding for GUI Agents

NeurIPS 2025poster

One of the principal challenges in building VLM-powered GUI agents is visual grounding—localizing the appropriate screen region for action execution based on both the visual content and the textual plans. Most existing work formulates this as a text-based coordinate generation task. However, these a…

Cited by 0SourceScholar
2025

ICL-Bandit: Relevance Labeling in Advertisement Recommendation Systems via LLM

EMNLP 2025

Measuring the relevance between user queries and advertisements is a critical task for advertisement (ad) recommendation systems, such as Microsoft Bing Ads and Google Ads. Traditionally, this requires expert data labeling, which is both costly and time-consuming. Recent advances have explored using

Cited by 0SourcePDFScholar
2025

OpenRCA: Can Large Language Models Locate the Root Cause of Software Failures?

ICLR 2025poster

Large language models (LLMs) are driving substantial advancements in software engineering, with successful applications like Copilot and Cursor transforming real-world development practices. However, current research predominantly focuses on the early stages of development, such as code generation,…

Cited by 2SourcePDFScholar
2025

Privacy in Action: Towards Realistic Privacy Mitigation and Evaluation for LLM-Powered Agents

EMNLP 2025

The increasing autonomy of LLM agents in handling sensitive communications, accelerated by Model Context Protocol (MCP) and Agent-to-Agent (A2A) frameworks, creates urgent privacy challenges. While recent work reveals significant gaps between LLMs’ privacy Q&A performance and their agent behavior, e

Cited by 0SourcePDFScholar
2025

Reason-before-Retrieve: One-Stage Reflective Chain-of-Thoughts for Training-Free Zero-Shot Composed Image Retrieval

CVPR 2025highlight

Composed Image Retrieval (CIR) aims to retrieve target images that closely resemble a reference image while integrating user-specified textual modifications, thereby capturing user intent more accurately. Existing training-free zero-shot CIR (ZS-CIR) methods often employ a two-stage process: they fi…

2025

RuAG: Learned-rule-augmented Generation for Large Language Models

ICLR 2025poster

In-context learning (ICL) and Retrieval-Augmented Generation (RAG) have gained attention for their ability to enhance LLMs' reasoning by incorporating external knowledge but suffer from limited contextual window size, leading to insufficient information injection. To this end, we propose a novel fra…

Cited by 2SourcePDFScholar
2025

Skeleton-Guided-Translation: A Benchmarking Framework for Code Repository Translation with Fine-Grained Quality Evaluation

EMNLP 2025

Code translation benchmarks are essential for evaluating the accuracy and efficiency of LLM-based systems. Existing benchmarks mainly target individual functions, overlooking repository-level challenges like intermodule coherence and dependency management. Recent repository-level efforts exist, but

Cited by 0SourcePDFScholar
2025

Thread: A Logic-Based Data Organization Paradigm for How-To Question Answering with Retrieval Augmented Generation

EMNLP 2025

Recent advances in retrieval-augmented generation (RAG) have substantially improved question-answering systems, particularly for factoid ‘5Ws’ questions. However, significant challenges remain when addressing ‘1H’ questions, specifically how-to questions, which are integral for decision-making and r

Cited by 0SourcePDFScholar
2025

Token-level Proximal Policy Optimization for Query Generation

EMNLP 2025

Query generation is a critical task for web search engines (e.g. Google, Bing) and recommendation systems. Recently, state-of-the-art query generation methods leverage Large Language Models (LLMs) for their strong capabilities in context understanding and text generation. However, they still face ch

Cited by 0SourcePDFScholar
2025

UFO: A UI-Focused Agent for Windows OS Interaction

NAACL 2025long

We introduce UFO, a UI-Fcused agent designed to fulfill user requests tailored to Windows OS applications by observing and analyzing the GUI and control information of these applications. UFO utilizes a hierarchical dual-agent framework that decomposes user requests using a divide-and-conquer approa…

2025

WarriorCoder: Learning from Expert Battles to Augment Code Large Language Models

ACL 2025long

Despite recent progress achieved by code large language models (LLMs), their remarkable abilities are largely dependent on fine-tuning on the high-quality data, posing challenges for data collection and annotation. To address this, current methods often design various data flywheels to collect compl…

2025

WizardMath: Empowering Mathematical Reasoning for Large Language Models via Reinforced Evol-Instruct

ICLR 2025oral

Large language models (LLMs), such as GPT-4, have shown remarkable performance in natural language processing (NLP) tasks, including challenging mathematical reasoning. However, most existing open-source models are only pre-trained on large-scale internet data and without math-related optimization.…

Cited by 414SourcePDFScholar
2024

AutoRAG-HP: Automatic Online Hyper-Parameter Tuning for Retrieval-Augmented Generation

EMNLP 2024finding

Recent advancements in Large Language Models have transformed ML/AI development, necessitating a reevaluation of AutoML principles for the Retrieval-Augmented Generation (RAG) systems. To address the challenges of hyper-parameter optimization and online adaptation in RAG, we propose the AutoRAG-HP f…

Cited by 2SourcePDFScholar
2024

Balance Reward and Safety Optimization for Safe Reinforcement Learning: A Perspective of Gradient Manipulation

AAAI 2024technical

Ensuring the safety of Reinforcement Learning (RL) is crucial for its deployment in real-world applications. Nevertheless, managing the trade-off between reward and safety during exploration presents a significant challenge. Improving reward performance through policy adjustments may adversely affec…

2024

Call Me When Necessary: LLMs can Efficiently and Faithfully Reason over Structured Environments

ACL 2024findings

Large Language Models (LLMs) have shown potential in reasoning over structured environments, e.g., knowledge graphs and tables. Such tasks typically require multi-hop reasoning, i.e., match natural language utterance with instances in the environment. Previous works adopt LLMs to incrementally build…

2024

EfficientRAG: Efficient Retriever for Multi-Hop Question Answering

EMNLP 2024main

Retrieval-augmented generation (RAG) methods encounter difficulties when addressing complex questions like multi-hop queries.While iterative retrieval methods improve performance by gathering additional information, current approaches often rely on multiple calls of large language models (LLMs).In t…

2024

Everything of Thoughts: Defying the Law of Penrose Triangle for Thought Generation

ACL 2024findings

This paper introduce a novel thought prompting approach called ”Everything of Thoughts” (XoT) for Large Language Models (LLMs) to defy the law of ”Penrose triangle” of existing thought paradigms, to achieve three key perspectives in thought generation simultaneously: performance, efficiency, and fle…

2024

LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compression

ACL 2024findings

This paper focuses on task-agnostic prompt compression for better generalizability and efficiency. Considering the redundancy in natural language, existing approaches compress prompts by removing tokens or lexical units according to their information entropy obtained from a causal language model suc…

2024

SELF-GUARD: Empower the LLM to Safeguard Itself

NAACL 2024long

With the increasing risk posed by jailbreak attacks, recent studies have investigated various methods to improve the safety of large language models (LLMs), mainly falling into two strategies: safety training and safeguards. Safety training involves fine-tuning the LLM with adversarial samples, whic…

2024

SMuCo: Reinforcement Learning for Visual Control via Sequential Multi-view Total Correlation

UAI 2024poster

The advent of abundant image data has catalyzed the advancement of visual control in reinforcement learning (RL) systems, leveraging multiple view- points to capture the same physical states, which could enhance control performance theoretically. However, integrating multi-view data into representat…

Cited by 0SourcePDFScholar
2024

WizardArena: Post-training Large Language Models via Simulated Offline Chatbot Arena

NeurIPS 2024poster

Recent work demonstrates that, post-training large language models with open-domain instruction following data have achieved colossal success. Simultaneously, human Chatbot Arena has emerged as one of the most reasonable benchmarks for model evaluation and developmental guidance. However, the proces…

Cited by 0SourcePDFScholar
2024

WizardCoder: Empowering Code Large Language Models with Evol-Instruct

ICLR 2024poster

Code Large Language Models (Code LLMs), such as StarCoder, have demonstrated remarkable performance in various code-related tasks. However, different from their counterparts in the general language modeling field, the technique of instruction fine-tuning remains relatively under-researched in this d…

2024

WizardLM: Empowering Large Pre-Trained Language Models to Follow Complex Instructions

ICLR 2024poster

Training large language models (LLMs) with open-domain instruction following data brings colossal success. However, manually creating such instruction data is very time-consuming and labor-intensive. Moreover, humans may struggle to produce high-complexity instructions. In this paper, we show an ave…

Cited by 175SourcePDFScholar
2023

Conservative State Value Estimation for Offline Reinforcement Learning

NeurIPS 2023poster

Offline reinforcement learning faces a significant challenge of value over-estimation due to the distributional drift between the dataset and the current learned policy, leading to learning failure in practice. The common approach is to incorporate a penalty term to reward or value estimation in the…

2023

LexLIP: Lexicon-Bottlenecked Language-Image Pre-Training for Large-Scale Image-Text Sparse Retrieval

ICCV 2023poster

Image-text retrieval (ITR) aims to retrieve images or texts that match a query originating from the other modality. The conventional dense retrieval paradigm relies on encoding images and texts into dense representations with dual-stream encoders. However, this approach is limited by slow retrieval…

Cited by 20PDFcodeScholar
2023

MMDialog: A Large-scale Multi-turn Dialogue Dataset Towards Multi-modal Open-domain Conversation

ACL 2023long

Responding with multi-modal content has been recognized as an essential capability for an intelligent conversational agent. In this paper, we introduce the MMDialog dataset to facilitate multi-modal conversation better. MMDialog is composed of a curated set of 1.08 million real-world dialogues with…

2023

PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem

IJCAI 2023poster

The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers design various algorithms for solving SIP. In this work, we propose three main heuristics and develop an improved exact algorith…

2023

Towards Lightweight, Model-Agnostic and Diversity-Aware Active Anomaly Detection

ICLR 2023poster

Active Anomaly Discovery (AAD) is flourishing in the anomaly detection research area, which aims to incorporate analysts’ feedback into unsupervised anomaly detectors. However, existing AAD approaches usually prioritize the samples with the highest anomaly scores for user labeling, which hinders the…

Cited by 1SourcePDFScholar
2022

Automatic Loss Function Search for Predict-Then-Optimize Problems with Strong Ranking Property

ICLR 2022poster

Combinatorial optimization problems with parameters to be predicted from side information are commonly seen in a variety of problems during the paradigm shift from reactive decision making to proactive decision making. Due to the misalignment between the continuous prediction results and the discret…

Cited by 2SourcePDFScholar
2022

T-SMOTE: Temporal-oriented Synthetic Minority Oversampling Technique for Imbalanced Time Series Classification

IJCAI 2022poster

Time series classification is a popular and important topic in machine learning, and it suffers from the class imbalance problem in many real-world applications. In this paper, to address the class imbalance problem, we propose a novel and practical oversampling method named T-SMOTE, which can make…

Cited by 26SourcePDFScholar
2021

A Runtime Analysis of Typical Decomposition Approaches in MOEA/D Framework for Many-objective Optimization Problems

IJCAI 2021poster

Decomposition approach is an important component in multi-objective evolutionary algorithm based on decomposition (MOEA/D), which is a popular method for handing many-objective optimization problems (MaOPs). This paper presents a theoretical analysis on the convergence ability of using the typical w…

Cited by 23SourcePDFScholar
2021

A Surrogate Objective Framework for Prediction+Programming with Soft Constraints

NeurIPS 2021poster

Prediction+optimization is a common real-world paradigm where we have to predict problem parameters before solving the optimization problem. However, the criteria by which the prediction model is trained are often inconsistent with the goal of the downstream optimization problem. Recently, decision…

Cited by 7SourcePDFScholar
2021

Correlation-Aware Heuristic Search for Intelligent Virtual Machine Provisioning in Cloud Systems

AAAI 2021technical

The optimization of resource is crucial for the operation of public cloud systems such as Microsoft Azure, as well as servers dedicated to the workloads of large customers such as Microsoft 365. Those optimization tasks often need to take unknown parameters into consideration and can be formulated a…

2021

NuQClq: An Effective Local Search Algorithm for Maximum Quasi-Clique Problem

AAAI 2021technical

The maximum quasi-clique problem (MQCP) is an important extension of maximum clique problem with wide applications. Recent heuristic MQCP algorithms can hardly solve large and hard graphs effectively. This paper develops an efficient local search algorithm named NuQClq for the MQCP, which has two ma…

2021

PULNS: Positive-Unlabeled Learning with Effective Negative Sample Selector

AAAI 2021technical

Positive-unlabeled learning (PU learning) is an important case of binary classification where the training data only contains positive and unlabeled samples. The current state-of-the-art approach for PU learning is the cost-sensitive approach, which casts PU learning as a cost-sensitive classificati…

2021

Predictive Job Scheduling under Uncertain Constraints in Cloud Computing

IJCAI 2021poster

Capacity management has always been a great challenge for cloud platforms due to massive, heterogeneous on-demand instances running at different times. To better plan the capacity for the whole platform, a class of cloud computing instances have been released to collect computing demands beforehand.…

Cited by 7SourcePDFScholar
2020

Intelligent Virtual Machine Provisioning in Cloud Computing

IJCAI 2020poster

Virtual machine (VM) provisioning is a common and critical problem in cloud computing. In industrial cloud platforms, there are a huge number of VMs provisioned per day. Due to the complexity and resource constraints, it needs to be carefully optimized to make cloud platforms effectively utilize the…

2020

Two-goal Local Search and Inference Rules for Minimum Dominating Set

IJCAI 2020poster

Minimum dominating set (MinDS) is a canonical NP-hard combinatorial optimization problem with applications. For large and hard instances one must resort to heuristic approaches to obtain good solutions within reasonable time. This paper develops an efficient local search algorithm for MinDS, which…

Cited by 0SourcePDFScholar