Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
39works
0followers
32topics
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

39 published item(s)

preprint2026arXiv

OTora: A Unified Red Teaming Framework for Reasoning-Level Denial-of-Service in LLM Agents

Large Language Models (LLMs) are increasingly deployed as autonomous agents that execute tool-augmented, multi-step tasks, where latency is a critical factor for real-world applications. Yet an overlooked threat is Reasoning-Level Denial-of-Service (R-DoS), in which an attacker preserves task correctness but degrades availability by inflating an agent's reasoning depth or tool-use budget. We introduce OTora, the first unified, two-stage red-teaming framework for instantiating R-DoS attacks. Stage I optimizes an adversarial trigger that induces targeted tool invocations using insertion-aware scoring and dynamic target co-evolution, supporting both black-box and white-box settings. Stage II generates agent-aware reasoning payloads via an ICL-guided genetic search that amplifies overthinking while maintaining correct task outcomes. Across WebShop, Email, and OS agents built on multiple backbone models such as LLaMA-70B and GPT-OSS-120B, OTora achieves up to 10 times increases in reasoning tokens and order-of-magnitude latency slowdowns, all while preserving near-baseline task accuracy. Finally, we discuss mitigation strategies for detecting and constraining abnormal reasoning and latency spikes. The code is available at https://github.com/llm2409/OTora.

preprint2025arXiv

Constrained Language Model Policy Optimization via Risk-aware Stepwise Alignment

When fine-tuning pre-trained Language Models (LMs) to exhibit desired behaviors, maintaining control over risk is critical for ensuring both safety and trustworthiness. Most existing safety alignment methods, such as Safe RLHF and SACPO, typically operate under a risk-neutral paradigm that is insufficient to address the risks arising from deviations from the reference policy and offers limited robustness against rare but potentially catastrophic harmful behaviors. To address this limitation, we propose Risk-aware Stepwise Alignment (RSA), a novel alignment method that explicitly incorporates risk awareness into the policy optimization process by leveraging a class of nested risk measures. Specifically, RSA formulates safety alignment as a token-level risk-aware constrained policy optimization problem and solves it through a stepwise alignment procedure that yields token-level policy updates derived from the nested risk measures. This design offers two key benefits: (1) it mitigates risks induced by excessive model shift away from a reference policy, and (2) it explicitly suppresses low-probability yet high-impact harmful behaviors. Moreover, we provide theoretical analysis on policy optimality under mild assumptions. Experimental results demonstrate that our method achieves high levels of helpfulness while ensuring strong safety and significantly suppresses tail risks, namely low-probability yet high-impact unsafe responses.

preprint2025arXiv

GuidedMorph: Two-Stage Deformable Registration for Breast MRI

Accurately registering breast MR images from different time points enables the alignment of anatomical structures and tracking of tumor progression, supporting more effective breast cancer detection, diagnosis, and treatment planning. However, the complexity of dense tissue and its highly non-rigid nature pose challenges for conventional registration methods, which primarily focus on aligning general structures while overlooking intricate internal details. To address this, we propose \textbf{GuidedMorph}, a novel two-stage registration framework designed to better align dense tissue. In addition to a single-scale network for global structure alignment, we introduce a framework that utilizes dense tissue information to track breast movement. The learned transformation fields are fused by introducing the Dual Spatial Transformer Network (DSTN), improving overall alignment accuracy. A novel warping method based on the Euclidean distance transform (EDT) is also proposed to accurately warp the registered dense tissue and breast masks, preserving fine structural details during deformation. The framework supports paradigms that require external segmentation models and with image data only. It also operates effectively with the VoxelMorph and TransMorph backbones, offering a versatile solution for breast registration. We validate our method on ISPY2 and internal dataset, demonstrating superior performance in dense tissue, overall breast alignment, and breast structural similarity index measure (SSIM), with notable improvements by over 13.01% in dense tissue Dice, 3.13% in breast Dice, and 1.21% in breast SSIM compared to the best learning-based baseline.

preprint2024arXiv

Capacity Results for Multiple-Input Multiple-Output Optical Wireless Communication With Per-Antenna Intensity Constraints

In this paper, we investigate the capacity of a multiple-input multiple-output (MIMO) optical intensity channel (OIC) under per-antenna peak- and average-intensity constraints. We first consider the case where the average intensities of input are required to be equal to preassigned constants due to the requirement of illumination quality and color temperature. When the channel graph of the MIMO OIC is strongly connected, we prove that the strongest eigen-subchannel must have positive channel gains, which simplifies the capacity analysis. Then we derive various capacity bounds by utilizing linear precoding, generalized entropy power inequality, and QR decomposition, etc. These bounds are numerically verified to approach the capacity in the low or high signal-to-noise ratio regime. Specifically, when the channel rank is one less than the number of transmit antennas, we derive an equivalent capacity expression from the perspective of convex geometry, and new lower bounds are derived based on this equivalent expression. Finally, the developed results are extended to the more general case where the average intensities of input are required to be no larger than preassigned constants.

preprint2023arXiv

Towards A Unified Conformer Structure: from ASR to ASV Task

