Arrow Research search

Author name cluster

Wei Lu

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.

56 papers
2 author rows

Possible papers

56

EAAI Journal 2026 Journal Article

A social recommendation model based on cross-view contrastive learning and multi-head attention for multi-rating fusion

  • Rui Chen
  • Zhuo Dai
  • Wei Lu
  • Yanbu Guo
  • Weizhi Meng
  • Pu Li
  • Min Huang
  • Xiangjie Kong

In recent years, social recommender systems have become a hot research field. Contrastive learning effectively enhances the expressiveness of user representations by modeling the consistency of representations between interactive views and social views, thereby improving recommendation performance. This paper proposes a social recommendation model based on cross-view contrastive learning, which employs a multi-head attention mechanism to fuse multi-rating information. It adaptively assigns weights to multiple views, making more effective use of rich social relationships and social trust information to alleviate data sparsity. In the rating view, interaction-aware noise with orientation-preserving constraints is introduced for data augmentation. The proposed model constructs a cross-view contrastive learning task between the rating view and the social view. Extensive experiments on three real-world datasets demonstrate the effectiveness of the proposed approach and its key components, and reveal that our model consistently outperforms state-of-the-art methods.

Details DOI

AAAI Conference 2026 Conference Paper

ARIW-Framework: Adaptive Robust Iterative Watermarking Framework

  • Shaowu Wu
  • Liting Zeng
  • Wei Lu

With the rapid rise of large models, copyright protection for generated image content has become a critical security challenge. Although deep learning watermarking techniques offer an effective solution for digital image copyright protection, they still face limitations in terms of visual quality, robustness and generalization. To address these issues, this paper proposes an adaptive robust iterative watermarking framework (ARIW-Framework) that achieves high-quality watermarked images while maintaining exceptional robustness and generalization performance. Specifically, we introduce an iterative approach to optimize the encoder for generating robust residuals. The encoder incorporates noise layers and a decoder to compute robustness weights for residuals under various noise attacks. By employing a parallel optimization strategy, the framework enhances robustness against multiple types of noise attacks. Furthermore, we leverage image gradients to determine the embedding strength at each pixel location, significantly improving the visual quality of the watermarked images. Extensive experiments demonstrate that the proposed method achieves superior visual quality while exhibiting remarkable robustness and generalization against noise attacks.

PDF Details DOI

AAAI Conference 2026 Conference Paper

LWGANet: Addressing Spatial and Channel Redundancy in Remote Sensing Visual Tasks with Light-Weight Grouped Attention

  • Wei Lu
  • Xue Yang
  • Si-Bao Chen

Light-weight neural networks for remote sensing (RS) visual analysis must overcome two inherent redundancies: spatial redundancy from vast, homogeneous backgrounds, and channel redundancy, where extreme scale variations render a single feature space inefficient. Existing models, often designed for natural images, fail to address this dual challenge in RS scenarios. To bridge this gap, we propose LWGANet, a light-weight backbone engineered for RS-specific properties. LWGANet introduces two core innovations: a Top-K Global Feature Interaction (TGFI) module that mitigates spatial redundancy by focusing computation on salient regions, and a Light-Weight Grouped Attention (LWGA) module that resolves channel redundancy by partitioning channels into specialized, scale-specific pathways. By synergistically resolving these core inefficiencies, LWGANet achieves a superior trade-off between feature representation quality and computational cost. Extensive experiments on twelve diverse datasets across four major RS tasks—scene classification, oriented object detection, semantic segmentation, and change detection—demonstrate that LWGANet consistently outperforms state-of-the-art light-weight backbones in both accuracy and efficiency. Our work establishes a new, robust baseline for efficient visual analysis in RS images.

PDF Details DOI

AAAI Conference 2026 Conference Paper

StyleSentinel: Reliable Artistic Copyright Verification via Stylistic Fingerprints

  • Lingxiao Chen
  • Liqin Wang
  • Wei Lu

The versatility of diffusion models in generating customized images has led to unauthorized usage of personal artwork, which poses a significant threat to the intellectual property of artists. Existing approaches relying on embedding additional information, such as perturbations, watermarks, and backdoors, suffer from limited defensive capabilities and fail to protect artwork published online. In this paper, we propose StyleSentinel, an approach for copyright protection of artwork by verifying an inherent stylistic fingerprint in the artist's artwork. Specifically, we employ a semantic self-reconstruction process to enhance stylistic expressiveness within the artwork, which establishes a dense and style-consistent manifold foundation for feature learning. Subsequently, we adaptively fuse multi-layer image features to encode abstract artistic style into a compact stylistic fingerprint. Finally, we model the target artist's style as a minimal enclosing hypersphere boundary in the feature space, transforming complex copyright verification into a robust one-class learning task. Extensive experiments demonstrate that compared with the state-of-the-art, StyleSentinel achieves superior performance on the one-sample verification task. We also demonstrate the effectiveness through online platforms.

PDF Details DOI

AAAI Conference 2026 Conference Paper

VoiceCloak: A Multi-Dimensional Defense Framework Against Unauthorized Diffusion-Based Voice Cloning

  • Qianyue Hu
  • Junyan Wu
  • Wei Lu
  • Xiangyang Luo

Diffusion Models (DMs) have achieved remarkable success in realistic voice cloning (VC), while they also increase the risk of malicious misuse. Existing proactive defenses designed for traditional VC models aim to disrupt the forgery process, but they have been proven incompatible with DMs due to the intricate generative mechanisms of diffusion. To bridge this gap, we introduce VoiceCloak, a multi-dimensional proactive defense framework with the goal of obfuscating speaker identity and degrading perceptual quality in potential unauthorized VC. To achieve these goals, we conduct a focused analysis to identify specific vulnerabilities within DMs, allowing VoiceCloak to disrupt the cloning process by introducing adversarial perturbations into the reference audio. Specifically, to obfuscate speaker identity, VoiceCloak first targets speaker identity by distorting representation learning embeddings to maximize identity variation, which is guided by auditory perception principles. Additionally, VoiceCloak disrupts crucial conditional guidance processes, particularly attention context, thereby preventing the alignment of vocal characteristics that are essential for achieving convincing cloning. Then, to address the second objective, VoiceCloak introduces score magnitude amplification to actively steer the reverse trajectory away from the generation of high-quality speech. Noise-guided semantic corruption is further employed to disrupt structural speech semantics captured by DMs, degrading output quality. Extensive experiments highlight VoiceCloak's outstanding defense success rate against unauthorized diffusion-based voice cloning. Additional audio samples of VoiceCloak are available in demo pages.

PDF Details DOI

AAAI Conference 2026 Conference Paper

Weakly-Supervised Image Forgery Localization via Vision-Language Collaborative Reasoning Framework

  • Ziqi Sheng
  • Junyan Wu
  • Wei Lu
  • Jiantao Zhou

Image forgery localization aims to precisely identify tampered regions within images, but it commonly depends on costly pixel-level annotations. To alleviate this annotation burden, weakly supervised image forgery localization (WSIFL) has emerged, yet existing methods still achieve limited localization performance as they mainly exploit intra-image consistency clues and lack external semantic guidance to compensate for insufficient supervision information. In this paper, we propose ViLaCo, a vision-language collaborative reasoning framework that introduces auxiliary semantic supervision derived from pre-trained vision-language models (VLMs), enabling accurate pixel-level localization using only image-level labels. Specifically, we first employ a vision-language feature modeling network to jointly extract textual semantics and visual features by leveraging pre-trained VLMs. Next, an adaptive vision-language reasoning network aligns these features through mutual interactions, producing semantically aligned representations. Subsequently, these representations are passed into dual prediction heads, where the coarse head performs image-level classification and the fine head generates pixel-level localization masks, allowing the coarse-grained task to provide guidance for the fine-grained localization. Moreover, a contrastive patch consistency module is introduced to cluster tampered features while separating authentic ones, facilitating more reliable forgery discrimination. Extensive experiments on multiple public datasets demonstrate that ViLaCo substantially outperforms existing WSIFL methods, achieving state-of-the-art performance in both detection and localization accuracy.

PDF Details DOI

EAAI Journal 2025 Journal Article

A latent-coupled neural network for multiphysics long-term forecasting in reactor transients using sparse observations

  • Yu-Yan Xu
  • Jun Luo
  • Deng Pan
  • Wei Lu
  • Ting Liu
  • Guanghui Yuan
  • Minxiao Zhong
  • Qing Li

