arXiv subjects

Shang Wang

Publications and source records attributed to Shang Wang.

At least 37 records · Page 2Linked to original sources

arXiv2025

The Demon is in Ambiguity: Revisiting Situation Recognition with Single Positive Multi-Label Learning

Context recognition (SR) is a fundamental task in computer vision that aims to extract structured semantic summaries from images by identifying key events and their associated entities. Specifically, given an input image, the model must first classify the main visual events (verb classification), then identify the participating entities and their semantic roles (semantic role labeling), and finally localize these entities in the image (semantic role localization). Existing methods treat verb classification as a single-label problem, but we show through a comprehensive analysis that this formulation fails to address the inherent ambiguity in visual event recognition, as multiple verb categories may reasonably describe the same image. This paper makes three key contributions: First, we reveal through empirical analysis that verb classification is inherently a multi-label problem due to the ubiquitous semantic overlap between verb categories. Second, given the impracticality of fully annotating large-scale datasets with multiple labels, we propose to reformulate verb classification as a single positive multi-label learning (SPMLL) problem - a novel perspective in SR research. Third, we design a comprehensive multi-label evaluation benchmark for SR that is carefully designed to fairly evaluate model performance in a multi-label setting. To address the challenges of SPMLL, we futher develop the Graph Enhanced Verb Multilayer Perceptron (GE-VerbMLP), which combines graph neural networks to capture label correlations and adversarial training to optimize decision boundaries. Extensive experiments on real-world datasets show that our approach achieves more than 3\% MAP improvement while remaining competitive on traditional top-1 and top-5 accuracy metrics.

cs.CV↗

arXiv2025

Isolated elliptically-polarized attosecond pulse generation in gapped graphene driven by linearly polarized laser fields

We theoretically investigate high-order harmonic generation (HHG) and its ellipticity in gapped graphene, driven by a femtosecond short-pulse laser at various orientation angles, employing the two-band density-matrix equations within the tight-binding approximation. The orientation-dependent harmonic spectra exhibit pronounced enhancement of specific harmonics, which we attribute to the caustic effect. Using the recombination trajectory model, we reveal that the orientation dependence of these enhanced harmonics originates from the distinct band structures encountered by electrons ionized from the two inequivalent $\textrm{K}$ points. Moreover, we focus on the ellipticity of the enhanced harmonics at specific angles and demonstrate that it primarily depends on the phase difference between the parallel and perpendicular components, which can be accurately predicted by our recombination trajectory model. Based on these insights, we propose a two-color (fundamental plus second-harmonic) field scheme to generate isolated elliptically polarized attosecond pulses (IEAPs) in gapped graphene. Our findings may provide a promising pathway toward the generation of IEAPs in gapped graphene or transition metal dichalcogenides.

physics.atom-ph↗

arXiv2025

A Neural Architecture Search Method using Auxiliary Evaluation Metric based on ResNet Architecture

This paper proposes a neural architecture search space using ResNet as a framework, with search objectives including parameters for convolution, pooling, fully connected layers, and connectivity of the residual network. In addition to recognition accuracy, this paper uses the loss value on the validation set as a secondary objective for optimization. The experimental results demonstrate that the search space of this paper together with the optimisation approach can find competitive network architectures on the MNIST, Fashion-MNIST and CIFAR100 datasets.

cs.NE↗

arXiv2025

A Transformer-based Neural Architecture Search Method

This paper presents a neural architecture search method based on Transformer architecture, searching cross multihead attention computation ways for different number of encoder and decoder combinations. In order to search for neural network structures with better translation results, we considered perplexity as an auxiliary evaluation metric for the algorithm in addition to BLEU scores and iteratively improved each individual neural network within the population by a multi-objective genetic algorithm. Experimental results show that the neural network structures searched by the algorithm outperform all the baseline models, and that the introduction of the auxiliary evaluation metric can find better models than considering only the BLEU score as an evaluation metric.

cs.CL↗

arXiv2025

W-PCA Based Gradient-Free Proxy for Efficient Search of Lightweight Language Models

