BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Ren Wang

Ren Wang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Machine LearningArtificial IntelligenceCryptography and Securityphysics.app-phphysics.opticsComputer VisionHardware ArchitectureInformation Retrievalmath.RAmath.RTOperating Systemsphysics.class-phSocial and Information Networks

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
9works
0followers
13topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

9 published item(s)

preprint2026arXiv

MoCo-EA: Exploiting Adversarial Mode Connectivity for Efficient Evolutionary Attacks

Evolutionary algorithms for adversarial attacks leverage population-based search to discover perturbations without gradient information, but suffer from inefficient crossover operations that destroy adversarial properties through discrete interpolation. We introduce Mode Connectivity Evolutionary Attack (MoCo-EA), which replaces traditional crossover with a novel Bézier crossover operator that optimizes perturbations along a continuous Bézier curve between parent perturbations. Our key insight is that adversarial examples lie on connected manifolds where intermediate points maintain and often enhance attack effectiveness. We demonstrate three findings: (1) Successful adversarial perturbations exhibit mode connectivity; (2) Intermediate points along optimized paths achieve higher transferability than endpoints; (3) Bézier crossover dramatically outperforms discrete genetic operations while reducing convergence time and query requirements. By exploiting the geometric structure of adversarial space through path optimization, MoCo-EA provides an efficient and reliable method. Our work challenges the traditional view of adversarial examples as isolated points and opens new directions for both attack generation and defense research.

0 citations0 reviewsNo code linkedOpen access
preprint2024arXiv

Inverse Design of Frequency Selective Surface Using Physics-Informed Neural Networks

This paper uses Physics-Informed Neural Network (PINN) to design Frequency Selective Surface (FSS). PINN integrates physical information into the loss function, so training PINN does not require a dataset, which will be faster than traditional neural networks for inverse design. The specific implementation process of this paper is to construct a PINN using field solutions of mode matching method, and given the design goal, the PINN can train the shape of the diaphragms. The single frequency FSS that meets the design goal was designed using the inverse design method proposed in this paper without a dataset, verifying the rationality of using PINN to design metasurface. Using PINN for inverse design is not limited to single frequency FSS, but can also be used for more complex metasurface.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

Free-Space Propagation and Skyrmion Topology of Toroidal Electromagnetic Pulses

Toroidal electromagnetic pulses have been recently reported as nontransverse, space-time nonseparable topological excitations of free space [Nat. Photon. 16, 523-528 (2022)]. However, their propagation dynamics and topological configurations have not been comprehensively experimentally characterized. Here, we report that microwave toroidal pulses can be launched by a broadband conical horn antenna. We experimentally map their skyrmionic textures and demonstrate how that during propagation the pulses evolves towards stronger space-time nonseparability and closer proximity to the canonical Hellwarth and Nouchi toroidal pulses.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Space Time Nonseparable Electromagnetic Vortices

In structured light with controllable degrees of freedom (DoFs), the vortex beams carrying orbital angular momentum (OAM) give access to provide additional degrees of freedom for information transfer, and in classic field, the propagation invariant space time electromagnetic pulses are the possible approach to high dimensional states. This paper arose an idea that coupling the space polarization nonseparable states of vortex beams and space time nonseparable states of spatiotemporal pulse can generate numerous unique and beneficial effects. Here, we introduce an family of space time nonseparable electromagnetic vortices (STNEV). The pulses exhibit complex and robust spatiotemporal topological structure of the electromagnetic fields, multiple singularities in the Poynting vector maps and distributions of energy backflow. We apply a quantum-mechanics methodology for quantitatively characterizing space time nonseparability of the pulse. Our findings facilitate their applications in fields of information transfer, toroidal electrodynamics and inducing transient excitations in matter.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

IOCA: High-Speed I/O-Aware LLC Management for Network-Centric Multi-Tenant Platform

In modern server CPUs, last-level cache (LLC) is a critical hardware resource that exerts significant influence on the performance of the workloads, and how to manage LLC is a key to the performance isolation and QoS in the cloud with multi-tenancy. In this paper, we argue that besides CPU cores, high-speed network I/O is also important for LLC management. This is because of an Intel architectural innovation -- Data Direct I/O (DDIO) -- that directly injects the inbound I/O traffic to (part of) the LLC instead of the main memory. We summarize two problems caused by DDIO and show that (1) the default DDIO configuration may not always achieve optimal performance, (2) DDIO can decrease the performance of non-I/O workloads which share LLC with it by as high as 32%. We then present IOCA, the first LLC management mechanism for network-centric platforms that treats the I/O as the first-class citizen. IOCA monitors and analyzes the performance of the cores, LLC, and DDIO using CPU's hardware performance counters, and adaptively adjusts the number of LLC ways for DDIO or the tenants that demand more LLC capacity. In addition, IOCA dynamically chooses the tenants that share its LLC resource with DDIO, to minimize the performance interference by both the tenants and the I/O. Our experiments with multiple microbenchmarks and real-world applications in two major end-host network models demonstrate that IOCA can effectively reduce the performance degradation caused by DDIO, with minimal overhead.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

