Search

A stable, low-power and tunable magnon frequency comb (MFC) is crucial for magnon-based precision measurements, quantum information processing and chip integration. Original method for creating MFC utilizes the nonlinear interactions between propagating spin waves and localized oscillations of an isolated magnetic texture, e.g., skyrmion. It requires a driving frequency well above the ferromagnetic resonance (FMR) and the spectrum frequency of MFC will quickly approach to the detection limit of conventional microwave technique after only tens of comb teeth. In addition, the detection and manipulation of a single skyrmion is challenging in experiments due to its high degree of locality. These issues hinder the applications of MFC. In this work, we report the low-lying MFC with comb frequencies below the FMR in a skyrmion crystal (SkX). We show that the MFC originates from the three-wave mixing between the collective skyrmion gyration and breathing in the SkX. Our findings significantly improve the efficiency of the nonlinear frequency conversion from a single-frequency mircowave input, and establish a synergistic relationship between the SkX and MFC, which paves the way to coherent information processing and ultra-sensitive metrology based on MFC.

As a prominent instance of vandalism edits, Wiki search poisoning for illicit promotion is a cybercrime in which the adversary aims at editing Wiki articles to promote illicit businesses through Wiki search results of relevant queries. In this paper, we report a study that, for the first time, shows that such stealthy blackhat SEO on Wiki can be automated. Our technique, called MAWSEO, employs adversarial revisions to achieve real-world cybercriminal objectives, including rank boosting, vandalism detection evasion, topic relevancy, semantic consistency, user awareness (but not alarming) of promotional content, etc. Our evaluation and user study demonstrate that MAWSEO is capable of effectively and efficiently generating adversarial vandalism edits, which can bypass state-of-the-art built-in Wiki vandalism detectors, and also get promotional content through to Wiki users without triggering their alarms. In addition, we investigated potential defense, including coherence based detection and adversarial training of vandalism detection, against our attack in the Wiki ecosystem., Comment: Accepted at the 45th IEEE Symposium on Security and Privacy (IEEE S&P 2024)

We consider the neural sparse representation to solve Boltzmann equation with BGK and quadratic collision model, where a network-based ansatz that can approximate the distribution function with extremely high efficiency is proposed. Precisely, fully connected neural networks are employed in the time and spatial space so as to avoid the discretization in space and time. The different low-rank representations are utilized in the microscopic velocity for the BGK and quadratic collision model, resulting in a significant reduction in the degree of freedom. We approximate the discrete velocity distribution in the BGK model using the canonical polyadic decomposition. For the quadratic collision model, a data-driven, SVD-based linear basis is built based on the BGK solution. All these will significantly improve the efficiency of the network when solving Boltzmann equation. Moreover, the specially designed adaptive-weight loss function is proposed with the strategies as multi-scale input and Maxwellian splitting applied to further enhance the approximation efficiency and speed up the learning process. Several numerical experiments, including 1D wave and Sod problems and 2D wave problem, demonstrate the effectiveness of these neural sparse representation methods.

Post-training quantization attracts increasing attention due to its convenience in deploying quantized neural networks. Although rounding-to-nearest remains the prevailing method for DNN quantization, prior research has demonstrated its suboptimal nature when applied to weight quantization. They propose optimizing weight rounding schemes by leveraging output error rather than the traditional weight quantization error. Our study reveals that similar rounding challenges also extend to activation quantization. Despite the easy generalization, the challenges lie in the dynamic nature of activation. Adaptive rounding is expected for varying activations and the method is subjected to runtime overhead. To tackle this, we propose the AQuant quantization framework with a novel perspective to reduce output error by adjusting rounding schemes of activations. Instead of using the constant rounding border 0.5 of the rounding-to-nearest operation, we make the border become a function w.r.t. the activation value to change the activation rounding by the adaptive border. To deal with the runtime overhead, we use a coarse-grained version of the border function. Finally, we introduce our framework to optimize the border function. Extensive experiments show that AQuant achieves notable improvements compared to state-of-the-art works and pushes the accuracy of ResNet-18 up to 60.31% under the 2-bit weight and activation quantization.

Trajectory prediction and behavioral decision-making are two important tasks for autonomous vehicles that require good understanding of the environmental context; behavioral decisions are better made by referring to the outputs of trajectory predictions. However, most current solutions perform these two tasks separately. Therefore, a joint neural network that combines multiple cues is proposed and named as the holistic transformer to predict trajectories and make behavioral decisions simultaneously. To better explore the intrinsic relationships between cues, the network uses existing knowledge and adopts three kinds of attention mechanisms: the sparse multi-head type for reducing noise impact, feature selection sparse type for optimally using partial prior knowledge, and multi-head with sigmoid activation type for optimally using posteriori knowledge. Compared with other trajectory prediction models, the proposed model has better comprehensive performance and good interpretability. Perceptual noise robustness experiments demonstrate that the proposed model has good noise robustness. Thus, simultaneous trajectory prediction and behavioral decision-making combining multiple cues can reduce computational costs and enhance semantic relationships between scenes and agents., Comment: 26 pages, 6 figures