Transformer has achieved extraordinary performance in Natural Language Processing and Computer Vision tasks thanks to its powerful self-attention mechanism, and its variant Conformer has become a state-of-the-art architecture in the field of Automatic Speech Recognition (ASR). However, the main-stream architecture for Automatic Speaker Verification (ASV) is convolutional Neural Networks, and there is still much room for research on the Conformer based ASV. In this paper, firstly, we modify the Conformer architecture from ASR to ASV with very minor changes. Length-Scaled Attention (LSA) method and Sharpness-Aware Minimizationis (SAM) are adopted to improve model generalization. Experiments conducted on VoxCeleb and CN-Celeb show that our Conformer based ASV achieves competitive performance compared with the popular ECAPA-TDNN. Secondly, inspired by the transfer learning strategy, ASV Conformer is natural to be initialized from the pretrained ASR model. Via parameter transferring, self-attention mechanism could better focus on the relationship between sequence features, brings about 11% relative improvement in EER on test set of VoxCeleb and CN-Celeb, which reveals the potential of Conformer to unify ASV and ASR task. Finally, we provide a runtime in ASV-Subtools to evaluate its inference speed in production scenario. Our code is released at https://github.com/Snowdar/asv-subtools/tree/master/doc/papers/conformer.md.

preprint2022arXiv

Analysis of a Direct Separation Method Based on Adaptive Chirplet Transform for Signals with Crossover Instantaneous Frequencies

In many applications, it is necessary to retrieve the sub-signal building blocks of a multi-component signal, which is usually non-stationary in real-world and real-life applications. Empirical mode decomposition (EMD), synchrosqueezing transform (SST), signal separation operation (SSO), and iterative filtering decomposition (IFD) have been proposed and developed for this purpose. However, these computational methods are restricted by the specification of well-separation of the sub-signal frequency curves for multi-component signals. On the other hand, the chirplet transform-based signal separation scheme (CT3S) that extends SSO from the two-dimensional "time-frequency" plane to the three-dimensional "time-frequency-chirp rate" space was recently proposed in our recent work to remove the frequency-separation specification, and thereby allowing "frequency crossing". The main objective of this present paper is to carry out an in-depth error analysis study of instantaneous frequency estimation and component recovery for the CT3S method.

preprint2022arXiv

Approximation Properties of Deep ReLU CNNs

This paper focuses on establishing $L^2$ approximation properties for deep ReLU convolutional neural networks (CNNs) in two-dimensional space. The analysis is based on a decomposition theorem for convolutional kernels with a large spatial size and multi-channels. Given the decomposition result, the property of the ReLU activation function, and a specific structure for channels, a universal approximation theorem of deep ReLU CNNs with classic structure is obtained by showing its connection with one-hidden-layer ReLU neural networks (NNs). Furthermore, approximation properties are obtained for one version of neural networks with ResNet, pre-act ResNet, and MgNet architecture based on connections between these networks.

preprint2022arXiv

Deep Representation Decomposition for Rate-Invariant Speaker Verification

While promising performance for speaker verification has been achieved by deep speaker embeddings, the advantage would reduce in the case of speaking-style variability. Speaking rate mismatch is often observed in practical speaker verification systems, which may actually degrade the system performance. To reduce intra-class discrepancy caused by speaking rate, we propose a deep representation decomposition approach with adversarial learning to learn speaking rate-invariant speaker embeddings. Specifically, adopting an attention block, we decompose the original embedding into an identity-related component and a rate-related component through multi-task training. Additionally, to reduce the latent relationship between the two decomposed components, we further propose a cosine mapping block to train the parameters adversarially to minimize the cosine similarity between the two decomposed components. As a result, identity-related features become robust to speaking rate and then are used for verification. Experiments are conducted on VoxCeleb1 data and HI-MIA data to demonstrate the effectiveness of our proposed approach.

preprint2022arXiv

Direct Signal Separation Via Extraction of Local Frequencies with Adaptive Time-Varying Parameters

Real-world phenomena that can be formulated as signals are often affected by a number of factors and appear as multi-component modes. To understand and process such phenomena, "divide-and-conquer" is probably the most common strategy to address the problem. In other words, the captured signal is decomposed into signal components for each individual component to be processed. Unfortunately, for signals that are superimposition of non-stationary amplitude-frequency modulated (AM-FM) components, the "divide-and-conquer" strategy is bound to fail, since there is no way to be sure that the decomposed components take on the AM-FM formulations which are necessary for the extraction of their instantaneous frequencies (IFs) and amplitudes (IAs). In this paper, we propose an adaptive signal separation operation (ASSO) for effective and accurate separation of a single-channel blind-source multi-component signal, via introducing a time-varying parameter that adapts locally to IFs and using linear chirp (linear frequency modulation) signals to approximate components at each time instant. We derive more accurate component recovery formulae based on the linear chirp signal local approximation. In addition, a recovery scheme, together with a ridge detection method, is also proposed to extract the signal components one by one, and the time-varying parameter is updated for each component. The proposed method is suitable for engineering implementation, being capable of separating complicated signals into their components or sub-signals and reconstructing the signal trend directly. Numerical experiments on synthetic and real-world signals are presented to demonstrate our improvement over the previous attempts.

preprint2022arXiv

Dual Space Graph Contrastive Learning

