Miracle-dz/UniFAR-FTUs huggingface dataset:
Hyperbolic Multiplex Network Embedding with Maps of Random Walk

Recent research on network embedding in hyperbolic space have proven successful in several applications. However, nodes in real world networks tend to interact through several distinct channels. Simple aggregation or ignorance of this multiplexity will lead to misleading results. On the other hand, there exists redundant information between different interaction patterns between nodes. Recent research reveals the analogy between the community structure and the hyperbolic coordinate. To learn each node's effective embedding representation while reducing the redundancy of multiplex network, we then propose a unified framework combing multiplex network hyperbolic embedding and multiplex community detection. The intuitive rationale is that high order node embedding approach is expected to alleviate the observed network's sparse and noisy structure which will benefit the community detection task. On the contrary, the improved community structure will also guide the node embedding task. To incorporate the common features between channels while preserving unique features, a random walk approach which traversing in latent multiplex hyperbolic space is proposed to detect the community across channels and bridge the connection between node embedding and community detection. The proposed framework is evaluated on several network tasks using different real world dataset. The results demonstrates that our framework is effective and efficiency compared with state-of-the-art approaches.
PySS3: A Python package implementing a novel text classifier with visualization tools for Explainable AI

A recently introduced text classifier, called SS3, has obtained state-of-the-art performance on the CLEF's eRisk tasks. SS3 was created to deal with risk detection over text streams and, therefore, not only supports incremental training and classification but also can visually explain its rationale. However, little attention has been paid to the potential use of SS3 as a general classifier. We believe this could be due to the unavailability of an open-source implementation of SS3. In this work, we introduce PySS3, a package that implements SS3 and also comes with visualization tools that allow researchers to deploy robust, explainable, and trusty machine learning models for text classification.
Non‐Gaussian geostatistical modeling using (skew) t processes

We propose a new model for regression and dependence analysis when addressing spatial data with possibly heavy tails and an asymmetric marginal distribution. We first propose a stationary process with t marginals obtained through scale mixing of a Gaussian process with an inverse square root process with Gamma marginals. We then generalize this construction by considering a skew‐Gaussian process, thus obtaining a process with skew‐t marginal distributions. For the proposed (skew) t process, we study the second‐order and geometrical properties and in the t case, we provide analytic expressions for the bivariate distribution. In an extensive simulation study, we investigate the use of the weighted pairwise likelihood as a method of estimation for the t process. Moreover we compare the performance of the optimal linear predictor of the t process versus the optimal Gaussian predictor. Finally, the effectiveness of our methodology is illustrated by analyzing a georeferenced dataset on maximum temperatures in Australia.
Short-time detection of QRS complexes using dual channels 1 based on U-Net and bidirectional long short-term memory

Cardiovascular disease is associated with high rates of morbidity and mortality, and can be reflected by 19 abnormal features of electrocardiogram (ECG). Detecting changes in the QRS complexes in ECG 20 signals is regarded as a straightforward, noninvasive, inexpensive, and preliminary diagnosis approach 21 for evaluating the cardiac health of patients. Therefore, detecting QRS complexes in ECG signals must 22 be accurate over short times. However, the reliability of automatic QRS detection is restricted by all 23 kinds of noise and complex signal morphologies. In this study, we proposed a new algorithm for 24 short-time detection of QRS complexes using dual channels based on U-Net and bidirectional long 25 short-term memory. First, a proposed preprocessor with mean filtering and discrete wavelet transform 26 was initially applied to remove different types of noise. Next the signal was transformed and 27 annotations were relabeled. Finally, a method combining U-Net and bidirectional long short-term 28 memory with dual channels was used for the short-time detection of QRS complexes. The proposed 29 algorithm was trained and tested using 44 ECG records from the MIT-BIH arrhythmia database. It 30 achieved, on average, high values for detection sensitivity (99.56%), positive predictivity (99.72%), 31 and accuracy (99.28%) on the test set, indicating an improvement compared to algorithms reported in 32 the literature.
Accelerating PDE-constrained Inverse Solutions with Deep Learning and Reduced Order Models

Inverse problems are pervasive mathematical methods in inferring knowledge from observational and experimental data by leveraging simulations and models. Unlike direct inference methods, inverse problem approaches typically require many forward model solves usually governed by Partial Differential Equations (PDEs). This a crucial bottleneck in determining the feasibility of such methods. While machine learning (ML) methods, such as deep neural networks (DNNs), can be employed to learn nonlinear forward models, designing a network architecture that preserves accuracy while generalizing to new parameter regimes is a daunting task. Furthermore, due to the computation-expensive nature of forward models, state-of-the-art black-box ML methods would require an unrealistic amount of work in order to obtain an accurate surrogate model. On the other hand, standard Reduced-Order Models (ROMs) accurately capture supposedly important physics of the forward model in the reduced subspaces, but otherwise could be inaccurate elsewhere. In this paper, we propose to enlarge the validity of ROMs and hence improve the accuracy outside the reduced subspaces by incorporating a data-driven ML technique. In particular, we focus on a goal-oriented approach that substantially improves the accuracy of reduced models by learning the error between the forward model and the ROM outputs. Once an ML-enhanced ROM is constructed it can accelerate the performance of solving many-query problems in parametrized forward and inverse problems. Numerical results for inverse problems governed by elliptic PDEs and parametrized neutron transport equations will be presented to support our approach.
Confusing dark matter particle properties with modifications to general relativity

