Miracle-dz/UniFAR-FTUs huggingface dataset:
Asymptotic Characterisation of Regularised Zero-Forcing Receiver for Imperfect and Correlated Massive MIMO Systems with Optimal Power Allocation

In this paper, we present asymptotic high dimensional analysis of the regularised zero-forcing (RZF) receiver in terms of its mean squared error (MSE) and bit error rate (BER) when used for the recovery of binary phase shift keying (BPSK) modulated signals in a massive multiple-input multiple-output (MIMO) communication system. We assume that the channel matrix is spatially correlated and not perfectly known. We use the linear minimum mean squared error (LMMSE) method to estimate the channel matrix. The asymptotic approximations of the MSE and BER enable us to solve various practical optimisation problems. Under MSE/BER minimisation, we derive 1) the optimal regularisation factor for RZF; 2) the optimal power allocation scheme. Numerical simulations show a close match to the derived asymptotic results even for a few dozens of the problem dimensions.
Smart Online Charging Algorithm for Electric Vehicles via Customized Actor–Critic Learning

With the advances in the Internet-of-Things technology, electric vehicles (EVs) have become easier to schedule in daily life, which is reshaping the electric load curve. It is important to design efficient charging algorithms to mitigate the negative impact of EV charging on the power grid. This article investigates an EV charging scheduling problem to reduce the charging cost while shaving the peak charging load, under unknown future information about EVs, such as arrival time, departure time, and charging demand. First, we formulate an EV charging problem to minimize the electricity bill of the EV fleet and study the EV charging problem in an online setting without knowing future information. We develop an actor–critic learning-based smart charging algorithm (SCA) to schedule the EV charging against the uncertainties in EV charging behaviors. The SCA learns an optimal EV charging strategy with continuous charging actions instead of discrete approximation of charging. We further develop a more computationally efficient customized actor–critic learning charging (CALC) algorithm by reducing the state dimension and thus improving the computational efficiency. Finally, simulation results show that our proposed SCA can reduce EVs’ expected cost by 24.03%, 21.49%, 13.80%, compared with the eagerly charging algorithm, online charging algorithm, reinforcement learning (RL)-based adaptive energy management algorithm, respectively. CALC is more computationally efficient, and its performance is close to that of SCA with only a gap of 5.56% in the cost.
A Continuous Liveness Detection for Voice Authentication on Smart Devices

Voice biometrics is drawing increasing attention as it is a promising alternative to legacy passwords for user authentication. Recently, a growing body of work shows that voice biometrics is vulnerable to spoofing through replay attacks, where an adversary tries to spoof voice authentication systems by using a pre-recorded voice sample collected from a genuine user. To this end, we propose VoiceGesture, a liveness detection solution for voice authentication on smart devices such as smartphones and smart speakers. VoiceGesture detects a live user by leveraging both the unique articulatory gesture of the user when speaking a passphrase and the audio hardware advances on these smart devices. Specifically, our system re-uses a pair of built-in speaker and microphone on a smart device as a Doppler radar, which transmits a high-frequency acoustic sound from the speaker and listens to the reflections at the microphone when a user speaks a passphrase. Then we extract Doppler shifts resulted from the user's articulatory gestures for liveness detection. VoiceGesture is practical as it requires neither cumbersome operations nor additional hardware but a speaker and a microphone commonly available on smart devices that support voice input. Our experimental evaluation with 21 participants and different smart devices shows that VoiceGesture achieves over 99% and around 98% detection accuracy for text-dependent and text-independent liveness detection, respectively. Results also show that VoiceGesture is robust to different device placements, low audio sampling frequency, and supports medium range liveness detection on smart speakers in various use scenarios like smart homes and smart vehicles.
Why Machine Reading Comprehension Models Learn Shortcuts?

Recent studies report that many machine reading comprehension (MRC) models can perform closely to or even better than humans on benchmark datasets. However, existing works indicate that many MRC models may learn shortcuts to outwit these benchmarks, but the performance is unsatisfactory in real-world applications. In this work, we attempt to explore, instead of the expected comprehension skills, why these models learn the shortcuts. Based on the observation that a large portion of questions in current datasets have shortcut solutions, we argue that larger proportion of shortcut questions in training data make models rely on shortcut tricks excessively. To investigate this hypothesis, we carefully design two synthetic datasets with annotations that indicate whether a question can be answered using shortcut solutions. We further propose two new methods to quantitatively analyze the learning difficulty regarding shortcut and challenging questions, and revealing the inherent learning mechanism behind the different performance between the two kinds of questions. A thorough empirical analysis shows that MRC models tend to learn shortcut questions earlier than challenging questions, and the high proportions of shortcut questions in training sets hinder models from exploring the sophisticated reasoning skills in the later stage of training.
Robust Voxelization and Visualization by Improved Tetrahedral Mesh Generation

