← Search

Yuxin Zhang

44 accepted papers

2026

ARMOR: Adaptive Curriculum Meta-Learning for Noise-Robust RAG Reasoning

IJCAI 2026

Retrieval-Augmented Generation (RAG) systems have demonstrated remarkable effectiveness in mitigating hallucinations by incorporating external knowledge. However, the retrieval process inevitably introduces noise, posing significant challenges to RAG robustness. Fundamentally, noise robustness is a

Cited by 0Scholar
2026

CP-Agent: Context‑Aware Multimodal Reasoning for Cellular Morphological Profiling under Chemical Perturbations

ICLR 2026poster

Cell Painting combines multiplexed fluorescent staining, high‑content imaging, and quantitative analysis to generate high-dimensional phenotypic readouts to support diverse downstream tasks such as mechanism-of-action (MoA) inference, toxicity prediction, and construction of drug–disease atlases. Ho…

Cited by 0SourceScholar
2026

DeepAnalyze: Agentic Large Language Models for Autonomous Data Science

ICML 2026poster

Autonomous data science on the structured data has been a long-standing challenge, and is now becoming feasible with the emergence of powerful large language models (LLMs). Recent workflowbased data agents have shown promising results on specific data tasks but remain fundamentally limited in achiev…

Cited by 0SourceScholar
2026

Dynamic Multi-Path Retrieval for Knowledge-based Visual Question Answering

IJCAI 2026

Knowledge-based Visual Question Answering (KB-VQA) requires models to answer visual questions by reasoning over external knowledge beyond the given image. Existing approaches suffer from two main limitations. First, candidate knowledge is often retrieved in a single modality, either textual or visua

Cited by 0Scholar
2026

Forget What Has Seen: Selective Concept Unlearning in Segmentation Foundation Models

AAAI 2026technical

Machine unlearning (MU) has emerged as a critical tool for removing sensitive or personal information from machine learning models, empowering individuals with the right to be forgotten. While MU has achieved success in classification and generative tasks, whether this technique can be effectively a

Cited by 0SourcePDFScholar
2026

KTV: Keyframes and Key Tokens Selection for Efficient Training-Free Video LLMs

AAAI 2026technical

Training-free video understanding methods leverage the strong image comprehension capabilities of pre-trained vision language models (VLMs) by treating videos as a sequences of static frames, thus obviating the need for costly video-specific training. However, this paradigm often suffers from severe

Cited by 0SourcePDFScholar
2026

M4PQA: A Comprehensive QA Dataset for AI Research with Instance-Level Evaluation

ICLR 2026poster

The growing volume of academic papers has made it increasingly difficult for researchers to efficiently extract key information. While large language models (LLMs) based agents are capable of automating question answering (QA) workflows for scientific papers, there still lacks a comprehensive and re…

Cited by 0SourceScholar
2026

Out of the Memory Barrier: A Highly Memory-Efficient Training System for LLMs with Million-Token Contexts

ICLR 2026poster

Training Large Language Models (LLMs) on long contexts is severely constrained by prohibitive GPU memory overhead, not training time. The primary culprits are the activations, whose memory footprints scale linearly with sequence length. We introduce OOMB, a highly memory-efficient training system th…

Cited by 0SourcecodeScholar
2026

Prototype-Based Test-Time Adaptation of Vision-Language Models

ICML 2026poster

Test-time adaptation (TTA) has emerged as a promising paradigm for vision–language models (VLMs) to bridge the distribution gap between pre-training and test data. Recent works have focused on backpropagation-free TTA methods that rely on cache-based designs, but these introduce two key limitations.…

Cited by 0SourceScholar
2026

SongEcho: Towards Cover Song Generation via Instance-Adaptive Element-wise Linear Modulation

ICLR 2026poster

Cover songs constitute a vital aspect of musical culture, preserving the core melody of an original composition while reinterpreting it to infuse novel emotional depth and thematic emphasis. Although prior research has explored the reinterpretation of instrumental music through melody-conditioned te…

Cited by 0SourcecodeScholar
2026

TAG-MoE: Task-Aware Gating for Unified Generative Mixture-of-Experts

CVPR 2026