On Fast Adversarial Robustness Adaptation in Model-Agnostic Meta-Learning

Model-agnostic meta-learning (MAML) has emerged as one of the most successful meta-learning techniques in few-shot learning. It enables us to learn a meta-initialization} of model parameters (that we call meta-model) to rapidly adapt to new tasks using a small amount of labeled training data. Despite the generalization power of the meta-model, it remains elusive that how adversarial robustness can be maintained by MAML in few-shot learning. In addition to generalization, robustness is also desired for a meta-model to defend adversarial examples (attacks). Toward promoting adversarial robustness in MAML, we first study WHEN a robustness-promoting regularization should be incorporated, given the fact that MAML adopts a bi-level (fine-tuning vs. meta-update) learning procedure. We show that robustifying the meta-update stage is sufficient to make robustness adapted to the task-specific fine-tuning stage even if the latter uses a standard training protocol. We also make additional justification on the acquired robustness adaptation by peering into the interpretability of neurons' activation maps. Furthermore, we investigate HOW robust regularization can efficiently be designed in MAML. We propose a general but easily-optimized robustness-regularized meta-learning framework, which allows the use of unlabeled data augmentation, fast adversarial attack generation, and computationally-light fine-tuning. In particular, we for the first time show that the auxiliary contrastive learning task can enhance the adversarial robustness of MAML. Finally, extensive experiments are conducted to demonstrate the effectiveness of our proposed methods in robust few-shot learning.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Skew group categories, algebras associated to Cartan matrices and folding of root lattices

For a finite group action on a finite EI quiver, we construct its `orbifold' quotient EI quiver. The free EI category associated to the quotient EI quiver is equivalent to the skew group category with respect to the given group action. Specializing the result to a finite group action on a finite acyclic quiver, we prove that, under reasonable conditions, the skew group category of the path category is equivalent to a finite EI category of Cartan type. If the ground field is of characteristic $p$ and the acting group is a cyclic $p$-group, we prove that the skew group algebra of the path algebra is Morita equivalent to the algebra associated to a Cartan matrix, defined in [C. Geiss, B. Leclerc, and J. Schröer, Quivers with relations for symmetrizable Cartan matrices I: Foundations, Invent. Math. 209 (2017), 61--158]. We apply the Morita equivalence to construct a categorification of the folding projection between the root lattices with respect to a graph automorphism. In the Dynkin cases, the restriction of the categorification to indecomposable modules corresponds to the folding of positive roots.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Practical Detection of Trojan Neural Networks: Data-Limited and Data-Free Cases

When the training data are maliciously tampered, the predictions of the acquired deep neural network (DNN) can be manipulated by an adversary known as the Trojan attack (or poisoning backdoor attack). The lack of robustness of DNNs against Trojan attacks could significantly harm real-life machine learning (ML) systems in downstream applications, therefore posing widespread concern to their trustworthiness. In this paper, we study the problem of the Trojan network (TrojanNet) detection in the data-scarce regime, where only the weights of a trained DNN are accessed by the detector. We first propose a data-limited TrojanNet detector (TND), when only a few data samples are available for TrojanNet detection. We show that an effective data-limited TND can be established by exploring connections between Trojan attack and prediction-evasion adversarial attacks including per-sample attack as well as all-sample universal attack. In addition, we propose a data-free TND, which can detect a TrojanNet without accessing any data samples. We show that such a TND can be built by leveraging the internal response of hidden neurons, which exhibits the Trojan behavior even at random noise inputs. The effectiveness of our proposals is evaluated by extensive experiments under different model architectures and datasets including CIFAR-10, GTSRB, and ImageNet.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

SCG: Spotting Coordinated Groups in Social Media

Recent events have led to a burgeoning awareness on the misuse of social media sites to affect political events, sway public opinion, and confuse the voters. Such serious, hostile mass manipulation has motivated a large body of works on bots/troll detection and fake news detection, which mostly focus on classifying at the user level based on the content generated by the users. In this study, we jointly analyze the connections among the users, as well as the content generated by them to Spot Coordinated Groups (SCG), sets of users that are likely to be organized towards impacting the general discourse. Given their tiny size (relative to the whole data), detecting these groups is computationally hard. Our proposed method detects these tiny-clusters effectively and efficiently. We deploy our SCG method to summarize and explain the coordinated groups on Twitter around the 2019 Canadian Federal Elections, by analyzing over 60 thousand user accounts with 3.4 million followership connections, and 1.3 million unique hashtags in the content of their tweets. The users in the detected coordinated groups are over 4x more likely to get suspended, whereas the hashtags which characterize their creed are linked to misinformation campaigns.

0 citations0 reviewsNo code linkedOpen access