When obtaining interior 3D voxel data from triangular meshes, most existing methods fail to handle low quality meshes which happen to take up a big portion on the internet. In this work we present a robust voxelization method that is based on tetrahedral mesh generation within a user defined error bound. Compared to other tetrahedral mesh generation methods, our method produces much higher quality tetrahedral meshes as the intermediate outcome, which allows us to utilize a faster voxelization algorithm that is based on a stronger assumption. We show the results compared to various methods including the state-of-the-art. Our contribution includes a framework which takes triangular mesh as an input and produces voxelized data, a proof to an unproved algorithm that performs better than the state-of-the-art, and various experiments including parallelization built on the GPU and CPU. We further tested our method on various datasets including Princeton ModelNet and Thingi10k to show the robustness of the framework, where near 100% availability is achieved, while others can only achieve around 50%. Keywords—voxelization, computation geometry, tetrahedral mesh, mesh reconstruction
Differential Privacy for Text Analytics via Natural Text Sanitization

Texts convey sophisticated knowledge. However, texts also convey sensitive information. Despite the success of general-purpose language models and domain-specific mechanisms with differential privacy (DP), existing text sanitization mechanisms still provide low utility, as cursed by the high-dimensional text representation. The companion issue of utilizing sanitized texts for downstream analytics is also under-explored. This paper takes a direct approach to text sanitization. Our insight is to consider both sensitivity and similarity via our new local DP notion. The sanitized texts also contribute to our sanitization-aware pretraining and fine-tuning, enabling privacy-preserving natural language processing over the BERT language model with promising utility. Surprisingly, the high utility does not boost up the success rate of inference attacks.
Multiresolution Graph Variational Autoencoder

In this paper, we propose Multiresolution Graph Networks (MGN) and Multires-olution Graph Variational Autoencoders (MGVAE) to learn and generate graphs in a multiresolution and equivariant manner. At each resolution level, MGN employs higher order message passing to encode the graph while learning to partition it into mutually exclusive clusters and coarsening into a lower resolution. MGVAE constructs a hierarchical generative model based on MGN to variation-ally autoencode the hierarchy of coarsened graphs. Our proposed framework is end-to-end permutation equivariant with respect to node ordering. Our methods have been successful with several generative tasks including link prediction on citation graphs, unsupervised molecular representation learning to predict molecular properties, molecular generation, general graph generation and graph-based image generation.
An Empirical Comparison of Off-policy Prediction Learning Algorithms on the Collision Task

Off-policy prediction -- learning the value function for one policy from data generated while following another policy -- is one of the most challenging subproblems in reinforcement learning. This paper presents empirical results with eleven prominent off-policy learning algorithms that use linear function approximation: five Gradient-TD methods, two Emphatic-TD methods, Off-policy TD($\lambda$), Vtrace, and versions of Tree Backup and ABQ modified to apply to a prediction setting. Our experiments used the Collision task, a small idealized off-policy problem analogous to that of an autonomous car trying to predict whether it will collide with an obstacle. We assessed the performance of the algorithms according to their learning rate, asymptotic error level, and sensitivity to step-size and bootstrapping parameters. By these measures, the eleven algorithms can be partially ordered on the Collision task. In the top tier, the two Emphatic-TD algorithms learned the fastest, reached the lowest errors, and were robust to parameter settings. In the middle tier, the five Gradient-TD algorithms and Off-policy TD($\lambda$) were more sensitive to the bootstrapping parameter. The bottom tier comprised Vtrace, Tree Backup, and ABQ; these algorithms were no faster and had higher asymptotic error than the others. Our results are definitive for this task, though of course experiments with more tasks are needed before an overall assessment of the algorithms' merits can be made.
Large-Scale Wasserstein Gradient Flows

Wasserstein gradient flows provide a powerful means of understanding and solving many diffusion equations. Specifically, Fokker-Planck equations, which model the diffusion of probability measures, can be understood as gradient descent over entropy functionals in Wasserstein space. This equivalence, introduced by Jordan, Kinderlehrer and Otto, inspired the so-called JKO scheme to approximate these diffusion processes via an implicit discretization of the gradient flow in Wasserstein space. Solving the optimization problem associated to each JKO step, however, presents serious computational challenges. We introduce a scalable method to approximate Wasserstein gradient flows, targeted to machine learning applications. Our approach relies on input-convex neural networks (ICNNs) to discretize the JKO steps, which can be optimized by stochastic gradient descent. Unlike previous work, our method does not require domain discretization or particle simulation. As a result, we can sample from the measure at each time step of the diffusion and compute its probability density. We demonstrate our algorithm's performance by computing diffusions following the Fokker-Planck equation and apply it to unnormalized density sampling as well as nonlinear filtering.
Anomalies, extensions, and orbifolds