Unsupervised graph representation learning has emerged as a powerful tool to address real-world problems and achieves huge success in the graph learning domain. Graph contrastive learning is one of the unsupervised graph representation learning methods, which recently attracts attention from researchers and has achieved state-of-the-art performances on various tasks. The key to the success of graph contrastive learning is to construct proper contrasting pairs to acquire the underlying structural semantics of the graph. However, this key part is not fully explored currently, most of the ways generating contrasting pairs focus on augmenting or perturbating graph structures to obtain different views of the input graph. But such strategies could degrade the performances via adding noise into the graph, which may narrow down the field of the applications of graph contrastive learning. In this paper, we propose a novel graph contrastive learning method, namely \textbf{D}ual \textbf{S}pace \textbf{G}raph \textbf{C}ontrastive (DSGC) Learning, to conduct graph contrastive learning among views generated in different spaces including the hyperbolic space and the Euclidean space. Since both spaces have their own advantages to represent graph data in the embedding spaces, we hope to utilize graph contrastive learning to bridge the spaces and leverage advantages from both sides. The comparison experiment results show that DSGC achieves competitive or better performances among all the datasets. In addition, we conduct extensive experiments to analyze the impact of different graph encoders on DSGC, giving insights about how to better leverage the advantages of contrastive learning between different spaces.

preprint2022arXiv

Graph Convolutional Network Based Semi-Supervised Learning on Multi-Speaker Meeting Data

Unsupervised clustering on speakers is becoming increasingly important for its potential uses in semi-supervised learning. In reality, we are often presented with enormous amounts of unlabeled data from multi-party meetings and discussions. An effective unsupervised clustering approach would allow us to significantly increase the amount of training data without additional costs for annotations. Recently, methods based on graph convolutional networks (GCN) have received growing attention for unsupervised clustering, as these methods exploit the connectivity patterns between nodes to improve learning performance. In this work, we present a GCN-based approach for semi-supervised learning. Given a pre-trained embedding extractor, a graph convolutional network is trained on the labeled data and clusters unlabeled data with "pseudo-labels". We present a self-correcting training mechanism that iteratively runs the cluster-train-correct process on pseudo-labels. We show that this proposed approach effectively uses unlabeled data and improves speaker recognition accuracy.

preprint2022arXiv

Josephson-Coulomb drag effect between graphene and LaAlO3/SrTiO3 interfacial superconductor

Coulomb drag refers to the phenomenon that a charge current in one electronic circuit induces a responsive current in a neighboring circuit solely through Coulomb interactions. For conventional interactions between fermionic particles such as electrons, the as-induced drag current in the passive layer is orders of magnitude weaker than the active current due to strong dielectric screening effect between the two. Here we propose a 'super' Coulomb drag effect between an active normal conductor and a passive superconductor of Josephson junction arrays, whereby the passive current can greatly exceed the active. The drag force originates from the interactions between the substantially enhanced dynamical quantum fluctuations of the superconducting phases in the passive layer and the normal electrons in the active layer. We demonstrate this effect in the devices composed of monolayer graphene and LaAlO3/SrTiO3 heterointerface, an inherently non-uniform superconductor described by Josephson junction arrays. Remarkable drag signal is observed in the superconducting transition regime of the LaAlO3/SrTiO3 interface, with its sign independent of the carrier type in the graphene layer. The estimated passive-to-active ratio can reach about 0.3 at the optimal gate voltage and the temperature dependence follows that of the typical Josephson energy between superconducting puddles. Strikingly, the ratio ought to be as large as 10^5 at zero temperature by theoretical extrapolation. From engineering perspective, our device may work as current or voltage transformers, and the drag mechanism lays the foundation for synchronizing Josephson-junction-array-based terahertz radiators.

preprint2022arXiv

Label Semantic Knowledge Distillation for Unbiased Scene Graph Generation

The Scene Graph Generation (SGG) task aims to detect all the objects and their pairwise visual relationships in a given image. Although SGG has achieved remarkable progress over the last few years, almost all existing SGG models follow the same training paradigm: they treat both object and predicate classification in SGG as a single-label classification problem, and the ground-truths are one-hot target labels. However, this prevalent training paradigm has overlooked two characteristics of current SGG datasets: 1) For positive samples, some specific subject-object instances may have multiple reasonable predicates. 2) For negative samples, there are numerous missing annotations. Regardless of the two characteristics, SGG models are easy to be confused and make wrong predictions. To this end, we propose a novel model-agnostic Label Semantic Knowledge Distillation (LS-KD) for unbiased SGG. Specifically, LS-KD dynamically generates a soft label for each subject-object instance by fusing a predicted Label Semantic Distribution (LSD) with its original one-hot target label. LSD reflects the correlations between this instance and multiple predicate categories. Meanwhile, we propose two different strategies to predict LSD: iterative self-KD and synchronous self-KD. Extensive ablations and results on three SGG tasks have attested to the superiority and generality of our proposed LS-KD, which can consistently achieve decent trade-off performance between different predicate categories.

preprint2022arXiv

Learning to Prove Trigonometric Identities