Complex dynamical systems in safety-critical applications like nuclear reactors involve strongly coupled physical fields evolving over space and time. Accurate prediction of these fields is vital for safety monitoring but is challenged by limited sensor placement and unobservable variables (e. g. , xenon and iodine concentrations). This paper proposes the Sparse observation to High-dimensional coupled physical field Prediction Network (SHPNet), a deep learning framework that predicts and reconstructs multiple physical fields directly from sparse observations. SHPNet combines a three-branch autoencoder to extract shared latent representations with a neural operator that models temporal dynamics in latent space, enabling efficient long-term forecasting. Evaluated on Hua-long Pressurized Reactor (HPR1000) under varying power and burnup conditions, SHPNet outperforms traditional frameworks and end-to-end model, achieving higher accuracy, robustness to observation sparsity, and effective reconstruction of unobservable fields. These results demonstrate SHPNet’s potential as a practical tool for real-time monitoring of complex coupled systems.

Details DOI

NeurIPS Conference 2025 Conference Paper

Accurately Predicting Protein Mutational Effects via a Hierarchical Many-Body Attention Network

  • Dahao Xu
  • Jiahua Rao
  • Mingming Zhu
  • Jixian Zhang
  • Wei Lu
  • Shuangjia Zheng
  • Yuedong Yang

Predicting changes in binding free energy ($\Delta\Delta G$) is essential for understanding protein-protein interactions, which are critical in drug design and protein engineering. However, existing methods often rely on pre-trained knowledge and heuristic features, limiting their ability to accurately model complex mutation effects, particularly higher-order and many-body interactions. To address these challenges, we propose H3-DDG, a Hypergraph-driven Hierarchical network to capture Higher-order many-body interactions across multiple scales. By introducing a hierarchical communication mechanism, H3-DDG effectively models both local and global mutational effects. Experimental results demonstrate state-of-the-art performance on multiple benchmarks. On the SKEMPI v2 dataset, H3-DDG achieves a Pearson correlation of 0. 75, improving multi-point mutations prediction by 12. 10%. On the challenging BindingGYM dataset, it outperforms Prompt-DDG and BA-DDG by 62. 61% and 34. 26%, respectively. Ablation and efficiency analyses demonstrate its robustness and scalability, while a case study on SARS-CoV-2 antibodies highlights its practical value in improving binding affinity for therapeutic design.

PDF Details

TMLR Journal 2025 Journal Article

FRAP: Faithful and Realistic Text-to-Image Generation with Adaptive Prompt Weighting

  • Liyao Jiang
  • Negar Hassanpour
  • Mohammad Salameh
  • Mohan Sai Singamsetti
  • Fengyu Sun
  • Wei Lu
  • Di Niu

Text-to-image (T2I) diffusion models have demonstrated impressive capabilities in generating high-quality images given a text prompt. However, ensuring the prompt-image alignment remains a considerable challenge, i.e., generating images that faithfully align with the prompt's semantics. Recent works attempt to improve the faithfulness by optimizing the latent code, which potentially could cause the latent code to go out-of-distribution and thus produce unrealistic images. In this paper, we propose FRAP, a simple, yet effective approach based on adaptively adjusting the per-token prompt weights to improve prompt-image alignment and authenticity of the generated images. We design an online algorithm to adaptively update each token's weight coefficient, which is achieved by minimizing a unified objective function that encourages object presence and the binding of object-modifier pairs. Through extensive evaluations, we show FRAP generates images with significantly higher prompt-image alignment to prompts from complex datasets, while having a lower average latency compared to recent latent code optimization methods, e.g., 4 seconds faster than D&B on the COCO-Subject dataset. Furthermore, through visual comparisons and evaluation of the CLIP-IQA-Real metric, we show that FRAP not only improves prompt-image alignment but also generates more authentic images with realistic appearances. We also explore combining FRAP with prompt rewriting LLM to recover their degraded prompt-image alignment, where we observe improvements in both prompt-image alignment and image quality. We release the code at the following link: https://github.com/LiyaoJiang1998/FRAP/.

PDF Details

AAAI Conference 2025 Conference Paper

GLCF: A Global-Local Multimodal Coherence Analysis Framework for Talking Face Generation Detection

  • Xiaocan Chen
  • Qilin Yin
  • Jiarui Liu
  • Wei Lu
  • Xiangyang Luo
  • Jiantao Zhou

Talking face generation (TFG) allows for producing lifelike talking videos of any character using only facial images and accompanying text. Abuse of this technology could pose significant risks to society, creating the urgent need for research into corresponding detection methods. However, research in this field has been hindered by the lack of public datasets. In this paper, we construct the first large-scale multi-scenario talking face dataset (MSTF), which contains 22 audio and video forgery techniques, filling the gap of datasets in this field. The dataset covers 11 generation scenarios and more than 20 semantic scenarios, closer to the practical application scenario of TFG. Besides, we also propose a TFG detection framework, which leverages the analysis of both global and local coherence in the multimodal content of TFG videos. Therefore, a region-focused smoothness detection module (RSFDM) and a discrepancy capture-time frame aggregation module (DCTAM) are introduced to evaluate the global temporal coherence of TFG videos, aggregating multi-grained spatial information. Additionally, a visual-audio fusion module (V-AFM) is designed to evaluate audiovisual coherence within a localized temporal perspective. Comprehensive experiments demonstrate the reasonableness and challenges of our datasets, while also indicating the superiority of our proposed method compared to the state-of-the-art deepfake detection approaches.

PDF Details DOI

AAAI Conference 2025 Conference Paper

Interweaving Memories of a Siamese Large Language Model

  • Xin Song
  • Zhikai Xue
  • Guoxiu He
  • Jiawei Liu
  • Wei Lu

Parameter-efficient fine-tuning (PEFT) methods optimize large language models (LLMs) by modifying or introducing a small number of parameters to enhance alignment with downstream tasks. However, they can result in catastrophic forgetting, where LLMs prioritize new knowledge at the expense of comprehensive world knowledge. A promising approach to mitigate this issue is to recall prior memories based on the original knowledge. To this end, we propose a model-agnostic PEFT framework, IMSM, which Interweaves Memories of a Siamese Large Language Model. Specifically, our siamese LLM is equipped with an existing PEFT method. Given an incoming query, it generates two distinct memories based on the pre-trained and fine-tuned parameters. IMSM then incorporates an interweaving mechanism that regulates the contributions of both original and enhanced memories when generating the next token. This framework is theoretically applicable to all open-source LLMs and existing PEFT methods. We conduct extensive experiments across various benchmark datasets, evaluating the performance of popular open-source LLMs using the proposed IMSM, in comparison to both classical and leading PEFT methods. Our findings indicate that IMSM maintains comparable time and space efficiency to backbone PEFT methods while significantly improving performance and effectively mitigating catastrophic forgetting.

PDF Details DOI

AAAI Conference 2025 Conference Paper

Joint Knowledge Editing for Information Enrichment and Probability Promotion

  • Wenhang Shi
  • Yiren Chen
  • Shuqing Bian
  • Xinyi Zhang
  • Zhe Zhao
  • Pengfei Hu
  • Wei Lu
  • Xiaoyong Du

Knowledge stored in large language models requires timely updates to reflect the dynamic nature of real-world information. To update the knowledge, most knowledge editing methods focus on the low layers, since recent probes into the knowledge recall process reveal that the answer information is enriched in low layers. However, these probes only and could only reveal critical recall stages for the original answers, while the goal of editing is to rectify model's prediction for the target answers. This inconsistency indicates that both the probe approaches and the associated editing methods are deficient. To mitigate the inconsistency and identify critical editing regions, we propose a contrast-based probe approach, and locate two crucial stages where the model behavior diverges between the original and target answers: Information Enrichment in low layers and Probability Promotion in high layers. Building upon the insights, we develop the Joint knowledge Editing for information Enrichment and probability Promotion (JEEP) method, which jointly edits both the low and high layers to modify the two critical recall stages. Considering the mutual interference and growing forgetting due to dual modifications, JEEP is designed to ensure that updates to distinct regions share the same objectives and are complementary. We rigorously evaluate JEEP by editing up to thousands of facts on various models, i.e., GPT-J (6B) and LLaMA (7B), and addressing diverse editing objectives, i.e., adding factual and counterfactual knowledge. In all tested scenarios, JEEP achieves best performances, validating the effectiveness of the revealings of our probe approach and the designs of our editing method.

PDF Details DOI

NeurIPS Conference 2025 Conference Paper

No Loss, No Gain: Gated Refinement and Adaptive Compression for Prompt Optimization

  • Wenhang Shi
  • Yiren Chen
  • Shuqing Bian
  • Xinyi Zhang
  • Kai Tang
  • Pengfei Hu
  • Zhe Zhao
  • Wei Lu

