Searcharxiv⌕ Search

arXiv subjects

Ren Wang

Publications and source records attributed to Ren Wang.

At least 55 records · Page 3Linked to original sources

Forget Vectors at Play: Universal Input Perturbations Driving Machine Unlearning in Image Classification

Machine unlearning (MU), which seeks to erase the influence of specific unwanted data from already-trained models, is becoming increasingly vital in model editing, particularly to comply with evolving data regulations like the ``right to be forgotten''. Conventional approaches are predominantly model-based, typically requiring retraining or fine-tuning the model's weights to meet unlearning requirements. In this work, we approach the MU problem from a novel input perturbation-based perspective, where the model weights remain intact throughout the unlearning process. We demonstrate the existence of a proactive input-based unlearning strategy, referred to forget vector, which can be generated as an input-agnostic data perturbation and remains as effective as model-based approximate unlearning approaches. We also explore forget vector arithmetic, whereby multiple class-specific forget vectors are combined through simple operations (e.g., linear combinations) to generate new forget vectors for unseen unlearning tasks, such as forgetting arbitrary subsets across classes. Extensive experiments validate the effectiveness and adaptability of the forget vector, showcasing its competitive performance relative to state-of-the-art model-based methods. Codes are available at https://github.com/Changchangsun/Forget-Vector.

cs.LG↗

Data-driven Control of T-Product-based Dynamical Systems

Data-driven control is a powerful tool that enables the design and implementation of control strategies directly from data without explicitly identifying the underlying system dynamics. While various data-driven control techniques, such as stabilization, linear quadratic regulation, and model predictive control, have been extensively developed, these methods are not inherently suited for multi-linear dynamical systems, where the states are represented as higher-order tensors. In this article, we propose a novel framework for data-driven control of T-product-based dynamical systems (TPDSs), where the system evolution is governed by the T-product between a third-order dynamic tensor and a third-order state tensor. In particular, we offer necessary and sufficient conditions to determine the data informativity for system identification, stabilization by state feedback, and T-product quadratic regulation of TPDSs with detailed complexity analyses. Finally, we validate our framework through numerical examples.

eess.SY↗

HODDI: A Dataset of High-Order Drug-Drug Interactions for Computational Pharmacovigilance

Drug-side effect research is vital for understanding adverse reactions arising in complex multi-drug therapies. However, the scarcity of higher-order datasets that capture the combinatorial effects of multiple drugs severely limits progress in this field. Existing resources such as TWOSIDES primarily focus on pairwise interactions. To fill this critical gap, we introduce HODDI, the first Higher-Order Drug-Drug Interaction Dataset, constructed from U.S. Food and Drug Administration (FDA) Adverse Event Reporting System (FAERS) records spanning the past decade, to advance computational pharmacovigilance. HODDI contains 109,744 records involving 2,506 unique drugs and 4,569 unique side effects, specifically curated to capture multi-drug interactions and their collective impact on adverse effects. Comprehensive statistical analyses demonstrate HODDI's extensive coverage and robust analytical metrics, making it a valuable resource for studying higher-order drug relationships. Evaluating HODDI with multiple models, we found that simple Multi-Layer Perceptron (MLP) can outperform graph models, while hypergraph models demonstrate superior performance in capturing complex multi-drug interactions, further validating HODDI's effectiveness. Our findings highlight the inherent value of higher-order information in drug-side effect prediction and position HODDI as a benchmark dataset for advancing research in pharmacovigilance, drug safety, and personalized medicine. The dataset and codes are available at https://github.com/TIML-Group/HODDI.

cs.LG↗

Boosting Diffusion Guidance via Learning Degradation-Aware Models for Blind Super Resolution