Automatic theorem proving with deep learning methods has attracted attentions recently. In this paper, we construct an automatic proof system for trigonometric identities. We define the normalized form of trigonometric identities, design a set of rules for the proof and put forward a method which can generate theoretically infinite trigonometric identities. Our goal is not only to complete the proof, but to complete the proof in as few steps as possible. For this reason, we design a model to learn proof data generated by random BFS (rBFS), and it is proved theoretically and experimentally that the model can outperform rBFS after a simple imitation learning. After further improvement through reinforcement learning, we get AutoTrig, which can give proof steps for identities in almost as short steps as BFS (theoretically shortest method), with a time cost of only one-thousandth. In addition, AutoTrig also beats Sympy, Matlab and human in the synthetic dataset, and performs well in many generalization tasks.

preprint2022arXiv

MealRec: A Meal Recommendation Dataset

Bundle recommendation systems aim to recommend a bundle of items for a user to consider as a whole. They have become a norm in modern life and have been applied to many real-world settings, such as product bundle recommendation, music playlist recommendation and travel package recommendation. However, compared to studies of bundle recommendation approaches in areas such as online shopping and digital music services, research on meal recommendations for restaurants in the hospitality industry has made limited progress, due largely to the lack of high-quality benchmark datasets. A publicly available dataset specialising in meal recommendation research for the research community is in urgent demand. In this paper, we introduce a meal recommendation dataset (MealRec) that aims to facilitate future research. MealRec is constructed from the user review records of Allrecipe.com, covering 1,500+ users, 7,200+ recipes and 3,800+ meals. Each recipe is described with rich information, such as ingredients, instructions, pictures, category and tags, etc; and each meal is three-course, consisting of an appetizer, a main dish and a dessert. Furthermore, we propose a category-constrained meal recommendation model that is evaluated through comparative experiments with several state-of-the-art bundle recommendation methods on MealRec. Experimental results confirm the superiority of our model and demonstrate that MealRec is a promising testbed for meal recommendation related research. The MealRec dataset and the source code of our proposed model are available at https://github.com/WUT-IDEA/MealRec for access and reproducibility.

preprint2022arXiv

Normalized solutions for Schrödinger-Bopp-Podolsky system

In this paper, we study the following energy functional originates from the Schrödinger-Bopp-Podolsky system $$I(u)=\frac{1}{2}\int_{\mathbb{R}^{3}}|\nabla u|^{2}dx+\frac{1}{4}\int_{\mathbb{R}^{3}} ϕ_{u}u^{2}dx-\frac{1}{p}\int_{\mathbb{R}^{3}}|u|^{p}dx$$ constrained on $B_ρ=\left\{u\in H^{1}(\mathbb{R}^{3},C):\ \left\|u\right\|_{2}=ρ\right\},$ where $ρ>0.$ As such constrained problem $I(u)$ is bounded from below on $B_ρ$ when $p\in(2,\frac{10}{3}).$ We use minimizing method to get a normalized solution.

preprint2022arXiv

Probabilistic Guaranteed Path Planning for Safe Urban Air Mobility Using Chance Constrained RRT

Safety is a critical concern for the success of urban air mobility, especially in dynamic and uncertain environments. This paper proposes a path planning algorithm based on RRT in conjunction with chance constraints in the presence of uncertain obstacles. The chance-constrained formulation for Gaussian distributed obstacles is developed by converting the probabilistic constraints to deterministic constraints in terms of distribution parameters. The probabilistic feasible region at every time step can be established through the simulation of the system state and the evaluation of convex constraints. Through establishing chance-constrained RRT, the algorithm not only enjoys the benefits of sampling-based algorithms but also incorporates uncertainty into the formulation. Simulation results demonstrate that the planning for a trajectory connecting the starting and goal point in accordance with the requirement of probabilistic obstacle avoidance can be achieved by the utilization of this algorithm.

preprint2022arXiv

ReLU Deep Neural Networks from the Hierarchical Basis Perspective

We study ReLU deep neural networks (DNNs) by investigating their connections with the hierarchical basis method in finite element methods. First, we show that the approximation schemes of ReLU DNNs for $x^2$ and $xy$ are composition versions of the hierarchical basis approximation for these two functions. Based on this fact, we obtain a geometric interpretation and systematic proof for the approximation result of ReLU DNNs for polynomials, which plays an important role in a series of recent exponential approximation results of ReLU DNNs. Through our investigation of connections between ReLU DNNs and the hierarchical basis approximation for $x^2$ and $xy$, we show that ReLU DNNs with this special structure can be applied only to approximate quadratic functions. Furthermore, we obtain a concise representation to explicitly reproduce any linear finite element function on a two-dimensional uniform mesh by using ReLU DNNs with only two hidden layers.

preprint2022arXiv

Scattered Image Reconstruction at Near-infrared Based on Spatial Modulation Instability

We present a method of near-infrared image reconstruction based on spatial modulation instability in a photorefractive strontium barium niobate crystal. The conditions that lead to the formation of modulation instability at near-infrared are discussed depending on the theory of modulation instability gain. Experimental results of scattered image reconstruction at the 1064 nm wavelength show the maximum cross-correlation coefficient and cross-correlation gain are 0.57 and 2.09 respectively. This method is expected to be an aid for near-infrared imaging technologies.

preprint2022arXiv

The Devil is in the Labels: Noisy Label Correction for Robust Scene Graph Generation

