OpenRaiser/Intern-Atlas huggingface dataset:
Enriching BERT with Knowledge Graph Embeddings for Document Classification
Venue: arXiv cs.CL 2019
Year: 2019

In this paper, we focus on the classification of books using short descriptive texts (cover blurbs) and additional metadata. Building upon BERT, a deep neural language model, we demonstrate how to combine text representations with metadata and knowledge graph embeddings, which encode author information. Compared to the standard BERT approach we achieve considerably better results for the classification task. For a more coarse-grained classification using eight labels we achieve an F1- score of 87.20, while a detailed classification using 343 labels yields an F1-score of 64.70. We make the source code and trained models of our experiments publicly available
Learnability Can Be Independent of ZFC Axioms: Explanations and Implications
Venue: arXiv cs.LG 2019
Year: 2019

In Ben-David et al.'s "Learnability Can Be Undecidable," they prove an independence result in theoretical machine learning. In particular, they define a new type of learnability, called Estimating The Maximum (EMX) learnability. They argue that this type of learnability fits in with other notions such as PAC learnability, Vapnik's statistical learning setting, and other general learning settings. However, using some set-theoretic techniques, they show that some learning problems in the EMX setting are independent of ZFC. Specifically they prove that ZFC cannot prove or disprove EMX learnability of the finite subsets on the [0,1] interval. Moreover, the way they prove it shows that there can be no characteristic dimension for EMX; and, hence, for general learning settings. Here, I will explain their findings, discuss some limitations on those findings, and offer some suggestions about how to excise that undecidability. Parts 2-3 will explain the results of the paper, part 4-5 will discuss some limitations and next steps, and I will conclude in part 6.
The collaboration behavior of top scientists
Venue: arXiv cs.DL 2019
Year: 2019

The intention of this work is to analyze top scientists' collaboration behavior at the "international", "domestic extramural" and "intramural" levels, and compare it to that of their lesser performing colleagues. The field of observation consists of the entire faculty of the Italian academic system, and so the coauthorship of scientific publications by over 12,000 professors. The broader aim is to improve understanding of the causal nexus between research collaboration and performance. The analysis is thus longitudinal, over two successive five-year periods. Results show a strong increase in the propensity to collaborate at domestic level (both extramural and intramural), however this is less for scientists who remain or become top, than it is for their lower-performing colleagues. In contrast, the increase in international collaboration behavior is greater for scientists who become or remain top than it is for their peers. The increase in productivity by those who acquire top scientist status is due precisely to the greater average impact of the publications achieved in collaboration with foreign colleagues.
Optimization of the Belief-Propagation Algorithm for Distributed Detection by Linear Data-Fusion Techniques
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we investigate distributed inference schemes, over binary-valued Markov random fields, which are realized by the belief propagation (BP) algorithm. We first show that a decision variable obtained by the BP algorithm in a network of distributed agents can be approximated by a linear fusion of all the local log-likelihood ratios. The proposed approach clarifies how the BP algorithm works, simplifies the statistical analysis of its behavior, and enables us to develop a performance optimization framework for the BP-based distributed inference systems. Next, we propose a blind learning-adaptation scheme to optimize the system performance when there is no information available a priori describing the statistical behavior of the wireless environment concerned. In addition, we propose a blind threshold adaptation method to guarantee a certain performance level in a BP-based distributed detection system. To clarify the points discussed, we design a novel linear-BP-based distributed spectrum sensing scheme for cognitive radio networks and illustrate the performance improvement obtained, over an existing BP-based detection method, via computer simulations.
Transfer Learning with Dynamic Distribution Adaptation
Venue: arXiv cs.LG 2019
Year: 2019

Transfer learning aims to learn robust classifiers for the target domain by leveraging knowledge from a source domain. Since the source and the target domains are usually from different distributions, existing methods mainly focus on adapting the cross-domain marginal or conditional distributions. However, in real applications, the marginal and conditional distributions usually have different contributions to the domain discrepancy. Existing methods fail to quantitatively evaluate the different importance of these two distributions, which will result in unsatisfactory transfer performance. In this paper, we propose a novel concept called Dynamic Distribution Adaptation (DDA), which is capable of quantitatively evaluating the relative importance of each distribution. DDA can be easily incorporated into the framework of structural risk minimization to solve transfer learning problems. On the basis of DDA, we propose two novel learning algorithms: (1) Manifold Dynamic Distribution Adaptation (MDDA) for traditional transfer learning, and (2) Dynamic Distribution Adaptation Network (DDAN) for deep transfer learning. Extensive experiments demonstrate that MDDA and DDAN significantly improve the transfer learning performance and setup a strong baseline over the latest deep and adversarial methods on digits recognition, sentiment analysis, and image classification. More importantly, it is shown that marginal and conditional distributions have different contributions to the domain divergence, and our DDA is able to provide good quantitative evaluation of their relative importance which leads to better performance. We believe this observation can be helpful for future research in transfer learning.
Physical Layer Security in Multimode Fiber Optical Networks
Venue: arXiv cs.CR 2019
Year: 2019

