← Search

Guoyin Wang

41 accepted papers

2026

Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) has emerged as a central paradigm for scaling LLM reasoning, yet its optimization often suffers from training instability and suboptimal convergence. Through a systematic dissection of the GRPO-based objective, we reveal that the rigid clipping d…

Cited by 0SourceScholar
2026

Experience Augmented Policy Optimization for LLM Reasoning

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) is a powerful paradigm for improving the reasoning capabilities of large language models (LLMs). However, existing RLVR methods typically rely on on-policy optimization from scratch, resulting in high sampling costs and inefficient utilization of…

Cited by 0SourceScholar
2026

On the Direction of RLVR Updates for LLM Reasoning: Identification and Exploitation

ICLR 2026poster

Reinforcement learning with verifiable rewards (RLVR) has substantially improved the reasoning capabilities of large language models. While existing analyses identify that RLVR-induced changes are sparse, they primarily focus on the **magnitude** of these updates, largely overlooking their **direct…

Cited by 0SourcecodeScholar
2026

On-Policy RL Meets Off-Policy Experts: Harmonizing Supervised Fine-Tuning and Reinforcement Learning via Dynamic Weighting

ICLR 2026poster

Supervised Fine-Tuning (SFT) and Reinforcement Learning (RL) are two prominent post-training paradigms for refining the capabilities and aligning the behavior of Large Language Models (LLMs). Existing approaches that integrate SFT and RL often face the risk of disrupting established response pattern…

Cited by 0SourcecodeScholar
2026

One-Way Policy Optimization for Self-Evolving LLMs

ICML 2026poster

Reinforcement Learning with Verifiable Rewards (RLVR) has become a promising paradigm for scaling reasoning capabilities of Large Language Models (LLMs). However, the sparsity of binary verifier rewards often leads to low efficiency and optimization instability. To stabilize training, existing metho…

Cited by 0SourceScholar
2026

Sparse but Critical: A Token-Level Analysis of Distributional Shifts in RLVR Fine-Tuning of LLMs

ICLR 2026poster

Reinforcement learning with verifiable rewards (RLVR) has significantly improved reasoning in large language models (LLMs), yet the token-level mechanisms through which they reshape model behavior remain unclear. We present a systematic empirical study of RLVR’s distributional effects across three c…

Cited by 0SourceScholar
2025

ATLANTIS: Weak-to-Strong Learning via Importance Sampling

ACL 2025long

Supervised fine-tuning (SFT) enables large language models to align with training data for better performance in many aspects. Nevertheless, the gap between the distribution of current datasets from human annotations or model generations and the real-world data distribution heavily limits the capaci…

2025

From Sparse to Complete: Semantic Understanding Based on Stroke Evolution in On-the-fly Sketch-based Image Retrieval

IJCAI 2025

In contrast with human sketching, which pre-conceptualizes outlines and features, conventional sketch retrieval models rely primarily rely on pixel-level processing and feature extraction, limiting their ability to capture early sketch intent. Consequently, these models are susceptible to subjective

Cited by 0SourcePDFScholar
2025

Fusion of Granular-Ball Visual Spatial Representations for Enhanced Facial Expression Recognition

IJCAI 2025

Facial Expression Recognition (FER) is a fundamental problem in computer vision. Despite recent advances, significant challenges remain. Current methods primarily focus on extracting visual representations while overlooking other valuable information. To address this limitation, we propose a novel m

2025

GBGC: Efficient and Adaptive Graph Coarsening via Granular-ball Computing

IJCAI 2025

The objective of graph coarsening is to generate smaller, more manageable graphs while preserving key information of the original graph. Previous work were mainly based on the perspective of spectrum-preserving, using some predefined coarsening rules to make the eigenvalues of the Laplacian matrix o

2025

GPT-NER: Named Entity Recognition via Large Language Models

NAACL 2025findings

Despite the fact that large-scale Language Models (LLM) have achieved SOTA performances on a variety of NLP tasks, its performance on NER is still significantly below supervised baselines. This is due to the gap between the two tasks the NER and LLMs: the former is a sequence labeling task in nature…

2025

Graph Coarsening via Supervised Granular-Ball for Scalable Graph Neural Network Training

AAAI 2025technical

Graph Neural Networks (GNNs) have demonstrated significant achievements in processing graph data, yet scalability remains a substantial challenge. To address this, numerous graph coarsening methods have been developed. However, most existing coarsening methods are training-dependent, leading to lowe…

2025

Multi-Granularity Open Intent Classification via Adaptive Granular-Ball Decision Boundary

AAAI 2025technical