Unbiased SGG has achieved significant progress over recent years. However, almost all existing SGG models have overlooked the ground-truth annotation qualities of prevailing SGG datasets, i.e., they always assume: 1) all the manually annotated positive samples are equally correct; 2) all the un-annotated negative samples are absolutely background. In this paper, we argue that both assumptions are inapplicable to SGG: there are numerous "noisy" groundtruth predicate labels that break these two assumptions, and these noisy samples actually harm the training of unbiased SGG models. To this end, we propose a novel model-agnostic NoIsy label CorrEction strategy for SGG: NICE. NICE can not only detect noisy samples but also reassign more high-quality predicate labels to them. After the NICE training, we can obtain a cleaner version of SGG dataset for model training. Specifically, NICE consists of three components: negative Noisy Sample Detection (Neg-NSD), positive NSD (Pos-NSD), and Noisy Sample Correction (NSC). Firstly, in Neg-NSD, we formulate this task as an out-of-distribution detection problem, and assign pseudo labels to all detected noisy negative samples. Then, in Pos-NSD, we use a clustering-based algorithm to divide all positive samples into multiple sets, and treat the samples in the noisiest set as noisy positive samples. Lastly, in NSC, we use a simple but effective weighted KNN to reassign new predicate labels to noisy positive samples. Extensive results on different backbones and tasks have attested to the effectiveness and generalization abilities of each component of NICE.

preprint2022arXiv

The Effects of Dynamic Learning and the Forgetting Process on an Optimizing Modelling for Full-Service Repair Pricing Contracts for Medical Devices

In order to improve the profitability and customer service management of original equipment manufacturers (OEMs) in a market where full-service (FS) and on-call service (OS) co-exist, this article extends the optimizing modelling for pricing FS repair contracts with the effects of dynamic learning and forgetting. Along with considering autonomous learning in maintenance practice, this study also analyses how induced learning and forgetting process in a workplace put impact on the pricing optimizing model of FS contracts in the portfolio of FS and OS. A numerical analysis based on real data from a medical industry proves that the enhanced FS pricing model discussed here has two main advantages: (1) It could prominently improve repair efficiency, and (2) It help OEMs gain better profits compared to the original FS model and the sole OS maintenance. Sensitivity analysis shows that if internal failure rate increases, the optimized FS price rises gradually until reaching the maximum value, and profitability to the OEM increases overall; if frequency of induced learning goes up, the optimal FS price rises after a short-term downward trend, with a stable profitability to the OEM.

preprint2022arXiv

Towards Real-Time Visual Tracking with Graded Color-names Features

MeanShift algorithm has been widely used in tracking tasks because of its simplicity and efficiency. However, the traditional MeanShift algorithm needs to label the initial region of the target, which reduces the applicability of the algorithm. Furthermore, it is only applicable to the scene with a large overlap rate between the target area and the candidate area. Therefore, when the target speed is fast, the target scale change, shape deformation or the target occlusion occurs, the tracking performance will be deteriorated. In this paper, we address the challenges above-mentioned by developing a tracking method that combines the background models and the graded features of color-names under the MeanShift framework. This method significantly improve performance in the above scenarios. In addition, it facilitates the balance between detection accuracy and detection speed. Experimental results demonstrate the validation of the proposed method.

preprint2022arXiv

Video is All You Need: Attacking PPG-based Biometric Authentication

Unobservable physiological signals enhance biometric authentication systems. Photoplethysmography (PPG) signals are convenient owning to its ease of measurement and are usually well protected against remote adversaries in authentication. Any leaked PPG signals help adversaries compromise the biometric authentication systems, and the advent of remote PPG (rPPG) enables adversaries to acquire PPG signals through restoration. While potentially dangerous, rPPG-based attacks are overlooked because existing methods require the victim's PPG signals. This paper proposes a novel spoofing attack approach that uses the waveforms of rPPG signals extracted from video clips to fool the PPG-based biometric authentication. We develop a new PPG restoration model that does not require leaked PPG signals for adversarial attacks. Test results on state-of-art PPG-based biometric authentication show that the signals recovered through rPPG pose a severe threat to PPG-based biometric authentication.

preprint2022arXiv

What is Next when Sequential Prediction Meets Implicitly Hard Interaction?

Hard interaction learning between source sequences and their next targets is challenging, which exists in a myriad of sequential prediction tasks. During the training process, most existing methods focus on explicitly hard interactions caused by wrong responses. However, a model might conduct correct responses by capturing a subset of learnable patterns, which results in implicitly hard interactions with some unlearned patterns. As such, its generalization performance is weakened. The problem gets more serious in sequential prediction due to the interference of substantial similar candidate targets. To this end, we propose a Hardness Aware Interaction Learning framework (HAIL) that mainly consists of two base sequential learning networks and mutual exclusivity distillation (MED). The base networks are initialized differently to learn distinctive view patterns, thus gaining different training experiences. The experiences in the form of the unlikelihood of correct responses are drawn from each other by MED, which provides mutual exclusivity knowledge to figure out implicitly hard interactions. Moreover, we deduce that the unlikelihood essentially introduces additional gradients to push the pattern learning of correct responses. Our framework can be easily extended to more peer base networks. Evaluation is conducted on four datasets covering cyber and physical spaces. The experimental results demonstrate that our framework outperforms several state-of-the-art methods in terms of top-k based metrics.

