High order conservative schemes for the generalized Benjamin-Ono equation in the unbounded domain

This paper proposes a new class of mass or energy conservative numerical schemes for the generalized Benjamin-Ono (BO) equation on the whole real line with arbitrarily high-order accuracy in time. The spatial discretization is achieved by the pseudo-spectral method with the rational basis functions, which can be implemented by the Fast Fourier transform (FFT) with the computational cost $mathcal{O}( Nlog(N))$. By reformulating the spatial discretized system into the different equivalent forms, either the spatial semi-discretized mass or energy can be preserved exactly under the continuous time flow. Combined with the symplectic Runge-Kutta, with or without the scalar auxiliary variable reformulation, the fully discrete energy or mass conservative scheme can be constructed with arbitrarily high-order temporal accuracy, respectively. Our numerical results show the conservation of the proposed schemes, and also the superior accuracy and stability to the non-conservative (Leap-frog) scheme.

A Microscopic Pandemic Simulator for Pandemic Prediction Using Scalable Million-Agent Reinforcement Learning

Microscopic epidemic models are powerful tools for government policy makers to predict and simulate epidemic outbreaks, which can capture the impact of individual behaviors on the macroscopic phenomenon. However, existing models only consider simple rule-based individual behaviors, limiting their applicability. This paper proposes a deep-reinforcement-learning-powered microscopic model named Microscopic Pandemic Simulator (MPS). By replacing rule-based agents with rational agents whose behaviors are driven to maximize rewards, the MPS provides a better approximation of real world dynamics. To efficiently simulate with massive amounts of agents in MPS, we propose Scalable Million-Agent DQN (SMADQN). The MPS allows us to efficiently evaluate the impact of different government strategies. This paper first calibrates the MPS against real-world data in Allegheny, US, then demonstratively evaluates two government strategies: information disclosure and quarantine. The results validate the effectiveness of the proposed method. As a broad impact, this paper provides novel insights for the application of DRL in large scale agent-based networks such as economic and social networks.

TDM: Trustworthy Decision-Making via Interpretability Enhancement

Human-robot interactive decision-making is increasingly becoming ubiquitous, and trust is an influential factor in determining the reliance on autonomy. However, it is not reasonable to trust systems that are beyond our comprehension, and typical machine learning and data-driven decision-making are black-box paradigms that impede interpretability. Therefore, it is critical to establish computational trustworthy decision-making mechanisms enhanced by interpretability-aware strategies. To this end, we propose a Trustworthy Decision-Making (TDM) framework, which integrates symbolic planning into sequential decision-making. The framework learns interpretable subtasks that result in a complex, higher-level composite task that can be formally evaluated using the proposed trust metric. TDM enables the subtask-level interpretability by design and converges to an optimal symbolic plan from the learned subtasks. Moreover, a TDM-based algorithm is introduced to demonstrate the unification of symbolic planning with other sequential-decision making algorithms, reaping the benefits of both. Experimental results validate the effectiveness of trust-score-based planning while improving the interpretability of subtasks.

CPSC: Conformal prediction with shrunken centroids for efficient prediction reliability quantification and data augmentation, a case in alternative herbal medicine classification with electronic nose

In machine learning applications, the reliability of predictions is significant for assisted decision and risk control. As an effective framework to quantify the prediction reliability, conformal prediction (CP) was developed with the CPKNN (CP with kNN). However, the conventional CPKNN suffers from high variance and bias and long computational time as the feature dimensionality increases. To address these limitations, a new CP framework-conformal prediction with shrunken centroids (CPSC) is proposed. It regularizes the class centroids to attenuate the irrelevant features and shrink the sample space for predictions and reliability quantification. To compare CPKNN and CPSC, we employed them in the classification of 12 categories of alternative herbal medicine with electronic nose as a case and assessed them in two tasks: 1) offline prediction: the training set was fixed and the accuracy on the testing set was evaluated; 2) online prediction with data augmentation: they filtered unlabeled data to augment the training data based on the prediction reliability and the final accuracy of testing set was compared. The result shows that CPSC significantly outperformed CPKNN in both two tasks: 1) CPSC reached a significantly higher accuracy with lower computation cost, and with the same credibility output, CPSC generally achieves a higher accuracy; 2) the data augmentation process with CPSC robustly manifested a statistically significant improvement in prediction accuracy with different reliability thresholds, and the augmented data were more balanced in classes. This novel CPSC provides higher prediction accuracy and better reliability quantification, which can be a reliable assistance in decision support.

SiamCorners: Siamese Corner Networks for Visual Tracking

The current Siamese network based on region proposal network (RPN) has attracted great attention in visual tracking due to its excellent accuracy and high efficiency. However, the design of the RPN involves the selection of the number, scale, and aspect ratios of anchor boxes, which will affect the applicability and convenience of the model. Furthermore, these anchor boxes require complicated calculations, such as calculating their intersection-over-union (IoU) with ground truth bounding boxes.Due to the problems related to anchor boxes, we propose a simple yet effective anchor-free tracker (named Siamese corner networks, SiamCorners), which is end-to-end trained offline on large-scale image pairs. Specifically, we introduce a modified corner pooling layer to convert the bounding box estimate of the target into a pair of corner predictions (the bottom-right and the top-left corners). By tracking a target as a pair of corners, we avoid the need to design the anchor boxes. This will make the entire tracking algorithm more flexible and simple than anchorbased trackers. In our network design, we further introduce a layer-wise feature aggregation strategy that enables the corner pooling module to predict multiple corners for a tracking target in deep networks. We then introduce a new penalty term that is used to select an optimal tracking box in these candidate corners. Finally, SiamCorners achieves experimental results that are comparable to the state-of-art tracker while maintaining a high running speed. In particular, SiamCorners achieves a 53.7% AUC on NFS30 and a 61.4% AUC on UAV123, while still running at 42 frames per second (FPS).

