Arrow Research search

Author name cluster

Lin Sun

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.

13 papers
2 author rows

Possible papers

13

AAAI Conference 2026 Conference Paper

Efficient Switchable Safety Control in LLMs via Magic-Token-Guided Co-Training

  • Jianfeng Si
  • Lin Sun
  • Zhewen Tan
  • Xiangzheng Zhang

Current methods for content safety in Large Language Models (LLMs), such as Supervised Fine-Tuning (SFT) and Reinforcement Learning from Human Feedback (RLHF), often rely on multi-stage training pipelines and lack fine-grained, post-deployment controllability. To address these limitations, we propose a unified co-training framework that efficiently integrates multiple safety behaviors: positive (lawful/prosocial), negative (unfiltered/risk-prone) and rejective (refusal-oriented/conservative) within a single SFT stage. Notably, each behavior is dynamically activated via a simple system-level instruction, or magic token, enabling stealthy and efficient behavioral switching at inference time. This flexibility supports diverse deployment scenarios, such as positive for safe user interaction, negative for internal red-teaming, and rejective for context-aware refusals triggered by upstream moderation signals. This co-training strategy induces a distinct Safety Alignment Margin in the output space, characterized by well-separated response distributions corresponding to each safety mode. The existence of this margin provides empirical evidence for the model's safety robustness and enables unprecedented fine-grained control. Experiments show that our method matches the safety alignment quality of SFT+DPO, with our 8B model notably surpassing DeepSeek-R1 (671B) in safety performance, while significantly reducing both training complexity and deployment costs. This work presents a scalable, efficient, and highly controllable solution for LLM content safety.

ECAI Conference 2025 Conference Paper

D-CHO: Task-Oriented Satellite Conditional Handover Decision in NTN Based on Multi-Agent Game

  • Lin Sun
  • Jinming Liu
  • Fanmeng Hong
  • Haopeng Chen
  • Xiupu Lang
  • Lin Gui 0001

In non-terrestrial networks, satellite constellations based on the Low-Earth-Orbit (LEO) have become crucial for ensuring seamless global connectivity. The flexible continuity guarantee is demanded for task-oriented user connection requests in satellite networks. In this paper, we propose a task-oriented satellite conditional handover scheme, D-CHO, based on multi-agent game theory. For the problem formalization, this paper focuses on delay overhead, satellite utilization deviation, and load performance to model the multi-objective optimization. According to game theory, a Nash equilibrium exists among the multi-task game strategies that require satellite links. Through exploration and exploitation, the optimal satellite handover sequence scheme can be identified. This paper explores the optimal solution based on the MAPPO algorithm, which enables multiple tasks to make independent decisions based on their partial observations without requiring global information. This approach is beneficial for the adaptive expansion in response to dynamic changes in different satellite networks. The simulation results show that D-CHO improves performance by 22%, 26%, and 11% compared to the SCDP, G-CHO, and MADDPG-CHO algorithms, respectively, and exhibits better scalability while maintaining satisfactory performance.

AAAI Conference 2025 Conference Paper

Expand VSR Benchmark for VLLM to Expertize in Spatial Rules

  • Peijin Xie
  • Lin Sun
  • Bingquan Liu
  • Dexin Wang
  • Xiangzheng Zhang
  • Chengjie Sun
  • Jiajia Zhang

Distinguishing spatial relations is a basic part of human cognition which requires fine-grained perception on cross-instance. Although benchmarks like MME, MMBench and SEED comprehensively have evaluated various capabilities which already include visual spatial reasoning(VSR). There is still a lack of sufficient quantity and quality evaluation and optimization datasets for Vision Large Language Models(VLLMs) specifically targeting visual positional reasoning. To handle this, we first diagnosed current VLLMs with the VSR dataset and proposed a unified test set. We found current VLLMs to exhibit a contradiction of over-sensitivity to language instructions and under-sensitivity to visual positional information. By expanding the original benchmark from two aspects of tunning data and model structure, we mitigated this phenomenon. To our knowledge, we expanded spatially positioned image data controllably using diffusion models for the first time and integrated original visual encoding(CLIP) with other 3 powerful visual encoders(SigLIP, SAM and DINO). After conducting combination experiments on scaling data and models, we obtained a VLLM VSR Expert(VSRE) that not only generalizes better to different instructions but also accurately distinguishes differences in visual positional information. VSRE achieved over a 27% increase in accuracy on the VSR test set. It becomes a performant VLLM on the position reasoning of both the VSR dataset and relevant subsets of other evaluation benchmarks. We hope it will accelerate advancements in VLLM on VSR learning.

EAAI Journal 2025 Journal Article

Feature selection-based rough graph classification via graph convolutional neural networks

  • Lin Sun
  • Yiwen Cai
  • Weiping Ding
  • Jiucheng Xu