Recently, diffusion-based blind super-resolution (SR) methods have shown great ability to generate high-resolution images with abundant high-frequency detail, but the detail is often achieved at the expense of fidelity. Meanwhile, another line of research focusing on rectifying the reverse process of diffusion models (i.e., diffusion guidance), has demonstrated the power to generate high-fidelity results for non-blind SR. However, these methods rely on known degradation kernels, making them difficult to apply to blind SR. To address these issues, we present DADiff in this paper. DADiff incorporates degradation-aware models into the diffusion guidance framework, eliminating the need to know degradation kernels. Additionally, we propose two novel techniques: input perturbation and guidance scalar, to further improve our performance. Extensive experimental results show that our proposed method has superior performance over state-of-the-art methods on blind SR benchmarks.

eess.IV↗

Heterogeneous Entity Representation for Medicinal Synergy Prediction

Medicinal synergy prediction is a powerful tool in drug discovery and development that harnesses the principles of combination therapy to enhance therapeutic outcomes by improving efficacy, reducing toxicity, and preventing drug resistance. While a myriad of computational methods has emerged for predicting synergistic drug combinations, a large portion of them may overlook the intricate, yet critical relationships between various entities in drug interaction networks, such as drugs, cell lines, and diseases. These relationships are complex and multidimensional, requiring sophisticated modeling to capture nuanced interplay that can significantly influence therapeutic efficacy. We introduce a salient deep hypergraph learning method, namely, Heterogeneous Entity Representation for MEdicinal Synergy prediction (HERMES), to predict anti-cancer drug synergy. HERMES integrates heterogeneous data sources, encompassing drug, cell line, and disease information, to provide a comprehensive understanding of the interactions involved. By leveraging advanced hypergraph neural networks with gated residual mechanisms, HERMES can effectively learn complex relationships/interactions within the data. Our results show HERMES demonstrates state-of-the-art performance, particularly in forecasting new drug combinations, significantly surpassing previous methods. This advancement underscores the potential of HERMES to facilitate more effective and precise drug combination predictions, thereby enhancing the development of novel therapeutic strategies.

cs.CE↗

Word-Sequence Entropy: Towards Uncertainty Estimation in Free-Form Medical Question Answering Applications and Beyond

Uncertainty estimation is crucial for the reliability of safety-critical human and artificial intelligence (AI) interaction systems, particularly in the domain of healthcare engineering. However, a robust and general uncertainty measure for free-form answers has not been well-established in open-ended medical question-answering (QA) tasks, where generative inequality introduces a large number of irrelevant words and sequences within the generated set for uncertainty quantification (UQ), which can lead to biases. This paper introduces Word-Sequence Entropy (WSE), a method that calibrates uncertainty at both the word and sequence levels, considering semantic relevance. WSE quantifies uncertainty in a way that is more closely aligned with the reliability of LLMs during uncertainty quantification (UQ). We compare WSE with six baseline methods on five free-form medical QA datasets, utilizing seven popular large language models (LLMs). Experimental results demonstrate that WSE exhibits superior performance in UQ under two standard criteria for correctness evaluation. Additionally, in terms of real-world medical QA applications, the performance of LLMs is significantly enhanced (e.g., a 6.36% improvement in model accuracy on the COVID-QA dataset) by employing responses with lower uncertainty that are identified by WSE as final answers, without any additional task-specific fine-tuning or architectural modifications.

cs.CL↗

Efficient and Robust Continual Graph Learning for Graph Classification in Biology

Graph classification is essential for understanding complex biological systems, where molecular structures and interactions are naturally represented as graphs. Traditional graph neural networks (GNNs) perform well on static tasks but struggle in dynamic settings due to catastrophic forgetting. We present Perturbed and Sparsified Continual Graph Learning (PSCGL), a robust and efficient continual graph learning framework for graph data classification, specifically targeting biological datasets. We introduce a perturbed sampling strategy to identify critical data points that contribute to model learning and a motif-based graph sparsification technique to reduce storage needs while maintaining performance. Additionally, our PSCGL framework inherently defends against graph backdoor attacks, which is crucial for applications in sensitive biological contexts. Extensive experiments on biological datasets demonstrate that PSCGL not only retains knowledge across tasks but also enhances the efficiency and robustness of graph classification models in biology.