preprint2021arXiv

CFNS Ad-Hoc meeting on Radiative Corrections Whitepaper

Current precision scattering experiments and even more so many experiments planed for the Electron Ion Collider will be limited by systematics. From the theory side, a fundamental source of systematic uncertainty is the correct treatment of radiative effects. To gauge the current state of technique and knowledge, help the cross-pollination between different direction of nuclear physics, and to give input to the yellow report process, the community met in an ad-hoc workshop hosted by the Center for Frontiers in Nuclear Science, Stony Brook University. This whitepaper is a collection of contributions to this workshop.

preprint2021arXiv

Hyper Meta-Path Contrastive Learning for Multi-Behavior Recommendation

User purchasing prediction with multi-behavior information remains a challenging problem for current recommendation systems. Various methods have been proposed to address it via leveraging the advantages of graph neural networks (GNNs) or multi-task learning. However, most existing works do not take the complex dependencies among different behaviors of users into consideration. They utilize simple and fixed schemes, like neighborhood information aggregation or mathematical calculation of vectors, to fuse the embeddings of different user behaviors to obtain a unified embedding to represent a user's behavioral patterns which will be used in downstream recommendation tasks. To tackle the challenge, in this paper, we first propose the concept of hyper meta-path to construct hyper meta-paths or hyper meta-graphs to explicitly illustrate the dependencies among different behaviors of a user. How to obtain a unified embedding for a user from hyper meta-paths and avoid the previously mentioned limitations simultaneously is critical. Thanks to the recent success of graph contrastive learning, we leverage it to learn embeddings of user behavior patterns adaptively instead of assigning a fixed scheme to understand the dependencies among different behaviors. A new graph contrastive learning based framework is proposed by coupling with hyper meta-paths, namely HMG-CR, which consistently and significantly outperforms all baselines in extensive comparison experiments.

preprint2021arXiv

Observation of Aharonov-Bohm effect in PbTe nanowire networks

We report phase coherent electron transport in PbTe nanowire networks with a loop geometry. Magneto-conductance shows Aharonov-Bohm (AB) oscillations with periods of $h/e$ and $h/2e$ in flux. The amplitude of $h/2e$ oscillations is enhanced near zero magnetic field, possibly due to interference between time-reversal paths. Temperature dependence of the AB amplitudes suggests a phase coherence length $\sim$ 8 - 12 $μ$m at 50 mK. This length scale is larger than the typical geometry of PbTe-based hybrid semiconductor-superconductor nanowire devices.

preprint2021arXiv

Selective area epitaxy of PbTe-Pb hybrid nanowires on a lattice-matched substrate

Topological quantum computing is based on braiding of Majorana zero modes encoding topological qubits. A promising candidate platform for Majorana zero modes is semiconductor-superconductor hybrid nanowires. The realization of topological qubits and braiding operations requires scalable and disorder-free nanowire networks. Selective area growth of in-plane InAs and InSb nanowires, together with shadow-wall growth of superconductor structures, have demonstrated this scalability by achieving various network structures. However, the noticeable lattice mismatch at the nanowire-substrate interface, acting as a disorder source, imposes a serious obstacle along with this roadmap. Here, combining selective area and shadow-wall growth, we demonstrate the fabrication of PbTe-Pb hybrid nanowires - another potentially promising Majorana system - on a nearly perfectly lattice-matched substrate CdTe, all done in one molecular beam epitaxy chamber. Transmission electron microscopy shows the single-crystal nature of the PbTe nanowire and its atomically sharp and clean interfaces to the CdTe substrate and the Pb overlayer, without noticeable inter-diffusion or strain. The nearly ideal interface condition, together with the strong screening of charge impurities due to the large dielectric constant of PbTe, hold promise towards a clean nanowire system to study Majorana zero modes and topological quantum computing.

preprint2020arXiv

A BERT based Sentiment Analysis and Key Entity Detection Approach for Online Financial Texts

The emergence and rapid progress of the Internet have brought ever-increasing impact on financial domain. How to rapidly and accurately mine the key information from the massive negative financial texts has become one of the key issues for investors and decision makers. Aiming at the issue, we propose a sentiment analysis and key entity detection approach based on BERT, which is applied in online financial text mining and public opinion analysis in social media. By using pre-train model, we first study sentiment analysis, and then we consider key entity detection as a sentence matching or Machine Reading Comprehension (MRC) task in different granularity. Among them, we mainly focus on negative sentimental information. We detect the specific entity by using our approach, which is different from traditional Named Entity Recognition (NER). In addition, we also use ensemble learning to improve the performance of proposed approach. Experimental results show that the performance of our approach is generally higher than SVM, LR, NBM, and BERT for two financial sentiment analysis and key entity detection datasets.

preprint2020arXiv

Analysis of Adaptive Synchrosqueezing Transform with a Time-varying Parameter