In various applications, graph data is usually omnipresent. Many existing methods integrate graph classification and feature selection to select informative features; however, uncertainty in graph data is easily ignored and then the relationship between nodes has been not described fully. Additionally, when processing graph data, graph convolutional neural networks (GCNs) fall short in illustrating the structural features and inherent semantic of whole graphs, and relying on node features will lead to over-smoothing, which can affect the efficacy of graph classification. To address these flaws, this article presents a novel feature selection-based rough graph classification methodology via GCNs. Firstly, the average value of each node feature values is calculated to be sorted. A variance filtering-based feature selection scheme is constructed to remove irrelevant node features. Then, the upper approximate and lower approximate feature sets will be divided by a variance threshold. Secondly, according to the relationship between the upper and lower approximates, the upper approximate weight and lower approximate weight of nodes are provided, and the upper approximate weight and lower approximate weight of edges between nodes can be provided to remove the influence of redundant information on nodes. The weight coefficient between nodes is learned by calculating the similarity between nodes to create the upper and lower approximation graphs, and then rough graphs will be constructed to fully display the uncertainty between nodes. Thirdly, an updated self-attention pooling layer scheme is presented to evaluate the importance of nodes, GraphConv is used to extract features for an output feature matrix and obtain a sequence of important nodes. Feature matrix and adjacency matrix can be updated, the hierarchical pooling structure is studied to retain important nodes in network training, and then a simplified rough graph can be obtained. Thus, an end-to-end GCN model is designed by simultaneously considering the structure and node features of rough graphs. Finally, a novel rough graph classification algorithm via GCNs is designed. Experiments on 15 graph datasets illustrate the greater effectiveness of the designed methodology relative to other competitive algorithms.

EAAI Journal 2025 Journal Article

Granular ball-based fuzzy multineighborhood rough set for feature selection via label enhancement

  • Lin Sun
  • Wenjuan Du
  • Weiping Ding
  • Qian Long
  • Jiucheng Xu

Recently, in artificial intelligence, existing feature selection schemes have usually neglected the different distributions of features and description degrees of labels with respect to samples without considering label enhancement. In addition, some granular ball models do not compute the similarity of labels between samples, which leads to division errors in granular balls. To overcome these drawbacks, this paper studies granular ball-based adaptive fuzzy multineighborhood rough set and develops multilabel feature selection via label enhancement. First, the overall label set is developed on the basis of the description degree of label to granular ball. To develop the similarity of samples under the label space, the Jaccard similarity of labels is designed for the purity of granular balls, and then the multilabel samples with similar labels are clustered into the same granular ball. Second, to adapt the distribution of different features, the maximum and minimum feature standard deviations are applied to construct an adaptive fuzzy multineighborhood radius set. Adaptive fuzzy multineighborhood granules of samples can be extracted from adaptive fuzzy neighborhood classes to construct upper and lower approximations, and then granular ball-based adaptive fuzzy multineighborhood rough set can be established. Third, the fuzzy similarity of samples relative to the label set is considered to provide a label enhancement strategy to compute the label proportion, the fuzzy decision similarity under the label space is defined, and several label enhancement-based uncertainty measures are provided. By combining the dependence degree and knowledge granularity, a mixed measure is proposed to compute feature scores. Finally, the feature score vector of each granular ball is synthesized to select the optimal feature subset; then, a feature selection methodology via label enhancement is proposed. Experiments show that this constructed algorithm is effective on 14 multilabel datasets.

EAAI Journal 2025 Journal Article

Physics-informed neural networks in heat transfer-dominated multiphysics systems: A comprehensive review

  • Zhuang Zhao
  • Ye Wang
  • Weijian Zhang
  • Zhenggang Ba
  • Lin Sun

This article presents a comprehensive review of the role of Physics-Informed Neural Networks (PINNs) in engineering applications dominated by heat transfer, synthesizing bibliometric analysis with practical engineering perspectives. PINNs, which integrate separable neural networks and parameterized multiphysics models, offer a robust framework for solving both forward and inverse heat transfer problems. These models demonstrate particular efficacy in complex multiphysics environments, such as combustion modeling and geothermal forecasting, circumventing the need for extensive mesh generation required by traditional methods. Key applications explored include thermal management in electronics, monitoring of cogeneration systems, geothermal heat production, lifespan management of batteries and transformers, food drying processes, material thermal property identification and thermal oversight in additive manufacturing. Recent advancements, including the incorporation of numerical methods, adaptive activation functions, and transfer learning, have significantly improved the practicality of PINNs. However, their training cost remains a notable drawback when compared to the efficiency of conventional numerical simulation methods for regular, large-scale simulations. Emerging trends in deep learning and probabilistic approaches suggest promising future directions, such as potential integration with Graph Neural Networks and meta-learning to enhance modeling capabilities. While traditional numerical simulation methods remain preferable for short-term, well-defined scenarios, PINNs or hybrid approaches are recommended for long-term, innovative solutions requiring adaptability. This review provides a structured framework for engineers and researchers to apply PINNs in heat transfer-dominated applications and delineates future pathways for advancing data-driven, physics-constrained modeling strategies.

