OpenRaiser/Intern-Atlas huggingface dataset:
On the Right Path: A Modal Logic for Supervised Learning
Venue: arXiv cs.LO 2019
Year: 2019

Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. Although empirical evidence suggests that children can learn a language without responding to the correction of linguistic mistakes, the importance of Teacher in many other paradigms is significant. Instead of focusing only on learner(s), this work develops a general framework---the supervised learning game (SLG)---to investigate the interaction between Teacher and Learner. In particular, our proposal highlights several interesting features of the agents: on the one hand,Learner may make mistakes in the learning process, and she may also ignore the potential relation between different hypotheses; on the other hand, Teacher is able to correct Learner's mistakes, eliminate potential mistakes and point out the facts ignored by Learner. To reason about strategies in this game, we develop a modal logic of supervised learning (SLL). Broadly, this work takes a small step towards studying the interaction between graph games, logics and formal learning theory.
Feature Pyramid Encoding Network for Real-time Semantic Segmentation
Venue: arXiv cs.CV 2019
Year: 2019

Although current deep learning methods have achieved impressive results for semantic segmentation, they incur high computational costs and have a huge number of parameters. For real-time applications, inference speed and memory usage are two important factors. To address the challenge, we propose a lightweight feature pyramid encoding network (FPENet) to make a good trade-off between accuracy and speed. Specifically, we use a feature pyramid encoding block to encode multi-scale contextual features with depthwise dilated convolutions in all stages of the encoder. A mutual embedding upsample module is introduced in the decoder to aggregate the high-level semantic features and low-level spatial details efficiently. The proposed network outperforms existing real-time methods with fewer parameters and improved inference speed on the Cityscapes and CamVid benchmark datasets. Specifically, FPENet achieves 68.0\% mean IoU on the Cityscapes test set with only 0.4M parameters and 102 FPS speed on an NVIDIA TITAN V GPU.
Deep Model Reference Adaptive Control
Venue: arXiv cs.LG 2019
Year: 2019

We present a new neuroadaptive architecture: Deep Neural Network based Model Reference Adaptive Control (DMRAC). Our architecture utilizes the power of deep neural network representations for modeling significant nonlinearities while marrying it with the boundedness guarantees that characterize MRAC based controllers. We demonstrate through simulations and analysis that DMRAC can subsume previously studied learning based MRAC methods, such as concurrent learning and GP-MRAC. This makes DMRAC a highly powerful architecture for high-performance control of nonlinear systems with long-term learning properties.
Simultaneous Segmentation and Recognition: Towards more accurate Ego Gesture Recognition
Venue: arXiv cs.CV 2019
Year: 2019

Ego hand gestures can be used as an interface in AR and VR environments. While the context of an image is important for tasks like scene understanding, object recognition, image caption generation and activity recognition, it plays a minimal role in ego hand gesture recognition. An ego hand gesture used for AR and VR environments conveys the same information regardless of the background. With this idea in mind, we present our work on ego hand gesture recognition that produces embeddings from RBG images with ego hands, which are simultaneously used for ego hand segmentation and ego gesture recognition. To this extent, we achieved better recognition accuracy (96.9%) compared to the state of the art (92.2%) on the biggest ego hand gesture dataset available publicly. We present a gesture recognition deep neural network which recognises ego hand gestures from videos (videos containing a single gesture) by generating and recognising embeddings of ego hands from image sequences of varying length. We introduce the concept of simultaneous segmentation and recognition applied to ego hand gestures, present the network architecture, the training procedure and the results compared to the state of the art on the EgoGesture dataset
Towards a Public Key Management Framework for Virtual Assets and Virtual Asset Service Providers
Venue: arXiv cs.CR 2019
Year: 2019

The recent FATF Recommendations defines virtual assets and virtual assets service providers (VASP), and requires under the Travel Rule that originating VASPs obtain and hold required and accurate originator information and required beneficiary information on virtual asset transfers. In this paper we discuss the notion of key ownership evidence as a core part of originator and beneficiary information required by the FATF Recommendation. We discuss approaches to securely communicate the originator and beneficiary information between VASPs, and review existing standards for public key certificates as applied to VASPs and virtual asset transfers. We propose the notion of a trust network of VASPs in which originator and beneficiary information, including key ownership information, can be exchanged securely while observing individual privacy requirements.
Dynamic Bandwidth Allocation in Small-Cell Networks: An Economics Approach
Venue: arXiv cs.NI 2019
Year: 2019

We propose and experimentally demonstrate a bandwidth allocation method based on the comparative advantage of spectral efficiency among users in a multi-tone small-cell radio access system with frequency-selective fading channels. The method allocates frequency resources by ranking the comparative advantage of the spectrum measured at the receivers ends. It improves the overall spectral efficiency of the access system with low implementation complexity and independently of power loading. In a two-user wireless transmission experiment, we observe up to 23.1% average capacity improvement by using the proposed method.
Mi-Cho-Coq, a framework for certifying Tezos Smart Contracts
Venue: arXiv cs.PL 2019
Year: 2019