Unified image generation and editing models suffer from severe task interference in dense diffusion transformers architectures, where a shared parameter space must compromise between conflicting objectives (e.g., local editing v.s. subject-driven generation). While the sparse Mixture-of-Experts (MoE

Cited by 0SourcecodeScholar
2025

BAME: Block-Aware Mask Evolution for Efficient N:M Sparse Training

ICML 2025poster

N:M sparsity stands as a progressively important tool for DNN compression, achieving practical speedups by stipulating at most N non-zero components within M sequential weights. Unfortunately, most existing works identify the N:M sparse mask through dense backward propagation to update all weights,…

2025

Determining Layer-wise Sparsity for Large Language Models Through a Theoretical Perspective

ICML 2025spotlight

In this paper, we address the challenge of determining the layer-wise sparsity rates of large language models (LLMs) through a theoretical perspective. Specifically, we identify a critical issue of **"reconstruction error explosion"** in existing LLMs sparsification methods. This refers to the cumul…

2025

Discovering Important Experts for Mixture-of-Experts Models Pruning Through a Theoretical Perspective

NeurIPS 2025poster

Mixture-of-Experts (MoE) architectures enable efficient scaling of large language models but face prohibitive memory demands due to massive parameterization. Existing pruning methods rely on heuristic metrics or impractical enumeration of expert subsets, leading to suboptimal performance or scalabil…

Cited by 0SourceScholar
2025

Dynamic Low-Rank Sparse Adaptation for Large Language Models

ICLR 2025poster

Despite the efficacy of network sparsity in alleviating the deployment strain of Large Language Models (LLMs), it endures significant performance degradation. Applying Low-Rank Adaptation (LoRA) to fine-tune the sparse LLMs offers an intuitive approach to counter this predicament, while it holds sho…

2025

Feast Your Eyes: Mixture-of-Resolution Adaptation for Multimodal Large Language Models

ICLR 2025poster

In existing multimodal large language models (MLLMs), image resolution plays a significant role for granular visual recognition. However, directly increasing image resolution leads to expensive computational cost for MLLMs. In this paper, we reveal that a combination of low- and high-resolution…

2025

GS-Bias: Global-Spatial Bias Learner for Single-Image Test-Time Adaptation of Vision-Language Models

ICML 2025poster

Recent advances in test-time adaptation (TTA) for Vision-Language Models (VLMs) have garnered increasing attention, particularly through the use of multiple augmented views of a single image to boost zero-shot generalization. Unfortunately, existing methods fail to strike a satisfactory balance betw…

Cited by 0SourcePDFScholar
2025

LCFed: An Efficient Clustered Federated Learning Framework for Heterogeneous Data

ICASSP 2025accepted

Clustered federated learning (CFL) addresses the performance challenges posed by data heterogeneity in federated learning (FL) by organizing edge devices with similar data distributions into clusters, enabling collaborative model training tailored to each group. However, existing CFL approaches stri…

Cited by 0SourceScholar
2025

MoHGNN: Enhanced Heterogeneous Graph Neural Network via Metapath Optimization

ICASSP 2025accepted

In this paper, we propose a novel heterogeneous graph neural networks (HGNNs) model that addresses two major limitations of existing metapath-based methods: (1) Defining suitable metapaths requires professional knowledge in the special domain. (2) The neighbor nodes of the target node also play cruc…

Cited by 0SourceScholar
2025

NeuSym-RAG: Hybrid Neural Symbolic Retrieval with Multiview Structuring for PDF Question Answering

ACL 2025long

The increasing number of academic papers poses significant challenges for researchers to efficiently acquire key details. While retrieval augmented generation (RAG) shows great promise in large language model (LLM) based automated question answering, previous works often isolate neural and symbolic…

2025

Parameter-Aware Contrastive Knowledge Editing: Tracing and Rectifying based on Critical Transmission Paths

ACL 2025long

Large language models (LLMs) have encoded vast amounts of knowledge in their parameters, but the acquired knowledge can sometimes be incorrect or outdated over time, necessitating rectification after pre-training. Traditional localized methods in knowledge-based model editing (KME) typically assume…

2025

Semantic Alignment and Reinforcement for Data-Free Quantization of Vision Transformers

ICCV 2025poster

Data-free quantization (DFQ) enables model quantization without accessing real data, addressing concerns regarding data security and privacy. With the growing adoption of Vision Transformers (ViTs), DFQ for ViTs has garnered significant attention. However, existing DFQ methods exhibit two limitation…

2025

Spotlight Attention: Towards Efficient LLM Generation via Non-linear Hashing-based KV Cache Retrieval

NeurIPS 2025poster

Reducing the key-value (KV) cache burden in Large Language Models (LLMs) significantly accelerates inference. Dynamically selecting critical KV caches during decoding helps maintain performance. Existing methods use random linear hashing to identify important tokens, but this approach is inefficient…

Cited by 0SourceScholar
2025

TEF: Causality-Aware Taxonomy Expansion via Front-Door Criterion

COLING 2025main

Taxonomy expansion is a primary method for enriching taxonomies, involving appending a large number of additional nodes (i.e., queries) to an existing taxonomy (i.e., seed), with the crucial step being the identification of the appropriate anchor (parent node) for each query by incorporating the str…

Cited by 0SourcePDFScholar
2025

TextRefiner: Internal Visual Feature as Efficient Refiner for Vision-Language Models Prompt Tuning

AAAI 2025technical

Despite the efficiency of prompt learning in transferring vision-language models (VLMs) to downstream tasks, existing methods mainly learn the prompts in a coarse-grained manner where the learned prompt vectors are shared across all categories. Consequently, the tailored prompts often fail to discer…

2025

Training Long-Context LLMs Efficiently via Chunk-wise Optimization

ACL 2025finding

While long-context large language models (LLMs) exhibit remarkable document processing capabilities, their prohibitively high training costs often hinder customized applications. To mitigate this issue, we propose __Sequential Chunk-wise Optimization (SeCO)__, a memory-efficient training paradigm th…

2024

APL: Anchor-based Prompt Learning for One-stage Weakly Supervised Referring Expression Comprehension

ECCV 2024poster

"Referring Expression Comprehension (REC) aims to ground the target object based on a given referring expression, which requires expensive instance-level annotations for training. To address this issue, recent advances explore an efficient one-stage weakly supervised REC model called RefCLIP. Partic…

2024

CaM: Cache Merging for Memory-efficient LLMs Inference

ICML 2024poster

Despite the exceptional performance of Large Language Models (LLMs), the substantial volume of key-value (KV) pairs cached during inference presents a barrier to their efficient deployment. To ameliorate this, recent works have aimed to selectively eliminate these caches, informed by the attention s…

2024

DiffAgent: Fast and Accurate Text-to-Image API Selection with Large Language Model

CVPR 2024poster

Text-to-image (T2I) generative models have attracted significant attention and found extensive applications within and beyond academic research. For example the Civitai community a platform for T2I innovation currently hosts an impressive array of 74492 distinct models. However this diversity presen…

2024

Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs

ICLR 2024poster

The ever-increasing large language models (LLMs), though opening a potential path for the upcoming artificial general intelligence, sadly drops a daunting obstacle on the way towards their on-device deployment. As one of the most well-established pre-LLMs approaches in reducing model complexity, net…

2024

ERQ: Error Reduction for Post-Training Quantization of Vision Transformers

ICML 2024spotlight

Post-training quantization (PTQ) for vision transformers (ViTs) has garnered significant attention due to its efficiency in compressing models. However, existing methods typically overlook the intricate interdependence between quantized weight and activation, leading to considerable quantization err…

Cited by 11SourcePDFScholar
2024

Learning Image Demoiréing from Unpaired Real Data

AAAI 2024technical

This paper focuses on addressing the issue of image demoiréing. Unlike the large volume of existing studies that rely on learning from paired real data, we attempt to learn a demoiréing model from unpaired real data, i.e., moiré images associated with irrelevant clean images. The proposed method, re…

2024

Music Style Transfer with Time-Varying Inversion of Diffusion Models

AAAI 2024technical

With the development of diffusion models, text-guided image style transfer has demonstrated great controllable and high-quality results. However, the utilization of text for diverse music style transfer poses significant challenges, primarily due to the limited availability of matched audio-text dat…

2023

Bi-directional Masks for Efficient N:M Sparse Training

ICML 2023poster

We focus on addressing the dense backward propagation issue for training efficiency of N:M fine-grained sparsity that preserves at most N out of M consecutive weights and achieves practical speedups supported by the N:M sparse tensor core. Therefore, we present a novel method of Bi-directional Masks…

2023

Inversion-Based Style Transfer With Diffusion Models

CVPR 2023poster

The artistic style within a painting is the means of expression, which includes not only the painting material, colors, and brushstrokes, but also the high-level attributes, including semantic elements and object shapes. Previous arbitrary example-guided artistic image generation methods often fail…

2023

Real-Time Image Demoir$\acute{e}$ing on Mobile Devices

ICLR 2023poster

Moir$\acute{e}$ patterns appear frequently when taking photos of digital screens, drastically degrading the image quality. Despite the advance of CNNs in image demoir$\acute{e}$ing, existing networks are with heavy design, causing massive computation burden for mobile devices. In this paper, we laun…

2023

SMMix: Self-Motivated Image Mixing for Vision Transformers

ICCV 2023poster

CutMix is a vital augmentation strategy that determines the performance and generalization ability of vision transformers (ViTs). However, the inconsistency between the mixed images and the corresponding labels harms its efficacy. Existing CutMix variants tackle this problem by generating more consi…

Cited by 15PDFcodeScholar
2022

A Multi-Modal Knowledge Graph for Classical Chinese Poetry

EMNLP 2022finding

Classical Chinese poetry has a long history and is a precious cultural heritage of humankind. Displaying the classical Chinese poetry in a visual way, helps to cross cultural barriers in different countries, making it enjoyable for all the people. In this paper, we construct a multi-modal knowledge…

2022

Learning Best Combination for Efficient N:M Sparsity

NeurIPS 2022accept

By forcing N out of M consecutive weights to be non-zero, the recent N:M fine-grained network sparsity has received increasing attention with its two attractive advantages over traditional irregular network sparsity methods: 1) Promising performance at a high sparsity. 2) Significant speedups when p…

2020

Channel Pruning via Automatic Structure Search

IJCAI 2020poster

Channel pruning is among the predominant approaches to compress deep neural networks. To this end, most existing pruning methods focus on selecting channels (filters) by importance/optimization or regularization based on rule-of-thumb designs, which defects in sub-optimal pruning. In this paper, we…