We investigate gauge anomalies in the context of orbifold conformal field theories. Such anomalies manifest as failures of modular invariance in the constituents of the orbifold partition function. We review how this irregularity is classified by cohomology and how extending the orbifold group can remove it. Working with such extensions requires an understanding of the consistent ways in which extending groups can act on the twisted states of the original symmetry, which leads us to a discrete-torsion like choice that exists in orbifolds with trivially-acting subgroups. We review a general method for constructing such extensions and investigate its application to orbifolds. Through numerous explicit examples we test the conjecture that consistent extensions should be equivalent to (in general multiple copies of) orbifolds by non-anomalous subgroups.
A Unified Generative Framework for Various NER Subtasks

Named Entity Recognition (NER) is the task of identifying spans that represent entities in sentences. Whether the entity spans are nested or discontinuous, the NER task can be categorized into the flat NER, nested NER, and discontinuous NER subtasks. These subtasks have been mainly solved by the token-level sequence labelling or span-level classification. However, these solutions can hardly tackle the three kinds of NER subtasks concurrently. To that end, we propose to formulate the NER subtasks as an entity span sequence generation task, which can be solved by a unified sequence-to-sequence (Seq2Seq) framework. Based on our unified framework, we can leverage the pre-trained Seq2Seq model to solve all three kinds of NER subtasks without the special design of the tagging schema or ways to enumerate spans. We exploit three types of entity representations to linearize entities into a sequence. Our proposed framework is easy-to-implement and achieves state-of-the-art (SoTA) or near SoTA performance on eight English NER datasets, including two flat NER datasets, three nested NER datasets, and three discontinuous NER datasets.
Multi-User Activity Recognition and Tracking Using Commodity WiFi

This paper presents MultiTrack, a commodity WiFi-based human sensing system that can track multiple users and recognize the activities of multiple users performing them simultaneously. Such a system can enable easy and large-scale deployment for multi-user tracking and sensing without the need for additional sensors through the use of existing WiFi devices (e.g., desktops, laptops, and smart appliances). The basic idea is to identify and extract the signal reflection corresponding to each individual user with the help of multiple WiFi links and all the available WiFi channels at 5GHz. Given the extracted signal reflection of each user, MultiTrack examines the path of the reflected signals at multiple links to simultaneously track multiple users. It further reconstructs the signal profile of each user as if only a single user has performed activity in the environment to facilitate multi-user activity recognition. We evaluate MultiTrack in different multipath environments with up to 4 users for multi-user tracking and up to 3 users for activity recognition. Experimental results show that our system can achieve decimeter localization accuracy and over 92% activity recognition accuracy under multi-user scenarios.
Ultra-Sparse Near-Additive Emulators

Near-additive (aka (1+ε,β)β-) emulators and spanners are a fundamental graph-algorithmic construct, with numerous applications for computing approximate shortest paths and related problems in distributed, streaming and dynamic settings. Known constructions of near-additive emulators enable one to trade between their sparsity (i.e., number of edges) and the additive stretch β. Specifically, for any pair of parameters ε >0, κ=1,2,. , one can have a (1+ε,β)-emulator with O(n^1+1/κ ) edges, with β = łeft(\fracłog κ ε \right)^łog κ . At their sparsest, these emulators employ c.n edges, for some constant c≥ 2. We tighten this bound, and show that in fact precisely n^1+1/κ edges suffice.
Testing whether a signal is strictly periodic. Application to disentangling planets and stellar activity in radial velocities

Searches for periodicity in time series are often done with models of periodic signals, whose statistical significance is assessed via false alarm probabilities or Bayes factors. However, a statistically significant periodic model might not originate from a strictly periodic source. In astronomy in particular, one expects transient signals that show periodicity for a certain amount of time before vanishing. This situation is encountered for instance in the search for planets in radial velocity data. While planetary signals are expected to have a stable phase, amplitude and frequency — except when strong planet-planet interactions are present — signals induced by stellar activity will typically not exhibit the same stability. In the present article, we explore the use of periodic functions multiplied by time windows to diagnose whether an apparently periodic signal is truly so. We suggest diagnostics to check whether a signal is consistently present in the time series, and has a stable phase, amplitude and period. The tests are expressed both in a periodogram and Bayesian framework. Our methods are applied to the Solar HARPS-N data as well as HD 215152, HD 69830 and HD 13808. We find that (i) the HARPS-N Solar data exhibits signals at the Solar rotation period and its first harmonic (∼ 13.4 days). The frequency and phase of the 13.4 days signal appear constant within the estimation uncertainties, but its amplitude presents significant variations which can be mapped to activity levels. (ii) as previously reported, we find four, three and two planets orbiting HD 215152, HD 69830 and HD 13808.
PP-Rec: News Recommendation with Personalized User Interest and Time-aware News Popularity