cs.LG↗

Double-Helix Singularity and Vortex-Antivortex Annihilation in Space-Time Helical Pulses

Topological structures reveal the hidden secrets and beauty in nature, such as the double helix in DNA, whilst, the manipula-tion of which in physical fields, especially in ultrafast struc-tured light, draw booming attention. Here we introduce a new family of spatiotemporal light fields, i.e. helical pulses, carry-ing sophisticated double-helix singularities in its electromag-netic topological structures. The helical pulses were solved from Maxwell's equation as chiral extensions of toroidal light pulses but with controlled angular momentum dependence. We unveil that the double helix singularities can maintain their topological invariance during propagation and the field exhibits paired generation and annihilation of vortices and antivortices in ultrafast space-time, so as to be potential information carriers beating previous conventional vortex structured light.

physics.optics↗

A recollement approach to Han's conjecture

A conjecture due to Y. Han asks whether that Hochschild homology groups of a finite dimensional algebra vanish for sufficiently large degrees would imply that the algebra is of finite global dimension. We investigate this conjecture from the viewpoint of recollements of derived categories. It is shown that for a recollement of unbounded derived categories of rings which extends downwards (or upwards) one step, Han's conjecture holds for the ring in the middle if and only if it holds for the two rings on the two sides and hence Han's conjecture is reduced to derived $2$-simple rings. Furthermore, this reduction result is applied to Han's conjecture for Morita contexts rings and exact contexts. Finally it is proved that Han's conjecture holds for skew-gentle algebras, category algebras of finite EI categories and Geiss-Leclerc-Schröer algebras associated to Cartan triples.

math.RT↗

Hybrid electromagnetic toroidal vortices

The ubiquitous occurrence of toroidal vortices or vortex rings in fluid-dynamic scenarios in nature has garnered significant attention of scientific frontier, whilst, the electromagnetic counterparts of which were only proposed recently with two distinct manifestations: vector toroidal pulses [Nat. Photon. 16, 523 (2022)] and scalar phase toroidal vortices [Nat. Photon. 16, 519 (2022)]. This dichotomy in the understanding of toroidal vortex phenomena has prompted a reassessment of their fundamental nature. Herein, we theoretically propose a novel form of electromagnetic toroidal vortex solutions, that uniquely integrate both scalar and vector characteristics, challenging the prevailing notion of their mutual exclusivity. We also present the experimental generation of the hybrid toroidal vortex pulses by a compact coaxial horn emitter augmented with a metasurface. This methodology not only demonstrates the feasibility of creating such complex vortex structures but also endows the resulting pulses with unique properties, including the coexistence of transverse orbital angular momentum, electromagnetic vortex streets, and topological skyrmion textures. These attributes introduce new dimensions in topologically complex structured waves, opening avenues for enhanced free-space information transmission, topologically nontrivial light-matter interaction and microscopy techniques.

physics.optics↗

Deep Adversarial Defense Against Multilevel-Lp Attacks

Deep learning models have shown considerable vulnerability to adversarial attacks, particularly as attacker strategies become more sophisticated. While traditional adversarial training (AT) techniques offer some resilience, they often focus on defending against a single type of attack, e.g., the $\ell_\infty$-norm attack, which can fail for other types. This paper introduces a computationally efficient multilevel $\ell_p$ defense, called the Efficient Robust Mode Connectivity (EMRC) method, which aims to enhance a deep learning model's resilience against multiple $\ell_p$-norm attacks. Similar to analytical continuation approaches used in continuous optimization, the method blends two $p$-specific adversarially optimal models, the $\ell_1$- and $\ell_\infty$-norm AT solutions, to provide good adversarial robustness for a range of $p$. We present experiments demonstrating that our approach performs better on various attacks as compared to AT-$\ell_\infty$, E-AT, and MSD, for datasets/architectures including: CIFAR-10, CIFAR-100 / PreResNet110, WideResNet, ViT-Base.

cs.LG↗