Higher dimensional generalization of the Benjamin-Ono equation: 2D case

We consider a higher-dimensional version of the Benjamin-Ono (HBO) equation in the 2D setting: $u_t- mathcal{R}_1 Delta u + frac{1}{2}(u^2)_x=0, (x,y) in mathbb{R}^2$, which is $L^2$-critical, and investigate properties of solutions both analytically and numerically. For a generalized equation (fractional 2D gKdV) after deriving the Pohozaev identities, we obtain non-existence conditions for solitary wave solutions, then prove uniform bounds in the energy space or conditional global existence, and investigate the radiation region, a specific wedge in the negative $x$-direction. We then introduce our numerical approach in a general context, and apply it to obtain the ground state solution in the 2D critical HBO equation, then show that its mass is a threshold for global vs. finite time existing solutions, which is typical in the focusing (mass-)critical dispersive equations. We also observe that globally existing solutions tend to disperse completely into the radiation in this nonlocal equation. The blow-up solutions travel in the positive $x$-direction with the rescaled ground state profile while also radiating dispersive oscillations into the radiative wedge. We conclude with examples of different interactions of two solitary wave solutions, including weak and strong interactions.

Be Careful about Poisoned Word Embeddings: Exploring the Vulnerability of the Embedding Layers in NLP Models

Recent studies have revealed a security threat to natural language processing (NLP) models, called the Backdoor Attack. Victim models can maintain competitive performance on clean samples while behaving abnormally on samples with a specific trigger word inserted. Previous backdoor attacking methods usually assume that attackers have a certain degree of data knowledge, either the dataset which users would use or proxy datasets for a similar task, for implementing the data poisoning procedure. However, in this paper, we find that it is possible to hack the model in a data-free way by modifying one single word embedding vector, with almost no accuracy sacrificed on clean samples. Experimental results on sentiment analysis and sentence-pair classification tasks show that our method is more efficient and stealthier. We hope this work can raise the awareness of such a critical security risk hidden in the embedding layers of NLP models. Our code is available at https://github.com/lancopku/Embedding-Poisoning.

Arbitrarily high-order conservative schemes for the generalized Korteweg-de Vries equation

This paper proposes a new class of arbitarily high-order conservative numerical schemes for the generalized Korteweg-de Vries (KdV) equation. This approach is based on the scalar auxiliary variable (SAV) method. The equation is reformulated into an equivalent system by introducing a scalar auxiliary variable, and the energy is reformulated into a sum of two quadratic terms. Therefore, the quadratic preserving Runge-Kutta method will preserve both the mass and the reformulated energy in the discrete time flow. With the Fourier pseudo-spectral spatial discretization, the scheme conserves the first and third invariant quantities (momentum and energy) exactly in the fully discrete sense. The discrete mass possesses the precision of the spectral accuracy.

Fast-Tracker 2.0: Improving Autonomy of Aerial Tracking with Active Vision and Human Location Regression

In recent years, several progressive works promote the development of aerial tracking. One of the representative works is our previous work Fast-tracker which is applicable to various challenging tracking scenarios. However, it suffers from two main drawbacks: 1) the over simplification in target detection by using artificial markers and 2) the contradiction between simultaneous target and environment perception with limited onboard vision. In this paper, we upgrade the target detection in Fast-tracker to detect and localize a human target based on deep learning and non-linear regression to solve the former problem. For the latter one, we equip the quadrotor system with 360 degree active vision on a customized gimbal camera. Furthermore, we improve the tracking trajectory planning in Fast-tracker by incorporating an occlusion-aware mechanism that generates observable tracking trajectories. Comprehensive real-world tests confirm the proposed systems robustness and real-time capability. Benchmark comparisons with Fast-tracker validate that the proposed system presents better tracking performance even when performing more difficult tracking tasks.

Continental generalization of an AI system for clinical seizure recognition

Electroencephalogram (EEG) monitoring and objective seizure identification is an essential clinical investigation for some patients with epilepsy. Accurate annotation is done through a time-consuming process by EEG specialists. Computer-assisted systems for seizure detection currently lack extensive clinical utility due to retrospective, patient-specific, and/or irreproducible studies that result in low sensitivity or high false positives in clinical tests. We aim to significantly reduce the time and resources on data annotation by demonstrating a continental generalization of seizure detection that balances sensitivity and specificity. This is a prospective inference test of artificial intelligence on nearly 14,590 hours of adult EEG data from patients with epilepsy between 2011 and 2019 in a hospital in Sydney, Australia. The inference set includes patients with different types and frequencies of seizures across a wide range of ages and EEG recording hours. We validated our inference model in an AI-assisted mode with a human expert arbiter and a result review panel of expert neurologists and EEG specialists on 66 sessions to demonstrate achievement of the same performance with over an order-of-magnitude reduction in time. Our inference on 1,006 EEG recording sessions on the Australian dataset achieved 76.68% with nearly 56 [0, 115] false alarms per 24 hours on average, against legacy ground-truth annotations by human experts, conducted independently over nine years. Our pilot test of 66 sessions with a human arbiter, and reviewed ground truth by a panel of experts, confirmed an identical human performance of 92.19% with an AI-assisted system, while the time requirements reduce significantly from 90 to 7.62 minutes on average.