Personalized news recommendation methods are widely used in online news services. These methods usually recommend news based on the matching between news content and user interest inferred from historical behaviors. However, these methods usually have difficulties in making accurate recommendations to cold-start users, and tend to recommend similar news with those users have read. In general, popular news usually contain important information and can attract users with different interests. Besides, they are usually diverse in content and topic. Thus, in this paper we propose to incorporate news popularity information to alleviate the cold-start and diversity problems for personalized news recommendation. In our method, the ranking score for recommending a candidate news to a target user is the combination of a personalized matching score and a news popularity score. The former is used to capture the personalized user interest in news. The latter is used to measure time-aware popularity of candidate news, which is predicted based on news content, recency, and real-time CTR using a unified framework. Besides, we propose a popularity-aware user encoder to eliminate the popularity bias in user behaviors for accurate interest modeling. Experiments on two real-world datasets show our method can effectively improve the accuracy and diversity for news recommendation.
Evidence-based Factual Error Correction

This paper introduces the task of factual error correction: performing edits to a claim so that the generated rewrite is better supported by evidence. This extends the well-studied task of fact verification by providing a mechanism to correct written texts that are refuted or only partially supported by evidence. We demonstrate that it is feasible to train factual error correction systems from existing fact checking datasets which only contain labeled claims accompanied by evidence, but not the correction. We achieve this by employing a two-stage distant supervision approach that incorporates evidence into masked claims when generating corrections. Our approach, based on the T5 transformer and using retrieved evidence, achieved better results than existing work which used a pointer copy network and gold evidence, producing accurate factual error corrections for 5x more instances in human evaluation and a . 125 increase in SARI score. The evaluation is conducted on a dataset of 65,000 instances based on a recent fact verification shared task and we release it to enable further work on the task.
Self-energy dynamics and the mode-specific phonon threshold effect in Kekulé-ordered graphene

Abstract Electron-phonon interaction and related self-energy are fundamental to both the equilibrium properties and non-equilibrium relaxation dynamics of solids. Although electron-phonon interaction has been suggested by various time-resolved measurements to be important for the relaxation dynamics of graphene, the lack of energy- and momentum-resolved self-energy dynamics prohibits direct identification of the role of specific phonon modes in the relaxation dynamics. Here, by performing time- and angle-resolved photoemission spectroscopy measurements on Kekulé-ordered graphene with folded Dirac cones at the Γ point, we have succeeded in resolving the self-energy effect induced by the coupling of electrons to two phonons at Ω1 = 177 meV and Ω2 = 54 meV, and revealing its dynamical change in the time domain. Moreover, these strongly coupled phonons define energy thresholds, which separate the hierarchical relaxation dynamics from ultrafast, fast to slow, thereby providing direct experimental evidence for the dominant role of mode-specific phonons in the relaxation dynamics.
Bottom-Up and Top-Down Neural Processing Systems Design: Neuromorphic Intelligence as the Convergence of Natural and Artificial Intelligence

—While Moore’s law has driven exponential computing power expectations, its nearing end calls for new avenues for improving the overall system performance. One of these avenues is the exploration of new alternative brain-inspired computing architectures that promise to achieve the ﬂexibility and computational efﬁciency of biological neural processing systems. Within this context, neuromorphic intelligence represents a paradigm shift in computing based on the implementation of spiking neural network architectures tightly co-locating processing and memory. In this paper, we provide a comprehensive overview of the ﬁeld, highlighting the different levels of granularity present in existing silicon implementations, comparing approaches that aim at replicating natural intelligence (bottom-up) versus those that aim at solving practical artiﬁcial intelligence applications (top-down), and assessing the beneﬁts of the different circuit design styles used to achieve these goals. First, we present the analog, mixed-signal and digital circuit design styles, identifying the boundary between processing and memory through time multiplexing, in-memory computation and novel devices. Next, we highlight the key trade-offs for each of the bottom-up and top-down approaches, survey their silicon implementations, and carry out detailed comparative analyses to extract design guidelines. Finally, we identify both necessary synergies and missing elements required to achieve a competitive advantage for neuromorphic edge computing over conventional machine-learning accelerators, and outline the key elements for a framework toward neuromorphic intelligence.