Cold Dark Stars made of self-gravitating fermions in the degenerate limit are constructed in General Relativity and in R-square gravity, $f(R)=R+\alpha R^2$. The properties of the resulting Cold Dark Stars in both theories of gravity are studied. It is found that the same gravitational potential is generated for different election of the parameters of the model, such as the mass of the fermion, the self-interacting strength or the value of $\alpha$, thus, a possible confusion in the determination of the dark matter properties and the favored theory of gravity might arise.
An End-to-End Dialogue State Tracking System with Machine Reading Comprehension and Wide & Deep Classification

This paper describes our approach in DSTC 8 Track 4: Schema-Guided Dialogue State Tracking. The goal of this task is to predict the intents and slots in each user turn to complete the dialogue state tracking (DST) based on the information provided by the task's schema. Different from traditional stage-wise DST, we propose an end-to-end DST system to avoid error accumulation between the dialogue turns. The DST system consists of a machine reading comprehension (MRC) model for non-categorical slots and a Wide & Deep model for categorical slots. As far as we know, this is the first time that MRC and Wide & Deep model are applied to DST problem in a fully end-to-end way. Experimental results show that our framework achieves an excellent performance on the test dataset including 50% zero-shot services with a joint goal accuracy of 0.8652 and a slot tagging F1-Score of 0.9835.
Collaborative Filtering vs. Content-Based Filtering: differences and similarities

Recommendation Systems (SR) suggest items exploring user preferences, helping them with the information overload problem. Two approaches to SR have received more prominence, Collaborative Filtering, and Content-Based Filtering. Moreover, even though studies are indicating their advantages and disadvantages, few results empirically prove their characteristics, similarities, and differences. In this work, an experimental methodology is proposed to perform comparisons between recommendation algorithms for different approaches going beyond the "precision of the predictions". For the experiments, three algorithms of recommendation were tested: a baseline for Collaborative Filtration and two algorithms for Content-based Filtering that were developed for this evaluation. The experiments demonstrate the behavior of these systems in different data sets, its main characteristics and especially the complementary aspect of the two main approaches.
TextTubes for Detecting Curved Text in the Wild

We present a detector for curved text in natural images. We model scene text instances as tubes around their medial axes and introduce a parametrization-invariant loss function. We train a two-stage curved text detector, and evaluate it on the curved text benchmarks CTW-1500 and Total-Text. Our approach achieves state-of-the-art results or improves upon them, notably for CTW-1500 by over 8 percentage points in F-score.
Adaptive granularity in tensors: A quest for interpretable structure

Data collected at very frequent intervals is usually extremely sparse and has no structure that is exploitable by modern tensor decomposition algorithms. Thus, the utility of such tensors is low, in terms of the amount of interpretable and exploitable structure that one can extract from them. In this paper, we introduce the problem of finding a tensor of adaptive aggregated granularity that can be decomposed to reveal meaningful latent concepts (structures) from datasets that, in their original form, are not amenable to tensor analysis. Such datasets fall under the broad category of sparse point processes that evolve over space and/or time. To the best of our knowledge, this is the first work that explores adaptive granularity aggregation in tensors. Furthermore, we formally define the problem and discuss different definitions of “good structure” that are in practice and show that the optimal solution is of prohibitive combinatorial complexity. Subsequently, we propose an efficient and effective greedy algorithm called ICEBREAKER, which follows a number of intuitive decision criteria that locally maximize the “goodness of structure,” resulting in high-quality tensors. We evaluate our method on synthetic, semi-synthetic, and real datasets. In all the cases, our proposed method constructs tensors that have a very high structure quality.
Identification of abrupt stiffness changes of structures with tuned mass dampers under sudden events