Purification Of Contaminated Convolutional Neural Networks Via Robust Recovery: An Approach with Theoretical Guarantee in One-Hidden-Layer Case

Convolutional neural networks (CNNs), one of the key architectures of deep learning models, have achieved superior performance on many machine learning tasks such as image classification, video recognition, and power systems. Despite their success, CNNs can be easily contaminated by natural noises and artificially injected noises such as backdoor attacks. In this paper, we propose a robust recovery method to remove the noise from the potentially contaminated CNNs and provide an exact recovery guarantee on one-hidden-layer non-overlapping CNNs with the rectified linear unit (ReLU) activation function. Our theoretical results show that both CNNs' weights and biases can be exactly recovered under the overparameterization setting with some mild assumptions. The experimental results demonstrate the correctness of the proofs and the effectiveness of the method in both the synthetic environment and the practical neural network setting. Our results also indicate that the proposed method can be extended to multiple-layer CNNs and potentially serve as a defense strategy against backdoor attacks.

cs.LG↗

Preprojective algebras, skew group algebras and Morita equivalences

Let $\mathbb{K}$ be a field of characteristic $p$ and $G$ be a cyclic $p$-group which acts on a finite acyclic quiver $Q$. The folding process associates a Cartan triple to the action. We establish a Morita equivalence between the skew group algebra of the preprojective algebra of $Q$ and the generalized preprojective algebra associated to the Cartan triple in the sense of Geiss, Leclerc and Schröer. The Morita equivalence induces an isomorphism between certain ideal monoids of these preprojective algebras, which is compatible with the embedding of Weyl groups appearing in the folding process.

math.RT↗

Nomad: Non-Exclusive Memory Tiering via Transactional Page Migration

With the advent of byte-addressable memory devices, such as CXL memory, persistent memory, and storage-class memory, tiered memory systems have become a reality. Page migration is the de facto method within operating systems for managing tiered memory. It aims to bring hot data whenever possible into fast memory to optimize the performance of data accesses while using slow memory to accommodate data spilled from fast memory. While the existing research has demonstrated the effectiveness of various optimizations on page migration, it falls short of addressing a fundamental question: Is exclusive memory tiering, in which a page is either present in fast memory or slow memory, but not both simultaneously, the optimal strategy for tiered memory management? We demonstrate that page migration-based exclusive memory tiering suffers significant performance degradation when fast memory is under pressure. In this paper, we propose non-exclusive memory tiering, a page management strategy that retains a copy of pages recently promoted from slow memory to fast memory to mitigate memory thrashing. To enable non-exclusive memory tiering, we develop Nomad, a new page management mechanism for Linux that features transactional page migration and page shadowing. Nomad helps remove page migration off the critical path of program execution and makes migration completely asynchronous. Evaluations with carefully crafted micro-benchmarks and real-world applications show that Nomad is able to achieve up to 6x performance improvement over the state-of-the-art transparent page placement (TPP) approach in Linux when under memory pressure. We also compare Nomad with a recently proposed hardware-assisted, access sampling-based page migration approach and demonstrate Nomad's strengths and potential weaknesses in various scenarios.

cs.OS↗

Single-antenna super-resolution positioning with nonseparable toroidal pulses

The fundamental principle of satellite or node-based positioning involves triangulating the receiver's coordinates through the intersection of spatial distances. Recent advancements in hybrid wireless networks have yielded high-precision positioning at decimetre-level (wavelength-level) (Nature 611, 473-478 (2022)), approaching the resolution limits in free space. Here, we present a three-dimensional (3D) super-resolution positioning paradigm in free space by utilizing a novel kind of topologically structured pulses, toroidal electromagnetic pulses (Nat. Photonics 16(7), 523-528 (2022); Sci. Adv. 10(2), eadl1803 (2024)). Excited by the recent compact generator of toroidal pulses and their sophisticated topological and nonseparable structures, we demonstrate that the space-time nonseparability and skyrmion topology inherent in toroidal pulses can be harnessed to achieve freespace microwave 3D positioning with super-resolution accuracy, reaching the centimeter level, using a single emitting antenna. This work opens up new avenues for exploring the potential applications of topological electromagnetic pulses including but not limited to positioning, imaging, and sensing technologies.