Prompt engineering is crucial for leveraging the full potential of large language models (LLMs). While automatic prompt optimization offers a scalable alternative to costly manual design, generating effective prompts remains challenging. Existing methods often struggle to stably generate improved prompts, leading to low efficiency, and overlook that prompt optimization easily gets trapped in local optima. Addressing this, we propose GRACE, a framework that integrates two synergistic strategies: Gated Refinement and Adaptive Compression, achieving Efficient prompt optimization. The gated refinement strategy introduces a feedback regulation gate and an update rejection gate, which refine update signals to produce stable and effective prompt improvements. When optimization stagnates, the adaptive compression strategy distills the prompt’s core concepts, restructuring the optimization trace and opening new paths. By strategically introducing information loss through refinement and compression, GRACE delivers substantial gains in performance and efficiency. In extensive experiments on 11 tasks across three practical domains, including BIG-Bench Hard (BBH), domain-specific, and general NLP tasks, GRACE achieves significant average relative performance improvements of 4. 7\%, 4. 4\% and 2. 7\% over state-of-the-art methods, respectively. Further analysis shows that GRACE achieves these gains using only 25\% of the prompt generation budget required by prior methods, highlighting its high optimization efficiency and low computational overhead. Our code is available at https: //github. com/Eric8932/GRACE.

PDF Details

JBHI Journal 2025 Journal Article

PFPRNet: A Phase-Wise Feature Pyramid With Retention Network for Polyp Segmentation

  • Jinghui Chu
  • Wangtao Liu
  • Qi Tian
  • Wei Lu

Early detection of colonic polyps is crucial for the prevention and diagnosis of colorectal cancer. Currently, deep learning-based polyp segmentation methods have become mainstream and achieved remarkable results. Acquiring a large number of labeled data is time-consuming and labor-intensive, and meanwhile the presence of numerous similar wrinkles in polyp images also hampers model prediction performance. In this paper, we propose a novel approach called Phase-wise Feature Pyramid with Retention Network (PFPRNet), which leverages a pre-trained Transformer-based Encoder to obtain multi-scale feature maps. A Phase-wise Feature Pyramid with Retention Decoder is designed to gradually integrate global features into local features and guide the model's attention towards key regions. Additionally, our custom Enhance Perception module enables capturing image information from a broader perspective. Finally, we introduce an innovative Low-layer Retention module as an alternative to Transformer for more efficient global attention modeling. Evaluation results on several widely-used polyp segmentation datasets demonstrate that our proposed method has strong learning ability and generalization capability, and outperforms the state-of-the-art approaches.

Details DOI

AAAI Conference 2025 Conference Paper

Qua2SeDiMo: Quantifiable Quantization Sensitivity of Diffusion Models

  • Keith G. Mills
  • Mohammad Salameh
  • Ruichen Chen
  • Negar Hassanpour
  • Wei Lu
  • Di Niu

Diffusion Models (DM) have democratized AI image generation through an iterative denoising process. Quantization is a major technique to alleviate the inference cost and reduce the size of DM denoiser networks. However, as denoisers evolve from variants of convolutional U-Nets toward newer Transformer architectures, it is of growing importance to understand the quantization sensitivity of different weight layers, operations and architecture types to performance. In this work, we address this challenge with Qua2SeDiMo, a mixed-precision Post-Training Quantization framework that generates explainable insights on the cost-effectiveness of various model weight quantization methods for different denoiser operation types and block structures. We leverage these insights to make high-quality mixed-precision quantization decisions for a myriad of diffusion models ranging from foundational U-Nets to state-of-the-art Transformers. As a result, Qua2SeDiMo can construct 3.4-bit, 3.9-bit, 3.65-bit and 3.7-bit weight quantization on PixArt-α, PixArt-Σ, Hunyuan-DiT and SDXL, respectively. We further pair our weight-quantization configurations with 6-bit activation quantization and outperform existing approaches in terms of quantitative metrics and generative image quality.

PDF Details DOI

AAAI Conference 2025 Conference Paper

RaCMC: Residual-Aware Compensation Network with Multi-Granularity Constraints for Fake News Detection

  • Xinquan Yu
  • Ziqi Sheng
  • Wei Lu
  • Xiangyang Luo
  • Jiantao Zhou

Multimodal fake news detection aims to automatically identify real or fake news, thereby mitigating the adverse effects caused by such misinformation. Although prevailing approaches have demonstrated their effectiveness, challenges persist in cross-modal feature fusion and refinement for classification. To address this, we present a residual-aware compensation network with multi-granularity constraints (RaCMC) for fake news detection, that aims to sufficiently interact and fuse cross-modal features while amplifying the differences between real and fake news. First, a multiscale residual-aware compensation module is designed to interact and fuse features at different scales, and ensure both the consistency and exclusivity of feature interaction, thus acquiring high-quality features. Second, a multi-granularity constraints module is implemented to limit the distribution of both the news overall and the image-text pairs within the news, thus amplifying the differences between real and fake news at the news and feature levels. Finally, a dominant feature fusion reasoning module is developed to comprehensively evaluate news authenticity from the perspectives of both consistency and inconsistency. Experiments on three public datasets, including Weibo17, Politifact and GossipCop, reveal the superiority of the proposed method.

PDF Details DOI

ICML Conference 2025 Conference Paper

Satori: Reinforcement Learning with Chain-of-Action-Thought Enhances LLM Reasoning via Autoregressive Search

  • Maohao Shen
  • Guangtao Zeng
  • Zhenting Qi
  • Zhang-Wei Hong
  • Zhenfang Chen
  • Wei Lu
  • Gregory W. Wornell
  • Subhro Das

Large language models (LLMs) have demonstrated remarkable reasoning capabilities across diverse domains. Recent studies have shown that increasing test-time computation enhances LLMs’ reasoning capabilities. This typically involves extensive sampling at inference time guided by an external LLM verifier, resulting in a two-player system. Despite external guidance, the effectiveness of this system demonstrates the potential of a single LLM to tackle complex tasks. Thus, we pose a new research problem: Can we internalize the searching capabilities to fundamentally enhance the reasoning abilities of a single LLM? This work explores an orthogonal direction focusing on post-training LLMs for autoregressive searching ( i. e. , an extended reasoning process with self-reflection and self-exploration of new strategies). To achieve this, we propose the Chain-of-Action-Thought (COAT) reasoning and a two-stage training paradigm: 1) a small-scale format tuning stage to internalize the COAT reasoning format and 2) a large-scale self-improvement stage leveraging reinforcement learning. Our approach results in Satori, a 7B LLM trained on open-source models and data. Extensive empirical evaluations demonstrate that Satori achieves state-of-the-art performance on mathematical reasoning benchmarks while exhibits strong generalization to out-of-domain tasks. Code, data, and models are fully open-sourced.

Details

AAAI Conference 2025 Conference Paper

SUMI-IFL: An Information-Theoretic Framework for Image Forgery Localization with Sufficiency and Minimality Constraints

  • Ziqi Sheng
  • Wei Lu
  • Xiangyang Luo
  • Jiantao Zhou
  • Xiaochun Cao

Image forgery localization (IFL) is a crucial technique for preventing tampered image misuse and protecting social safety. However, due to the rapid development of image tampering technologies, extracting more comprehensive and accurate forgery clues remains an urgent challenge. To address these challenges, we introduce a novel information-theoretic IFL framework named SUMI-IFL that imposes sufficiency-view and minimality-view constraints on forgery feature representation. First, grounded in the theoretical analysis of mutual information, the sufficiency-view constraint is enforced on the feature extraction network to ensure that the latent forgery feature contains comprehensive forgery clues. Considering that forgery clues obtained from a single aspect alone may be incomplete, we construct the latent forgery feature by integrating several orthogonal individual image features. Second, based on the information bottleneck, the minimality-view constraint is imposed on the feature reasoning network to achieve an accurate and concise forgery feature representation that counters the interference of task-unrelated features. Extensive experiments show the superior performance of SUMI-IFL to existing state-of-the-art methods, not only on in-dataset comparisons but also on cross-dataset comparisons.

PDF Details DOI

TMLR Journal 2025 Journal Article

Synthetic Data (Almost) from Scratch: Generalized Instruction Tuning for Language Models

  • Haoran Li
  • Qingxiu Dong
  • Zhengyang Tang
  • Chaojun Wang
  • Xingxing Zhang
  • Haoyang Huang
  • Shaohan Huang
  • Xiaolong Huang