Inverse precoding algorithms in multimode fiber based communication networks are used to exploit mode dependent losses on the physical layer. This provides an asymmetry between legitimate (Bob) and unlegitimate (Eve) receiver of messages resulting in a significant SNR advantage for Bob. In combination with dynamic mode channel changes, Eve has no chance to reconstruct a sent message even in a worst case scenario in which she is almighty. This is the first time, Physical Layer Security in a fiber optical network is investigated on the basis of measured transmission matrices. These results show that messages can be sent securely with conventional communication techniques. Translating the task of securing data from software to hardware represents the potential of a scientific paradigm shift. The introduced technique is a step towards the development of cyber physical systems.
Visual Measurement Integrity Monitoring for UAV Localization
Venue: arXiv cs.RO 2019
Year: 2019

Unmanned aerial vehicles (UAVs) have increasingly been adopted for safety, security, and rescue missions, for which they need precise and reliable pose estimates relative to their environment. To ensure mission safety when relying on visual perception, it is essential to have an approach to assess the integrity of the visual localization solution. However, to the best of our knowledge, such an approach does not exist for optimization-based visual localization. Receiver autonomous integrity monitoring (RAIM) has been widely used in global navigation satellite systems (GNSS) applications such as automated aircraft landing. In this paper, we propose a novel approach inspired by RAIM to monitor the integrity of optimization-based visual localization and calculate the protection level of a state estimate, i.e. the largest possible translational error in each direction. We also propose a metric that quantitatively evaluates the performance of the error bounds. Finally, we validate the protection level using the EuRoC dataset and demonstrate that the proposed protection level provides a significantly more reliable bound than the commonly used $3σ$ method.
Learning Discrepancy Models From Experimental Data
Venue: arXiv cs.LG 2019
Year: 2019

First principles modeling of physical systems has led to significant technological advances across all branches of science. For nonlinear systems, however, small modeling errors can lead to significant deviations from the true, measured behavior. Even in mechanical systems, where the equations are assumed to be well-known, there are often model discrepancies corresponding to nonlinear friction, wind resistance, etc. Discovering models for these discrepancies remains an open challenge for many complex systems. In this work, we use the sparse identification of nonlinear dynamics (SINDy) algorithm to discover a model for the discrepancy between a simplified model and measurement data. In particular, we assume that the model mismatch can be sparsely represented in a library of candidate model terms. We demonstrate the efficacy of our approach on several examples including experimental data from a double pendulum on a cart. We further design and implement a feed-forward controller in simulations, showing improvement with a discrepancy model.
Optimization of Power Transfer Efficiency and Energy Efficiency for Wireless-Powered Systems with Massive MIMO
Venue: arXiv cs.IT 2019
Year: 2019

Massive MIMO is attractive for wireless information and energy transfer due to its ability to focus energy towards desired spatial locations. In this paper, the overall power transfer efficiency (PTE) and the energy efficiency (EE) of a wireless-powered massive MIMO system is investigated where a multi-antenna base-station (BS) uses wireless energy transfer to charge single-antenna energy harvesting users on the downlink. The users may exploit the harvested energy to transmit information to the BS on the uplink. The overall system performance is analyzed while accounting for the nonlinear nature of practical energy harvesters. First, for wireless energy transfer, the PTE is characterized using a scalable model for the BS circuit power consumption. The PTE-optimal number of BS antennas and users are derived. Then, for wireless energy and information transfer, the EE performance is characterized. The EE-optimal BS transmit power is derived in terms of the key system parameters such as the number of BS antennas and the number of users. As the number of antennas becomes large, increasing the transmit power improves the energy efficiency for moderate to large number of antennas. Simulation results suggest that it is energy efficient to operate the system in the massive antenna regime.
Real-Time Cortical Simulation on Neuromorphic Hardware
Venue: arXiv cs.ET 2019
Year: 2019

Real-time simulation of a large-scale biologically representative spiking neural network is presented, through the use of a heterogeneous parallelisation scheme and SpiNNaker neuromorphic hardware. A published cortical microcircuit model is used as a benchmark test case, representing approx. 1 square mm of early sensory cortex, containing 77k neurons and 0.3 billion synapses. This is the first true real-time simulation of this model, with 10 s of biological simulation time executed in 10 s wall-clock time. This surpasses best published efforts on HPC neural simulators (3x slowdown) and GPUs running optimised SNN libraries (2x slowdown). Furthermore, the presented approach indicates that real-time processing can be maintained with increasing SNN size, breaking the communication barrier incurred by traditional computing machinery. Model results are compared to an established HPC simulator baseline to verify simulation correctness, comparing well across a range of statistical measures. Energy to solution, and energy per synaptic event are also reported, demonstrating that the relatively low-tech SpiNNaker processors achieve a 10x reduction in energy relative to modern HPC systems, and comparable energy consumption to modern GPUs. Finally, system robustness is demonstrated through multiple 12 h simulations of the cortical microcircuit, each simulating 12 h of biological time, and demonstrating the potential of neuromorphic hardware as a neuroscience research tool for studying complex spiking neural networks over extended time periods.
Cross-Lingual Contextual Word Embeddings Mapping With Multi-Sense Words In Mind
Venue: arXiv cs.CL 2019
Year: 2019

