Arrow Research search

Author name cluster

Maobin Tang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

AAAI Conference 2026 Conference Paper

End-to-End Knowledge Distillation for Unsupervised Domain Adaptation with Large Vision-language Models

  • Yangtao Wang
  • Xingwei Deng
  • Yanzhao Xie
  • Weilong Peng
  • Siyuan Chen
  • Xiaocui Li
  • Maobin Tang
  • Meie Fang

Knowledge distillation based on large vision-language models (VLMs) has recently emerged as a significant solution to transfer knowledge from the source domain to the target domain in unsupervised domain adaptation (UDA) tasks. However, existing methods employ a two-stage training pipeline, which not only complicates the training procedure but also lacks interactions between the source and target domains, severely hindering real-time cross-domain knowledge transfer. To address these challenges, we propose End-to-End Knowledge Distillation for UDA with large VLMs (termed as EKDA). (1) EKDA employs a lightweight prompt learning mechanism to first embed the knowledge from the source domain into VLMs, and then simultaneously utilize the image encoder and text encoder of VLMs to perform knowledge distillation on the target domain, significantly reducing the domain gap. (2) EKDA designs a teacher-student alternating training strategy to implement real-time collaborative interactions across domains, enabling an end-to-end paradigm to provide accurate source domain-aware supervision for the target domain. We conduct extensive experiments on 4 widely recognized benchmark datasets including Office-31, Office-Home, VisDA-2017, and Mini-DomainNet. Experimental results demonstrate that EKDA achieves significant performance improvement over the state-of-the-art UDA approaches, while maintaining a much lower model complexity. Take Office-Home for example, EKDA has gained at least 2.7% performance improvement while reducing the learnable parameters by over 80% compared with the state-of-the-art UDA baselines.

TCS Journal 2014 Journal Article

Solving the maximum duo-preservation string mapping problem with linear programming

  • Wenbin Chen
  • Zhengzhang Chen
  • Nagiza F. Samatova
  • Lingxi Peng
  • Jianxiong Wang
  • Maobin Tang

In this paper, we introduce the maximum duo-preservation string mapping problem (MPSM), which is complementary to the minimum common string partition problem (MCSP). When each letter occurs at most k times in any input string, the version of MPSM is called k-MPSM. In order to design approximation algorithms for MPSM, we also introduce the constrained maximum induced subgraph problem (CMIS) and the constrained minimum induced subgraph (CNIS) problem. We show that both CMIS and CNIS are NP-complete. We also study the approximation algorithms for the restricted version of CMIS, which is called k-CMIS ( k ⩾ 2 ). Using Linear Programming method, we propose an approximation algorithm for 2-CMIS with approximation ratio 2 and an approximation algorithm for k-CMIS ( k ⩾ 3 ) with approximation ratio k 2. Based on approximation algorithms for k-CMIS, we get approximation algorithms for k-MPSM with the same approximation ratio.

TCS Journal 2013 Journal Article

Inapproximability results for the minimum integral solution problem with preprocessing over ℓ ∞ norm

  • Wenbin Chen
  • Lingxi Peng
  • Jianxiong Wang
  • Fufang Li
  • Maobin Tang
  • Wei Xiong
  • Songtao Wang

The Minimum Integral Solution Problem with preprocessing has been introduced by Alekhnovich, Khot, Kindler, and Vishnoi [M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi, Hardness of approximating the closest vector problem with preprocessing, in: Proc. 46th IEEE Symposium on FOCS, 2005, pp. 216–225]. They studied the complexity of Minimum Integral Solution Problem with preprocessing over ℓ p norm ( 1 ≤ p < ∞ ). They leave an open problem about the complexity of the Minimum Integral Solution Problem with preprocessing over ℓ ∞ norm. In this paper, we settle the problem. We show that the Minimum Integral Solution Problem with preprocessing over ℓ ∞ norm ( MISPP ∞ ) is NP-hard to approximate to within a factor of 2 − ϵ for any ϵ > 0, unless P = NP.

v2026.09.13