← Search

Changshui Zhang

57 accepted papers

2026

Attend to the Active: Structure-Aware Dynamic Attention in LLMs for Compositional Instruction Following

ICLR 2026poster

Large language models (LLMs) have exhibited strong instruction-following capabilities; however, they often struggle with compositional instructions involving multiple interleaved yet logically independent sub-tasks. These sub-tasks are typically organized in mutually exclusive structures, such as br…

Cited by 0SourceScholar
2026

Beyond Tokens: Dynamic Latent Reasoning via Semantic Residual Refinement

AAAI 2026technical

Chain-of-Thought prompting has remarkably advanced LLM reasoning by generating explicit step-by-step tokens, yet its discrete nature inherently limits expressiveness and efficiency, struggling with abstract, ambiguous, or semantically divergent cognition beyond linguistic tokens. Latent reasoning of

Cited by 0SourcePDFScholar
2026

Deliberate Evolution for Sample-Efficient Symbolic Regression with LLM

ICML 2026poster

Symbolic regression (SR) stands as a cornerstone of scientific discovery, deriving mathematical expressions from observing data. Recent advances incorporate large language models (LLMs) into evolutionary optimization, typically relying on iterative refinement driven by scalar feedback (e.g., mean sq…

Cited by 0SourceScholar
2026

Gold Points Sniper: Self-Guided Visual Reasoning in VLM for Fine-Grained Action Understanding

ICRA 2026poster

Robots operating in everyday environments must understand fine-grained human actions, intentions, and contextual cues from broad views where people occupy only small regions, a capability unmet by current systems. While open-vocabulary action recognition methods remain limited to assigning predefine…

2026

Kronos: A Foundation Model for the Language of Financial Markets

AAAI 2026technical

The success of large-scale pre-training paradigm, exemplified by Large Language Models (LLMs), has inspired the development of Time Series Foundation Models (TSFMs). However, their application to financial candlestick (K-line) data remains limited, often underperforming non-pre-trained architectures

Cited by 0SourcePDFScholar
2026

Learning Push-Grasp Synergy for Occluded Objects in Cluttered Environments

ICRA 2026poster

Successfully executing grasping tasks within highly cluttered spaces is still a significant hurdle in robotics, especially in scenarios involving severe target occlusion. To tackle this, we present a novel self-supervised framework driven by deep reinforcement learning that enables robots to acquire…

Cited by 0Scholar
2025

Adaptive Localization of Knowledge Negation for Continual LLM Unlearning

ICML 2025poster

With the growing deployment of large language models (LLMs) across diverse domains, concerns regarding their safety have grown substantially. LLM unlearning has emerged as a pivotal approach to removing harmful or unlawful contents while maintaining utility. Despite increasing interest, the challeng…

Cited by 0SourcePDFScholar
2025

Assimilation and Accommodation: Task-Adaptive Hierarchical Abstraction for Solving Web Tasks

ACL 2025finding

Web tasks, which involve processing data from online resources, challenge agents to generalize beyond fixed knowledge to unseen task contexts. Learning from experience, the ability to derive reusable patterns from past tasks, is crucial for improving generalization. However, existing methods focus o…

2025

CALM: Consensus-Aware Localized Merging for Multi-Task Learning

ICML 2025poster

Model merging aims to integrate the strengths of multiple fine-tuned models into a unified model while preserving task-specific capabilities. Existing methods, represented by task arithmetic, are typically classified into global- and local-aware methods. However, global-aware methods inevitably cau…

2025

Learning without Isolation: Pathway Protection for Continual Learning

ICML 2025poster

Deep networks are prone to catastrophic forgetting during sequential task learning, i.e., losing the knowledge about old tasks upon learning new tasks. To this end, continual learning (CL) has emerged, whose existing methods focus mostly on regulating or protecting the parameters associated with the…

2025

Physics Reasoner: Knowledge-Augmented Reasoning for Solving Physics Problems with Large Language Models

COLING 2025main

Physics problems constitute a significant aspect of reasoning, necessitating complicated reasoning ability and abundant physics knowledge. However, existing large language models (LLMs) frequently fail due to a lack of knowledge or incorrect knowledge application. To mitigate these issues, we propos…

2024

A Closer Look at the Self-Verification Abilities of Large Language Models in Logical Reasoning

NAACL 2024long

Logical reasoning has been an ongoing pursuit in the field of AI. Despite significant advancements made by large language models (LLMs), they still struggle with complex logical reasoning problems. To enhance reasoning performance, one promising direction is scalable oversight, which requires LLMs t…

2024

Abstraction-of-Thought Makes Language Models Better Reasoners

EMNLP 2024finding

Abstract reasoning, the ability to reason from the abstract essence of a problem, serves as a key to generalization in human reasoning. However, eliciting language models to perform reasoning with abstraction remains unexplored. This paper seeks to bridge this gap by introducing a novel structured r…

2024

Accurate Forgetting for Heterogeneous Federated Continual Learning

ICLR 2024poster

Recent years have witnessed a burgeoning interest in federated learning (FL). However, the contexts in which clients engage in sequential learning remain under- explored. Bridging FL and continual learning (CL) gives rise to a challenging practical problem: federated continual learning (FCL). Existi…

2024

Balancing Similarity and Complementarity for Federated Learning

ICML 2024poster

In mobile and IoT systems, Federated Learning (FL) is increasingly important for effectively using data while maintaining user privacy. One key challenge in FL is managing statistical heterogeneity, such as non-i.i.d. data, arising from numerous clients and diverse data sources. This requires strate…

Cited by 6SourcePDFScholar
2024

CLAP: Collaborative Adaptation for Patchwork Learning

ICLR 2024spotlight

In this paper, we investigate a new practical learning scenario, where the data distributed in different sources/clients are typically generated with various modalities. Existing research on learning from multi-source data mostly assume that each client owns the data of all modalities, which may lar…

Cited by 1SourcePDFScholar
2024

CLOMO: Counterfactual Logical Modification with Large Language Models

ACL 2024long

In this study, we delve into the realm of counterfactual reasoning capabilities of large language models (LLMs). Our primary objective is to cultivate the counterfactual thought processes within LLMs and rigorously assess these processes for their validity. Specifically, we introduce a novel task, C…

2024

Learned ISTA with Error-Based Thresholding for Adaptive Sparse Coding

ICASSP 2024accepted

Drawing on theoretical insights, we advocate an error-based thresholding (EBT) mechanism for learned ISTA (LISTA), which utilizes a function of the layer-wise reconstruction error to suggest a specific threshold for each observation in the shrinkage function of each layer. We show that the proposed…

Cited by 0SourceScholar
2024

Neural Collapse Inspired Feature Alignment for Out-of-Distribution Generalization

NeurIPS 2024poster

The spurious correlation between the background features of the image and its label arises due to that the samples labeled with the same class in the training set often co-occurs with a specific background, which will cause the encoder to extract non-semantic features for classification, resulting i…

Cited by 1SourcePDFScholar
2024

Subjective Topic meets LLMs: Unleashing Comprehensive, Reflective and Creative Thinking through the Negation of Negation

EMNLP 2024main

Large language models (LLMs) exhibit powerful reasoning capacity, as evidenced by prior studies focusing on objective topics that with unique standard answers such as arithmetic and commonsense reasoning. However, the reasoning to definite answers emphasizes more on logical thinking, and falls short…

Cited by 1SourcePDFScholar
2023

Faithful Question Answering with Monte-Carlo Planning

ACL 2023long

Although large language models demonstrate remarkable question-answering performances, revealing the intermediate reasoning steps that the models faithfully follow remains challenging. In this paper, we propose FAME (FAithful question answering with MontE-carlo planning) to answer questions based on…

2023

Structured BFGS Method for Optimal Doubly Stochastic Matrix Approximation

AAAI 2023technical

Doubly stochastic matrix plays an essential role in several areas such as statistics and machine learning. In this paper we consider the optimal approximation of a square matrix in the set of doubly stochastic matrices. A structured BFGS method is proposed to solve the dual of the primal problem. Th…

2022

Data Agnostic Filter Gating For Efficient Deep Networks

ICASSP 2022accepted

Filter pruning is essential for deploying a well-trained CNN model on edge computation devices with a target computation budget (e.g., FLOPs). Current filter pruning methods mainly focus on leveraging feature maps to analyze the importance of filters, and prune those with less impact on the value of…

Cited by 0SourceScholar
2022

GreedyNASv2: Greedier Search With a Greedy Path Filter

CVPR 2022poster

Training a good supernet in one-shot NAS methods is difficult since the search space is usually considerably huge (e.g., 13^ 21 ). In order to enhance the supernet's evaluation ability, one greedy strategy is to sample good paths, and let the supernet lean towards the good ones and ease its evaluati…

Cited by 22PDFScholar
2022

Leveraging Sparse Coding for EEG Based Emotion Recognition in Shooting

ICASSP 2022accepted

Emotion recognition in shooting is of great importance for improving athletes’ training methods. However, there is no open and high confident electroencephalography (EEG) dataset about shooting due to the difficulty of data acquisition, which made it a challenge for related studies. In this paper, w…

Cited by 0SourceScholar
2022

METGEN: A Module-Based Entailment Tree Generation Framework for Answer Explanation

NAACL 2022findings

Knowing the reasoning chains from knowledge to the predicted answers can help construct an explainable question answering (QA) system. Advances on QA explanation propose to explain the answers with entailment trees composed of multiple entailment steps. While current work proposes to generate entail…

2022

MetaLogic: Logical Reasoning Explanations with Fine-Grained Structure

EMNLP 2022main

In this paper, we propose a comprehensive benchmark to investigate models’ logical reasoning capabilities in complex real-life scenarios. Current explanation datasets often employ synthetic data with simple reasoning structures. Therefore, it cannot express more complex reasoning processes, such as…

2022

Synergy-of-Experts: Collaborate to Improve Adversarial Robustness

NeurIPS 2022accept

Learning adversarially robust models require invariant predictions to a small neighborhood of its natural inputs, often encountering insufficient model capacity. There is research showing that learning multiple sub-models in an ensemble could mitigate this insufficiency, further improving the genera…

Cited by 8SourcePDFScholar
2022

ViTAS: Vision Transformer Architecture Search

ECCV 2022poster

"Vision transformers (ViTs) inherited the success of NLP but their structures have not been sufficiently investigated and optimized for visual tasks. One of the simplest solutions is to directly search the optimal one via the widely used neural architecture search (NAS) in CNNs. However, we empirica…

2021

Addressing Algorithmic Disparity and Performance Inconsistency in Federated Learning

NeurIPS 2021poster

Federated learning (FL) has gain growing interests for its capability of learning from distributed data sources collectively without the need of accessing the raw data samples across different sources. So far FL research has mostly focused on improving the performance, how the algorithmic disparity…

2021

BCNet: Searching for Network Width With Bilaterally Coupled Network

CVPR 2021poster

Searching for a more compact network width recently serves as an effective way of channel pruning for the deployment of convolutional neural networks (CNNs) under hardware constraints. To fulfill the searching, a one-shot supernet is usually leveraged to efficiently evaluate the performance \wrt dif…

Cited by 42PDFScholar
2021

Exophoric Pronoun Resolution in Dialogues with Topic Regularization

EMNLP 2021main

Resolving pronouns to their referents has long been studied as a fundamental natural language understanding problem. Previous works on pronoun coreference resolution (PCR) mostly focus on resolving pronouns to mentions in text while ignoring the exophoric scenario. Exophoric pronouns are common in d…

2021

FMA-ETA: Estimating Travel Time Entirely Based on FFN with Attention

ICASSP 2021accepted

Estimated time of arrival (ETA) is one of the most important services in intelligent transportation systems (ITS) and becomes a challenging spatial-temporal (ST) data mining task in recent years. Nowadays, deep learning based methods, specifically recurrent neural networks (RNN) based ones are adapt…

Cited by 0SourceScholar
2021

K-shot NAS: Learnable Weight-Sharing for NAS with K-shot Supernets

ICML 2021spotlight

In one-shot weight sharing for NAS, the weights of each operation (at each layer) are supposed to be identical for all architectures (paths) in the supernet. However, this rules out the possibility of adjusting operation weights to cater for different paths, which limits the reliability of the evalu…

Cited by 48SourcePDFScholar
2021

Learning a Proposal Classifier for Multiple Object Tracking

CVPR 2021poster

The recent trend in multiple object tracking (MOT) is heading towards leveraging deep learning to boost the tracking performance. However, it is not trivial to solve the data-association problem in an end-to-end fashion. In this paper, we propose a novel proposal-based learnable framework, which mod…

Cited by 140PDFcodeScholar
2021

Locally Free Weight Sharing for Network Width Search

ICLR 2021spotlight

Searching for network width is an effective way to slim deep neural networks with hardware budgets. With this aim, a one-shot supernet is usually leveraged as a performance evaluator to rank the performance \wrt~different width. Nevertheless, current methods mainly follow a manually fixed weight sha…

Cited by 45SourcePDFScholar
2021

Policy-Driven Attack: Learning to Query for Hard-label Black-box Adversarial Examples

ICLR 2021poster

To craft black-box adversarial examples, adversaries need to query the victim model and take proper advantage of its feedback. Existing black-box attacks generally suffer from high query complexity, especially when only the top-1 decision (i.e., the hard-label prediction) of the victim model is avai…

2021

Prioritized Architecture Sampling With Monto-Carlo Tree Search

CVPR 2021poster

One-shot neural architecture search (NAS) methods significantly reduce the search cost by considering the whole search space as one network, which only needs to be trained once. However, current methods select each operation independently without considering previous layers. Besides, the historical…

Cited by 66PDFcodeScholar
2021

ReSSL: Relational Self-Supervised Learning with Weak Augmentation

NeurIPS 2021poster

Self-supervised Learning (SSL) including the mainstream contrastive learning has achieved great success in learning visual representations without data annotations. However, most of methods mainly focus on the instance level information (\ie, the different augmented images of the same instance shoul…

2021

Weakly Supervised Contrastive Learning

ICCV 2021poster

Unsupervised visual representation learning has gained much attention from the computer vision community because of the recent achievement of contrastive learning. Most of the existing contrastive learning frameworks adopt the instance discrimination as the pretext task, which treating every single…

Cited by 152PDFcodeScholar
2020

Agree to Disagree: Adaptive Ensemble Knowledge Distillation in Gradient Space

NeurIPS 2020poster

Distilling knowledge from an ensemble of teacher models is expected to have a more promising performance than that from a single one. Current methods mainly adopt a vanilla average rule, i.e., to simply take the average of all teacher losses for training the student network. However, this approach t…

2020

Boosting Semantic Human Matting With Coarse Annotations

CVPR 2020oral

Semantic human matting aims to estimate the per-pixel opacity of the foreground human regions. It is quite challenging that usually requires user interactive trimaps and plenty of high quality annotated data. Annotating such kind of data is labor intensive and requires great skills beyond normal use…

Cited by 113PDFScholar
2020

GreedyNAS: Towards Fast One-Shot NAS With Greedy Supernet

CVPR 2020poster

Training a supernet matters for one-shot neural architecture search (NAS) methods since it serves as a basic performance estimator for different architectures (paths). Current methods mainly hold the assumption that a supernet should give a reasonable ranking over all paths. They thus treat all path…

Cited by 188PDFScholar
2020

Semismooth Newton Algorithm for Efficient Projections onto $\ell_1, ∞$-norm Ball

ICML 2020poster

The structured sparsity-inducing $\ell_{1, \infty}$-norm, as a generalization of the classical $\ell_1$-norm, plays an important role in jointly sparse models which select or remove simultaneously all the variables forming a group. However, its resulting problem is more difficult to solve than the c…

2019

Subspace Attack: Exploiting Promising Subspaces for Query-Efficient Black-box Attacks

NeurIPS 2019poster

Unlike the white-box counterparts that are widely studied and readily accessible, adversarial examples in black-box settings are generally more Herculean on account of the difficulty of estimating gradients. Many methods achieve the task by issuing numerous queries to target classification systems,…

2018

Connectionist Temporal Classification with Maximum Entropy Regularization

NeurIPS 2018spotlight

Connectionist Temporal Classification (CTC) is an objective function for end-to-end sequence learning, which adopts dynamic programming algorithms to directly learn the mapping between sequences. CTC has shown promising results in many sequence learning applications including speech recognition and…

2018

Deep Defense: Training DNNs with Improved Adversarial Robustness

NeurIPS 2018poster

Despite the efficacy on a variety of computer vision tasks, deep neural networks (DNNs) are vulnerable to adversarial attacks, limiting their applications in security-critical systems. Recent works have shown the possibility of generating imperceptibly perturbed image inputs (a.k.a., adversarial exa…

2017

Learning Efficient Convolutional Networks Through Network Slimming

ICCV 2017poster

The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high computational cost. In this paper, we propose a novel learning scheme for CNNs to simultaneously 1) reduce the model size; 2) decrease the run-time memory footprint; and 3) l…

Cited by 3354PDFcodeScholar
2017

Recurrent Convolutional Neural Networks for Continuous Sign Language Recognition by Staged Optimization

CVPR 2017poster

This work presents a weakly supervised framework with deep neural networks for vision-based continuous sign language recognition, where the ordered gloss labels but no exact temporal locations are available with the video of sign sentence, and the amount of labeled sentences for training is limited.…

Cited by 422PDFScholar