Arrow Research search

Author name cluster

Yangyang Li

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.

4 papers
1 author row

Possible papers

4

AAAI Conference 2023 Conference Paper

HG-SL: Jointly Learning of Global and Local User Spreading Behavior for Fake News Early Detection

  • Ling Sun
  • Yuan Rao
  • Yuqian Lan
  • Bingcan Xia
  • Yangyang Li

Recently, fake news forgery technology has become more and more sophisticated, and even the profiles of participants may be faked, which challenges the robustness and effectiveness of traditional detection methods involving text or user identity. Most propagation-only approaches mainly rely on neural networks to learn the diffusion pattern of individual news, which is insufficient to describe the differences in news spread ability, and also ignores the valuable global connections of news and users, limiting the performance of detection. Therefore, we propose a joint learning model named HG-SL, which is blind to news content and user identities, but capable of catching the differences between true and fake news in the early stages of propagation through global and local user spreading behavior. Specifically, we innovatively design a Hypergraph-based Global interaction learning module to capture the global preferences of users from their co-spreading relationships, and introduce node centrality encoding to complement user influence in hypergraph learning. Moreover, the designed Self-attention-based Local context learning module first introduce spread status to highlight the propagation ability of news and users, thus providing additional signals for verifying news authenticity. Experiments on real-world datasets indicate that our HG-SL, which solely relies on user behavior, outperforms SOTA baselines utilizing multidimensional features in both fake news detection and early detection task.

NeurIPS Conference 2023 Conference Paper

LICO: Explainable Models with Language-Image COnsistency

  • Yiming Lei
  • Zilong Li
  • Yangyang Li
  • Junping Zhang
  • Hongming Shan

Interpreting the decisions of deep learning models has been actively studied since the explosion of deep neural networks. One of the most convincing interpretation approaches is salience-based visual interpretation, such as Grad-CAM, where the generation of attention maps depends merely on categorical labels. Although existing interpretation methods can provide explainable decision clues, they often yield partial correspondence between image and saliency maps due to the limited discriminative information from one-hot labels. This paper develops a Language-Image COnsistency model for explainable image classification, termed LICO, by correlating learnable linguistic prompts with corresponding visual features in a coarse-to-fine manner. Specifically, we first establish a coarse global manifold structure alignment by minimizing the distance between the distributions of image and language features. We then achieve fine-grained saliency maps by applying optimal transport (OT) theory to assign local feature maps with class-specific prompts. Extensive experimental results on eight benchmark datasets demonstrate that the proposed LICO achieves a significant improvement in generating more explainable attention maps in conjunction with existing interpretation methods such as Grad-CAM. Remarkably, LICO improves the classification performance of existing models without introducing any computational overhead during inference.

AAAI Conference 2021 Conference Paper

Learned Extragradient ISTA with Interpretable Residual Structures for Sparse Coding

  • Yangyang Li
  • Lin Kong
  • Fanhua Shang
  • Yuanyuan Liu
  • Hongying Liu
  • Zhouchen Lin

Recently, the study on learned iterative shrinkage thresholding algorithm (LISTA) has attracted increasing attentions. A large number of experiments as well as some theories have proved the high efficiency of LISTA for solving sparse coding problems. However, existing LISTA methods are all serial connection. To address this issue, we propose a novel extragradient based LISTA (ELISTA), which has a residual structure and theoretical guarantees. Moreover, most LISTA methods use the soft thresholding function, which has been found to cause a large estimation bias. Therefore, we propose a thresholding function for ELISTA instead of soft thresholding. From a theoretical perspective, we prove that our method attains linear convergence. Through ablation experiments, the improvements of our method on the network structure and the thresholding function are verified in practice. Extensive empirical results verify the advantages of our method.

EAAI Journal 2014 Journal Article

Change detection in SAR images by artificial immune multi-objective clustering

  • Ronghua Shang
  • Liping Qi
  • Licheng Jiao
  • Rustam Stolkin
  • Yangyang Li

This paper addresses the problem of unsupervised change detection in Synthetic Aperture Radar (SAR) images. Previous approaches have used evolutionary clustering optimization methods, which can suffer from reduced accuracy, because they often use only a single objective function and can easily become trapped at locally optimal values. To overcome these difficulties, we propose a new approach which combines the artificial immune system (AIS) theory with a multi-objective optimization algorithm. First, the self-adaptive artificial immune multi-objective algorithm is adopted to pre-sort the difference image. During this procedure, the difference image is categorized into three classes – changed class, unchanged class and uncertain samples. Second, based on wavelet decomposition to extract features from the difference image, the immune clonal multi-objective clustering algorithm is used to search for the optimal clustering centers of uncertain samples, labeling them as changed or unchanged. Experimental comparisons with four state-of-the-art approaches show that the proposed algorithm can obtain a higher accuracy, is more robust to noise, and finds solutions which are more globally optimal. Additionally, the proposed algorithm can improve the local search ability for the optimal solutions and produces better cluster centers.

v2026.09.13