Tezos is a blockchain launched in June 2018. It is written in OCaml and supports smart contracts. Its smart contract language is called Michelson and it has been designed with formal verification in mind. In this article, we present Mi-Cho-Coq, a Coq framework for verifying the functional correctness of Michelson smart contracts. As a case study, we detail the certification of a Multisig contract with the Mi-Cho-Coq framework.
Alleviating Sequence Information Loss with Data Overlapping and Prime Batch Sizes
Venue: arXiv cs.CL 2019
Year: 2019

In sequence modeling tasks the token order matters, but this information can be partially lost due to the discretization of the sequence into data points. In this paper, we study the imbalance between the way certain token pairs are included in data points and others are not. We denote this a token order imbalance (TOI) and we link the partial sequence information loss to a diminished performance of the system as a whole, both in text and speech processing tasks. We then provide a mechanism to leverage the full token order information -Alleviated TOI- by iteratively overlapping the token composition of data points. For recurrent networks, we use prime numbers for the batch size to avoid redundancies when building batches from overlapped data points. The proposed method achieved state of the art performance in both text and speech related tasks.
Comments on "On Favorable Propagation in Massive MIMO Systems and Different Antenna Configurations" [1]
Venue: arXiv cs.IT 2019
Year: 2019

It is shown that the condition of Theorem 1 in [1] never holds in practice and that Theorem 2 is incorrect under the stated condition. Extra assumptions or/and modifications are needed to make the conclusions of Theorem 1 and 2 above valid, which are provided below.
Low-Resource Parsing with Crosslingual Contextualized Representations
Venue: arXiv cs.CL 2019
Year: 2019

Despite advances in dependency parsing, languages with small treebanks still present challenges. We assess recent approaches to multilingual contextual word representations (CWRs), and compare them for crosslingual transfer from a language with a large treebank to a language with a small or nonexistent treebank, by sharing parameters between languages in the parser itself. We experiment with a diverse selection of languages in both simulated and truly low-resource scenarios, and show that multilingual CWRs greatly facilitate low-resource dependency parsing even without crosslingual supervision such as dictionaries or parallel text. Furthermore, we examine the non-contextual part of the learned language models (which we call a "decontextual probe") to demonstrate that polyglot language models better encode crosslingual lexical correspondence compared to aligned monolingual language models. This analysis provides further evidence that polyglot training is an effective approach to crosslingual transfer.
A High-Fidelity Open Embodied Avatar with Lip Syncing and Expression Capabilities
Venue: arXiv cs.HC 2019
Year: 2019

Embodied avatars as virtual agents have many applications and provide benefits over disembodied agents, allowing non-verbal social and interactional cues to be leveraged, in a similar manner to how humans interact with each other. We present an open embodied avatar built upon the Unreal Engine that can be controlled via a simple python programming interface. The avatar has lip syncing (phoneme control), head gesture and facial expression (using either facial action units or cardinal emotion categories) capabilities. We release code and models to illustrate how the avatar can be controlled like a puppet or used to create a simple conversational agent using public application programming interfaces (APIs). GITHUB link: https://github.com/danmcduff/AvatarSim
Finding Locomanipulation Plans Quickly in the Locomotion Constrained Manifold
Venue: arXiv cs.RO 2019
Year: 2019

We present a method that finds locomanipulation plans that perform simultaneous locomotion and manipulation of objects for a desired end-effector trajectory. Key to our approach is to consider a generic locomotion constraint manifold that defines the locomotion scheme of the robot and then using this constraint manifold to search for admissible manipulation trajectories. The problem is formulated as a weighted-A* graph search whose planner output is a sequence of contact transitions and a path progression trajectory to construct the whole-body kinodynamic locomanipulation plan. We also provide a method for computing, visualizing and learning the locomanipulability region, which is used to efficiently evaluate the edge transition feasibility during the graph search. Experiments are performed on the NASA Valkyrie robot platform that utilizes a dynamic locomotion approach, called the divergent-component-of-motion (DCM), on two example locomanipulation scenarios.
Flexible Disaster Response of Tomorrow -- Final Presentation and Evaluation of the CENTAURO System
Venue: arXiv cs.RO 2019
Year: 2019