Open intent classification is critical for the development of dialogue systems, aiming to accurately classify known intents into their corresponding classes while identifying unknown intents. Prior boundary-based methods assumed known intents fit within compact spherical regions, focusing on coarse-…

2025

OS Agents: A Survey on MLLM-based Agents for Computer, Phone and Browser Use

ACL 2025long

The dream to create AI assistants as capable and versatile as the fictional J.A.R.V.I.S from Iron Man has long captivated imaginations. With the evolution of multi-modal large language models ((M)LLMs), this dream is closer to reality, as (M)LLM-based Agents using computers, mobile phones and web br…

2025

Packing Analysis: Packing Is More Appropriate for Large Models or Datasets in Supervised Fine-tuning

ACL 2025finding

Packing, initially utilized in the pre-training phase, is an optimization technique designed to maximize hardware resource efficiency by combining different training sequences to fit the model’s maximum input length. Although it has demonstrated effectiveness during pre-training, there remains a lac…

2025

SuperGPQA: Scaling LLM Evaluation across 285 Graduate Disciplines

NeurIPS 2025poster

Large language models (LLMs) have demonstrated remarkable proficiency in mainstream academic disciplines such as mathematics, physics, and computer science. However, human knowledge encompasses over 200 specialized disciplines, far exceeding the scope of existing benchmarks. The capabilities of LLMs…

Cited by 215SourceScholar
2025

The Good, The Bad, and The Greedy: Evaluation of LLMs Should Not Ignore Non-Determinism

NAACL 2025long

Current evaluations of large language models (LLMs) often overlook non-determinism, typically focusing on a single output per example. This limits our understanding of LLM performance variability in real-world applications. Our study addresses this issue by exploring key questions about the performa…

2025

Well Begun is Half Done: Low-resource Preference Alignment by Weak-to-Strong Decoding

ACL 2025finding

Large Language Models (LLMs) require alignment with human preferences to avoid generating offensive, false, or meaningless content. Recently, low-resource methods for LLM alignment have been popular, while still facing challenges in obtaining both high-quality and aligned content. Motivated by the o…

2024

An Expert is Worth One Token: Synergizing Multiple Expert LLMs as Generalist via Expert Token Routing

ACL 2024long

We present Expert-Token-Routing, a unified generalist framework that facilitates seamless integration of multiple expert LLMs. Our framework represents expert LLMs as special expert tokens within the vocabulary of a meta LLM. The meta LLM can route to an expert LLM like generating new tokens. Expert…

2024

InfiAgent-DABench: Evaluating Agents on Data Analysis Tasks

ICML 2024poster

In this paper, we introduce InfiAgent-DABench, the first benchmark specifically designed to evaluate LLM-based agents on data analysis tasks. Agents need to solve these tasks end-to-end by interacting with an execution environment. This benchmark contains DAEval, a dataset consisting of 603 data ana…

2024

Language Models as Semantic Indexers

ICML 2024poster

Semantic identifier (ID) is an important concept in information retrieval that aims to preserve the semantics of objects such as documents and items inside their IDs. Previous studies typically adopt a two-stage pipeline to learn semantic IDs by first procuring embeddings using off-the-shelf text en…

2024

LoraRetriever: Input-Aware LoRA Retrieval and Composition for Mixed Tasks in the Wild

ACL 2024findings

Low-Rank Adaptation (LoRA) provides an effective yet efficient solution for fine-tuning large language models (LLMs). The modular and plug-and-play nature of LoRA enables the integration of diverse domain-specific LoRAs to enhance the capabilities of LLMs. Previous research on exploiting multiple Lo…

2024

Towards Building The Federatedgpt: Federated Instruction Tuning

ICASSP 2024accepted

While "instruction-tuned" generative large language models (LLMs) have demonstrated an impressive ability to generalize to new tasks, the training phases heavily rely on large amounts of diverse and high-quality instruction data (such as ChatGPT and GPT-4). Unfortunately, acquiring high-quality data…

Cited by 0SourceScholar
2023

GNN-SL: Sequence Labeling Based on Nearest Examples via GNN

ACL 2023findings

To better handle long-tail cases in the sequence labeling (SL) task, in this work, we introduce graph neural networks sequence labeling (GNN-SL), which augments the vanilla SL model output with similar tagging examples retrieved from the whole training set. Since not all the retrieved tagging exampl…

2023

OssCSE: Overcoming Surface Structure Bias in Contrastive Learning for Unsupervised Sentence Embedding

EMNLP 2023long main