The synchrosqueezing transform (SST) was developed recently to separate the components of non-stationary multicomponent signals. The continuous wavelet transform-based SST (WSST) reassigns the scale variable of the continuous wavelet transform of a signal to the frequency variable and sharpens the time-frequency representation. The WSST with a time-varying parameter, called the adaptive WSST, was introduced very recently in the paper "Adaptive synchrosqueezing transform with a time-varying parameter for non-stationary signal separation". The well-separated conditions of non-stationary multicomponent signals with the adaptive WSST and a method to select the time-varying parameter were proposed in that paper. In addition, simulation experiments in that paper show that the adaptive WSST is very promising in estimating the instantaneous frequency of a multicomponent signal, and in accurate component recovery. However the theoretical analysis of the adaptive WSST has not been studied. In this paper, we carry out such analysis and obtain error bounds for component recovery with the adaptive WSST and the 2nd-order adaptive WSST. These results provide a mathematical guarantee to non-stationary multicomponent signal separation with the adaptive WSST.

preprint2020arXiv

Complementing Representation Deficiency in Few-shot Image Classification: A Meta-Learning Approach

Few-shot learning is a challenging problem that has attracted more and more attention recently since abundant training samples are difficult to obtain in practical applications. Meta-learning has been proposed to address this issue, which focuses on quickly adapting a predictor as a base-learner to new tasks, given limited labeled samples. However, a critical challenge for meta-learning is the representation deficiency since it is hard to discover common information from a small number of training samples or even one, as is the representation of key features from such little information. As a result, a meta-learner cannot be trained well in a high-dimensional parameter space to generalize to new tasks. Existing methods mostly resort to extracting less expressive features so as to avoid the representation deficiency. Aiming at learning better representations, we propose a meta-learning approach with complemented representations network (MCRNet) for few-shot image classification. In particular, we embed a latent space, where latent codes are reconstructed with extra representation information to complement the representation deficiency. Furthermore, the latent space is established with variational inference, collaborating well with different base-learners, and can be extended to other models. Finally, our end-to-end framework achieves the state-of-the-art performance in image classification on three standard few-shot learning datasets.

preprint2020arXiv

Effects of biaxial strain and local constant potential on electronic structure of monolayer SnSe

We use the modified Becke-Johnson exchange potential (mBJ) with the spin-orbit coupling effect (SOC) to study effects of biaxial strain and local constant potential on electronic structure of monolayer SnSe. Our results show the fundamental band gap size can be tuned via biaxial strain. Compressive strain (tensile strain) can narrow (enlarge) band gap, and compressive strain causes the transition from quasi-direct to indirect band gap. Moreover, considering that any tuning of electronic structure is realized by changing the periodic potential distribution in the crystalline, we directly add constant potential (CP) to muffin-tin spheres. The results demonstrate that positive and negative CPs can narrow and enlarge band gap, respectively. At CP of 0.9 Ry, semiconductor-metal transition appears, and interestingly a new type of nearly linear dispersions occur at band edge. Our work is good for inspiring more experimental and further theoretical research works.

preprint2020arXiv

Many-body chiral edge currents and sliding phases of atomic spinwaves in momentum-space lattice

Collective excitations (spinwaves) of long-lived atomic hyperfine states can be synthesized into a Bose-Hubbard model in momentum space. We explore many-body ground states and dynamics of a two-leg momentum-space lattice formed by two coupled hyperfine states. Essential ingredients of this setting are a staggered artificial magnetic field engineered by lasers that couple the spinwave states, and a state-dependent long-range interaction, which is induced by laser-dressing a hyperfine state to a Rydberg state. The Rydberg dressed two-body interaction gives rise to a state-dependent blockade in momentum space, and can amplify staggered flux induced anti-chiral edge currents in the many-body ground state in the presence of magnetic flux. When the Rydberg dressing is applied to both hyperfine states, exotic sliding insulating and superfluid/supersolid phases emerge. Due to the Rydberg dressed long-range interaction, spinwaves slide along a leg of the momentum-space lattice without costing energy. Our study paves a route to the quantum simulation of topological phases and exotic dynamics with interacting spinwaves of atomic hyperfine states in momentum-space lattice.

preprint2020arXiv

Null Gravitational Redshift by a Reissner-Nordström Black Hole in the Strong Field Limit

The gravitational shift of electromagnetic frequency in the strong field limit is usually investigated under the common scenario, where the light receiver is far away from the central body while the emitter is in the strong-field region of the lens. In this paper, the gravitational frequency shift of light caused by a Reissner-Nordström (RN) black hole is studied numerically in the traditional strong-field scenario, as well as in the scenario where both the light emission and reception events happen in the strong-field region of the black hole. In order to obtain the numerical results of the gravitational redshift, we first derive the exact null equations of motion in the RN geometry in harmonic coordinates. For a given light observer, a new numerical technique is proposed in the integration of the geodesic equations to determine the spatial position of the emitter, considering the fact that their spatial positions are not always known simultaneously. Our work might be helpful to the related observations for probing strong gravity.

preprint2020arXiv

Performance of the T-matrix based master equation for Coulomb drag in double quantum dots

Recently, novel Coulomb drag mechanisms in capacitively coupled double quantum dots were uncovered by the T-matrix based master equation (TME). The TME is so far the primary approach to studying Coulomb drag in the weak-coupling regime; however, its accuracy and reliability remain unexplored. Here, we evaluate the performance of the TME for Coulomb drag via a comparison with numerically exact results obtained by the hierarchical equation-of-motion approach. We find that the TME can capture qualitative current evolutions versus dot levels, temperature, and effective coupling strengths, but only partially succeeds at the quantitative level. Specifically, the TME gives highly inaccurate drag currents when large charge fluctuations on dots exist and the fourth-order tunneling processes make a leading-order contribution. This failure of the TME is attributed to the combined effect of the unique drag mechanisms and its overlook of the fourth-order single-electron tunnelings. We identify the reliable regions to facilitate further quantitative studies on Coulomb drag by the TME.

