Miracle-dz/UniFAR-FTUs huggingface dataset:
Weak Supervision in Analysis of News: Application to Economic Policy Uncertainty

The need for timely data analysis for economic decisions has prompted most economists and policy makers to search for non-traditional supplementary sources of data. In that context, text data is being explored to enrich traditional data sources because it is easy to collect and highly abun-dant. Our work focuses on studying the potential of textual data, in particular news pieces, for measuring economic policy uncertainty (EPU). Economic policy uncertainty is deﬁned as the public’s inability to predict the outcomes of their decisions under new policies and future economic fundamentals. Quantifying EPU is of great importance to policy makers, economists, and investors since it inﬂuences their expectations about the future economic fundamentals with an impact on their policy, investment and saving decisions. Most of the previous work using news articles for measuring EPU are either manual or based on a simple keyword search. Our work proposes a machine learning based solution involving weak supervision to classify news articles with regards to economic policy uncertainty. Weak supervision is shown to be an eﬃcient machine learning paradigm for applying machine learning models in low resource settings with no or scarce training sets, leveraging domain knowledge and heuristics. We further generated a weak supervision based EPU index that we used to conduct extensive econometric analysis along with the Irish macroeconomic indicators to validate whether our generated index foreshadows weaker macroeconomic performance.
A Nonparametric Contextual Bandit with Arm-level Eligibility Control for Customer Service Routing

Amazon Customer Service provides real-time support for millions of customer contacts every year. While bot-resolver helps automate some traffic, we still see high demand for human agents, also called subject matter experts (SMEs). Customers outreach with questions in different domains (return policy, device troubleshooting, etc.). Depending on their training, not all SMEs are eligible to handle all contacts. Routing contacts to eligible SMEs turns out to be a non-trivial problem because SMEs' domain eligibility is subject to training quality and can change over time. To optimally recommend SMEs while simultaneously learning the true eligibility status, we propose to formulate the routing problem with a nonparametric contextual bandit algorithm (K-Boot) plus an eligibility control (EC) algorithm. K-Boot models reward with a kernel smoother on similar past samples selected by $k$-NN, and Bootstrap Thompson Sampling for exploration. EC filters arms (SMEs) by the initially system-claimed eligibility and dynamically validates the reliability of this information. The proposed K-Boot is a general bandit algorithm, and EC is applicable to other bandits. Our simulation studies show that K-Boot performs on par with state-of-the-art Bandit models, and EC boosts K-Boot performance when stochastic eligibility signal exists.
Two-step reinforcement learning for model-free redesign of nonlinear optimal regulator

In many practical control applications, the performance level of a closed-loop system degrades over time due to the change of plant characteristics. Thus, there is a strong need for redesigning a controller without going through the system modelling process, which is often difficult for closed-loop systems. Reinforcement learning (RL) is one of the promising approaches that enable model-free redesign of optimal controllers for nonlinear dynamical systems based only on the measurement of the closed-loop system. However, the learning process of RL usually requires a considerable number of trial-and-error experiments using a poorly controlled system that may accumulate wear on the plant. To overcome this limitation, we propose a model-free two-step design approach that improves the transient learning performance of RL in an optimal regulator redesign problem for unknown nonlinear systems. Specifically, we first design a linear control law that attains some degree of control performance in a model-free manner, and then, train the nonlinear optimal control law with online RL by using the designed linear control law in parallel. We introduce an offline RL algorithm for the design of the linear control law and theoretically guarantee its convergence to the LQR controller under mild assumptions. Numerical simulations show that the proposed approach improves the transient learning performance and efficiency in hyperparameter tuning of RL.
Hearts Gym: Learning Reinforcement Learning as a Team Event

Amidst the COVID-19 pandemic, the authors of this paper organized a Reinforcement Learning (RL) course for a graduate school in the field of data science. We describe the strategy and materials for creating an exciting learning experience despite the ubiquitous Zoom fatigue and evaluate the course qualitatively. The key organizational features are a focus on a competitive hands-on setting in teams, supported by a minimum of lectures providing the essential background on RL. The practical part of the course revolved around Hearts Gym, an RL environment for the card game Hearts that we developed as an entry-level tutorial to RL. Participants were tasked with training agents to explore reward shaping and other RL hyperparameters. For a final evaluation, the agents of the participants competed against each other.
Elastic Context: Encoding Elasticity for Data-driven Models of Textiles Elastic Context: Encoding Elasticity for Data-driven Models of Textiles