AAAI Conference 2024 Conference Paper

PathAsst: A Generative Foundation AI Assistant towards Artificial General Intelligence of Pathology

  • Yuxuan Sun
  • Chenglu Zhu
  • Sunyi Zheng
  • Kai Zhang
  • Lin Sun
  • Zhongyi Shui
  • Yunlong Zhang
  • Honglin Li

As advances in large language models (LLMs) and multimodal techniques continue to mature, the development of general-purpose multimodal large language models (MLLMs) has surged, offering significant applications in interpreting natural images. However, the field of pathology has largely remained untapped, particularly in gathering high-quality data and designing comprehensive model frameworks. To bridge the gap in pathology MLLMs, we present PathAsst, a multimodal generative foundation AI assistant to revolutionize diagnostic and predictive analytics in pathology. The development of PathAsst involves three pivotal steps: data acquisition, CLIP model adaptation, and the training of PathAsst's multimodal generative capabilities. Firstly, we collect over 207K high-quality pathology image-text pairs from authoritative sources. Leveraging the advanced power of ChatGPT, we generate over 180K instruction-following samples. Furthermore, we devise additional instruction-following data specifically tailored for invoking eight pathology-specific sub-models we prepared, allowing the PathAsst to effectively collaborate with these models, enhancing its diagnostic ability. Secondly, by leveraging the collected data, we construct PathCLIP, a pathology-dedicated CLIP, to enhance PathAsst's capabilities in interpreting pathology images. Finally, we integrate PathCLIP with the Vicuna-13b and utilize pathology-specific instruction-tuning data to enhance the multimodal generation capacity of PathAsst and bolster its synergistic interactions with sub-models. The experimental results of PathAsst show the potential of harnessing AI-powered generative foundation model to improve pathology diagnosis and treatment processes. We open-source our dataset, as well as a comprehensive toolkit for extensive pathology data collection and preprocessing at https://github.com/superjamessyx/Generative-Foundation-AI-Assistant-for-Pathology.

AAAI Conference 2024 Conference Paper

UMIE: Unified Multimodal Information Extraction with Instruction Tuning

  • Lin Sun
  • Kai Zhang
  • Qingyuan Li
  • Renze Lou

Multimodal information extraction (MIE) gains significant attention as the popularity of multimedia content increases. However, current MIE methods often resort to using task-specific model structures, which results in limited generalizability across tasks and underutilizes shared knowledge across MIE tasks. To address these issues, we propose UMIE, a unified multimodal information extractor to unify three MIE tasks as a generation problem using instruction tuning, being able to effectively extract both textual and visual mentions. Extensive experiments show that our single UMIE outperforms various state-of-the-art (SoTA) methods across six MIE datasets on three tasks. Furthermore, in-depth analysis demonstrates UMIE's strong generalization in the zero-shot setting, robustness to instruction variants, and interpretability. Our research serves as an initial step towards a unified MIE model and initiates the exploration into both instruction tuning and large language models within the MIE domain. Our code, data, and model are available at https://github.com/ZUCC-AI/UMIE.

TCS Journal 2021 Journal Article

Identity-based encryption with equality test and datestamp-based authorization mechanism

  • Xi-Jun Lin
  • Qihui Wang
  • Lin Sun
  • Haipeng Qu

Due to the advancement of cloud computing, public key encryption with equality test has become a hot topic in the cryptography community. The notion was extended to the identity-based setting to obtain a new primitive, called identity-based encryption with equality test (IBEET). To the best of our knowledge, there are two categories of authorization mechanisms for IBEET: ciphertext-specified authorization and user-specified authorization. However, these authorizations are not applicable for some scenarios. Motivated by this, we propose in this paper a new primitive, called identity-based encryption with equality test and datestamp-based authorization mechanism (IBEET-DBA). In the primitive, the data owner can control the validity of trapdoor by embedding datestamp into it. The cloud server can only obtain the correct equivalence results on the ciphertexts which are generated within the valid period of trapdoor. In this paper, we formally define this primitive and its security notion. Moreover, we propose the first IBEET-DBA scheme and prove its security.

AAAI Conference 2021 Conference Paper

RpBERT: A Text-image Relation Propagation-based BERT Model for Multimodal NER

  • Lin Sun
  • Jiquan Wang
  • Kai Zhang
  • Yindu Su
  • Fangsheng Weng

