Miracle-dz/UniFAR-FTUs huggingface dataset:
The newly discovered Be/X-ray binary Swift J004516.6–734703 in the SMC: witnessing the emergence of a circumstellar disc

We report on the discovery of Swift J004516.6–734703, a Be/X-ray binary system by the Swift SMC Survey, S-CUBED. Swift J004516.6–734703, or SXP 146.6, was found to be exhibiting a bright (∼1037 erg s−1) X-ray outburst on 2020 June 18. The historical UV and IR light-curves from OGLE and Swift/UVOT showed that after a long period of steady brightness, it experienced a significant brightening beginning around 2019 March. This IR/UV rise is likely the signature of the formation of a circumstellar disc, confirmed by the presence of strong an H α line in SALT spectroscopy, that was not previously present. Periodicity analysis of the OGLE data reveals a plausible 426 d binary period, and in X-ray a pulsation period of 146.6 s is detected. The onset of X-ray emission from Swift J004516.6–734703 is likely the signature of a Type-I outburst from the first periastron passage of the neutron star companion through the newly formed circumstellar disc. We note that the formation of the circumstellar disc began at the predicted time of the previous periastron passage, suggesting its formation was spurred by tidal interaction with the neutron star.
Uniqueness and stability of an inverse problem for a semi-linear wave equation

We consider the recovery of a potential associated with a semi-linear wave equation on $\mathbb{R}^{n+1}$, $n\geq 1$. We show a Holder stability estimate for the recovery of an unknown potential $a$ of the wave equation $\square u +a u^m=0$ from its Dirichlet-to-Neumann map. We show that an unknown potential $a(x,t)$, supported in $\Omega\times[t_1,t_2]$, of the wave equation $\square u +a u^m=0$ can be recovered in a Holder stable way from the map $u|_{\partial \Omega\times [0,T]}\mapsto \langle\psi,\partial_\nu u|_{\partial \Omega\times [0,T]}\rangle_{L^2(\partial \Omega\times [0,T])}$. This data is equivalent to the inner product of the Dirichlet-to-Neumann map with a measurement function $\psi$. We also prove similar stability result for the recovery of $a$ when there is noise added to the boundary data. The method we use is constructive and it is based on the higher order linearization. As a consequence, we also get a uniqueness result. We also give a detailed presentation of the forward problem for the equation $\square u +a u^m=0$.
Exact Support Recovery in Federated Regression with One-shot Communication

Federated learning provides a framework to address the challenges of distributed computing, data ownership and privacy over a large number of distributed clients with low computational and communication capabilities. In this paper, we study the problem of learning the exact support of sparse linear regression in the federated learning setup. We provide a simple communication efficient algorithm which only needs one-shot communication with the centralized server to compute the exact support. Our method does not require the clients to solve any optimization problem and thus, can be run on devices with low computational capabilities. Our method is naturally robust to the problems of client failure, model poisoning and straggling clients. We formally prove that our method requires a number of samples per client that is polynomial with respect to the support size, but independent of the dimension of the problem. We require the number of distributed clients to be logarithmic in the dimension of the problem. If the predictor variables are mutually independent then the overall sample complexity matches the optimal sample complexity of the non-federated centralized setting. Furthermore, our method is easy to implement and has an overall polynomial time complexity.
The Hawkes Edge Partition Model for Continuous-time Event-based Temporal Networks

We propose a novel probabilistic framework to model continuous-time interaction events data. Our goal is to infer the \emph{implicit} community structure underlying the temporal interactions among entities, and also to exploit how the community structure influences the interaction dynamics among these nodes. To this end, we model the reciprocating interactions between individuals using mutually-exciting Hawkes processes. The base rate of the Hawkes process for each pair of individuals is built upon the latent representations inferred using the hierarchical gamma process edge partition model (HGaP-EPM). In particular, our model allows the interaction dynamics between each pair of individuals to be modulated by their respective affiliated communities. Moreover, our model can flexibly incorporate the auxiliary individuals' attributes, or covariates associated with interaction events. Efficient Gibbs sampling and Expectation-Maximization algorithms are developed to perform inference via P\'olya-Gamma data augmentation strategy. Experimental results on real-world datasets demonstrate that our model not only achieves competitive performance for temporal link prediction compared with state-of-the-art methods, but also discovers interpretable latent structure behind the observed temporal interactions.
Calibration of Shared Equilibria in General Sum Partially Observable Markov Games