The demand for efficient natural language processing (NLP) systems has led to the development of lightweight language models. Previous work in this area has primarily focused on manual design or training-based neural architecture search (NAS) methods. Recently, zero-shot NAS methods have been proposed for evaluating language models without the need for training. However, prevailing approaches to zero-shot NAS often face challenges such as biased evaluation metrics and computational inefficiencies. In this paper, we introduce weight-weighted PCA (W-PCA), a novel zero-shot NAS method specifically tailored for lightweight language models. Our approach utilizes two evaluation proxies: the parameter count and the number of principal components with cumulative contribution exceeding $η$ in the feed-forward neural (FFN) layer. Additionally, by eliminating the need for gradient computations, we optimize the evaluation time, thus enhancing the efficiency of designing and evaluating lightweight language models. We conduct a comparative analysis on the GLUE and SQuAD datasets to evaluate our approach. The results demonstrate that our method significantly reduces training time compared to one-shot NAS methods and achieves higher scores in the testing phase compared to previous state-of-the-art training-based methods. Furthermore, we perform ranking evaluations on a dataset sampled from the FlexiBERT search space. Our approach exhibits superior ranking correlation and further reduces solving time compared to other zero-shot NAS methods that require gradient computation.

cs.CL↗

arXiv2025

Is the atmospheric river operating at a self-organized criticality state?

Atmospheric rivers (ARs) are essential components of the global hydrological cycle, with profound implications for water resources, extreme weather events, and climate dynamics. Yet, the statistical organization and underlying physical mechanisms of AR intensity and evolution remain poorly understood. Here we apply methods from statistical physics to analyze the full life cycle of ARs and identify universal signatures of self-organized criticality (SOC). We demonstrate that AR morphology exhibits nontrivial fractal geometry, while AR event sizes, quantified via integrated water vapor transport, follow robust power-law distributions, displaying finite-size scaling. These scaling behaviors persist under warming scenarios, suggesting that ARs operate near a critical state as emergent, self-regulating systems. Concurrently, we observe a systematic poleward migration and intensification of ARs, linked to thermodynamic amplification and dynamical reorganization. Our findings establish a statistical physics framework for ARs, linking critical phenomena to the spatiotemporal structure of extreme events in a warming climate.

physics.geo-ph↗

arXiv2025

Data-Free Model-Related Attacks: Unleashing the Potential of Generative AI

Generative AI technology has become increasingly integrated into our daily lives, offering powerful capabilities to enhance productivity. However, these same capabilities can be exploited by adversaries for malicious purposes. While existing research on adversarial applications of generative AI predominantly focuses on cyberattacks, less attention has been given to attacks targeting deep learning models. In this paper, we introduce the use of generative AI for facilitating model-related attacks, including model extraction, membership inference, and model inversion. Our study reveals that adversaries can launch a variety of model-related attacks against both image and text models in a data-free and black-box manner, achieving comparable performance to baseline methods that have access to the target models' training data and parameters in a white-box manner. This research serves as an important early warning to the community about the potential risks associated with generative AI-powered attacks on deep learning models.

cs.CR↗

arXiv2024

Creating a Cooperative AI Policymaking Platform through Open Source Collaboration

Advances in artificial intelligence (AI) present significant risks and opportunities, requiring improved governance to mitigate societal harms and promote equitable benefits. Current incentive structures and regulatory delays may hinder responsible AI development and deployment, particularly in light of the transformative potential of large language models (LLMs). To address these challenges, we propose developing the following three contributions: (1) a large multimodal text and economic-timeseries foundation model that integrates economic and natural language policy data for enhanced forecasting and decision-making, (2) algorithmic mechanisms for eliciting diverse and representative perspectives, enabling the creation of data-driven public policy recommendations, and (3) an AI-driven web platform for supporting transparent, inclusive, and data-driven policymaking.

cs.CY↗

arXiv2024

S2LIC: Learned Image Compression with the SwinV2 Block, Adaptive Channel-wise and Global-inter Attention Context

Recently, deep learning technology has been successfully applied in the field of image compression, leading to superior rate-distortion performance. It is crucial to design an effective and efficient entropy model to estimate the probability distribution of the latent representation. However, the majority of entropy models primarily focus on one-dimensional correlation processing between channel and spatial information. In this paper, we propose an Adaptive Channel-wise and Global-inter attention Context (ACGC) entropy model, which can efficiently achieve dual feature aggregation in both inter-slice and intraslice contexts. Specifically, we divide the latent representation into different slices and then apply the ACGC model in a parallel checkerboard context to achieve faster decoding speed and higher rate-distortion performance. In order to capture redundant global features across different slices, we utilize deformable attention in adaptive global-inter attention to dynamically refine the attention weights based on the actual spatial relationships and context. Furthermore, in the main transformation structure, we propose a high-performance S2LIC model. We introduce the residual SwinV2 Transformer model to capture global feature information and utilize a dense block network as the feature enhancement module to improve the nonlinear representation of the image within the transformation structure. Experimental results demonstrate that our method achieves faster encoding and decoding speeds and outperforms VTM-17.1 and some recent learned image compression methods in both PSNR and MS-SSIM metrics.

eess.IV↗

arXiv2024