Physical interaction with textiles, such as assistive dressing or household tasks, requires advanced dexterous skills. The complexity of textile behavior during stretching and pulling is influenced by the material properties of the yarn and by the textile's construction technique, which are often unknown in real-world settings. Moreover, identification of physical properties of textiles through sensing commonly available on robotic platforms remains an open problem. To address this, we introduce Elastic Context (EC), a method to encode the elasticity of textiles using stress-strain curves adapted from textile engineering for robotic applications. We employ EC to learn generalized elastic behaviors of textiles and examine the effect of EC dimension on accurate force modeling of real-world non-linear elastic behaviors.
Graphon Mean-Field Control for Cooperative Multi-Agent Reinforcement Learning

The marriage between mean-field theory and reinforcement learning has shown a great capacity to solve large-scale control problems with homogeneous agents. To break the homogeneity restriction of mean-field theory, a recent interest is to introduce graphon theory to the mean-field paradigm. In this paper, we propose a graphon mean-field control (GMFC) framework to approximate cooperative multi-agent reinforcement learning (MARL) with nonuniform interactions and show that the approximate order is of $\mathcal{O}(\frac{1}{\sqrt{N}})$, with $N$ the number of agents. By discretizing the graphon index of GMFC, we further introduce a smaller class of GMFC called block GMFC, which is shown to well approximate cooperative MARL. Our empirical studies on several examples demonstrate that our GMFC approach is comparable with the state-of-art MARL algorithms while enjoying better scalability.
Reconstructing the Dynamic Directivity of Unconstrained Speech

This article presents a method for estimating and reconstructing the spatial energy distribution pattern of natural speech, which is crucial for achieving realistic vocal presence in virtual communication settings. The method comprises two stages. First, recordings of speech captured by a real, static microphone array are used to create an egocentric virtual array that tracks the movement of the speaker over time. This virtual array is used to measure and encode the high-resolution directivity pattern of the speech signal as it evolves dynamically with natural speech and movement. In the second stage, the encoded directivity representation is utilized to train a machine learning model that can estimate the full, dynamic directivity pattern given a limited set of speech signals, such as those recorded using the microphones on a head-mounted display. Our results show that neural networks can accurately estimate the full directivity pattern of natural, unconstrained speech from limited information. The proposed method for estimating and reconstructing the spatial energy distribution pattern of natural speech, along with the evaluation of various machine learning models and training paradigms, provides an important contribution to the development of realistic vocal presence in virtual communication settings.
Alpha-Particle Generation from H-11B Fusion Initiated by Laser-Accelerated Boron Ions

Here, we report the generation of MeV alpha-particles from H-11B fusion initiated by laser-accelerated boron ions. Boron ions with maximum energy of 6 MeV and fluence of 109/MeV/sr@5 MeV were generated from 60 nm-thick self-supporting boron nanofoils irradiated by 1 J femtosecond pulses at an intensity of 1019 W/cm2. By bombarding secondary hydrogenous targets with the boron ions, 3 × 105/sr alpha-particles from H-11B fusion were registered, which is consistent with the theoretical yield calculated from the measured boron energy spectra. Our results demonstrated an alternative way toward ultrashort MeV alpha-particle sources employing compact femtosecond lasers. The ion acceleration and product measurement scheme are referential for the studies on the ion stopping power and cross section of the H-11B reaction in solid or plasma.
Robust Understanding of Word Problems with Extraneous Information

Understanding of free-format multi-step arithmetic word problems with extraneous information is discussed. A model including a full set of general skills necessary for understanding such problems was developed and computer implemented. The validity of the simulation was confirmed by testing on a variety of word problems with extraneous information. The results of this study show the way for moving from an intuitive understanding of word problems to a conscious and controlled process.
Stability of Syntactic Dialect Classification over Space and Time

This paper analyses the degree to which dialect classifiers based on syntactic representations remain stable over space and time. While previous work has shown that the combination of grammar induction and geospatial text classification produces robust dialect models, we do not know what influence both changing grammars and changing populations have on dialect models. This paper constructs a test set for 12 dialects of English that spans three years at monthly intervals with a fixed spatial distribution across 1,120 cities. Syntactic representations are formulated within the usage-based Construction Grammar paradigm (CxG). The decay rate of classification performance for each dialect over time allows us to identify regions undergoing syntactic change. And the distribution of classification accuracy within dialect regions allows us to identify the degree to which the grammar of a dialect is internally heterogeneous. The main contribution of this paper is to show that a rigorous evaluation of dialect classification models can be used to find both variation over space and change over time.
Age-of-Updates Optimization for UAV-assisted Networks