Contrastive learning has been demonstrated effective in unsupervised sentence representation learning. Given one sentence, positive pairs are obtained by passing the sentence to the encoder twice using the different dropout masks, and negative pairs are obtained by taking another sentence in the sam…

Cited by 0SourceScholar
2023

Ranking-Enhanced Unsupervised Sentence Representation Learning

ACL 2023long

Unsupervised sentence representation learning has progressed through contrastive learning and data augmentation methods such as dropout masking. Despite this progress, sentence encoders are still limited to using only an input sentence when predicting its semantic vector. In this work, we show that…

2023

ReAugKD: Retrieval-Augmented Knowledge Distillation For Pre-trained Language Models

ACL 2023short

Knowledge Distillation (KD) is one of the most effective approaches to deploying large-scale pre-trained language models in low-latency environments by transferring the knowledge contained in the large-scale models to smaller student models. Prior KD approaches use the soft labels and intermediate a…

Cited by 23SourcePDFScholar
2023

Sketch Less Face Image Retrieval: A New Challenge

ICASSP 2023accepted

In some specific scenarios, face sketch was used to identify a person. However, drawing a complete face sketch often needs skills and takes time, which hinder its widespread applicability in the practice. In this study, we proposed a new task named sketch less face image retrieval (SLFIR), in which…

Cited by 0SourceScholar
2023

Text Classification via Large Language Models

EMNLP 2023long findings

Despite the remarkable success of large-scale Language Models (LLMs) such as GPT-3, their performances still significantly underperform fine-tuned models in the task of text classification.This is due to (1) the lack of reasoning ability in addressing complex linguistic phenomena (e.g., intensif…

Cited by 0SourcecodeScholar
2022

An MRC Framework for Semantic Role Labeling

COLING 2022main

Semantic Role Labeling (SRL) aims at recognizing the predicate-argument structure of a sentence and can be decomposed into two subtasks: predicate disambiguation and argument labeling. Prior work deals with these two tasks independently, which ignores the semantic connection between the two tasks. I…

2022

Open World Classification with Adaptive Negative Samples

EMNLP 2022main

Open world classification is a task in natural language processing with key practical relevance and impact.Since the open or unknown category data only manifests in the inference phase, finding a model with a suitable decision boundary accommodating for the identification of known classes and discri…

Cited by 6SourcePDFScholar
2021

AugNLG: Few-shot Natural Language Generation using Self-trained Data Augmentation

ACL 2021long

Natural Language Generation (NLG) is a key component in a task-oriented dialogue system, which converts the structured meaning representation (MR) to the natural language. For large-scale conversational systems, where it is common to have over hundreds of intents and thousands of slots, neither temp…

2019

Adversarial Learning of a Sampler Based on an Unnormalized Distribution

AISTATS 2019poster

Fundamental aspects of adversarial learning are investigated, with learning based on samples from the target distribution (conventional GAN setup). With insights so garnered, adversarial learning is extended to the case for which one has access to an unnormalized form $u(x)$ of the target density fu…

2019

Improving Textual Network Learning with Variational Homophilic Embeddings

NeurIPS 2019poster

The performance of many network learning applications crucially hinges on the success of network embedding algorithms, which aim to encode rich network information into low-dimensional vertex-based vector representations. This paper considers a novel variational formulation of network embeddings, wi…

2019

Kernel-Based Approaches for Sequence Modeling: Connections to Neural Methods

NeurIPS 2019poster

We investigate time-dependent data analysis from the perspective of recurrent kernel machines, from which models with hidden units and gated memory cells arise naturally. By considering dynamic gating of the memory cell, a model closely related to the long short-term memory (LSTM) recurrent neural n…

2018

Adversarial Text Generation via Feature-Mover's Distance

NeurIPS 2018poster

Generative adversarial networks (GANs) have achieved significant success in generating real-valued data. However, the discrete nature of text hinders the application of GAN to text-generation tasks. Instead of using the standard GAN objective, we propose to improve text-generation GAN via a novel ap…

2018

JointGAN: Multi-Domain Joint Distribution Learning with Generative Adversarial Nets

ICML 2018oral

A new generative adversarial network is developed for joint distribution matching.Distinct from most existing approaches, that only learn conditional distributions, the proposed model aims to learn a joint distribution of multiple random variables (domains). This is achieved by learning to sample fr…

2017

Deconvolutional Paragraph Representation Learning

NeurIPS 2017poster

Learning latent representations from long text sequences is an important first step in many natural language processing applications. Recurrent Neural Networks (RNNs) have become a cornerstone for this challenging task. However, the quality of sentences during RNN-based decoding (reconstruction) dec…

Cited by 120SourcePDFScholar