physics.app-ph↗

Propagation-invariant strongly longitudinally polarized toroidal pulses

Recent advancements in optical, terahertz, and microwave systems have unveiled non-transverse optical toroidal pulses characterized by skyrmionic topologies, fractal-like singularities, space-time nonseparability, and anapole-exciting ability. Despite this, the longitudinally polarized fields of canonical toroidal pulses notably lag behind their transverse counterparts in magnitude. Interestingly, although mushroom-cloud-like toroidal vortices with strong longitudinal fields are common in nature, they remain unexplored in the realm of electromagnetics. Here, we present strongly longitudinally polarized toroidal pulses (SLPTPs) which boast a longitudinal component amplitude exceeding that of the transverse component by over tenfold. This unique polarization property endows SLPTPs with robust propagation characteristics, showcasing nondiffracting behavior. The propagation-invariant strongly longitudinally polarized field holds promise for pioneering light-matter interactions, far-field superresolution microscopy, and high-capacity wireless communication utilizing three polarizations.

physics.optics↗

Simultaneous Localization and Recognition of Subwavelength Non-Cooperative Entities Based on SISO Time Reversal and Neural Networks

The simultaneous localization and recognition of subwavelength non-cooperative entities within complex multi-scattering environments using a simplified system continues to pose a substantial challenge. This letter addresses this challenge by synergistically integrating time reversal time-frequency phase prints (TRTFPPs) and neural networks. Initially, a time reversal (TR) single-input single-output (SISO) framework is employed to generate TRTFPPs. To enhance the models' adaptability, particularly in the presence of noise, data augmentation techniques are applied. Subsequently, neural networks are employed to comprehend the TRTFPPs. Specifically, a cascaded neural network structure is embraced, encompassing both a recognition neural network and distinct neural networks for localizing different entities. Through the devised approach, two types of subwavelength entities are successfully identified and precisely localized through numerical simulations and experimental verification in laboratory environment. The proposed methodology holds applicability across various electromagnetic systems, including but not limited to detection, imaging, human-computer interaction, and the Internet of Things (IoT).

physics.app-ph↗

Backdoor Secrets Unveiled: Identifying Backdoor Data with Optimized Scaled Prediction Consistency

Modern machine learning (ML) systems demand substantial training data, often resorting to external sources. Nevertheless, this practice renders them vulnerable to backdoor poisoning attacks. Prior backdoor defense strategies have primarily focused on the identification of backdoored models or poisoned data characteristics, typically operating under the assumption of access to clean data. In this work, we delve into a relatively underexplored challenge: the automatic identification of backdoor data within a poisoned dataset, all under realistic conditions, i.e., without the need for additional clean data or without manually defining a threshold for backdoor detection. We draw an inspiration from the scaled prediction consistency (SPC) technique, which exploits the prediction invariance of poisoned data to an input scaling factor. Based on this, we pose the backdoor data identification problem as a hierarchical data splitting optimization problem, leveraging a novel SPC-based loss function as the primary optimization objective. Our innovation unfolds in several key aspects. First, we revisit the vanilla SPC method, unveiling its limitations in addressing the proposed backdoor identification problem. Subsequently, we develop a bi-level optimization-based approach to precisely identify backdoor data by minimizing the advanced SPC loss. Finally, we demonstrate the efficacy of our proposal against a spectrum of backdoor attacks, encompassing basic label-corrupted attacks as well as more sophisticated clean-label attacks, evaluated across various benchmark datasets. Experiment results show that our approach often surpasses the performance of current baselines in identifying backdoor data points, resulting in about 4%-36% improvement in average AUROC. Codes are available at https://github.com/OPTML-Group/BackdoorMSPC.

cs.LG↗