Mobile manipulation robots have high potential to support rescue forces in disaster-response missions. Despite the difficulties imposed by real-world scenarios, robots are promising to perform mission tasks from a safe distance. In the CENTAURO project, we developed a disaster-response system which consists of the highly flexible Centauro robot and suitable control interfaces including an immersive tele-presence suit and support-operator controls on different levels of autonomy. In this article, we give an overview of the final CENTAURO system. In particular, we explain several high-level design decisions and how those were derived from requirements and extensive experience of Kerntechnische Hilfsdienst GmbH, Karlsruhe, Germany (KHG). We focus on components which were recently integrated and report about a systematic evaluation which demonstrated system capabilities and revealed valuable insights.
Understanding the Information needs of Social Scientists in Germany
Venue: arXiv cs.IR 2019
Year: 2019

The information needs of social science researchers are manifold and almost studied in every decade since the 1950s. With this paper, we contribute to this series and present the results of three studies. We asked 367 social science researchers in Germany for their information needs and identified needs in different categories: literature, research data, measurement instruments, support for data analysis, support for data collection, variables in research data, software support, networking/cooperation, and illustrative material. Thereby, the search for literature and research data is still the main information need with more than three-quarter of our participants expressing needs in these categories. With comprehensive lists of altogether 154 concrete information needs, even those that are only expressed by one participant, we contribute to the holistic understanding of the information needs of social science researchers of today.
When Two is Worse Than One
Venue: arXiv cs.DC 2019
Year: 2019

This note is concerned with the impact on job latency of splitting a token bucket into multiple sub-token buckets with equal aggregate parameters and offered the same job arrival process. The situation commonly arises in distributed computing environments where job arrivals are rate controlled (each job needs one token to enter the system), but capacity limitations call for distributing jobs across multiple compute resources with scalability considerations preventing the use of a centralized rate control component (each compute resource is responsible for monitoring and enforcing that the job stream it receives conforms to a certain traffic envelope). The question we address is to what extent splitting a token bucket into multiple sub-token buckets that individually rate control a subset of the original arrival process affects job latency, when jobs wait for a token whenever the token bucket is empty upon their arrival. Our contribution is to establish that independent of the job arrival process and how jobs are distributed across compute resources (and sub-token buckets), splitting a token bucket always increases the sum of job latencies in the token buckets, and consequently the average job latency.
Impact of novel aggregation methods for flexible, time-sensitive EHR prediction without variable selection or cleaning
Venue: arXiv cs.LG 2019
Year: 2019

Dynamic assessment of patient status (e.g. by an automated, continuously updated assessment of outcome) in the Intensive Care Unit (ICU) is of paramount importance for early alerting, decision support and resource allocation. Extraction and cleaning of expert-selected clinical variables discards information and protracts collaborative efforts to introduce machine learning in medicine. We present improved aggregation methods for a flexible deep learning architecture which learns a joint representation of patient chart, lab and output events. Our models outperform recent deep learning models for patient mortality classification using ICU timeseries, by embedding and aggregating all events with no pre-processing or variable selection. Our model achieves a strong performance of AUROC 0.87 at 48 hours on the MIMIC-III dataset while using 13,233 unique un-preprocessed variables in an interpretable manner via hourly softmax aggregation. This demonstrates how our method can be easily combined with existing electronic health record systems for automated, dynamic patient risk analysis.
Road Damage Detection Acquisition System based on Deep Neural Networks for Physical Asset Management
Venue: arXiv cs.CV 2019
Year: 2019

Research on damage detection of road surfaces has been an active area of re-search, but most studies have focused so far on the detection of the presence of damages. However, in real-world scenarios, road managers need to clearly understand the type of damage and its extent in order to take effective action in advance or to allocate the necessary resources. Moreover, currently there are few uniform and openly available road damage datasets, leading to a lack of a common benchmark for road damage detection. Such dataset could be used in a great variety of applications; herein, it is intended to serve as the acquisition component of a physical asset management tool which can aid governments agencies for planning purposes, or by infrastructure mainte-nance companies. In this paper, we make two contributions to address these issues. First, we present a large-scale road damage dataset, which includes a more balanced and representative set of damages. This dataset is composed of 18,034 road damage images captured with a smartphone, with 45,435 in-stances road surface damages. Second, we trained different types of object detection methods, both traditional (an LBP-cascaded classifier) and deep learning-based, specifically, MobileNet and RetinaNet, which are amenable for embedded and mobile and implementations with an acceptable perfor-mance for many applications. We compare the accuracy and inference time of all these models with others in the state of the art.
Real-time Recognition of Smartphone User Behavior Based on Prophet Algorithms
Venue: arXiv cs.HC 2019
Year: 2019