We introduce Generalized Instruction Tuning (called GLAN), a general and scalable method for instruction tuning of Large Language Models (LLMs). Unlike prior work that relies on seed examples or existing datasets to construct instruction-tuning data, GLAN exclusively utilizes a pre-curated taxonomy of human knowledge and capabilities as input and generates large-scale synthetic instruction data across all disciplines. Specifically, inspired by the systematic structure in human education system, we build the taxonomy by decomposing human knowledge and capabilities to various fields, sub-fields and ultimately, distinct disciplines semi-automatically, facilitated by LLMs. Subsequently, we generate a comprehensive list of subjects for every discipline and proceed to design a syllabus tailored to each subject, again utilizing LLMs. With the fine-grained key concepts detailed in every class session of the syllabus, we are able to generate diverse instructions with a broad coverage across the entire spectrum of human knowledge and skills. Extensive experiments on large language models (e.g., Mistral) demonstrate that GLAN excels in multiple dimensions from mathematical reasoning, coding, academic exams, logical reasoning to general instruction following without using task-specific training data of these tasks. In addition, GLAN allows for easy customization and new fields or skills can be added by simply incorporating a new node into our taxonomy. While promising, our approach may inherit biases or inaccuracies from LLM-generated data as in other synthetic data work and is primarily evaluated on exam-style benchmarks. Broader evaluations and data quality control are left for future work.

PDF Details

IJCAI Conference 2025 Conference Paper

Weakly-supervised Audio Temporal Forgery Localization via Progressive Audio-language Co-learning Network

  • Junyan Wu
  • Wenbo Xu
  • Wei Lu
  • Xiangyang Luo
  • Rui Yang
  • Shize Guo

Audio temporal forgery localization (ATFL) aims to find the precise forgery regions of the partial spoof audio that is purposefully modified. Existing ATFL methods rely on training efficient networks using fine-grained annotations, which are obtained costly and challenging in real-world scenarios. To meet this challenge, in this paper, we propose a progressive audio-language co-learning network (LOCO) that adopts co-learning and self-supervision manners to prompt localization performance under weak supervision scenarios. Specifically, an audio-language co-learning module is first designed to capture forgery consensus features by aligning semantics from temporal and global perspectives. In this module, forgery-aware prompts are constructed by using utterance-level annotations together with learnable prompts, which can incorporate semantic priors into temporal content features dynamically. In addition, a forgery localization module is applied to produce forgery proposals based on fused forgery-class activation sequences. Finally, a progressive refinement strategy is introduced to generate pseudo frame-level labels and leverage supervised semantic contrastive learning to amplify the semantic distinction between real and fake content, thereby continuously optimizing forgery-aware features. Extensive experiments show that the proposed LOCO achieves SOTA performance on three public benchmarks.

PDF Details DOI

IJCAI Conference 2024 Conference Paper

G2LTraj: A Global-to-Local Generation Approach for Trajectory Prediction

  • Zhanwei Zhang
  • Zishuo Hua
  • Minghao Chen
  • Wei Lu
  • Binbin Lin
  • Deng Cai
  • Wenxiao Wang

Predicting future trajectories of traffic agents accurately holds substantial importance in various applications such as autonomous driving. Previous methods commonly infer all future steps of an agent either recursively or simultaneously. However, the recursive strategy suffers from the accumulated error, while the simultaneous strategy overlooks the constraints among future steps, resulting in kinematically infeasible predictions. To address these issues, in this paper, we propose G2LTraj, a plug-and-play global-to-local generation approach for trajectory prediction. Specifically, we generate a series of global key steps that uniformly cover the entire future time range. Subsequently, the local intermediate steps between the adjacent key steps are recursively filled in. In this way, we prevent the accumulated error from propagating beyond the adjacent key steps. Moreover, to boost the kinematical feasibility, we not only introduce the spatial constraints among key steps but also strengthen the temporal constraints among the intermediate steps. Finally, to ensure the optimal granularity of key steps, we design a selectable granularity strategy that caters to each predicted trajectory. Our G2LTraj significantly improves the performance of seven existing trajectory predictors across the ETH, UCY and nuScenes datasets. Experimental results demonstrate its effectiveness. Code will be available at https: //github. com/Zhanwei-Z/G2LTraj.

PDF Details DOI

TMLR Journal 2024 Journal Article

Generative Models are Self-Watermarked: Declaring Model Authentication through Re-Generation

  • Aditya Desu
  • Xuanli He
  • Qiongkai Xu
  • Wei Lu

As machine- and AI-generated content proliferates, protecting the intellectual property of generative models has become imperative, yet verifying data ownership poses formidable challenges, particularly in cases of unauthorized reuse of generated data. Confirming the ownership of the data is challenging, as the data generation process is opaque to those verifying the authenticity. Our work is dedicated to detecting data reuse from a single sample. While watermarking has been the traditional method to detect AI-generated content by embedding specific information within models or their outputs, which could compromise the quality of outputs, our approach instead identifies inherent fingerprints in the outputs without altering models. The verification is achieved by requiring the (authentic) models to re-generate the data. Furthermore, we propose a method that iteratively re-generates the data to enhance these fingerprints in the generation stage. The strategy is both theoretically sound and empirically proven effective with recent advanced text and image generative models. Our approach is significant because it avoids extra operations or measures, such as (1) modifying model parameters, (2) altering the generated outputs, or (3) employing additional classification models for verification. This enhancement broadens the applicability of authorship verification (1) to track the IP violation in generative models published without explicitly designed watermark mechanisms and (2) to produce outputs without compromising their quality.

PDF Details

AIIM Journal 2024 Journal Article

Walking representation and simulation based on multi-source image fusion and multi-agent reinforcement learning for gait rehabilitation

  • Yean Zhu
  • Meirong Xiao
  • Dan Robbins
  • Xiaoying Wu
  • Wei Lu
  • Wensheng Hou

In the formulation of strategies for walking rehabilitation, achieving precise identification of the current state and making rational predictions about the future state are crucial but often unrealized. To tackle this challenge, our study introduces a unified framework that integrates a novel 3D walking motion capture method using multi-source image fusion and a walking rehabilitation simulation approach based on multi-agent reinforcement learning. We found that, (i) the proposal achieved an accurate 3D walking motion capture and outperforms other advanced methods. Experimental evidence indicates that, compared to similar visual skeleton tracking methods, the proposed approach yields results with higher Pearson correlation ( r = 0. 93 ), intra-class correlation coefficient ( I C C ( 2, 1 ) = 0. 91 ), and narrower confidence intervals ( [ 0. 90, 0. 95 ] for r, [ 0. 88, 0. 94 ] for I C C ( 2, 1 ) ) when compared to standard results. The outcomes of the proposed approach also exhibit commendable correlation and concurrence with those obtained through the IMU-based skeleton tracking method in the assessment of gait parameters ( [ 0. 85, 0. 89 ] for r, [ 0. 75, 0. 81 ] for I C C ( 2, 1 ) ); (ii) multi-agent reinforcement learning has the potential to be used to solve the simulation task of gait rehabilitation. In mimicry experiment, our proposed simulation method for gait rehabilitation not only enables the intelligent agent to converge from the initial state to the target state, but also observes evolutionary patterns similar to those observed in clinical practice through motor state resolution. This study offers valuable contributions to walking rehabilitation, enabling precise assessment and simulation-based interventions, with potential implications for clinical practice and patient outcomes.

Details DOI

AAAI Conference 2023 Conference Paper

AIO-P: Expanding Neural Performance Predictors beyond Image Classification

  • Keith G. Mills
  • Di Niu
  • Mohammad Salameh
  • Weichen Qiu
  • Fred X. Han
  • Puyuan Liu
  • Jialin Zhang
  • Wei Lu

Evaluating neural network performance is critical to deep neural network design but a costly procedure. Neural predictors provide an efficient solution by treating architectures as samples and learning to estimate their performance on a given task. However, existing predictors are task-dependent, predominantly estimating neural network performance on image classification benchmarks. They are also search-space dependent; each predictor is designed to make predictions for a specific architecture search space with predefined topologies and set of operations. In this paper, we propose a novel All-in-One Predictor (AIO-P), which aims to pretrain neural predictors on architecture examples from multiple, separate computer vision (CV) task domains and multiple architecture spaces, and then transfer to unseen downstream CV tasks or neural architectures. We describe our proposed techniques for general graph representation, efficient predictor pretraining and knowledge infusion techniques, as well as methods to transfer to downstream tasks/spaces. Extensive experimental results show that AIO-P can achieve Mean Absolute Error (MAE) and Spearman’s Rank Correlation (SRCC) below 1p% and above 0.5, respectively, on a breadth of target downstream CV tasks with or without fine-tuning, outperforming a number of baselines. Moreover, AIO-P can directly transfer to new architectures not seen during training, accurately rank them and serve as an effective performance estimator when paired with an algorithm designed to preserve performance while reducing FLOPs.

PDF Details DOI

NeurIPS Conference 2023 Conference Paper

AutoGO: Automated Computation Graph Optimization for Neural Network Evolution

  • Mohammad Salameh
  • Keith Mills
  • Negar Hassanpour
  • Fred Han
  • Shuting Zhang
  • Wei Lu
  • Shangling Jui
  • Chunhua Zhou