Recent work in cross-lingual contextual word embedding learning cannot handle multi-sense words well. In this work, we explore the characteristics of contextual word embeddings and show the link between contextual word embeddings and word senses. We propose two improving solutions by considering contextual multi-sense word embeddings as noise (removal) and by generating cluster level average anchor embeddings for contextual multi-sense word embeddings (replacement). Experiments show that our solutions can improve the supervised contextual word embeddings alignment for multi-sense words in a microscopic perspective without hurting the macroscopic performance on the bilingual lexicon induction task. For unsupervised alignment, our methods significantly improve the performance on the bilingual lexicon induction task for more than 10 points.
Sentiment-Aware Recommendation System for Healthcare using Social Media
Venue: arXiv cs.CL 2019
Year: 2019

Over the last decade, health communities (known as forums) have evolved into platforms where more and more users share their medical experiences, thereby seeking guidance and interacting with people of the community. The shared content, though informal and unstructured in nature, contains valuable medical and/or health-related information and can be leveraged to produce structured suggestions to the common people. In this paper, at first we propose a stacked deep learning model for sentiment analysis from the medical forum data. The stacked model comprises of Convolutional Neural Network (CNN) followed by a Long Short Term Memory (LSTM) and then by another CNN. For a blog classified with positive sentiment, we retrieve the top-n similar posts. Thereafter, we develop a probabilistic model for suggesting the suitable treatments or procedures for a particular disease or health condition. We believe that integration of medical sentiment and suggestion would be beneficial to the users for finding the relevant contents regarding medications and medical conditions, without having to manually stroll through a large amount of unstructured contents.
Balsam: Automated Scheduling and Execution of Dynamic, Data-Intensive HPC Workflows
Venue: arXiv cs.DC 2019
Year: 2019

We introduce the Balsam service to manage high-throughput task scheduling and execution on supercomputing systems. Balsam allows users to populate a task database with a variety of tasks ranging from simple independent tasks to dynamic multi-task workflows. With abstractions for the local resource scheduler and MPI environment, Balsam dynamically packages tasks into ensemble jobs and manages their scheduling lifecycle. The ensembles execute in a pilot "launcher" which (i) ensures concurrent, load-balanced execution of arbitrary serial and parallel programs with heterogeneous processor requirements, (ii) requires no modification of user applications, (iii) is tolerant of task-level faults and provides several options for error recovery, (iv) stores provenance data (e.g task history, error logs) in the database, (v) supports dynamic workflows, in which tasks are created or killed at runtime. Here, we present the design and Python implementation of the Balsam service and launcher. The efficacy of this system is illustrated using two case studies: hyperparameter optimization of deep neural networks, and high-throughput single-point quantum chemistry calculations. We find that the unique combination of flexible job-packing and automated scheduling with dynamic (pilot-managed) execution facilitates excellent resource utilization. The scripting overheads typically needed to manage resources and launch workflows on supercomputers are substantially reduced, accelerating workflow development and execution.
VideoDP: A Universal Platform for Video Analytics with Differential Privacy
Venue: arXiv cs.CR 2019
Year: 2019

Massive amounts of video data are ubiquitously generated in personal devices and dedicated video recording facilities. Analyzing such data would be extremely beneficial in real world (e.g., urban traffic analysis, pedestrian behavior analysis, video surveillance). However, videos contain considerable sensitive information, such as human faces, identities and activities. Most of the existing video sanitization techniques simply obfuscate the video by detecting and blurring the region of interests (e.g., faces, vehicle plates, locations and timestamps) without quantifying and bounding the privacy leakage in the sanitization. In this paper, to the best of our knowledge, we propose the first differentially private video analytics platform (VideoDP) which flexibly supports different video analyses with rigorous privacy guarantee. Different from traditional noise-injection based differentially private mechanisms, given the input video, VideoDP randomly generates a utility-driven private video in which adding or removing any sensitive visual element (e.g., human, object) does not significantly affect the output video. Then, different video analyses requested by untrusted video analysts can be flexibly performed over the utility-driven video while ensuring differential privacy. Finally, we conduct experiments on real videos, and the experimental results demonstrate that our VideoDP effectively functions video analytics with good utility.
Co-citations in context: disciplinary heterogeneity is relevant
Venue: arXiv cs.DL 2019
Year: 2019