Although the traditional physical password, fingerprint unlocking and facial features have improved the security to a certain extent, they have the characteristics of passive authentication and easiness to be stolen. The existing behavioral data collected based on mobile phone sensors is mainly used for human activity recognition and fall detection and health management. Prophet is a procedure for forecasting time series data based on an additive model where non-linear trends are fit with yearly, weekly, and daily seasonality, plus holiday effects. It works best with time series that have strong seasonal effects and several seasons of historical data. Prophet is robust to missing data and shifts in the trend, and typically handles outliers well. Based on the time series behavior data of mobile terminal users, this paper uses Prophet algorithm to decompose the time series of six kinds of daily behavior and strip off the singular value, to get the inherent cycle and trend of each behavior, and to verify the legitimacy of the behavior user at the next moment. The experimental results on the UniMiB SHAR public dataset show that the user only needs to do 2 cycles of specified actions to realize the prediction of the next time series. The main contribution of this paper is that we propose a new idea for smartphone user authentication. It is based on real-time data of smartphone user behavior, through Phophet algorithm for feature decomposition and time series prediction, and to find the inherent cycle and other characteristics, so as to perform user behavior recognition. This data-driven auxiliary authentication method can effectively solve the problem of easy forgery of static feature recognition such as password, fingerprint and face recognition.
CogniVal: A Framework for Cognitive Word Embedding Evaluation
Venue: arXiv cs.CL 2019
Year: 2019

An interesting method of evaluating word representations is by how much they reflect the semantic representations in the human brain. However, most, if not all, previous works only focus on small datasets and a single modality. In this paper, we present the first multi-modal framework for evaluating English word representations based on cognitive lexical semantics. Six types of word embeddings are evaluated by fitting them to 15 datasets of eye-tracking, EEG and fMRI signals recorded during language processing. To achieve a global score over all evaluation hypotheses, we apply statistical significance testing accounting for the multiple comparisons problem. This framework is easily extensible and available to include other intrinsic and extrinsic evaluation methods. We find strong correlations in the results between cognitive datasets, across recording modalities and to their performance on extrinsic NLP tasks.
DIRE: A Neural Approach to Decompiled Identifier Naming
Venue: arXiv cs.SE 2019
Year: 2019

The decompiler is one of the most common tools for examining binaries without corresponding source code. It transforms binaries into high-level code, reversing the compilation process. Decompilers can reconstruct much of the information that is lost during the compilation process (e.g., structure and type information). Unfortunately, they do not reconstruct semantically meaningful variable names, which are known to increase code understandability. We propose the Decompiled Identifier Renaming Engine (DIRE), a novel probabilistic technique for variable name recovery that uses both lexical and structural information recovered by the decompiler. We also present a technique for generating corpora suitable for training and evaluating models of decompiled code renaming, which we use to create a corpus of 164,632 unique x86-64 binaries generated from C projects mined from GitHub. Our results show that on this corpus DIRE can predict variable names identical to the names in the original source code up to 74.3% of the time.
Argumentative Relation Classification as Plausibility Ranking
Venue: arXiv cs.CL 2019
Year: 2019

We formulate argumentative relation classification (support vs. attack) as a text-plausibility ranking task. To this aim, we propose a simple reconstruction trick which enables us to build minimal pairs of plausible and implausible texts by simulating natural contexts in which two argumentative units are likely or unlikely to appear. We show that this method is competitive with previous work albeit it is considerably simpler. In a recently introduced content-based version of the task, where contextual discourse clues are hidden, the approach offers a performance increase of more than 10% macro F1. With respect to the scarce attack-class, the method achieves a large increase in precision while the incurred loss in recall is small or even nonexistent.
Look, Read and Enrich. Learning from Scientific Figures and their Captions
Venue: arXiv cs.AI 2019
Year: 2019

Compared to natural images, understanding scientific figures is particularly hard for machines. However, there is a valuable source of information in scientific literature that until now has remained untapped: the correspondence between a figure and its caption. In this paper we investigate what can be learnt by looking at a large number of figures and reading their captions, and introduce a figure-caption correspondence learning task that makes use of our observations. Training visual and language networks without supervision other than pairs of unconstrained figures and captions is shown to successfully solve this task. We also show that transferring lexical and semantic knowledge from a knowledge graph significantly enriches the resulting features. Finally, we demonstrate the positive impact of such features in other tasks involving scientific text and figures, like multi-modal classification and machine comprehension for question answering, outperforming supervised baselines and ad-hoc approaches.
Self-Supervised Learning of Depth and Motion Under Photometric Inconsistency
Venue: arXiv cs.CV 2019
Year: 2019

The self-supervised learning of depth and pose from monocular sequences provides an attractive solution by using the photometric consistency of nearby frames as it depends much less on the ground-truth data. In this paper, we address the issue when previous assumptions of the self-supervised approaches are violated due to the dynamic nature of real-world scenes. Different from handling the noise as uncertainty, our key idea is to incorporate more robust geometric quantities and enforce internal consistency in the temporal image sequence. As demonstrated on commonly used benchmark datasets, the proposed method substantially improves the state-of-the-art methods on both depth and relative pose estimation for monocular image sequences, without adding inference overhead.