Optimizing Deep Neural Networks (DNNs) to obtain high-quality models for efficient real-world deployment has posed multi-faceted challenges to machine learning engineers. Existing methods either search for neural architectures in heuristic design spaces or apply low-level adjustments to computation primitives to improve inference efficiency on hardware. We present Automated Graph Optimization (AutoGO), a framework to evolve neural networks in a low-level Computation Graph (CG) of primitive operations to improve both its performance and hardware friendliness. Through a tokenization scheme, AutoGO performs variable-sized segment mutations, making both primitive changes and larger-grained changes to CGs. We introduce our segmentation and mutation algorithms, efficient frequent segment mining technique, as well as a pretrained context-aware predictor to estimate the impact of segment replacements. Extensive experimental results show that AutoGO can automatically evolve several typical large convolutional networks to achieve significant task performance improvement and FLOPs reduction on a range of CV tasks, ranging from Classification, Semantic Segmentation, Human Pose Estimation, to Super Resolution, yet without introducing any newer primitive operations. We also demonstrate the lightweight deployment results of AutoGO-optimized super-resolution and denoising U-Nets on a cycle simulator for a Neural Processing Unit (NPU), achieving PSNR improvement and latency/power reduction simultaneously. Code available at https: //github. com/Ascend-Research/AutoGO.

PDF Details

AAAI Conference 2023 Conference Paper

GENNAPE: Towards Generalized Neural Architecture Performance Estimators

  • Keith G. Mills
  • Fred X. Han
  • Jialin Zhang
  • Fabian Chudak
  • Ali Safari Mamaghani
  • Mohammad Salameh
  • Wei Lu
  • Shangling Jui

Predicting neural architecture performance is a challenging task and is crucial to neural architecture design and search. Existing approaches either rely on neural performance predictors which are limited to modeling architectures in a predefined design space involving specific sets of operators and connection rules, and cannot generalize to unseen architectures, or resort to Zero-Cost Proxies which are not always accurate. In this paper, we propose GENNAPE, a Generalized Neural Architecture Performance Estimator, which is pretrained on open neural architecture benchmarks, and aims to generalize to completely unseen architectures through combined innovations in network representation, contrastive pretraining, and a fuzzy clustering-based predictor ensemble. Specifically, GENNAPE represents a given neural network as a Computation Graph (CG) of atomic operations which can model an arbitrary architecture. It first learns a graph encoder via Contrastive Learning to encourage network separation by topological features, and then trains multiple predictor heads, which are soft-aggregated according to the fuzzy membership of a neural network. Experiments show that GENNAPE pretrained on NAS-Bench-101 can achieve superior transferability to 5 different public neural network benchmarks, including NAS-Bench-201, NAS-Bench-301, MobileNet and ResNet families under no or minimum fine-tuning. We further introduce 3 challenging newly labelled neural network benchmarks: HiAML, Inception and Two-Path, which can concentrate in narrow accuracy ranges. Extensive experiments show that GENNAPE can correctly discern high-performance architectures in these families. Finally, when paired with a search algorithm, GENNAPE can find architectures that improve accuracy while reducing FLOPs on three families.

PDF Details DOI

EAAI Journal 2023 Journal Article

Online classification of soybean seeds based on deep learning

  • Wei Lin
  • Lei Shu
  • Weibo Zhong
  • Wei Lu
  • Daoyi Ma
  • Yizhen Meng

To quickly evaluate soybean quality, we proposed a deep learning-based method for online classification of soybean seeds. Firstly, images of soybean seeds with uneven illumination were segmented based on the multi-scale Retinex with color restoration (MSRCR). Then, a convolutional neural network (CNN) was constructed to achieve soybean seed four-classification with appropriate parameters. The F-score of the normal, damaged, abnormal, and non-classifiable soybeans reached about 95. 97%, 97. 41%, 97. 25%, and 96. 14%, respectively. Finally, the method was successfully applied in NVIDIA Jetson TX2 with an accuracy of 95. 63% and an average classification time of 4. 92 ms for a soybean seed, which can meet the requirement of online soybean quality assessment.

Details DOI

IS Journal 2022 Journal Article

Deep Fusion for Travel Time Estimation Based on Road Network Topology

  • Fuyong Sun
  • Ruipeng Gao
  • Weiwei Xing
  • Yaoxue Zhang
  • Wei Lu
  • Jun Fang
  • Shui Liu

With the wide application of vehicular location-based services, precise estimation of the travel time plays a crucial role in intelligent transportation systems, such as driving navigation, traffic monitoring, and route planning. Recent methods have made significant progress on public datasets, but are not satisfied for current ride-hailing platforms with complex road network topology and dynamic traffic fluctuation. In this article, we propose an end-to-end Deep Fusion framework for Travel Time Estimation, which exploits multisource heterogeneous traffic information within an encoder–decoder architecture. Specifically, we explore a relational fusion network to learn the relationship of road link segments, and employ an attention mechanism to capture efficient correlations among spatial and temporal features. Extensive experiments have been conducted on two large-scale real-world traffic datasets collected by DiDi Corporation (DiDi) platform, and the results have demonstrated our effectiveness compared with the state of the art.

Details DOI

TCS Journal 2022 Journal Article

Hardness and approximation for the star p-Hub Routing Cost Problem in metric graphs

  • Hao-Ping Yeh
  • Wei Lu
  • Li-Hsuan Chen
  • Ling-Ju Hung
  • Ralf Klasing
  • Sun-Yuan Hsieh

Given a metric graph G = ( V, E, w ), a specific vertex c ∈ V, and an integer p, let T be a depth-2 spanning tree of G rooted at c such that c is adjacent to p vertices called hubs and each of the remaining vertices is adjacent to a hub. The Star p -Hub Routing Cost Problem is to find a spanning tree T of G satisfying the conditions stated above such that the sum of distances between all pairs of vertices in T is minimized. In this paper, we prove that the Star p -Hub Routing Cost Problem is NP-hard. A 3-approximation algorithm running in time O ( n 2 ) is given for solving the same problem where n is the number of vertices in the input graph. Moreover, we give an example to show that the analysis of the approximation ratio cannot be better than 2 − ϵ for any ϵ > 0.

Details DOI

ICLR Conference 2022 Conference Paper

Learning Guarantees for Graph Convolutional Networks on the Stochastic Block Model

  • Wei Lu

An abundance of neural network models and algorithms for diverse tasks on graphs have been developed in the past five years. However, very few provable guarantees have been available for the performance of graph neural network models. This state of affairs is in contrast with the steady progress on the theoretical underpinnings of traditional dense and convolutional neural networks. In this paper we present the first provable guarantees for one of the best-studied families of graph neural network models, Graph Convolutional Networks (GCNs), for semi- supervised community detection tasks. We show that with high probability over the initialization and training data, a GCN will efficiently learn to detect communities on graphs drawn from a stochastic block model. Our proof relies on a fine-grained analysis of the training dynamics in order to overcome the complexity of a non-convex optimization landscape with many poorly-performing local minima.

Details

AAAI Conference 2022 Conference Paper

Sample Average Approximation for Stochastic Optimization with Dependent Data: Performance Guarantees and Tractability

  • Yafei Wang
  • Bo Pan
  • Wei Tu
  • Peng Liu
  • Bei Jiang
  • Chao Gao
  • Wei Lu
  • Shangling Jui

Sample average approximation (SAA), a popular method for tractably solving stochastic optimization problems, enjoys strong asymptotic performance guarantees in settings with independent training samples. However, these guarantees are not known to hold generally with dependent samples, such as in online learning with time series data or distributed computing with Markovian training samples. In this paper, we show that SAA remains tractable when the distribution of unknown parameters is only observable through dependent instances and still enjoys asymptotic consistency and finite sample guarantees. Specifically, we provide a rigorous probability error analysis to derive 1 - beta confidence bounds for the out-of-sample performance of SAA estimators and show that these estimators are asymptotically consistent. We then, using monotone operator theory, study the performance of a class of stochastic first-order algorithms trained on a dependent source of data. We show that approximation error for these algorithms is bounded and concentrates around zero, and establish deviation bounds for iterates when the underlying stochastic process is phi-mixing. The algorithms presented can be used to handle numerically inconvenient loss functions such as the sum of a smooth and non-smooth function or of non-smooth functions with constraints. To illustrate the usefulness of our results, we present several stochastic versions of popular algorithms such as stochastic proximal gradient descent (S-PGD), stochastic relaxed Peaceman– Rachford splitting algorithms (S-rPRS), and numerical experiment.

PDF Details

NeurIPS Conference 2022 Conference Paper

