← Search

Wenbin Li

55 accepted papers

2026

Branch, or Layer? Zeroth-Order Optimization for Continual Learning of Vision-Language Models

AAAI 2026technical

Vision-Language Continual Learning (VLCL) has attracted significant research attention for its robust capabilities, and the adoption of Parameter-Efficient Fine-Tuning (PEFT) strategies is enabling these models to achieve competitive performance with substantially reduced resource consumption. Howev

Cited by 0SourcePDFScholar
2026

Don't Forget Why You Started: Tackling Dual Forgetting in Vision-Language Continual Learning

ICML 2026poster

Continual learning of Vision-Language Model (VLM) aspires to empower foundation models with new expertise without compromising their universal zero-shot capabilities. However, this pursuit faces a critical ''dual-forgetting'' challenge: the catastrophic forgetting of newly acquired classes (Incremen…

Cited by 0SourceScholar
2026

Faster Parameter-Free Regret Matching Algorithms

ICLR 2026poster

Regret Matching (RM) and its variants are widely employed to learn a Nash equilibrium (NE) in large-scale games. However, most existing research only establishes a theoretical convergence rate of $O(1/\sqrt{T})$ for these algorithms in learning an NE. Recent studies have shown that smooth RM$^+$ var…

Cited by 0SourceScholar
2026

GTool: Graph Enhanced Tool Planning with Large Language Model

ICLR 2026poster

Tool planning with large language models (LLMs), referring to selecting, organizing, and preparing the tools necessary to complete a user request, bridges the gap between natural language understanding and task execution. However, current works treat different tools as isolated components and fail t…

Cited by 0SourceScholar
2026

QPrompt-R1: Real-Time Reasoning for Domain-Generalized Semantic Segmentation via Group-Relative Query Alignment

ICLR 2026poster

Deploying semantic segmentation in driving and robotics requires both real-time inference and robustness to domain shifts, formalized as Real-Time Domain-Generalized Semantic Segmentation (RT-DGSS), which has not been fully addressed. Existing methods often treat real-time(RT) inference and domain g…

Cited by 0SourceScholar
2026

Retain and Adapt: Auto-Balanced Model Editing for Open-Vocabulary Object Detection under Domain Shifts

ICLR 2026poster

Recent advances in Open Vocabulary Object Detection (OVOD) have shown strong performance on standard benchmarks, but performance drops sharply under out-of-distribution (OOD) shifts. Continual learning offers a potential remedy by sequentially integrating new tasks, yet existing methods often strugg…

Cited by 0SourceScholar
2026

SAME: Sparse and Anchored Model Editing for Heterogeneous Incremental Learning under Limited Data

CVPR 2026

Existing Incremental Learning (IL) methods are primarily evaluated under either a single-domain class-incremental setting, or a multi-domain task-incremental setting with known task identifiers. However, these assumptions often fail to hold in real-world applications. To bridge this gap, we introduc

Cited by 0SourceScholar
2026

SSR-Merge: Subspace Signal Routing for Training-Free LoRA Merging in Diffusion Models

ICML 2026poster

Low-Rank Adaptation (LoRA) merging can efficiently combine diverse generative capabilities from multiple trained LoRAs for a diffusion model. However, existing LoRA merging techniques often suffer from severe parameter interference, causing destructive collisions in the shared parameter space. To ad…

Cited by 0SourceScholar
2026

Selective, Regularized, and Calibrated: Harnessing Vision Foundation Models for Cross-Domain Few-Shot Semantic Segmentation

CVPR 2026

Vision foundation models (VFMs) have achieved strong performance across various vision tasks. However, it still remains challenging to apply VFMs for cross-domain few-shot segmentation (CD-FSS), which segments objects of novel classes under domain shifts using only a few labeled exemplars. The chall

Cited by 0SourceScholar
2026

The Shape of Addition: Geometric Structures of Arithmetic in Large Language Models

ICML 2026poster

Large Language Models exhibit paradoxical fragility in fundamental arithmetic, implying a disconnect between internal computation and discrete output. By analyzing the residual stream geometry during multi-operand addition, we identify the **Iso-Raw-Sum Trajectory (IRST)**, a topological manifold wh…

Cited by 0SourceScholar
2026

UHR-BAT: Budget-Aware Token Compression Vision-Language model for Ultra-High-Resolution Remote Sensing

ICML 2026poster

Ultra-high-resolution (UHR) remote sensing imagery couples kilometer-scale context with query-critical evidence that may occupy only a few pixels. Such vast spatial scale leads to a quadratic explosion of visual tokens and hinders the extraction of information from small objects. Previous works util…

Cited by 0SourceScholar
2026

Understanding and Enforcing Weight Disentanglement in Task Arithmetic

CVPR 2026

Task arithmetic provides an efficient, training-free way to edit pre-trained models, yet lacks a fundamental theoretical explanation for its success. The existing concept of "weight disentanglement" describes the ideal outcome of non-interfering task composition but does not reveal its underlying ca

Cited by 0SourcecodeScholar
2025

AT-Drone: Benchmarking Adaptive Teaming in Multi-Drone Pursuit

CoRL 2025poster

Adaptive teaming—the capability of agents to effectively collaborate with unfamiliar teammates without prior coordination—is widely explored in virtual video games but overlooked in real-world multi-robot contexts. Yet, such adaptive collaboration is crucial for real-world applications, including bo…

Cited by 0SourceScholar
2025

Adapting In-Domain Few-Shot Segmentation to New Domains without Source Domain Retraining

ICCV 2025poster

Cross-domain few-shot segmentation (CD-FSS) aims to segment objects of novel classes in new domains, which is often challenging due to the diverse characteristics of target domains and the limited availability of support data. Most CD-FSS methods redesign and retrain in-domain FSS models using abund…

2025

DON’T NEED RETRAINING: A Mixture of DETR and Vision Foundation Models for Cross-Domain Few-Shot Object Detection

NeurIPS 2025poster

Cross-Domain Few-Shot Object Detection (CD-FSOD) aims to generalize to unseen domains by leveraging a few annotated samples of the target domain, requiring models to exhibit both strong generalization and localization capabilities. However, existing well-trained detectors typically have strong loca…

Cited by 0SourceScholar
2025

Dynamic Multi-Layer Null Space Projection for Vision-Language Continual Learning

ICCV 2025poster

Vision-Language Models (VLM) have emerged as a highly promising approach for Continual Learning (CL) due to their powerful generalized features. While adapter-based VLM can exploit both task-specific and task-agnostic features, current CL methods have largely overlooked the distinct and evolving par…

Cited by 0SourcePDFScholar
2025

Effective and Efficient Representation Learning for Flight Trajectories

AAAI 2025technical

Flight trajectory data plays a vital role in the traffic management community, especially for downstream tasks such as trajectory prediction, flight recognition, and anomaly detection. Existing works often utilize handcrafted features and design models for different tasks individually, which heavily…

2025

Efficient Last-Iterate Convergence in Solving Extensive-Form Games

NeurIPS 2025poster

To establish last-iterate convergence for Counterfactual Regret Minimization (CFR) algorithms in learning a Nash equilibrium (NE) of extensive-form games (EFGs), recent studies reformulate learning an NE of the original EFG as learning the NEs of a sequence of (perturbed) regularized EFGs. Hence, pr…

Cited by 0SourcecodeScholar
2025

Enhancing Few-Shot Class-Incremental Learning via Training-Free Bi-Level Modality Calibration

CVPR 2025poster

Few-shot Class-Incremental Learning (FSCIL) challenges models to adapt to new classes with limited samples, presenting greater difficulties than traditional classincremental learning. While existing approaches rely heavily on visual models and require additional training during base or incremental p…

2025

Last-Iterate Convergence of Smooth Regret Matching$^+$ Variants in Learning Nash Equilibria

NeurIPS 2025poster

Regret Matching$^+$ (RM$^+$) variants are widely used to build superhuman Poker AIs, yet few studies investigate their last-iterate convergence in learning a Nash equilibrium (NE). Although their last-iterate convergence is established for games satisfying the Minty Variational Inequality (MVI), no…

Cited by 0SourcecodeScholar
2025

Reducing Variance of Stochastic Optimization for Approximating Nash Equilibria in Normal-Form Games

ICML 2025spotlight

Nash equilibrium (NE) plays an important role in game theory. How to efficiently compute an NE in NFGs is challenging due to its complexity and non-convex optimization property. Machine Learning (ML), the cornerstone of modern artificial intelligence, has demonstrated remarkable empirical performanc…

Cited by 0SourcePDFScholar
2025

Text and Image Are Mutually Beneficial: Enhancing Training-Free Few-Shot Classification with CLIP

AAAI 2025technical

Contrastive Language-Image Pretraining (CLIP) has been widely used in vision tasks. Notably, CLIP has demonstrated promising performance in few-shot learning (FSL). However, existing CLIP-based methods in training-free FSL (i.e., without the requirement of additional training) mainly learn different…

2024

DTS-TPT: Dual Temporal-Sync Test-time Prompt Tuning for Zero-shot Activity Recognition

IJCAI 2024poster

Finetuning the large vision-language models on video data with a set of learnable prompts has shown promising performance on zero-shot activity recognition but still requires extra video data and expensive training costs. Inspired by recent Test-time Prompt Tuning (TPT) on the image domain, this wor…

2024

Dynamic Replay Training for Class-Incremental Learning

ICASSP 2024accepted

Replay-based methods for Class-Incremental Learning (CIL) typically employ new classes and a limited subset of old classes stored in memory to facilitate the model training. However, these methods often lead to class imbalance and catastrophic forgetting, where the model forgets previously learned t…

Cited by 0SourceScholar
2024

Exploiting Inter-sample and Inter-feature Relations in Dataset Distillation

CVPR 2024poster

Dataset distillation has emerged as a promising approach in deep learning enabling efficient training with small synthetic datasets derived from larger real ones. Particularly distribution matching-based distillation methods attract attention thanks to its effectiveness and low computational cost. H…

2024

Identifying Optimal Launch Sites of High-Altitude Latex-Balloons using Bayesian Optimisation for the Task of Station-Keeping

IROS 2024

Station-keeping tasks for high-altitude balloons show promise in areas such as ecological surveys, atmospheric analysis, and communication relays. However, identifying the optimal time and position to launch a latex high-altitude balloon is still a challenging and multifaceted problem. For example,

Cited by 0SourceScholar
2024

InsertNeRF: Instilling Generalizability into NeRF with HyperNet Modules

ICLR 2024poster

Generalizing Neural Radiance Fields (NeRF) to new scenes is a significant challenge that existing approaches struggle to address without extensive modifications to vanilla NeRF framework. We introduce **InsertNeRF**, a method for **INS**tilling g**E**ne**R**alizabili**T**y into **NeRF**. By utilizin…

2024

Multi-Agent Exploration via Self-Learning and Social Learning

ICASSP 2024accepted

Self-learning and social learning stand as two pivotal constituents in multi-agent exploration. Inspired by the fact that animals and humans explore unfamiliar environments to learn survival skills by training themselves using unlabeled data and replicating others’ successful experiences, we propose…

Cited by 0SourceScholar
2024

Multi-Agent Sparse Interaction Modeling is an Anomaly Detection Problem

ICASSP 2024accepted

Most real-world multi-agent tasks exhibit the characteristic of sparse interaction, wherein agents interact with each other in a limited number of crucial states while largely acting independently. Effectively modeling the sparse interaction and leveraging the learned interaction structure to instru…

Cited by 0SourceScholar
2024

Optimistic Value Instructors for Cooperative Multi-Agent Reinforcement Learning

AAAI 2024technical

In cooperative multi-agent reinforcement learning, decentralized agents hold the promise of overcoming the combinatorial explosion of joint action space and enabling greater scalability. However, they are susceptible to a game-theoretic pathology called relative overgeneralization that shadows the o…

Cited by 2SourcePDFScholar
2024

Reinforcement Learning of Dolly-In Filming Using a Ground-Based Robot

IROS 2024poster

Free-roaming dollies enhance filmmaking with dynamic movement, but challenges in automated camera control remain unresolved. Our study advances this field by applying Reinforcement Learning (RL) to automate dolly-in shots using free-roaming ground-based filming robots, overcoming traditional control…

Cited by 0SourceScholar
2024

STAR: Spatio-Temporal State Compression for Multi-Agent Tasks with Rich Observations

IJCAI 2024poster

This paper focuses on the problem of learning compressed state representations for multi-agent tasks. Under the assumption of rich observation, we pinpoint that the state representations should be compressed both spatially and temporally to enable efficient prioritization of task-relevant features,…

Cited by 0SourcePDFScholar
2024

Safe and Robust Subgame Exploitation in Imperfect Information Games

ICML 2024poster

Opponent exploitation is an important task for players to exploit the weaknesses of others in games. Existing approaches mainly focus on balancing between exploitation and exploitability but are often vulnerable to modeling errors and deceptive adversaries. To address this problem, our paper offers…

Cited by 2SourcePDFScholar
2023

Convergence Analysis of Graphical Game-Based Nash Q-Learning using the Interaction Detection Signal of N-Step Return

ICASSP 2023accepted

The graphical game provides an effective method for modeling different kinds of sparse interactions in multi-agent reinforcement learning. Most previous work on game abstraction lacks theoretical guarantees of convergence. In this paper, we adopt the ${\mathcal{N}}$-step return signal to detect inte…

Cited by 0SourceScholar
2023

Learning Explicit Credit Assignment for Cooperative Multi-Agent Reinforcement Learning via Polarization Policy Gradient

AAAI 2023technical

Cooperative multi-agent policy gradient (MAPG) algorithms have recently attracted wide attention and are regarded as a general scheme for the multi-agent system. Credit assignment plays an important role in MAPG and can induce cooperation among multiple agents. However, most MAPG algorithms cannot a…

Cited by 10SourcePDFScholar
2023

MAP: Towards Balanced Generalization of IID and OOD through Model-Agnostic Adapters

ICCV 2023oral

Deep learning has achieved tremendous success in recent years, but most of these successes are built on an independent and identically distributed (IID) assumption. This somewhat hinders the application of deep learning to the more challenging out-of-distribution (OOD) scenarios. Although many OOD m…

Cited by 22PDFcodeScholar
2023

Modeling Inter-Class and Intra-Class Constraints in Novel Class Discovery

CVPR 2023poster

Novel class discovery (NCD) aims at learning a model that transfers the common knowledge from a class-disjoint labelled dataset to another unlabelled dataset and discovers new classes (clusters) within it. Many methods, as well as elaborate training pipelines and appropriate objectives, have been pr…

2023

Resource-Constrained Station-Keeping for Latex Balloons Using Reinforcement Learning

IROS 2023poster

High altitude balloons have proved useful for ecological aerial surveys, atmospheric monitoring, and communication relays. However, due to weight and power constraints, there is a need to investigate alternate modes of propulsion to navigate in the stratosphere. Very recently, reinforcement learning…

Cited by 2SourceScholar
2022

Tree Structure-Aware Few-Shot Image Classification via Hierarchical Aggregation

ECCV 2022poster

"In this paper, we mainly focus on the problem of how to learn additional feature representations for few-shot image classification through pretext tasks (e.g., rotation or color permutation and so on). This additional knowledge generated by pretext tasks can further improve the performance of few-s…

2021

LoFGAN: Fusing Local Representations for Few-Shot Image Generation

ICCV 2021poster

Given only a few available images for a novel unseen category, few-shot image generation aims to generate more data for this category. Previous works attempt to globally fuse these images by using adjustable weighted coefficients. However, there is a serious semantic misalignment between different i…

Cited by 79PDFcodeScholar
2021

Manifold Alignment for Semantically Aligned Style Transfer

ICCV 2021poster

Most existing style transfer methods follow the assumption that styles can be represented with global statistics (e.g., Gram matrices or covariance matrices), and thus address the problem by forcing the output and style images to have similar global statistics. An alternative is the assumption of lo…

Cited by 60PDFcodeScholar
2020

Asymmetric Distribution Measure for Few-shot Learning

IJCAI 2020poster

The core idea of metric-based few-shot image classification is to directly measure the relations between query images and support classes to learn transferable feature embeddings. Previous work mainly focuses on image-level feature representations, which actually cannot effectively estimate a class'…

2020

Biased Feature Learning for Occlusion Invariant Face Recognition

IJCAI 2020poster

To address the challenges posed by unknown occlusions, we propose a Biased Feature Learning (BFL) framework for occlusion-invariant face recognition. We first construct an extended dataset using a multi-scale data augmentation method. For model training, we modify the label loss to adjust the impact…

Cited by 0SourcePDFScholar
2020

Joint Multi-view 2D Convolutional Neural Networks for 3D Object Classification

IJCAI 2020poster

Three-dimensional (3D) object classification is widely involved in various computer vision applications, e.g., autonomous driving, simultaneous localization and mapping, which has attracted lots of attention in the committee. However, solving 3D object classification by directly employing the 3D con…

Cited by 0SourcePDFScholar
2020

Learning Task-aware Local Representations for Few-shot Learning

IJCAI 2020poster

Few-shot learning for visual recognition aims to adapt to novel unseen classes with only a few images. Recent work, especially the work based on low-level information, has achieved great progress. In these work, local representations (LRs) are typically employed, because LRs are more consistent amon…

Cited by 0SourcePDFScholar
2020

RGBD-Dog: Predicting Canine Pose from RGBD Sensors

CVPR 2020poster

The automatic extraction of animal 3D pose from images without markers is of interest in a range of scientific fields. Most work to date predicts animal pose from RGB images, based on 2D labelling of joint positions. However, due to the difficult nature of obtaining training data, no ground truth da…

Cited by 73PDFcodeScholar
2019

Characterizing Visual Localization and Mapping Datasets

ICRA 2019poster

Benchmarking mapping and motion estimation algorithms is established practice in robotics and computer vision. As the diversity of datasets increases, in terms of the trajectories, models, and scenes, it becomes a challenge to select datasets for a given benchmarking purpose. Inspired by the Wassers…

Cited by 30SourceScholar
2019

MID-Fusion: Octree-based Object-Level Multi-Instance Dynamic SLAM

ICRA 2019poster

We propose a new multi-instance dynamic RGB-D SLAM system using an object-level octree-based volumetric representation. It can provide robust camera tracking in dynamic environments and at the same time, continuously estimate geometric, semantic, and motion properties for arbitrary objects in the sc…

Cited by 240SourcecodeScholar
2019

Revisiting Local Descriptor Based Image-To-Class Measure for Few-Shot Learning

CVPR 2019poster

Few-shot learning in image classification aims to learn a classifier to classify images when only few training examples are available for each class. Recent work has achieved promising classification performance, where an image-level feature based measure is usually used. In this paper, we argue tha…

Cited by 698PDFcodeScholar
2017

Nonrigid Optical Flow Ground Truth for Real-World Scenes With Time-Varying Shading Effects

RA-L 2017

In this paper we present a dense ground truth dataset of nonrigidly deforming real-world scenes. Our dataset contains both long and short video sequences, and enables the quantitatively evaluation for RGB based tracking and registration methods. To construct ground truth for the RGB sequences, we si

Cited by 14SourceScholar