Training multi-agent systems (MAS) to achieve realistic equilibria gives us a useful tool to understand and model real-world systems. We consider a general sum partially observable Markov game where agents of different types share a single policy network, conditioned on agent-specific information. This paper aims at i) formally understanding equilibria reached by such agents, and ii) matching emergent phenomena of such equilibria to real-world targets. Parameter sharing with decentralized execution has been introduced as an efficient way to train multiple agents using a single policy network. However, the nature of resulting equilibria reached by such agents is not yet understood: we introduce the novel concept of \textit{Shared equilibrium} as a symmetric pure Nash equilibrium of a certain Functional Form Game (FFG) and prove convergence to the latter for a certain class of games using self-play. In addition, it is important that such equilibria satisfy certain constraints so that MAS are \textit{calibrated} to real world data for practical use: we solve this problem by introducing a novel dual-Reinforcement Learning based approach that fits emergent behaviors of agents in a Shared equilibrium to externally-specified targets, and apply our methods to a $n$-player market example. We do so by calibrating parameters governing distributions of agent types rather than individual agents, which allows both behavior differentiation among agents and coherent scaling of the shared policy network to multiple agents.
Improving ambient solar wind model predictions with machine learning

The study of ambient solar wind, a continuous pressure-driven plasma flow emanating from our Sun, is an important component of space weather research. The ambient solar wind flows in interplanetary space determine how solar storms evolve through the heliosphere before reaching Earth, and especially during solar minimum are themselves a driver of activity in the Earth's magnetic field. Accurately forecasting the ambient solar wind flow is therefore imperative to space weather awareness. Here we present a novel machine learning approach in which solutions from magnetic models of the solar corona are used to output the solar wind conditions near the Earth. The results are compared to observations and existing models in a comprehensive validation analysis, and the new model outperforms existing models in almost all measures. The final model discussed here represents an extremely fast, well-validated and open-source approach to the forecasting of ambient solar wind at Earth.
Extension of Direct Feedback Alignment to Convolutional and Recurrent Neural Network for Bio-plausible Deep Learning

Throughout this paper, we focus on the improvement of the direct feedback alignment (DFA) algorithm and extend the usage of the DFA to convolutional and recurrent neural networks (CNNs and RNNs). Even though the DFA algorithm is biologically plausible and has a potential of high-speed training, it has not been considered as the substitute for back-propagation (BP) due to the low accuracy in the CNN and RNN training. In this work, we propose a new DFA algorithm for BP-level accurate CNN and RNN training. Firstly, we divide the network into several modules and apply the DFA algorithm within the module. Second, the DFA with the sparse backward weight is applied. It comes with a form of dilated convolution in the CNN case, and in a form of sparse matrix multiplication in the RNN case. Additionally, the error propagation method of CNN becomes simpler through the group convolution. Finally, hybrid DFA increases the accuracy of the CNN and RNN training to the BP-level while taking advantage of the parallelism and hardware efficiency of the DFA algorithm.
SIAT: A Systematic Inter-Component Communication Analysis Technology for Detecting Threats on Android

In this paper, we present the design and implementation of a Systematic Inter-Component Communication Analysis Technology (SIAT) consisting of two key modules: \emph{Monitor} and \emph{Analyzer}. As an extension to the Android operating system at framework layer, the \emph{Monitor} makes the first attempt to revise the taint tag approach named TaintDroid both at method-level and file-level, to migrate it to the app-pair ICC paths identification through systemwide tracing and analysis of taint in intent both at the data flow and control flow. By taking over the taint logs offered by the \emph{Monitor}, the \emph{Analyzer} can build the accurate and integrated ICC models adopted to identify the specific threat models with the detection algorithms and predefined rules. Meanwhile, we employ the models' deflation technology to improve the efficiency of the \emph{Analyzer}. We implement the SIAT with Android Open Source Project and evaluate its performance through extensive experiments on well-known datasets and real-world apps. The experimental results show that, compared to state-of-the-art approaches, the SIAT can achieve about 25\%$\sim$200\% accuracy improvements with 1.0 precision and 0.98 recall at the cost of negligible runtime overhead. Moreover, the SIAT can identify two undisclosed cases of bypassing that prior technologies cannot detect and quite a few malicious ICC threats in real-world apps with lots of downloads on the Google Play market.
Unsupervised Learning Universal Critical Behavior via the Intrinsic Dimension

The identification of universal properties from minimally processed data sets is one goal of machine learning techniques applied to statistical physics. Here, we study how the minimum number of variables needed to accurately describe the important features of a data set - the intrinsic dimension ($I_d$) - behaves in the vicinity of phase transitions. We employ state-of-the-art nearest neighbors-based $I_d$-estimators to compute the $I_d$ of raw Monte Carlo thermal configurations across different phase transitions: first-, second-order and Berezinskii-Kosterlitz-Thouless. For all the considered cases, we find that the $I_d$ uniquely characterizes the transition regime. The finite-size analysis of the $I_d$ allows not just to identify critical points with an accuracy comparable with methods that rely on a priori identification of order parameters, but also to determine the class of the transitions and to access the corresponding (critical) exponents. For the case of topological transitions, this analysis overcomes the reported limitations affecting other unsupervised learning methods. Our work reveals how raw data sets display unique signatures of universal behavior in the absence of any dimensional reduction scheme, and suggest direct parallelism between conventional order parameters in real space, and the intrinsic dimension in the data space.
Signal Shaping for Non-Uniform Beamspace Modulated mmWave Hybrid MIMO Communications