TANKBind: Trigonometry-Aware Neural NetworKs for Drug-Protein Binding Structure Prediction

  • Wei Lu
  • Qifeng Wu
  • Jixian Zhang
  • Jiahua Rao
  • Chengtao Li
  • Shuangjia Zheng

Illuminating interactions between proteins and small drug molecules is a long-standing challenge in the field of drug discovery. Despite the importance of understanding these interactions, most previous works are limited by hand-designed scoring functions and insufficient conformation sampling. The recently-proposed graph neural network-based methods provides alternatives to predict protein-ligand complex conformation in a one-shot manner. However, these methods neglect the geometric constraints of the complex structure and weaken the role of local functional regions. As a result, they might produce unreasonable conformations for challenging targets and generalize poorly to novel proteins. In this paper, we propose Trigonometry-Aware Neural networKs for binding structure prediction, TANKBind, that builds trigonometry constraint as a vigorous inductive bias into the model and explicitly attends to all possible binding sites for each protein by segmenting the whole protein into functional blocks. We construct novel contrastive losses with local region negative sampling to jointly optimize the binding interaction and affinity. Extensive experiments show substantial performance gains in comparison to state-of-the-art physics-based and deep learning-based methods on commonly-used benchmark datasets for both binding structure and affinity predictions with variant settings.

PDF Details

IJCAI Conference 2021 Conference Paper

Generative Adversarial Neural Architecture Search

  • Seyed Saeed Changiz Rezaei
  • Fred X. Han
  • Di Niu
  • Mohammad Salameh
  • Keith Mills
  • Shuo Lian
  • Wei Lu
  • Shangling Jui

Despite the empirical success of neural architecture search (NAS) in deep learning applications, the optimality, reproducibility and cost of NAS schemes remain hard to assess. In this paper, we propose Generative Adversarial NAS (GA-NAS) with theoretically provable convergence guarantees, promoting stability and reproducibility in neural architecture search. Inspired by importance sampling, GA-NAS iteratively fits a generator to previously discovered top architectures, thus increasingly focusing on important parts of a large search space. Furthermore, we propose an efficient adversarial learning approach, where the generator is trained by reinforcement learning based on rewards provided by a discriminator, thus being able to explore the search space without evaluating a large number of architectures. Extensive experiments show that GA-NAS beats the best published results under several cases on three public NAS benchmarks. In the meantime, GA-NAS can handle ad-hoc search constraints and search spaces. We show that GA-NAS can be used to improve already optimized baselines found by other NAS methods, including EfficientNet and ProxylessNAS, in terms of ImageNet accuracy or the number of parameters, in their original search space.

PDF Details DOI

AAMAS Conference 2021 Conference Paper

Learning Cooperative Solution Concepts from Voting Behavior: A Case Study on the Israeli Knesset

  • Omer Lev
  • Wei Lu
  • Alan Tsang
  • Yair Zick

Most frameworks for computing solution concepts in hedonic games are theoretical in nature, and require complete knowledge of all agent preferences, an impractical assumption in real-world settings. This paper presents the first application of strategic hedonic game models on real-world data. We show that PAC stable solutions can reflect Members of Knesset’ political positions and reveal politicians who are known to deviate from party lines. Moreover, these models compare favorably to machine learning models.

PDF

EAAI Journal 2021 Journal Article

Long-term prediction of time series using fuzzy cognitive maps

  • Guoliang Feng
  • Liyong Zhang
  • Jianhua Yang
  • Wei Lu

As a powerful recognized knowledge modeling tool, fuzzy cognitive maps (FCMs) have been investigated for time series modeling and forecasting problems. This methodology performs well in one-step-ahead or short-term prediction but poorly in terms of long-term prediction because of the potentially complex interaction between different ensuing steps. In this article, a sound conceptual method is proposed for long-term time series prediction with FCMs, which melds FCMs, time series segmentation and fuzzy clustering. A time series is divided into suitable and internally homogeneous segments. Dynamic time warping is introduced to evaluate the distance between segments. Subsequently, modified fuzzy c-means based on dynamic time warping is utilized to fuzzify these segments such that the segments are transformed into fuzzy time series and semantic vectors. The convex optimization based method is utilized with intent to rapidly and robustly learn FCMs. Consequently, the weight of FCMs can be obtained on the basis of the fuzzy time series. Eventually, the forecasting time segment will be capable of inference according to the formed FCMs and the semantic vectors. In addition, the semantic vectors can intuitively reflect the main characteristics and change tendencies of the time series. To demonstrate the long-term prediction ability of our method, we test it on both synthetic and real-life datasets in comparison with other representative and up-to-date forecasting methods; the superior performance of our method exhibits its excellent capability in forecasting future values.

Details DOI

AAAI Conference 2021 Conference Paper

Time to Transfer: Predicting and Evaluating Machine-Human Chatting Handoff

  • Jiawei Liu
  • Zhe Gao
  • Yangyang Kang
  • Zhuoren Jiang
  • Guoxiu He
  • Changlong Sun
  • Xiaozhong Liu
  • Wei Lu

Is chatbot able to completely replace the human agent? The short answer could be – “it depends. .. ”. For some challenging cases, e. g. , dialogue’s topical spectrum spreads beyond the training corpus coverage, the chatbot may malfunction and return unsatisfied utterances. This problem can be addressed by introducing the Machine-Human Chatting Handoff (MHCH) which enables human-algorithm collaboration. To detect the normal/transferable utterances, we propose a Difficulty-Assisted Matching Inference (DAMI) network, utilizing difficulty-assisted encoding to enhance the representations of utterances. Moreover, a matching inference mechanism is introduced to capture the contextual matching features. A new evaluation metric, Golden Transfer within Tolerance (GT-T), is proposed to assess the performance by considering the tolerance property of the MHCH. To provide insights into the task and validate the proposed model, we collect two new datasets. Extensive experimental results are presented and contrasted against a series of baseline models to demonstrate the efficacy of our model on MHCH.

PDF Details

AAAI Conference 2020 Conference Paper

Adversarial Deep Network Embedding for Cross-Network Node Classification

  • Xiao Shen
  • Quanyu Dai
  • Fu-lai Chung
  • Wei Lu
  • Kup-Sze Choi

In this paper, the task of cross-network node classification, which leverages the abundant labeled nodes from a source network to help classify unlabeled nodes in a target network, is studied. The existing domain adaptation algorithms generally fail to model the network structural information, and the current network embedding models mainly focus on single-network applications. Thus, both of them cannot be directly applied to solve the cross-network node classification problem. This motivates us to propose an adversarial cross-network deep network embedding (ACDNE) model to integrate adversarial domain adaptation with deep network embedding so as to learn network-invariant node representations that can also well preserve the network structural information. In ACDNE, the deep network embedding module utilizes two feature extractors to jointly preserve attributed affinity and topological proximities between nodes. In addition, a node classifier is incorporated to make node representations label-discriminative. Moreover, an adversarial domain adaptation technique is employed to make node representations network-invariant. Extensive experimental results demonstrate that the proposed ACDNE model achieves the state-of-the-art performance in cross-network node classification.

PDF Details

AAAI Conference 2020 Conference Paper

Knowing What, How and Why: A Near Complete Solution for Aspect-Based Sentiment Analysis

  • Haiyun Peng
  • Lu Xu
  • Lidong Bing
  • Fei Huang
  • Wei Lu
  • Luo Si

Target-based sentiment analysis or aspect-based sentiment analysis (ABSA) refers to addressing various sentiment analysis tasks at a fine-grained level, which includes but is not limited to aspect extraction, aspect sentiment classification, and opinion extraction. There exist many solvers of the above individual subtasks or a combination of two subtasks, and they can work together to tell a complete story, i. e. the discussed aspect, the sentiment on it, and the cause of the sentiment. However, no previous ABSA research tried to provide a complete solution in one shot. In this paper, we introduce a new subtask under ABSA, named aspect sentiment triplet extraction (ASTE). Particularly, a solver of this task needs to extract triplets (What, How, Why) from the inputs, which show WHAT the targeted aspects are, HOW their sentiment polarities are and WHY they have such polarities (i. e. opinion reasons). For instance, one triplet from “Waiters are very friendly and the pasta is simply average” could be (‘Waiters’, positive, ‘friendly’). We propose a two-stage framework to address this task. The first stage predicts what, how and why in a unified model, and then the second stage pairs up the predicted what (how) and why from the first stage to output triplets. In the experiments, our framework has set a benchmark performance in this novel triplet extraction task. Meanwhile, it outperforms a few strong baselines adapted from state-of-the-art related methods.

PDF Details

IJCAI Conference 2020 Conference Paper

Learning Latent Forests for Medical Relation Extraction

  • Zhijiang Guo
  • Guoshun Nan
  • Wei Lu
  • Shay B. Cohen