As a key supplement to privacy policies that are known to be lengthy and difficult to read, Apple has launched the app privacy labels, which purportedly help users more easily understand an app's privacy practices. However, false and misleading privacy labels can dupe privacy-conscious consumers into downloading data-intensive apps, ultimately eroding the credibility and integrity of the labels. Although Apple releases requirements and guidelines for app developers to create privacy labels, little is known about whether and to what extent the privacy labels in the wild are correct and compliant, reflecting the actual data practices of iOS apps. This paper presents the first systematic study, based on our new methodology named Lalaine, to evaluate data-flow to privacy-label (flow-to-label) consistency. Lalaine analyzed the privacy labels and binaries of 5,102 iOS apps, shedding light on the prevalence and seriousness of privacy-label non-compliance. We provide detailed case studies and analyze root causes for privacy label non-compliance that complements prior understandings. This has led to new insights for improving privacy-label design and compliance requirements, so app developers, platform stakeholders, and policy-makers can better achieve their privacy and accountability goals. Lalaine is thoroughly evaluated for its high effectiveness and efficiency. We are responsibly reporting the results to stakeholders.

Transformer architecture has become the de-facto model for many machine learning tasks from natural language processing and computer vision. As such, improving its computational efficiency becomes paramount. One of the major computational inefficiency of Transformer-based models is that they spend the identical amount of computation throughout all layers. Prior works have proposed to augment the Transformer model with the capability of skimming tokens to improve its computational efficiency. However, they suffer from not having effectual and end-to-end optimization of the discrete skimming predictor. To address the above limitations, we propose the Transkimmer architecture, which learns to identify hidden state tokens that are not required by each layer. The skimmed tokens are then forwarded directly to the final output, thus reducing the computation of the successive layers. The key idea in Transkimmer is to add a parameterized predictor before each layer that learns to make the skimming decision. We also propose to adopt reparameterization trick and add skim loss for the end-to-end training of Transkimmer. Transkimmer achieves 10.97x average speedup on GLUE benchmark compared with vanilla BERT-base baseline with less than 1% accuracy degradation., Comment: Published as a conference paper at ACL 2022

This work makes an exhaustive search for generic renormalizable R-symmetric Wess-Zumino models with up to 5 chiral fields, and checks the consistency of their vacuum solutions with predictions from the Nelson-Seiberg theorem and its generalizations. Each model is recorded as the R-charge assignment of fields, which uniquely determines the cubic polynomial superpotentials with generic coefficients. Redundancy from permutation symmetries and reducible models are properly eliminated in the searching algorithm. We found that among 859 models in total, 19 of them have supersymmetric vacua unpredicted by the Nelson-Seiberg theorem and its generalizations. These exceptional models have their specific R-charge assignments covered by constructions found in previous literature. The search result can be used to estimate the accuracy of the field counting method for finding supersymmetric models in the string landscape. More applications of the dataset are expected in future work., Comment: 26 pages. v2: The search algorithm and results are updated and corrected. The full list of models and analysis of counterexamples are added in appendixes. v3: Counterexamples are rephrased as non-generic exceptions which do not contradict the Nelson-Seiberg. Discussion on computational complexity is added

Hybrid magnonic systems host a variety of characteristic quantum phenomena such as the magnetically-induced transparency (MIT) and Purcell effect, which are considered useful for future coherent quantum information processing. In this work, we experimentally demonstrate a tunable MIT effect in the Y3Fe5O12(YIG)/Permalloy(Py) magnon-magnon coupled system via changing the magnetic field orientations. By probing the magneto-optic effects of Py and YIG, we identify clear features of MIT spectra induced by the mode hybridization between the uniform mode of Py and the perpendicular standing spin-wave modes of YIG. By changing the external magnetic field orientations, we observe a tunable coupling strength between the YIG's spin-wave modes and the Py's uniform mode, upon the application of an out-of-plane magnetic field. This observation is theoretically interpreted by a geometrical consideration of the Py and YIG magnetization under the oblique magnetic field even at a constant interfacial exchange coupling. Our findings show high promise for investigating tunable coherent phenomena with hybrid magnonic platforms., Comment: 10 pages, 5 figures

Transformer models have achieved promising results on natural language processing (NLP) tasks including extractive question answering (QA). Common Transformer encoders used in NLP tasks process the hidden states of all input tokens in the context paragraph throughout all layers. However, different from other tasks such as sequence classification, answering the raised question does not necessarily need all the tokens in the context paragraph. Following this motivation, we propose Block-skim, which learns to skim unnecessary context in higher hidden layers to improve and accelerate the Transformer performance. The key idea of Block-Skim is to identify the context that must be further processed and those that could be safely discarded early on during inference. Critically, we find that such information could be sufficiently derived from the self-attention weights inside the Transformer model. We further prune the hidden states corresponding to the unnecessary positions early in lower layers, achieving significant inference-time speedup. To our surprise, we observe that models pruned in this way outperform their full-size counterparts. Block-Skim improves QA models' accuracy on different datasets and achieves 3 times speedup on BERT-base model., Comment: Published as a conference paper at AAAI 2022