This paper investigates adaptive signal shaping methods for millimeter wave (mmWave) multiple-input multiple-output (MIMO) communications based on the maximizing the minimum Euclidean distance (MMED) criterion. In this work, we utilize the indices of analog precoders to carry information and optimize the symbol vector sets used for each analog precoder activation state. Specifically, we firstly propose a joint optimization based signal shaping (JOSS) approach, in which the symbol vector sets used for all analog precoder activation states are jointly optimized by solving a series of quadratically constrained quadratic programming (QCQP) problems. JOSS exhibits good performance, however, with a high computational complexity. To reduce the computational complexity, we then propose a full precoding based signal shaping (FPSS) method and a diagonal precoding based signal shaping (DPSS) method, where the full or diagonal digital precoders for all analog precoder activation states are optimized by solving two small-scale QCQP problems. Simulation results show that the proposed signal shaping methods can provide considerable performance gain in reliability in comparison with existing mmWave transmission solutions.
Function approximation via the subsampled Poincaré inequality

Function approximation and recovery via some sampled data have long been studied in a wide array of applied mathematics and statistics fields. Analytic tools, such as the Poincare inequality, have been handy for estimating the approximation errors in different scales. The purpose of this paper is to study a generalized Poincar\' e inequality, where the measurement function is of subsampled type, with a small but non-zero lengthscale that will be made precise. Our analysis identifies this inequality as a basic tool for function recovery problems. We discuss and demonstrate the optimality of the inequality concerning the subsampled lengthscale, connecting it to existing results in the literature. In application to function approximation problems, the approximation accuracy using different basis functions and under different regularity assumptions is established by using the subsampled Poincare inequality. We observe that the error bound blows up as the subsampled lengthscale approaches zero, due to the fact that the underlying function is not regular enough to have well-defined pointwise values. A weighted version of the Poincar\' e inequality is proposed to address this problem; its optimality is also discussed.
Sparse Symplectically Integrated Neural Networks

We introduce Sparse Symplectically Integrated Neural Networks (SSINNs), a novel model for learning Hamiltonian dynamical systems from data. SSINNs combine fourth-order symplectic integration with a learned parameterization of the Hamiltonian obtained using sparse regression through a mathematically elegant function space. This allows for interpretable models that incorporate symplectic inductive biases and have low memory requirements. We evaluate SSINNs on four classical Hamiltonian dynamical problems: the Henon-Heiles system, nonlinearly coupled oscillators, a multi-particle mass-spring system, and a pendulum system. Our results demonstrate promise in both system prediction and conservation of energy, outperforming the current state-of-the-art black-box prediction techniques by an order of magnitude. Further, SSINNs successfully converge to true governing equations from highly limited and noisy data, demonstrating potential applicability in the discovery of new physical governing equations.
Hybrid Spatio-Temporal Graph Convolutional Network: Improving Traffic Prediction with Navigation Data

Traffic forecasting has recently attracted increasing interest due to the popularity of online navigation services, ridesharing and smart city projects. Owing to the non-stationary nature of road traffic, forecasting accuracy is fundamentally limited by the lack of contextual information. To address this issue, we propose the Hybrid Spatio-Temporal Graph Convolutional Network (H-STGCN), which is able to "deduce" future travel time by exploiting the data of upcoming traffic volume. Specifically, we propose an algorithm to acquire the upcoming traffic volume from an online navigation engine. Taking advantage of the piecewise-linear flow-density relationship, a novel transformer structure converts the upcoming volume into its equivalent in travel time. We combine this signal with the commonly-utilized travel-time signal, and then apply graph convolution to capture the spatial dependency. Particularly, we construct a compound adjacency matrix which reflects the innate traffic proximity. We conduct extensive experiments on real-world datasets. The results show that H-STGCN remarkably outperforms state-of-the-art methods in various metrics, especially for the prediction of non-recurring congestion.
Distilling Object Detectors with Task Adaptive Regularization