The goal of medical relation extraction is to detect relations among entities, such as genes, mutations and drugs in medical texts. Dependency tree structures have been proven useful for this task. Existing approaches to such relation extraction leverage off-the-shelf dependency parsers to obtain a syntactic tree or forest for the text. However, for the medical domain, low parsing accuracy may lead to error propagation downstream the relation extraction pipeline. In this work, we propose a novel model which treats the dependency structure as a latent variable and induces it from the unstructured text in an end-to-end fashion. Our model can be understood as composing task-specific dependency forests that capture non-local interactions for better relation extraction. Extensive results on four datasets show that our model is able to significantly outperform state-of-the-art systems without relying on any direct tree supervision or pre-training.

PDF Details DOI

AIIM Journal 2020 Journal Article

Random Forest enhancement using improved Artificial Fish Swarm for the medial knee contact force prediction

  • Yean Zhu
  • Weiyi XU
  • Guoliang Luo
  • Haolun Wang
  • Jingjing Yang
  • Wei Lu

Knee contact force (KCF) is an important factor to evaluate the knee joint function for the patients with knee joint impairment. However, the KCF measurement based on the instrumented prosthetic implants or inverse dynamics analysis is limited due to the invasive, expensive price and time consumption. In this work, we propose a KCF prediction method by integrating the Artificial Fish Swarm and the Random Forest algorithm. First, we train a Random Forest to learn the nonlinear relation between gait parameters (input) and contact pressures (output) based on a dataset of three patients instrumented with knee replacement. Then, we use the improved artificial fish group algorithm to optimize the main parameters of the Random Forest based KCF prediction model. The extensive experiments verify that our method can predict the medial knee contact force both before and after the intervention of gait patterns, and the performance outperforms the classical multi-body dynamics analysis and artificial neural network model.

Details DOI

AAAI Conference 2020 Conference Paper

Recurrent Nested Model for Sequence Generation

  • Wenhao Jiang
  • Lin Ma
  • Wei Lu

Depth has been shown beneficial to neural network models. In this paper, we make an attempt to make the encoder-decoder model deeper for sequence generation. We propose a module that can be plugged into the middle between the encoder and decoder to increase the depth of the whole model. The proposed module follows a nested structure, which is divided into blocks with each block containing several recurrent transition steps. To reduce the training difficulty and preserve the necessary information for the decoder during transitions, inter-block connections and intra-block connections are constructed in our model. The inter-block connections provide the thought vectors from the current block to all the subsequent blocks. The intra-block connections connect all the hidden states entering the current block to the current transition step. The advantages of our model are illustrated on the image captioning and code captioning tasks.

PDF Details

AAAI Conference 2019 Conference Paper

Learning Diffusions without Timestamps

  • Hao Huang
  • Qian Yan
  • Ting Gan
  • Di Niu
  • Wei Lu
  • Yunjun Gao

To learn the underlying parent-child influence relationships between nodes in a diffusion network, most existing approaches require timestamps that pinpoint the exact time when node infections occur in historical diffusion processes. In many real-world diffusion processes like the spread of epidemics, monitoring such infection temporal information is often expensive and difficult. In this work, we study how to carry out diffusion network inference without infection timestamps, using only the final infection statuses of nodes in each historical diffusion process, which are more readily accessible in practice. Our main result is a probabilistic model that can find for each node an appropriate number of most probable parent nodes, who are most likely to have generated the historical infection results of the node. Extensive experiments on both synthetic and real-world networks are conducted, and the results verify the effectiveness and efficiency of our approach.

PDF Details

JBHI Journal 2018 Journal Article

A Low-Power Fall Detector Balancing Sensitivity and False Alarm Rate

  • Changhong Wang
  • Wei Lu
  • Stephen J. Redmond
  • Michael C. Stevens
  • Stephen R. Lord
  • Nigel H. Lovell

Falls in older people are a major challenge to public health. A wearable fall detector can detect falls automatically based on kinematic information of the human body, allowing help to arrive sooner. To date, most studies have focused on the accuracy of an offline algorithm to distinguish real-world or simulated falls from activities of daily living, while neglecting the false alarm rate and battery life of a real device. To address these two important metrics, which significantly influence user compliance, this paper proposes a low-power fall detector using triaxial accelerometry and barometric pressure sensing. This fall detector minimizes power consumption using both hardware- and firmware-based techniques. Additionally, the fall detection algorithm used in this device is optimized to achieve a balance between sensitivity and false alarm rate, while minimizing the power consumption due to algorithm execution. The fall detector achieved a high sensitivity (91%) with a low false alarm rate (0. 1149 alarms per hour), and a commercially-viable battery life (1125 days).

Details DOI

AAAI Conference 2018 Conference Paper

cw2vec: Learning Chinese Word Embeddings with Stroke n-gram Information

  • Shaosheng Cao
  • Wei Lu
  • Jun Zhou
  • Xiaolong Li

We propose cw2vec, a novel method for learning Chinese word embeddings. It is based on our observation that exploiting stroke-level information is crucial for improving the learning of Chinese word embeddings. Specifically, we design a minimalist approach to exploit such features, by using stroke n-grams, which capture semantic and morphological level information of Chinese words. Through qualitative analysis, we demonstrate that our model is able to extract semantic information that cannot be captured by existing methods. Empirical results on the word similarity, word analogy, text classification and named entity recognition tasks show that the proposed approach consistently outperforms state-of-the-art approaches such as word-based word2vec and GloVe, character-based CWE, component-based JWE and pixel-based GWE.

PDF Details

AAAI Conference 2018 Conference Paper

Learning Latent Opinions for Aspect-level Sentiment Classification

  • Bailin Wang
  • Wei Lu

Aspect-level sentiment classification aims at detecting the sentiment expressed towards a particular target in a sentence. Based on the observation that the sentiment polarity is often related to specific spans in the given sentence, it is possible to make use of such information for better classification. On the other hand, such information can also serve as justifications associated with the predictions. We propose a segmentation attention based LSTM model which can effectively capture the structural dependencies between the target and the sentiment expressions with a linear-chain conditional random field (CRF) layer. The model simulates human’s process of inferring sentiment information when reading: when given a target, humans tend to search for surrounding relevant text spans in the sentence before making an informed decision on the underlying sentiment information. We perform sentiment classification tasks on publicly available datasets on online reviews across different languages from SemEval tasks and social comments from Twitter. Extensive experiments show that our model achieves the state-of-the-art performance while extracting interpretable sentiment expressions.

PDF Details

EAAI Journal 2017 Journal Article

Copy-move forgery detection based on hybrid features

  • Fan Yang
  • Jingwei Li
  • Wei Lu
  • Jian Weng

Copy-move forgery is one of the most popular tampering artifacts in digital images. Most existing keypoint-based detection methods may fail to precisely locate duplicated regions because there are not enough correct matched points. In this paper, a novel copy-move forgery detection method is proposed based on hybrid features. A robust interest point detector KAZE is introduced and combined with SIFT to extract more feature points. In order to deal with multiple duplications, an improved matching algorithm is used which can find the n-best matched features. Then an effective filtering step based on image segmentation is executed to filter out false matches. Moreover, an iteration strategy is developed to estimate transformation matrices and determine the existence of forgery. Based on these matrices, the duplicated regions can be located at pixel level. Experimental results demonstrated that the proposed method can precisely detect duplicated regions even after distortions such as rotation, scaling, JPEG compression and adding noise.

Details DOI

AAAI Conference 2017 Conference Paper

Efficient Dependency-Guided Named Entity Recognition

  • Zhanming Jie
  • Aldrian Muis
  • Wei Lu

Named entity recognition (NER), which focuses on the extraction of semantically meaningful named entities and their semantic classes from text, serves as an indispensable component for several down-stream natural language processing (NLP) tasks such as relation extraction and event extraction. Dependency trees, on the other hand, also convey crucial semantic-level information. It has been shown previously that such information can be used to improve the performance of NER (Sasano and Kurohashi 2008; Ling and Weld 2012). In this work, we investigate on how to better utilize the structured information conveyed by dependency trees to improve the performance of NER. Specifically, unlike existing approaches which only exploit dependency information for designing local features, we show that certain global structured information of the dependency trees can be exploited when building NER models where such information can provide guided learning and inference. Through extensive experiments, we show that our proposed novel dependency-guided NER model performs competitively with models based on conventional semi-Markov conditional random fields, while requiring significantly less running time.

PDF Details

AAAI Conference 2017 Conference Paper

Improving Word Embeddings with Convolutional Feature Learning and Subword Information

  • Shaosheng Cao
  • Wei Lu