Watch Out! Simple Horizontal Class Backdoor Can Trivially Evade Defense

All current backdoor attacks on deep learning (DL) models fall under the category of a vertical class backdoor (VCB) -- class-dependent. In VCB attacks, any sample from a class activates the implanted backdoor when the secret trigger is present. Existing defense strategies overwhelmingly focus on countering VCB attacks, especially those that are source-class-agnostic. This narrow focus neglects the potential threat of other simpler yet general backdoor types, leading to false security implications. This study introduces a new, simple, and general type of backdoor attack coined as the horizontal class backdoor (HCB) that trivially breaches the class dependence characteristic of the VCB, bringing a fresh perspective to the community. HCB is now activated when the trigger is presented together with an innocuous feature, regardless of class. For example, the facial recognition model misclassifies a person who wears sunglasses with a smiling innocuous feature into the targeted person, such as an administrator, regardless of which person. The key is that these innocuous features are horizontally shared among classes but are only exhibited by partial samples per class. Extensive experiments on attacking performance across various tasks, including MNIST, facial recognition, traffic sign recognition, object detection, and medical diagnosis, confirm the high efficiency and effectiveness of the HCB. We rigorously evaluated the evasiveness of the HCB against a series of eleven representative countermeasures, including Fine-Pruning (RAID 18'), STRIP (ACSAC 19'), Neural Cleanse (Oakland 19'), ABS (CCS 19'), Februus (ACSAC 20'), NAD (ICLR 21'), MNTD (Oakland 21'), SCAn (USENIX SEC 21'), MOTH (Oakland 22'), Beatrix (NDSS 23'), and MM-BD (Oakland 24'). None of these countermeasures prove robustness, even when employing a simplistic trigger, such as a small and static white-square patch.

cs.CR↗

arXiv2024

Gate Tunable Asymmetric Ozone Adsorption on Graphene

Molecular adsorption is pivotal in device fabrication and material synthesis for quantum technology. However, elucidating the behavior of physisorption poses technical challenges. Here graphene with ultrahigh sensitivity was utilized to detect ozone adsorption at cryogenic temperatures. Significant hole doping observed in graphene indicates a strong interaction between ozone and graphene. Interestingly, the adsorption exhibits asymmetry with positive and negative gate voltages. The strong affinity of ozone provides a tool to modulate materials and devices, while the gate tunability of adsorption offers new insights into construction and manipulation of oxide quantum materials.

cond-mat.mes-hall↗

arXiv2024

FPGA Divide-and-Conquer Placement using Deep Reinforcement Learning

This paper introduces the problem of learning to place logic blocks in Field-Programmable Gate Arrays (FPGAs) and a learning-based method. In contrast to previous search-based placement algorithms, we instead employ Reinforcement Learning (RL) with the goal of minimizing wirelength. In addition to our preliminary learning results, we also evaluated a novel decomposition to address the nature of large search space when placing many blocks on a chipboard. Empirical experiments evaluate the effectiveness of the learning and decomposition paradigms on FPGA placement tasks.

cs.AR↗

arXiv2023

Regional Greening as a `Positive' Tipping Phenomenon

Earth system tipping elements have been predominantly investigated for their potential to trigger \textit{negative} ecological, climatic, and societal shifts. Yet, an overlooked but seminal avenue exists in the form of \textit{positive} tipping phenomena, whose underlying mechanisms and benefits remain largely underexplored. To bridge this gap, our research introduces a fundamental percolation-based framework to assess the criticality and resilience of planetary terrestrial vegetation systems. Leveraging high-resolution satellite data, we focus on greening-induced positive tipping dynamics driven by global warming. We feature the Qinghai-Tibetan Plateau (QTP) and the Sahel region as contrasting yet analogous case studies. Our analysis uncovers an intriguing phenomenon where vegetation fragmentation aligns with a percolation threshold, exhibiting a scale-invariant pattern characterized by nearly perfect power laws with three critical exponents. Remarkably, contrary to conventional destructive tipping elements, these regions act as favorable tipping elements, transitioning from fragmented to cohesive vegetation patterns due to anthropogenic climate change and afforestation efforts. Furthermore, we propose an \textit{optimal resilience enhancement model} to reinforce vegetation robustness while minimizing socio-economic costs. This study provides valuable insights into the favorable aspects of tipping elements under climate change and offers effective strategies for enhancing ecological resilience against environmental threats.

physics.geo-ph↗

arXiv2022

CASSOCK: Viable Backdoor Attacks against DNN in The Wall of Source-Specific Backdoor Defences

As a critical threat to deep neural networks (DNNs), backdoor attacks can be categorized into two types, i.e., source-agnostic backdoor attacks (SABAs) and source-specific backdoor attacks (SSBAs). Compared to traditional SABAs, SSBAs are more advanced in that they have superior stealthier in bypassing mainstream countermeasures that are effective against SABAs. Nonetheless, existing SSBAs suffer from two major limitations. First, they can hardly achieve a good trade-off between ASR (attack success rate) and FPR (false positive rate). Besides, they can be effectively detected by the state-of-the-art (SOTA) countermeasures (e.g., SCAn). To address the limitations above, we propose a new class of viable source-specific backdoor attacks, coined as CASSOCK. Our key insight is that trigger designs when creating poisoned data and cover data in SSBAs play a crucial role in demonstrating a viable source-specific attack, which has not been considered by existing SSBAs. With this insight, we focus on trigger transparency and content when crafting triggers for poisoned dataset where a sample has an attacker-targeted label and cover dataset where a sample has a ground-truth label. Specifically, we implement $CASSOCK_{Trans}$ and $CASSOCK_{Cont}$. While both they are orthogonal, they are complementary to each other, generating a more powerful attack, called $CASSOCK_{Comp}$, with further improved attack performance and stealthiness. We perform a comprehensive evaluation of the three $CASSOCK$-based attacks on four popular datasets and three SOTA defenses. Compared with a representative SSBA as a baseline ($SSBA_{Base}$), $CASSOCK$-based attacks have significantly advanced the attack performance, i.e., higher ASR and lower FPR with comparable CDA (clean data accuracy). Besides, $CASSOCK$-based attacks have effectively bypassed the SOTA defenses, and $SSBA_{Base}$ cannot.

cs.CR↗

arXiv2021

A recurrent neural network approach for remaining useful life prediction utilizing a novel trend features construction method

Data-driven methods for remaining useful life (RUL) prediction normally learn features from a fixed window size of a priori of degradation, which may lead to less accurate prediction results on different datasets because of the variance of local features. This paper proposes a method for RUL prediction which depends on a trend feature representing the overall time sequence of degradation. Complete ensemble empirical mode decomposition, followed by a reconstruction procedure, is created to build the trend features. The probability distribution of sensors' measurement learned by conditional neural processes is used to evaluate the trend features. With the best trend feature, a data-driven model using long short-term memory is developed to predict the RUL. To prove the effectiveness of the proposed method, experiments on a benchmark C-MAPSS dataset are carried out and compared with other state-of-the-art methods. Comparison results show that the proposed method achieves the smallest root mean square values in prediction of all RUL.

eess.SP↗

arXiv2021

SearchGCN: Powering Embedding Retrieval by Graph Convolution Networks for E-Commerce Search

Graph convolution networks (GCN), which recently becomes new state-of-the-art method for graph node classification, recommendation and other applications, has not been successfully applied to industrial-scale search engine yet. In this proposal, we introduce our approach, namely SearchGCN, for embedding-based candidate retrieval in one of the largest e-commerce search engine in the world. Empirical studies demonstrate that SearchGCN learns better embedding representations than existing methods, especially for long tail queries and items. Thus, SearchGCN has been deployed into JD.com's search production since July 2020.

cs.IR↗

arXiv2021

Searching for Dark Matter Particles with Compton Scattering Approach

The dark matter puzzle is one of the most important fundamental physics questions in 21 century. There is no doubt that solving the puzzle will be a new milestone for human beings in the way of deeper understanding the mother nature. Here we propose to use the Shanghai laser electron gamma source (SLEGS) to search for dark matter candidates particles, including dark pseudo scalar particles, dark scalar particles, and dark photons. Our simulations show that electron facilities like SLEGS with some upgrading could be competitive platforms in searching for light dark matter particles with mass under tens of keV.

hep-ex↗

arXiv2021

Alignment dependence of photoelectron momentum distributions for diatomic molecules N$_2$ in strong elliptical laser fields

We study ionization dynamics of aligned diatomic molecules N$_2$ in strong elliptical laser fields experimentally and theoretically. The alignment dependence of photoelectron momentum distributions (PMDs) of N$_2$ measured in experiments is highlighted with comparing to Ar measured synchronously. Our results show that the PMDs of N$_2$ depend strongly on the alignment of the molecule, relative to the main axis of the laser ellipse. In particular, the most-probable electron-emission angle which is often used in attosecond measurement, differs remarkably when changing the molecular alignment. We show that the interplay of two-center interference and tunneling when the electron goes through the laser-Coulomb-formed barrier, plays an important role in these phenomena. Our work gives suggestions on studying ultrafast electron motion inside aligned molecules.

physics.atom-ph↗