This paper presents a recursive system identification method for MDoF structures with tuned mass dampers (TMDs) considering abrupt stiffness changes in case of sudden events, such as earthquakes. Due to supplementary nonclassical damping of the TMDs, the system identification of MDoF + TMD systems disposes a challenge, in particular, in case of sudden events. These identification methods may be helpful for structural health monitoring of MDoF structures controlled by TMDs. A new adaptation formulation of the unscented Kalman filter allows the identification method to track abrupt stiffness changes. The paper, firstly, describes the theoretical background of the proposed system identification method and afterwards presents three parametric studies regarding the performance of the method. The first study shows the augmented state identification by the presented system identification method applied on a MDoF + TMD system. In this study, the abrupt stiffness changes of the system are successfully detected and localized under earthquake, impulse, and white noise excitations. The second study investigates the effects of the state covariance and its relevance for the system identification of MDoF + TMD systems. The results of this study show the necessity of an adaptive definition of the state covariance as applied in the proposed method. The third study investigates the effects of modeling on the performance of the identification method. Mathematical models with discretization of different orders of convergence and system noise levels are studied. The results show that, in particular, MDoF + TMD systems require higher order mathematical models for an accurate identification of abrupt changes.
Going Beneath the Surface: Evaluating Image Captioning for Grammaticality, Truthfulness and Diversity

Image captioning as a multimodal task has drawn much interest in recent years. However, evaluation for this task remains a challenging problem. Existing evaluation metrics focus on surface similarity between a candidate caption and a set of reference captions, and do not check the actual relation between a caption and the underlying visual content. We introduce a new diagnostic evaluation framework for the task of image captioning, with the goal of directly assessing models for grammaticality, truthfulness and diversity (GTD) of generated captions. We demonstrate the potential of our evaluation framework by evaluating existing image captioning models on a wide ranging set of synthetic datasets that we construct for diagnostic evaluation. We empirically show how the GTD evaluation framework, in combination with diagnostic datasets, can provide insights into model capabilities and limitations to supplement standard evaluations.
Pseudo-Encoded Stochastic Variational Inference

Posterior inference in directed graphical models is commonly done using a probabilistic encoder (a.k.a inference model) conditioned on the input. Often this inference model is trained jointly with the probabilistic decoder (a.k.a generator model). If probabilistic encoder encounters complexities during training (e.g. suboptimal complxity or parameterization), then learning reaches a suboptimal objective; a phenomena commonly called inference suboptimality. In Variational Inference (VI), optimizing the ELBo using Stochastic Variational Inference (SVI) can eliminate the inference suboptimality (as demonstrated in this paper), however, this solution comes at a substantial computational cost when inference needs to be done on new data points. Essentially, a long sequential chain of gradient updates is required to fully optimize approximate posteriors. In this paper, we present an approach called Pseudo-Encoded Stochastic Variational Inference (PE-SVI), to reduce the inference complexity of SVI during test time. Our approach relies on finding a suitable initial start point for gradient operations, which naturally reduces the required gradient steps. Furthermore, this initialization allows for adopting larger step sizes (compared to random initialization used in SVI), which further reduces the inference time complexity. PE-SVI reaches the same ELBo objective as SVI using less than one percent of required steps, on average.
HAMBox: Delving into Online High-quality Anchors Mining for Detecting Outer Faces

Current face detectors utilize anchors to frame a multi-task learning problem which combines classification and bounding box regression. Effective anchor design and anchor matching strategy enable face detectors to localize faces under large pose and scale variations. However, we observe that more than 80% correctly predicted bounding boxes are regressed from the unmatched anchors (the IoUs between anchors and target faces are lower than a threshold) in the inference phase. It indicates that these unmatched anchors perform excellent regression ability, but the existing methods neglect to learn from them. In this paper, we propose an Online High-quality Anchor Mining Strategy (HAMBox), which explicitly helps outer faces compensate with high-quality anchors. Our proposed HAMBox method could be a general strategy for anchor-based single-stage face detection. Experiments on various datasets, including WIDER FACE, FDDB, AFW and PASCAL Face, demonstrate the superiority of the proposed method. Furthermore, our team win the championship on the Face Detection test track of WIDER Face and Pedestrian Challenge 2019. We will release the codes with PaddlePaddle.
Enabling Smartphone-based Estimation of Heart Rate

Continuous, ubiquitous monitoring through wearable sensors has the potential to collect useful information about users' context. Heart rate is an important physiologic measure used in a wide variety of applications, such as fitness tracking and health monitoring. However, wearable sensors that monitor heart rate, such as smartwatches and electrocardiogram (ECG) patches, can have gaps in their data streams because of technical issues (e.g., bad wireless channels, battery depletion, etc.) or user-related reasons (e.g. motion artifacts, user compliance, etc.). The ability to use other available sensor data (e.g., smartphone data) to estimate missing heart rate readings is useful to cope with any such gaps, thus improving data quality and continuity. In this paper, we test the feasibility of estimating raw heart rate using smartphone sensor data. Using data generated by 12 participants in a one-week study period, we were able to build both personalized and generalized models using regression, SVM, and random forest algorithms. All three algorithms outperformed the baseline moving-average interpolation method for both personalized and generalized settings. Moreover, our findings suggest that personalized models outperformed the generalized models, which speaks to the importance of considering personal physiology, behavior, and life style in the estimation of heart rate. The promising results provide preliminary evidence of the feasibility of combining smartphone sensor data with wearable sensor data for continuous heart rate monitoring.
Finite State Markov Modeling of Fading Channels Towards Decoding of LDPC Codes