preprint2020arXiv

Possible Formation Scenarios of ZTF J153932.16+502738.8-A Gravitational Source Close to the Peak of LISA's Sensitivity

ZTF J153932.16+502738.8 (ZTFJ1539) is an eclipsing double-white-dwarf system with an orbital period of 6.91 minutes, and is a significant source of LISA detecting gravitational wave. However, the massive white dwarf (WD) with mass of about 0.61 M$_\odot$ has a high effective temperature (48900 K), and the lower mass WD with mass of about 0.21 M$_{\odot}$ has a low effective temperature($<$10000 K). It is challenging the popular theory of binary evolution. We investigate the formation of ZTFJ1539 via nova and Algol scenarios. Assuming that the massive WD in ZTFJ1539 just experiences a thermalnuclear runaway, nova scenario can explain the effective temperatures of two WDs in ZTFJ1539. However, in order to enlarging a semi-detached orbit of about 4---5 minutes to a detached orbit of about 7 minutes, nova scenario needs a much high kick velocity of about 200 km s$^{-1}$ during nova eruption. The high kick velocity can result in high eccentricity of about 0.2---0.6. Algol scenario can also produce ZTFJ1539 if we take a high efficient parameter for ejecting common envelope and enhance the mass-loss rate via stellar wind trigger by tidal effect.

preprint2020arXiv

Taking the pulse of COVID-19: A spatiotemporal perspective

The sudden outbreak of the Coronavirus disease (COVID-19) swept across the world in early 2020, triggering the lockdowns of several billion people across many countries, including China, Spain, India, the U.K., Italy, France, Germany, and most states of the U.S. The transmission of the virus accelerated rapidly with the most confirmed cases in the U.S., and New York City became an epicenter of the pandemic by the end of March. In response to this national and global emergency, the NSF Spatiotemporal Innovation Center brought together a taskforce of international researchers and assembled implemented strategies to rapidly respond to this crisis, for supporting research, saving lives, and protecting the health of global citizens. This perspective paper presents our collective view on the global health emergency and our effort in collecting, analyzing, and sharing relevant data on global policy and government responses, geospatial indicators of the outbreak and evolving forecasts; in developing research capabilities and mitigation measures with global scientists, promoting collaborative research on outbreak dynamics, and reflecting on the dynamic responses from human societies.

preprint2019arXiv

The Formation of Bimodal Dust Species in Nova Ejecta

The formation of bimodal dust species (namely the silicate and amorphous carbon dust grains coexistent) in a nova eruption is an open problem. According to the nova model simulated by Modules for Experiments in Stellar Astrophysics code, we calculate the formation and growth of carbon (C) and forsterite (Mg2SiO4) dust grains purely in nova ejecta for the fee-expansion model and the radiative shock model by assuming spherical geometry of the nova ejecta. In these models, the chemical properties of pre-existing circumstellar medium are not taken into account. In the free-expansion model, the nova ejecta is not an idea environment for dust nucleation. However, it can efficiently produce dust in the radiative shock model. We estimate that every nova can produce C grains with an average mass of about $10^{-9}$ and $10^{-8}$ ${\rm M_\odot}$, and Mg$_2$SiO$_4$ grains with an average mass of about $10^{-8}$ and $10^{-7}$ ${\rm M_\odot}$. Based on the mass of ejected gas, the ratio of dust to gas is about 1\%. The C grains form first after several or tens of days of nova eruption. After that, the Mg$_2$SiO$_4$ grains begin to grow in tens of days, which is consistent with observations.

preprint2018arXiv

ReLU Deep Neural Networks and Linear Finite Elements

In this paper, we investigate the relationship between deep neural networks (DNN) with rectified linear unit (ReLU) function as the activation function and continuous piecewise linear (CPWL) functions, especially CPWL functions from the simplicial linear finite element method (FEM). We first consider the special case of FEM. By exploring the DNN representation of its nodal basis functions, we present a ReLU DNN representation of CPWL in FEM. We theoretically establish that at least $2$ hidden layers are needed in a ReLU DNN to represent any linear finite element functions in $Ω\subseteq \mathbb{R}^d$ when $d\ge2$. Consequently, for $d=2,3$ which are often encountered in scientific and engineering computing, the minimal number of two hidden layers are necessary and sufficient for any CPWL function to be represented by a ReLU DNN. Then we include a detailed account on how a general CPWL in $\mathbb R^d$ can be represented by a ReLU DNN with at most $\lceil\log_2(d+1)\rceil$ hidden layers and we also give an estimation of the number of neurons in DNN that are needed in such a representation. Furthermore, using the relationship between DNN and FEM, we theoretically argue that a special class of DNN models with low bit-width are still expected to have an adequate representation power in applications. Finally, as a proof of concept, we present some numerical results for using ReLU DNNs to solve a two point boundary problem to demonstrate the potential of applying DNN for numerical solution of partial differential equations.