Recently multimodal named entity recognition (MNER) has utilized images to improve the accuracy of NER in tweets. However, most of the multimodal methods use attention mechanisms to extract visual clues regardless of whether the text and image are relevant. Practically, the irrelevant textimage pairs account for a large proportion in tweets. The visual clues that are unrelated to the texts will exert uncertain or even negative effects on multimodal model learning. In this paper, we introduce a method of text-image relation propagation into the multimodal BERT model. We integrate soft or hard gates to select visual clues and propose a multitask algorithm to train on the MNER datasets. In the experiments, we deeply analyze the changes in visual attention before and after the use of text-image relation propagation. Our model achieves state-of-the-art performance on the MNER datasets.

NeurIPS Conference 2020 Conference Paper

Every View Counts: Cross-View Consistency in 3D Object Detection with Hybrid-Cylindrical-Spherical Voxelization

  • Qi Chen
  • Lin Sun
  • Ernest Cheung
  • Alan L. Yuille

Recent voxel-based 3D object detectors for autonomous vehicles learn point cloud representations either from bird eye view (BEV) or range view (RV, a. k. a. the perspective view). However, each view has its own strengths and weaknesses. In this paper, we present a novel framework to unify and leverage the benefits from both BEV and RV. The widely-used cuboid-shaped voxels in Cartesian coordinate system only benefit learning BEV feature map. Therefore, to enable learning both BEV and RV feature maps, we introduce Hybrid-Cylindrical-Spherical voxelization. Our findings show that simply adding detection on another view as auxiliary supervision will lead to poor performance. We proposed a pair of cross-view transformers to transform the feature maps into the other view and introduce cross-view consistency loss on them. Comprehensive experiments on the challenging NuScenes Dataset validate the effectiveness of our proposed method by virtue of joint optimization and complementary information on both views. Remarkably, our approach achieved mAP of 55. 8%, outperforming all published approaches by at least 3% in overall performance and up to 16. 5% in safety-crucial categories like cyclist.

NeurIPS Conference 2020 Conference Paper

Grasp Proposal Networks: An End-to-End Solution for Visual Learning of Robotic Grasps

  • Chaozheng Wu
  • Jian Chen
  • Qiaoyu Cao
  • Jianchi Zhang
  • Yunxin Tai
  • Lin Sun
  • Kui Jia

Learning robotic grasps from visual observations is a promising yet challenging task. Recent research shows its great potential by preparing and learning from large-scale synthetic datasets. For the popular, 6 degree-of-freedom (6-DOF) grasp setting of parallel-jaw gripper, most of existing methods take the strategy of heuristically sampling grasp candidates and then evaluating them using learned scoring functions. This strategy is limited in terms of the conflict between sampling efficiency and coverage of optimal grasps. To this end, we propose in this work a novel, end-to-end \emph{Grasp Proposal Network (GPNet)}, to predict a diverse set of 6-DOF grasps for an unseen object observed from a single and unknown camera view. GPNet builds on a key design of grasp proposal module that defines \emph{anchors of grasp centers} at discrete but regular 3D grid corners, which is flexible to support either more precise or more diverse grasp predictions. To test GPNet, we contribute a synthetic dataset of 6-DOF object grasps; evaluation is conducted using rule-based criteria, simulation test, and real test. Comparative results show the advantage of our methods over existing ones. Notably, GPNet gains better simulation results via the specified coverage, which helps achieve a ready translation in real test. Our code and dataset are available on \url{https: //github. com/CZ-Wu/GPNet}.

EAAI Journal 2019 Journal Article

Online probabilistic goal recognition and its application in dynamic shortest-path local network interdiction

  • Kai Xu
  • Yunxiu Zeng
  • Qi Zhang
  • Quanjun Yin
  • Lin Sun
  • Kaiming Xiao

Goal recognition is the task of inferring an agent’s goals given some or all of the agent’s observed actions. However, few research focuses on how to improve the usage effectiveness of knowledge produced by a goal recognition system. In this work, we propose a probabilistic goal recognition approach tailored to a dynamic shortest-path network interdiction problem. Apart from inferring a probabilistic distribution over the possible goals of an agent, our work has another four key novelties: (i) a dynamic shortest-path local network interdiction model that allocates resources locally per step using goal recognition information; (ii) two behavior modeling approaches, including a data-driven learning method based on Inverse Reinforcement Learning as well as a heuristic method taking advantage of the network information, to help solve both the data-intensive and no available data situations; (iii) a heuristic named Subjective Confidence that uses variance in particle system for flexible resource allocation adjustment. The empirical test results show the effectiveness of our goal recognition method, and also verify the practical implications of these methods in solving scalable multi-terminus network interdiction problem.

v2026.09.13