Here we have proposed two decoding strategies of low-density parity-check (LDPC) codes over Markov noise channels with bit flipping noise. The sum-product algorithm used for decoding LDPC codes over memoryless channels is extended to include channel estimation and how much gain we obtain by doing so is simulated and verified. LDPC codes have been studied for years over memoryless channels and are known to have excellent performance. However, these codes over channels with memory is the topic of current research. Here, channels with memory are characterized by Markov modeling which is a useful busty channel model. With sufficient no. of states, they are able to model sufficient noise characteristics. We have gone for a two-state system as it shows a good compromise between complexity and performance.
Overcoming Long-Term Catastrophic Forgetting Through Adversarial Neural Pruning and Synaptic Consolidation

Enabling a neural network to sequentially learn multiple tasks is of great significance for expanding the applicability of neural networks in real-world applications. However, artificial neural networks face the well-known problem of catastrophic forgetting. What is worse, the degradation of previously learned skills becomes more severe as the task sequence increases, known as the long-term catastrophic forgetting. It is due to two facts: first, as the model learns more tasks, the intersection of the low-error parameter subspace satisfying for these tasks becomes smaller or even does not exist; second, when the model learns a new task, the cumulative error keeps increasing as the model tries to protect the parameter configuration of previous tasks from interference. Inspired by the memory consolidation mechanism in mammalian brains with synaptic plasticity, we propose a confrontation mechanism in which Adversarial Neural Pruning and synaptic Consolidation (ANPyC) is used to overcome the long-term catastrophic forgetting issue. The neural pruning acts as long-term depression to prune task-irrelevant parameters, while the novel synaptic consolidation acts as long-term potentiation to strengthen task-relevant parameters. During the training, this confrontation achieves a balance in that only crucial parameters remain, and non-significant parameters are freed to learn subsequent tasks. ANPyC avoids forgetting important information and makes the model efficient to learn a large number of tasks. Specifically, the neural pruning iteratively relaxes the current task’s parameter conditions to expand the common parameter subspace of the task; the synaptic consolidation strategy, which consists of a structure-aware parameter-importance measurement and an element-wise parameter updating strategy, decreases the cumulative error when learning new tasks. Our approach encourages the synapse to be sparse and polarized, which enables long-term learning and memory. ANPyC exhibits effectiveness and generalization on both image classification and generation tasks with multiple layer perceptron, convolutional neural networks, and generative adversarial networks, and variational autoencoder. The full source code is available at https://github.com/GeoX-Lab/ANPyC.
Gaia GraL: Gaia DR2 Gravitational Lens Systems. V. Doubly-imaged QSOs discovered from entropy and wavelets

The discovery of multiply-imaged gravitationally lensed QSOs is fundamental to many astronomical and cosmological studies. However, these objects are rare and challenging to discover due to requirements of high-angular resolution astrometric, multiwavelength photometric and spectroscopic data. This has limited the number of known systems to a few hundred objects. We aim to reduce the constraints on angular resolution and discover multiply-imaged QSO candidates by using new candidate selection principles based on unresolved photometric time-series and ground-based images from public surveys. We selected candidates for multiply-imaged QSOs based on low levels of entropy computed from Catalina unresolved photometric time-series or Euclidean similarity to known lenses in a space defined by the wavelet power spectra of Pan-STARSS DR2 or DECaLS DR7 images, combined with multiple {\it Gaia} DR2 sources or large astrometric errors and supervised and unsupervised learning methods. We then confirmed spectroscopically some candidates with the Palomar Hale, Keck-I, and ESO/NTT telescopes. Here we report the discovery and confirmation of seven doubly-imaged QSOs and one likely double quasar. This demonstrates the potential of combining space-astrometry, even if unresolved, with low spatial-resolution photometric time-series and/or low-spatial resolution multi-band imaging to discover multiply-imaged lensed QSOs.
Nuclear and neutron-star matter from local chiral interactions

We report a quantum Monte Carlo calculation of the equation of state of symmetric nuclear matter using local interactions derived from chiral effective field theory up to next-to-next-to-leading order fit to few-body observables only. The empirical saturation density and energy are well reproduced within statistical and systematic uncertainties. We have also derived the symmetry energy as a function of the density, finding good agreement with available experimentally derived constraints at saturation and twice saturation density. We find that the corresponding pressure is also in excellent agreement with recent constraints extracted from gravitational waves of the neutron-star merger GW170817 by the LIGO-Virgo detection.