Citation analysis of the scientific literature has been used to study and define disciplinary boundaries, to trace the dissemination of knowledge, and to estimate impact. Co-citation, the frequency with which pairs of publications are cited, provides insight into how documents relate to each other and across fields. Co-citation analysis has been used to characterize combinations of prior work as conventional or innovative and to derive features of highly cited publications. Given the organization of science into disciplines, a key question is the sensitivity of such analyses to frame of reference. Our study examines this question using semantically-themed citation networks. We observe that trends reported to be true across the scientific literature do not hold for focused citation networks, and we conclude that inferring novelty using co-citation analysis and random graph models benefits from disciplinary context.
Large-scale representation learning from visually grounded untranscribed speech
Venue: arXiv cs.CV 2019
Year: 2019

Systems that can associate images with their spoken audio captions are an important step towards visually grounded language learning. We describe a scalable method to automatically generate diverse audio for image captioning datasets. This supports pretraining deep networks for encoding both audio and images, which we do via a dual encoder that learns to align latent representations from both modalities. We show that a masked margin softmax loss for such models is superior to the standard triplet loss. We fine-tune these models on the Flickr8k Audio Captions Corpus and obtain state-of-the-art results---improving recall in the top 10 from 29.6% to 49.5%. We also obtain human ratings on retrieval outputs to better assess the impact of incidentally matching image-caption pairs that were not associated in the data, finding that automatic evaluation substantially underestimates the quality of the retrieved results.
DAOC: Stable Clustering of Large Networks
Venue: arXiv cs.SI 2019
Year: 2019

Clustering is a crucial component of many data mining systems involving the analysis and exploration of various data. Data diversity calls for clustering algorithms to be accurate while providing stable (i.e., deterministic and robust) results on arbitrary input networks. Moreover, modern systems often operate with large datasets, which implicitly constrains the complexity of the clustering algorithm. Existing clustering techniques are only partially stable, however, as they guarantee either determinism or robustness. To address this issue, we introduce DAOC, a Deterministic and Agglomerative Overlapping Clustering algorithm. DAOC leverages a new technique called Overlap Decomposition to identify fine-grained clusters in a deterministic way capturing multiple optima. In addition, it leverages a novel consensus approach, Mutual Maximal Gain, to ensure robustness and further improve the stability of the results while still being capable of identifying micro-scale clusters. Our empirical results on both synthetic and real-world networks show that DAOC yields stable clusters while being on average 25% more accurate than state-of-the-art deterministic algorithms without requiring any tuning. Our approach has the ambition to greatly simplify and speed up data analysis tasks involving iterative processing (need for determinism) as well as data fluctuations (need for robustness) and to provide accurate and reproducible results.
Proof Pearl: Magic Wand as Frame
Venue: arXiv cs.PL 2019
Year: 2019

Separation logic adds two connectives to assertion languages: separating conjunction * ("star") and its adjoint, separating implication -* ("magic wand"). Comparatively, separating implication is less widely used. This paper demonstrates that by using magic wand to express frames that relate mutable local portions of data structures to global portions, we can exploit its power while proofs are still easily understandable. Many useful separation logic theorems about partial data structures can now be proved by simple automated tactics, which were usually proved by induction. This magic-wand-as-frame technique is especially useful when formalizing the proofs by a high order logic. We verify binary search tree insert in Coq as an example to demonstrate this proof technique.
Made for Each Other: Broad-coverage Semantic Structures Meet Preposition Supersenses
Venue: arXiv cs.CL 2019
Year: 2019

Universal Conceptual Cognitive Annotation (UCCA; Abend and Rappoport, 2013) is a typologically-informed, broad-coverage semantic annotation scheme that describes coarse-grained predicate-argument structure but currently lacks semantic roles. We argue that lexicon-free annotation of the semantic roles marked by prepositions, as formulated by Schneider et al. (2018b), is complementary and suitable for integration within UCCA. We show empirically for English that the schemes, though annotated independently, are compatible and can be combined in a single semantic graph. A comparison of several approaches to parsing the integrated representation lays the groundwork for future research on this task.
Towards humane digitization: a wellbeing-driven process of personas creation
Venue: arXiv cs.HC 2019
Year: 2019

Digital transformation is a process of digitizing the working and living environment in which people are at the center of digitization. In this paper, we present a personas-based guideline for system developers on how the humanization of digital transformation integrates into the design process. The proposed guideline uses the positive personas from the beginning as a basis for the transformation of the working environment into the digital form. We used the literature research as a preliminary study for the process of wellbeing-driven digital transformation design, consisting of questions for structuring the required information in the positive personas as well as a potential method that could be integrated into the wellbeing-based design process.