We present a novel approach to learning word embeddings by exploring subword information (character n-gram, root/affix and inflections) and capturing the structural information of their context with convolutional feature learning. Specifically, we introduce a convolutional neural network architecture that allows us to measure structural information of context words and incorporate subword features conveying semantic, syntactic and morphological information related to the words. To assess the effectiveness of our model, we conduct extensive experiments on the standard word similarity and word analogy tasks. We showed improvements over existing state-of-the-art methods for learning word embeddings, including skipgram, GloVe, char n-gram and DSSM.

PDF Details

AAAI Conference 2017 Conference Paper

Learning Latent Sentiment Scopes for Entity-Level Sentiment Analysis

  • Hao Li
  • Wei Lu

In this paper, we focus on the task of extracting named entities together with their associated sentiment information in a joint manner. Our key observation in such an entity-level sentiment analysis (a. k. a. targeted sentiment analysis) task is that there exists a sentiment scope within which each named entity is embedded, which largely decides the sentiment information associated with the entity. However, such sentiment scopes are typically not explicitly annotated in the data, and their lengths can be unbounded. Motivated by this, unlike traditional approaches that cast this problem as a simple sequence labeling task, we propose a novel approach that can explicitly model the latent sentiment scopes. Our experiments on the standard datasets demonstrate that our approach is able to achieve better results compared to existing approaches based on conventional conditional random fields (CRFs) and a more recent work based on neural networks.

PDF Details

AAAI Conference 2017 Conference Paper

Semantic Parsing with Neural Hybrid Trees

  • Raymond Hendy Susanto
  • Wei Lu

We propose a neural graphical model for parsing natural language sentences into their logical representations. The graphical model is based on hybrid tree structures that jointly represent both sentences and semantics. Learning and decoding are done using efficient dynamic programming algorithms. The model is trained under a discriminative setting, which allows us to incorporate a rich set of features. Hybrid tree structures have shown to achieve state-of-the-art results on standard semantic parsing datasets. In this work, we propose a novel model that incorporates a rich, nonlinear featurization by a feedforward neural network. The error signals are computed with respect to the conditional random fields (CRFs) objective using an inside-outside algorithm, which are then backpropagated to the neural network. We demonstrate that by combining the strengths of the exact global inference in the hybrid tree models and the power of neural networks to extract high level features, our model is able to achieve new state-of-the-art results on standard benchmark datasets across different languages.

PDF Details

AAAI Conference 2016 Conference Paper

Deep Neural Networks for Learning Graph Representations

  • Shaosheng Cao
  • Wei Lu
  • Qiongkai Xu

In this paper, we propose a novel model for learning graph representations, which generates a low-dimensional vector representation for each vertex by capturing the graph structural information. Different from other previous research efforts, we adopt a random surfing model to capture graph structural information directly, instead of using the samplingbased method for generating linear sequences proposed by Perozzi et al. (2014). The advantages of our approach will be illustrated from both theorical and empirical perspectives. We also give a new perspective for the matrix factorization method proposed by Levy and Goldberg (2014), in which the pointwise mutual information (PMI) matrix is considered as an analytical solution to the objective function of the skipgram model with negative sampling proposed by Mikolov et al. (2013). Unlike their approach which involves the use of the SVD for finding the low-dimensitonal projections from the PMI matrix, however, the stacked denoising autoencoder is introduced in our model to extract complex features and model non-linearities. To demonstrate the effectiveness of our model, we conduct experiments on clustering and visualization tasks, employing the learned vertex representations as features. Empirical results on datasets of varying sizes show that our model outperforms other stat-of-the-art models in such tasks.

PDF Details

AAAI Conference 2013 Conference Paper

Supervised Coupled Dictionary Learning with Group Structures for Multi-modal Retrieval

  • Yue Zhuang
  • Yan Wang
  • Fei Wu
  • Yin Zhang
  • Wei Lu

A better similarity mapping function across heterogeneous high-dimensional features is very desirable for many applications involving multi-modal data. In this paper, we introduce coupled dictionary learning (DL) into supervised sparse coding for multi-modal (crossmedia) retrieval. We call this Supervised coupleddictionary learning with group structures for Multi- Modal retrieval (SliM2 ). SliM2 formulates the multimodal mapping as a constrained dictionary learning problem. By utilizing the intrinsic power of DL to deal with the heterogeneous features, SliM2 extends unimodal DL to multi-modal DL. Moreover, the label information is employed in SliM2 to discover the shared structure inside intra-modality within the same class by a mixed norm (i. e. , `1/`2-norm). As a result, the multimodal retrieval is conducted via a set of jointly learned mapping functions across multi-modal data. The experimental results show the effectiveness of our proposed model when applied to cross-media retrieval.

PDF Details

AAAI Conference 2012 Conference Paper

Time-Critical Influence Maximization in Social Networks with Time-Delayed Diffusion Process

  • Wei Chen
  • Wei Lu
  • Ning Zhang

Influence maximization is a problem of finding a small set of highly influential users in a social network such that the spread of influence under certain propagation models is maximized. In this paper, we consider time-critical influence maximization, in which one wants to maximize influence spread within a given deadline. Since timing is considered in the optimization, we also extend the Independent Cascade (IC) model to incorporate the time delay aspect of influence diffusion in social networks. We show that time-critical influence maximization under the time-delayed IC model maintains desired properties such as submodularity, which allows a greedy algorithm to achieve an approximation ratio of 1 − 1/e, to circumvent the NP-hardness of the problem. To overcome the inefficiency of the approximation algorithm, we design two heuristic algorithms: the first one is based on a dynamic programming procedure that computes exact influence in tree structures, while the second one converts the problem to one in the original IC model and then applies existing fast heuristics to it. Our simulation results demonstrate that our heuristics achieve the same level of influence spread as the greedy algorithm while running a few orders of magnitude faster, and they also outperform existing algorithms that disregard the deadline constraint and delays in diffusion.

PDF Details

EAAI Journal 2011 Journal Article

Revealing digital fakery using multiresolution decomposition and higher order statistics

  • Wei Lu
  • Wei Sun
  • Fu-lai Chung
  • Hongtao Lu

With the advance of digitization and digital processing techniques, digital images are now easy to create and manipulate, and leave no clues of artificial evidence. There are some known digital fakery for images, e. g. , computer graphics (CGs) and digital forgeries. As valid records of natural world, natural images, i. e. , photographic images, are no longer believable. In this paper, a detection scheme for natural images and fake images is proposed. Features are first extracted using multiresolution decomposition and higher order local autocorrelations (HLACs). The support vector machines (SVMs) are then used to differentiate the natural and fake images. Because the inner product between features can be obtained directly without computing features, it can be integrated into SVM, and the computation complexity is decreased. Experiments show that the proposed detection scheme is effective, demonstrating that the proposed statistical features can model the differences between natural images and fake images.

Details DOI

IROS Conference 2006 Conference Paper

Autonomous Grasping of a Space Robot Multisensory Gripper

  • Minzhou Luo
  • Wei Lu
  • Bing-Yu Sun
  • Tao Mei 0003

Most robot grippers can hardly be applied to space service due to their devoid of the ability of outputting large force, autonomously making decision and sensing the environment. In this paper, a space underactuated gripper which can stably grasp various objects based on fewer actuators, large force and autonomous decision and multisensory information feedback is introduced. Firstly, the versatile grasping patterns of the gripper with characteristics of underactuation are presented. The multiple sensors are mounted on the gripper including PVDF contact force sensors, a line structure light sensor which detects grasped object approximate shape and volume, and a wrist force sensor which detects the grasped object mass. Secondly, autonomous grasping which is characterized by autonomous decision-making and control is focused on. Control strategies are also proposed to make proper prosthetics and stable grasping according to force sensors information. The grasping rules are extracted from original experiment sample data. Through fuzzy neural network, grasping map is established among comprehensive fuzzy features, including grasping task and object features, and the grasping patterns. Finally, the experimental results demonstrate that the gripper can achieve autonomous and stable grasping

Details

NeurIPS Conference 2000 Conference Paper

Constrained Independent Component Analysis

  • Wei Lu
  • Jagath Rajapakse

The paper presents a novel technique of constrained independent component analysis (CICA) to introduce constraints into the clas(cid: 173) sical ICA and solve the constrained optimization problem by using Lagrange multiplier methods. This paper shows that CICA can be used to order the resulted independent components in a specific manner and normalize the demixing matrix in the signal separation procedure. It can systematically eliminate the ICA's indeterminacy on permutation and dilation. The experiments demonstrate the use of CICA in ordering of independent components while providing normalized demixing processes. Keywords: Independent component analysis, constrained indepen(cid: 173) dent component analysis, constrained optimization, Lagrange mul(cid: 173) tiplier methods

PDF Details
v2026.09.13