Unmanned aerial vehicles (UAVs) have been proposed as a promising technology to collect data from IoT devices and relay it to the network. In this work, we are interested in scenarios where the data is updated periodically, and the collected updates are time-sensitive. In particular, the data updates may lose their value if they are not collected and analyzed timely. To maximize the data freshness, we optimize a new performance metric, namely the Age-of-Updates (AoU). Our objective is to carefully schedule the UAVs hovering positions and the users' association so that the AoU is minimized. Unlike existing works where the association parameters are considered as binary variables, we assume that devices send their updates according to a probability distribution. As a consequence, instead of optimizing a deterministic objective function, the objective function is replaced by an expectation over the probability distribution. The expected AoU is therefore optimized under quality of service and energy constraints. The original problem being non-convex, we propose an equivalent convex optimization that we solve using an interior-point method. Our simulation results show the performance of the proposed approach against a binary association.
A stability theory for constrained dynamic systems with applications to electric power systems

This paper develops a stability theory for constrained dynamic systems, which are defined as dynamic systems whose state trajectories are restricted to a particular set within the state space, called the feasible operating region. A restricted stability region is defined as the intersection of the domain of attraction of the stable equilibrium point without constraints and the feasible operating region. Our results show that the boundary of the stability region for a constrained dynamic system includes trajectories that are tangent to the boundary. We then develop a computational procedure to analyze stability in an electric power system following a network fault.
A Design of Low-Projection SCMA Codebooks for Ultra-Low Decoding Complexity in Downlink IoT Networks

This paper conceives a novel sparse code multiple access (SCMA) codebook design which is motivated by the strong need for providing ultra-low decoding complexity and good error performance in downlink Internet-of-things (IoT) networks, in which a massive number of low-end and low-cost IoT communication devices are served. By focusing on the typical Rician fading channels, we analyze the pair-wise error probability of superimposed SCMA codewords and then deduce the design metrics for multi-dimensional constellation construction and sparse codebook optimization. For significant reduction of the decoding complexity, we advocate the key idea of projecting the multi-dimensional constellation elements to a few overlapped complex numbers in each dimension, called low projection (LP). An emerging modulation scheme, called golden angle modulation (GAM), is considered for multi-stage LP optimization, where the resultant multi-dimensional constellation is called LP-GAM. Our analysis and simulation results show the superiority of the proposed LP codebooks (LPCBs) including one-shot decoding convergence and excellent error rate performance. In particular, the proposed LPCBs lead to decoding complexity reduction by at least 97% compared to that of the conventional codebooks, whilst owning large minimum Euclidean distance. Some examples of the proposed LPCBs are available at https://github.com/ethanlq/SCMA-codebook.
RIS-aided Wireless Communication with $1$-bit Discrete Optimization for Signal Enhancement

In recent years, a brand-new technology, reconfigurable intelligent surface (RIS) has been widely studied for reconfiguring the wireless propagation environment. RIS is an artificial surface of electromagnetic material that is capable of customizing the propagation of the wave impinging upon it. Utilizing RIS for communication service like signal enhancement usually lead to non-convex optimization problems. Existing optimization methods either suffers from scalability issues for $N$ number of RIS elements large, or may lead to suboptimal solutions in some scenario. In this paper, we propose a divide-and-sort (DaS) discrete optimization approach, that is guaranteed to find the global optimal phase shifts for $1$-bit RIS, and has time complexity $\mathcal{O}(N \log(N))$. Numerical experiments show that the proposed approach achieves a better ``performance--complexity tradeoff'' over other methods for $1$-bit RIS.
Structure formation and the global 21-cm signal in the presence of Coulomb-like dark matter-baryon interactions

Many compelling dark matter (DM) scenarios feature Coulomb-like interactions between DM particles and baryons, in which the cross section for elastic scattering scales with relative particle velocity as $v^{-4}$. Previous studies have invoked such interactions to produce heat exchange between cold DM and baryons and alter the temperature evolution of hydrogen. In this study, we present a comprehensive study of the effects of Coulomb-like scattering on structure formation, in addition to the known effects on the thermal history of hydrogen. We find that interactions which significantly alter the temperature of hydrogen at Cosmic Dawn also dramatically suppress the formation of galaxies that source the Lyman-$\alpha$ background, further affecting the global 21-cm signal. In particular, an interaction cross section at the current observational upper limit leads to a decrease in the abundance of star-forming halos by a factor of $\sim 2$ at $z\sim 20$, relative to cold, collisionless DM. We also find that DM that is 100% millicharged cannot reproduce the depth and the timing of the reported EDGES anomaly in any part of the parameter space. These results critically inform modeling of the global 21-cm signal and structure formation in cosmologies with DM-baryon scattering, with repercussions for future and upcoming cosmological data analysis.
Joint Activity Detection and Channel Estimation for Massive IoT Access Based on Millimeter-Wave/Terahertz Multi-Panel Massive MIMO