Current state-of-the-art object detectors are at the expense of high computational costs and are hard to deploy to low-end devices. Knowledge distillation, which aims at training a smaller student network by transferring knowledge from a larger teacher model, is one of the promising solutions for model miniaturization. In this paper, we investigate each module of a typical detector in depth, and propose a general distillation framework that adaptively transfers knowledge from teacher to student according to the task specific priors. The intuition is that simply distilling all information from teacher to student is not advisable, instead we should only borrow priors from the teacher model where the student cannot perform well. Towards this goal, we propose a region proposal sharing mechanism to interflow region responses between the teacher and student models. Based on this, we adaptively transfer knowledge at three levels, \emph{i.e.}, feature backbone, classification head, and bounding box regression head, according to which model performs more reasonably. Furthermore, considering that it would introduce optimization dilemma when minimizing distillation loss and detection loss simultaneously, we propose a distillation decay strategy to help improve model generalization via gradually reducing the distillation penalty. Experiments on widely used detection benchmarks demonstrate the effectiveness of our method. In particular, using Faster R-CNN with FPN as an instantiation, we achieve an accuracy of $39.0\%$ with Resnet-50 on COCO dataset, which surpasses the baseline $36.3\%$ by $2.7\%$ points, and even better than the teacher model with $38.5\%$ mAP.
Factors affecting the occupation of a colony site in Sydney, New South Wales by the Grey‐headed Flying‐fox Pteropus poliocephalus (Pteropodidae)

Previous authors have reported that Pteropus poliocephalus colony sites are occupied in response to blossom availability. However, in the present study it is reported that at the Gordon site in suburban Sydney, colony numbers were negatively correlated with the occurrence of pollen in the droppings. In addition, in contrast to reported occupational patterns at other colony sites, where flying-foxes are not present at the site during winter and early spring, the Gordon site was occupied by substantial numbers of flying-foxes throughout the entire period of 62 months from 1985 to 1990. As a result of the introduction of plants native to other parts of Australia and exotics from other continents, there is a variety of foods available throughout the year in the Sydney region, in comparison with less urbanized areas. This food supply permits the occupation of the Gordon colony site during winter and spring and reduces the migratory behaviour of flying-foxes throughout the year. It is concluded that in the absence of a restrictive food supply, the occupational pattern of the Gordon colony of P. poliocephalus is the result of the reproductive requirements of the species modified by the vagaries of blossom production in the native forests outside the foraging range of the colony.
Bias-corrected climate projections from Coupled Model Intercomparison Project-6 (CMIP6) for South Asia

Climate change is likely to pose enormous challenges for agriculture, water resources, infrastructure, and livelihood of millions of people living in South Asia. Here, we develop daily bias-corrected data of precipitation, maximum and minimum temperatures at 0.25° spatial resolution for South Asia (India, Pakistan, Bangladesh, Nepal, Bhutan, and Sri Lanka) and 18 river basins located in the Indian sub-continent. The bias-corrected dataset is developed using Empirical Quantile Mapping (EQM) for the historic (1951-2014) and projected (2015-2100) climate for the four scenarios (SSP126, SSP245, SSP370, SSP585) using output from 13 CMIP6-GCMs. The bias-corrected dataset was evaluated against the observations for both mean and extremes of precipitation, maximum and minimum temperatures. Bias corrected projections from 13 CMIP6-GCMs project a warmer (3-5°C) and wetter (13-30%) climate in South Asia in the 21st century. The bias-corrected projections from CMIP6-GCMs can be used for climate change impact assessment in South Asia and hydrologic impact assessment in the sub-continental river basins.
Optimised allgatherv, reduce_scatter and allreduce communication in message-passing systems

Collective communications, namely the patterns allgatherv, reduce_scatter, and allreduce in message-passing systems are optimised based on measurements at the installation time of the library. The algorithms used are set up in an initialisation phase of the communication, similar to the method used in so-called persistent collective communication introduced in the literature. For allgatherv and reduce_scatter the existing algorithms, recursive multiply/divide and cyclic shift (Bruck's algorithm) are applied with a flexible number of communication ports per node. The algorithms for equal message sizes are used with non-equal message sizes together with a heuristic for rank reordering. The two communication patterns are applied in a plasma physics application that uses a specialised matrix-vector multiplication. For the allreduce pattern the cyclic shift algorithm is applied with a prefix operation. The data is gathered and scattered by the cores within the node and the communication algorithms are applied across the nodes. In general our routines outperform the non-persistent counterparts in established MPI libraries by up to one order of magnitude or show equal performance, with a few exceptions of number of nodes and message sizes.
Fairness without Demographics through Adversarially Reweighted Learning

Much of the previous machine learning (ML) fairness literature assumes that protected features such as race and sex are present in the dataset, and relies upon them to mitigate fairness concerns. However, in practice factors like privacy and regulation often preclude the collection of protected features, or their use for training or inference, severely limiting the applicability of traditional fairness research. Therefore we ask: How can we train a ML model to improve fairness when we do not even know the protected group memberships? In this work we address this problem by proposing Adversarially Reweighted Learning (ARL). In particular, we hypothesize that non-protected features and task labels are valuable for identifying fairness issues, and can be used to co-train an adversarial reweighting approach for improving fairness. Our results show that ARL improves Rawlsian Max-Min fairness, with significant AUC improvements for worst-case protected groups in multiple datasets,outperforming state-of-the-art alternatives.