The multi-panel array, as a state-of-the-art antenna-in-package technology, is very suitable for millimeter-wave (mmWave)/ terahertz (THz) systems, due to its low-cost deployment and scalable configuration. But in the context of non-uniform array structures it leads to intractable signal processing. Based on such an array structure at the base station, this paper investigates a joint active user detection (AUD) and channel estimation (CE) scheme based on compressive sensing (CS) for application to the massive Internet of Things (IoT). Specifically, by exploiting the structured sparsity of mmWave/THz massive IoT access channels, we firstly formulate the multi-panel massive multiple-input multiple-output (mMIMO)-based joint AUD and CE problem as a multiple measurement vector (MMV)-CS problem. Then, we harness the expectation maximization (EM) algorithm to learn the prior parameters (i.e., the noise variance and the sparsity ratio) and an orthogonal approximate message passing (OAMP)-EM-MMV algorithm is developed to solve this problem. Our simulation results verify the improved AUD and CE performance of the proposed scheme compared to conventional CS-based algorithms.
Defend Data Poisoning Attacks on Voice Authentication

With the advances in deep learning, speaker verification has achieved very high accuracy and is gaining popularity as a type of biometric authentication option in many scenes of our daily life, especially the growing market of web services. Compared to traditional passwords,"vocal passwords"are much more convenient as they relieve people from memorizing different passwords. However, new machine learning attacks are putting these voice authentication systems at risk. Without a strong security guarantee, attackers could access legitimate users' web accounts by fooling the deep neural network (DNN) based voice recognition models. In this paper, we demonstrate an easy-to-implement data poisoning attack to the voice authentication system, which can hardly be captured by existing defense mechanisms. Thus, we propose a more robust defense method, called Guardian, which is a convolutional neural network-based discriminator. The Guardian discriminator integrates a series of novel techniques including bias reduction, input augmentation, and ensemble learning. Our approach is able to distinguish about 95% of attacked accounts from normal accounts, which is much more effective than existing approaches with only 60% accuracy.
Parasitic Element Time-Modulation for Enhanced Effective Inter-Antenna Coupling: Utilization for Improved Gain-Bandwidth

Time variation has been recently introduced as an additional degree of freedom for wave engineering, that enables going beyond the performances that are expected by linear time-invariant (LTI) systems. In this paper, we introduce the concept of indirect time-modulation of antennas using an add-on time-varying scatterer (parasitic element) that gives rise to an inherent feedback mechanism via the airborne wave system. As opposed to a direct modulated system where a time-dependent element is in contact with the other elements, in an indirect time modulation scheme \emph{no} direct physical contact between the original LTI network and the time-varying add-on scatterer is needed, thus leading to additional flexibility in the design. Using indirect time modulation we demonstrate enhanced effective coupling between remote antenna elements, and the possibility to outperform the gain-bandwidth achieved for the same antenna structure but without time-modulation.
Isoclinism and factor set in regular Hom-Lie superalgebras

Hom-Lie superalgebras can be considered as the deformation of Lie superalgebras; which are $\mathbb{Z}_2$-graded generalization of Hom-Lie algebras. The motivation of this paper is to introduce the concept of isoclinism and factor set in regular Hom-Lie superalgebras. Finally, we obtain that two finite same dimensional regular Hom-Lie superalgebras are isoclinic if and only if they are isomorphic.
The Herman invariant tori conjecture

We study a normal form at a critical point of an analytic Hamiltonian somewhat reminiscent of the Padé approximants in classical analysis. Under an arithmetic condition on the frequency we prove that the normal form converges over a Cantor set. Using this result, we deduce that the Hamiltonian is integrable over a Cantor set. Using the notion of curvedness, we show that in the real elliptic case this implies the existence of a positive measure set of invariant tori near the critical point, of density equal to one. This solves a conjecture formulated by M. Herman in the 90’s. To the memory of J.-C. Yoccoz. 1. Statement of the theorem Investigations into normal forms of Hamiltonian systems can be traced back to the earliest beginnings of celestial mechanics in the works of Euler, Laplace, Delaunay, and others. However, the understanding of simple examples is still very far from satisfactory. A fundamental class of examples starts with a system of non-interacting oscillators