OpenRaiser/Intern-Atlas huggingface dataset:
Emotional Musical Prosody: Validated Vocal Dataset for Human Robot Interaction
Venue: arXiv cs.RO 2020
Year: 2020

Human collaboration with robotics is dependant on the development of a relationship between human and robot, without which performance and utilization can decrease. Emotion and personality conveyance has been shown to enhance robotic collaborations, with improved human-robot relationships and increased trust. One under-explored way for an artificial agent to convey emotions is through non-linguistic musical prosody. In this work we present a new 4.2 hour dataset of improvised emotional vocal phrases based on the Geneva Emotion Wheel. This dataset has been validated through extensive listening tests and shows promising preliminary results for use in generative systems.
Self-play for Data Efficient Language Acquisition
Venue: arXiv cs.CL 2020
Year: 2020

When communicating, people behave consistently across conversational roles: People understand the words they say and are able to produce the words they hear. To date, artificial agents developed for language tasks have lacked such symmetry, meaning agents trained to produce language are unable to understand it and vice-versa. In this work, we exploit the symmetric nature of communication in order to improve both the efficiency and quality of language acquisition in learning agents. Specifically, we consider the setting in which an agent must learn to both understand and generate words in an existing language, but with the assumption that access to interaction with "oracle" speakers of the language is very limited. We show that using self-play as a substitute for direct supervision enables the agent to transfer its knowledge across roles (e.g. training as a listener but testing as a speaker) and make better inferences about the ground truth lexicon using only a handful of interactions with the oracle.
Cue-word Driven Neural Response Generation with a Shrinking Vocabulary
Venue: arXiv cs.CL 2020
Year: 2020

Open-domain response generation is the task of generating sensible and informative re-sponses to the source sentence. However, neural models tend to generate safe and mean-ingless responses. While cue-word introducing approaches encourage responses with concrete semantics and have shown tremendous potential, they still fail to explore di-verse responses during decoding. In this paper, we propose a novel but natural approach that can produce multiple cue-words during decoding, and then uses the produced cue-words to drive decoding and shrinks the decoding vocabulary. Thus the neural genera-tion model can explore the full space of responses and discover informative ones with efficiency. Experimental results show that our approach significantly outperforms several strong baseline models with much lower decoding complexity. Especially, our approach can converge to concrete semantics more efficiently during decoding.
Smoothing Game
Venue: arXiv cs.GT 2020
Year: 2020

We want to introduce another smoothing approach by treating each geometric element as a player in a game: a quest for the best element quality. In other words, each player has the goal of becoming as regular as possible. The set of strategies for each element is given by all translations of its vertices. Ideally, he would like to quantify this regularity using a quality measure which corresponds to the utility function in game theory. Each player is aware of the other players' utility functions as well as their set of strategies, which is analogous to his own utility function and strategies. In the simplest case, the utility functions only depend on the regularity. In more complicated cases this utility function depends on the element size, the curvature, or even the solution to a differential equation. This article is a sketch of a possible game-theoretical approach to mesh smoothing and still on-going research.
Distilling a Deep Neural Network into a Takagi-Sugeno-Kang Fuzzy Inference System
Venue: arXiv cs.AI 2020
Year: 2020

Deep neural networks (DNNs) demonstrate great success in classification tasks. However, they act as black boxes and we don't know how they make decisions in a particular classification task. To this end, we propose to distill the knowledge from a DNN into a fuzzy inference system (FIS), which is Takagi-Sugeno-Kang (TSK)-type in this paper. The model has the capability to express the knowledge acquired by a DNN based on fuzzy rules, thus explaining a particular decision much easier. Knowledge distillation (KD) is applied to create a TSK-type FIS that generalizes better than one directly from the training data, which is guaranteed through experiments in this paper. To further improve the performances, we modify the baseline method of KD and obtain good results.
Zero-Shot Translation Quality Estimation with Explicit Cross-Lingual Patterns
Venue: arXiv cs.CL 2020
Year: 2020

This paper describes our submission of the WMT 2020 Shared Task on Sentence Level Direct Assessment, Quality Estimation (QE). In this study, we empirically reveal the \textit{mismatching issue} when directly adopting BERTScore to QE. Specifically, there exist lots of mismatching errors between the source sentence and translated candidate sentence with token pairwise similarity. In response to this issue, we propose to expose explicit cross-lingual patterns, \textit{e.g.} word alignments and generation score, to our proposed zero-shot models. Experiments show that our proposed QE model with explicit cross-lingual patterns could alleviate the mismatching issue, thereby improving the performance. Encouragingly, our zero-shot QE method could achieve comparable performance with supervised QE method, and even outperforms the supervised counterpart on 2 out of 6 directions. We expect our work could shed light on the zero-shot QE model improvement.
A Locally Conservative Mixed Finite Element Framework for Coupled Hydro-Mechanical-Chemical Processes in Heterogeneous Porous Media
Venue: arXiv cs.CE 2020
Year: 2020

This paper presents a mixed finite element framework for coupled hydro-mechanical-chemical processes in heterogeneous porous media. The framework combines two types of locally conservative discretization schemes: (1) an enriched Galerkin method for reactive flow, and (2) a three-field mixed finite element method for coupled fluid flow and solid deformation. This combination ensures local mass conservation, which is critical to flow and transport in heterogeneous porous media, with a relatively affordable computational cost. A particular class of the framework is constructed for calcite precipitation/dissolution reactions, incorporating their nonlinear effects on the fluid viscosity and solid deformation. Linearization schemes and algorithms for solving the nonlinear algebraic system are also presented. Through numerical examples of various complexity, we demonstrate that the proposed framework is a robust and efficient computational method for simulation of reactive flow and transport in deformable porous media, even when the material properties are strongly heterogeneous and anisotropic.
An Encoder-Decoder CNN for Hair Removal in Dermoscopic Images
Venue: arXiv cs.CV 2020
Year: 2020

The process of removing occluding hair has a relevant role in the early and accurate diagnosis of skin cancer. It consists of detecting hairs and restore the texture below them, which is sporadically occluded. In this work, we present a model based on convolutional neural networks for hair removal in dermoscopic images. During the network's training, we use a combined loss function to improve the restoration ability of the proposed model. In order to train the CNN and to quantitatively validate their performance, we simulate the presence of skin hair in hairless images extracted from publicly known datasets such as the PH2, dermquest, dermis, EDRA2002, and the ISIC Data Archive. As far as we know, there is no other hair removal method based on deep learning. Thus, we compare our results with six state-of-the-art algorithms based on traditional computer vision techniques by means of similarity measures that compare the reference hairless image and the one with hair simulated. Finally, a statistical test is used to compare the methods. Both qualitative and quantitative results demonstrate the effectiveness of our network.
Comparison of Short Blocklength Sphere Shaping and Nonlinearity Compensation in WDM Systems
Venue: arXiv cs.IT 2020
Year: 2020

In optical communication systems, short blocklength probabilistic enumerative sphere shaping (ESS) provides both linear shaping gain and nonlinear tolerance. In this work, we investigate the performance and complexity of ESS in comparison with fiber nonlinearity compensation via digital back propagation (DBP) with different steps per span. We evaluate the impact of the shaping blocklength in terms of nonlinear tolerance and also consider the case of ESS with a Volterra-based nonlinear equalizer (VNLE), which provides lower complexity than DBP. In single-channel transmission, ESS with VNLE achieves similar performance in terms of finite length bit-metric decoding rate to uniform signaling with one step per span DBP. In the context of a dense wavelength-division multiplexing (WDM) transmission system, we show that ESS outperforms uniform signaling with DBP for different step sizes.
Boosted EfficientNet: Detection of Lymph Node Metastases in Breast Cancer Using Convolutional Neural Network
Venue: arXiv cs.CV 2020
Year: 2020

In recent years, advances in the development of whole-slide images have laid a foundation for the utilization of digital images in pathology. With the assistance of computer images analysis that automatically identifies tissue or cell types, they have greatly improved the histopathologic interpretation and diagnosis accuracy. In this paper, the Convolutional Neutral Network (CNN) has been adapted to predict and classify lymph node metastasis in breast cancer. Unlike traditional image cropping methods that are only suitable for large resolution images, we propose a novel data augmentation method named Random Center Cropping (RCC) to facilitate small resolution images. RCC enriches the datasets while retaining the image resolution and the center area of images. In addition, we reduce the downsampling scale of the network to further facilitate small resolution images better. Moreover, Attention and Feature Fusion (FF) mechanisms are employed to improve the semantic information of images. Experiments demonstrate that our methods boost performances of basic CNN architectures. And the best-performed method achieves an accuracy of 97.96% and an AUC of 99.68% on RPCam datasets, respectively.
Understanding Cloud Workloads Performance in a Production like Environment
Venue: arXiv cs.DC 2020
Year: 2020

Understanding inter-VM interference is of paramount importance to provide a sound knowledge and understand where performance degradation comes from in the current public cloud. With this aim, this paper devises a workload taxonomy that classifies applications according to how the major system resources affect their performance (e.g., tail latency) as a function of the level of load (e.g., QPS). After that, we present three main studies addressing three major concerns to improve the cloud performance: impact of the level of load on performance, impact of hyper-threading on performance, and impact of limiting the major system resources (e.g., last level cache) on performance. In all these studies we identified important findings that we hope help cloud providers improve their system utilization.
LSMAT Least Squares Medial Axis Transform
Venue: arXiv cs.GR 2020
Year: 2020

The medial axis transform has applications in numerous fields including visualization, computer graphics, and computer vision. Unfortunately, traditional medial axis transformations are usually brittle in the presence of outliers, perturbations and/or noise along the boundary of objects. To overcome this limitation, we introduce a new formulation of the medial axis transform which is naturally robust in the presence of these artifacts. Unlike previous work which has approached the medial axis from a computational geometry angle, we consider it from a numerical optimization perspective. In this work, we follow the definition of the medial axis transform as "the set of maximally inscribed spheres". We show how this definition can be formulated as a least squares relaxation where the transform is obtained by minimizing a continuous optimization problem. The proposed approach is inherently parallelizable by performing independant optimization of each sphere using Gauss-Newton, and its least-squares form allows it to be significantly more robust compared to traditional computational geometry approaches. Extensive experiments on 2D and 3D objects demonstrate that our method provides superior results to the state of the art on both synthetic and real-data.
Semi-supervised Neural Networks solve an inverse problem for modeling Covid-19 spread
Venue: arXiv cs.LG 2020
Year: 2020

Studying the dynamics of COVID-19 is of paramount importance to understanding the efficiency of restrictive measures and develop strategies to defend against upcoming contagion waves. In this work, we study the spread of COVID-19 using a semi-supervised neural network and assuming a passive part of the population remains isolated from the virus dynamics. We start with an unsupervised neural network that learns solutions of differential equations for different modeling parameters and initial conditions. A supervised method then solves the inverse problem by estimating the optimal conditions that generate functions to fit the data for those infected by, recovered from, and deceased due to COVID-19. This semi-supervised approach incorporates real data to determine the evolution of the spread, the passive population, and the basic reproduction number for different countries.
Maximin Optimization for Binary Regression
Venue: arXiv cs.LG 2020
Year: 2020

We consider regression problems with binary weights. Such optimization problems are ubiquitous in quantized learning models and digital communication systems. A natural approach is to optimize the corresponding Lagrangian using variants of the gradient ascent-descent method. Such maximin techniques are still poorly understood even in the concave-convex case. The non-convex binary constraints may lead to spurious local minima. Interestingly, we prove that this approach is optimal in linear regression with low noise conditions as well as robust regression with a small number of outliers. Practically, the method also performs well in regression with cross entropy loss, as well as non-convex multi-layer neural networks. Taken together our approach highlights the potential of saddle-point optimization for learning constrained models.
Leveraging Spatial Information in Radiology Reports for Ischemic Stroke Phenotyping
Venue: arXiv cs.CL 2020
Year: 2020

Classifying fine-grained ischemic stroke phenotypes relies on identifying important clinical information. Radiology reports provide relevant information with context to determine such phenotype information. We focus on stroke phenotypes with location-specific information: brain region affected, laterality, stroke stage, and lacunarity. We use an existing fine-grained spatial information extraction system--Rad-SpatialNet--to identify clinically important information and apply simple domain rules on the extracted information to classify phenotypes. The performance of our proposed approach is promising (recall of 89.62% for classifying brain region and 74.11% for classifying brain region, side, and stroke stage together). Our work demonstrates that an information extraction system based on a fine-grained schema can be utilized to determine complex phenotypes with the inclusion of simple domain rules. These phenotypes have the potential to facilitate stroke research focusing on post-stroke outcome and treatment planning based on the stroke location.
Document-Level Definition Detection in Scholarly Documents: Existing Models, Error Analyses, and Future Directions
Venue: arXiv cs.CL 2020
Year: 2020

The task of definition detection is important for scholarly papers, because papers often make use of technical terminology that may be unfamiliar to readers. Despite prior work on definition detection, current approaches are far from being accurate enough to use in real-world applications. In this paper, we first perform in-depth error analysis of the current best performing definition detection system and discover major causes of errors. Based on this analysis, we develop a new definition detection system, HEDDEx, that utilizes syntactic features, transformer encoders, and heuristic filters, and evaluate it on a standard sentence-level benchmark. Because current benchmarks evaluate randomly sampled sentences, we propose an alternative evaluation that assesses every sentence within a document. This allows for evaluating recall in addition to precision. HEDDEx outperforms the leading system on both the sentence-level and the document-level tasks, by 12.7 F1 points and 14.4 F1 points, respectively. We note that performance on the high-recall document-level task is much lower than in the standard evaluation approach, due to the necessity of incorporation of document structure as features. We discuss remaining challenges in document-level definition detection, ideas for improvements, and potential issues for the development of reading aid applications.
Mining Truck Platooning Patterns Through Massive Trajectory Data
Venue: arXiv cs.LG 2020
Year: 2020

Truck platooning refers to a series of trucks driving in close proximity via communication technologies, and it is considered one of the most implementable systems of connected and automated vehicles, bringing huge energy savings and safety improvements. Properly planning platoons and evaluating the potential of truck platooning are crucial to trucking companies and transportation authorities. This study proposes a series of data mining approaches to learn spontaneous truck platooning patterns from massive trajectories. An enhanced map matching algorithm is developed to identify truck headings by using digital map data, followed by an adaptive spatial clustering algorithm to detect instantaneous co-moving truck sets. These sets are then aggregated to find the network-wide maximum platoon duration and size through frequent itemset mining for computational efficiency. We leverage real GPS data collected from truck fleeting systems in Liaoning Province, China, to evaluate platooning performance and successfully extract spatiotemporal platooning patterns. Results show that approximately 36% spontaneous truck platoons can be coordinated by speed adjustment without changing routes and schedules. The average platooning distance and duration ratios for these platooned trucks are 9.6% and 9.9%, respectively, leading to a 2.8% reduction in total fuel consumption. We also distinguish the optimal platooning periods and space headways for national freeways and trunk roads, and prioritize the road segments with high possibilities of truck platooning. The derived results are reproducible, providing useful policy implications and operational strategies for large-scale truck platoon planning and roadside infrastructure construction.
On the Road from Edge Computing to the Edge Mesh
Venue: arXiv cs.DC 2020
Year: 2020

Nowadays, we are witnessing the advent of the Internet of Things (EC) with numerous devices performing interactions between them or with end users. The huge number of devices leads to huge volumes of collected data that demand the appropriate processing. The 'legacy' approach is to rely on Cloud where increased computational resources can be adopted to realize any processing. However, even if the communication with the Cloud back end lasts for some seconds there are cases where problems in the network or the need for supporting real time applications require a reduced latency in the provision of responses/outcomes. Edge Computing (EC) comes into the scene as the 'solver' of the latency problem (and not only). Any processing can be performed close to data sources, i.e., at EC nodes having direct connection with IoT devices. Hence, an ecosystem of processing nodes can be present at the edge of the network giving the opportunity to apply novel services upon the collected data. Various challenges should be met before we talk about a fully automated ecosystem where EC nodes can cooperate or understand the status of them and the environment to be capable of efficiently serving end users or applications. In this paper, we perform a survey of the relevant research activities targeting to support the vision of Edge Mesh (EM), i.e., a 'cover' of intelligence upon the EC infrastructure. We present all the parts of the EC/EM framework starting from the necessary hardware and discussing research outcomes in every aspect of EC nodes functioning. We present technologies and theories adopted for data, tasks and resource management while discussing how (deep) machine learning and optimization techniques are adopted to solve various problems. Our aim is to provide a starting point for novel research to conclude efficient services/applications opening up the path to realize the future EC form.
Joint Transceiver and Large Intelligent Surface Design for Massive MIMO MmWave Systems
Venue: arXiv cs.IT 2020
Year: 2020

Large intelligent surface (LIS) has recently emerged as a potential low-cost solution to reshape the wireless propagation environment for improving the spectral efficiency. In this paper, we consider a downlink millimeter-wave (mmWave) multiple-input-multiple-output (MIMO) system, where an LIS is deployed to assist the downlink data transmission from a base station (BS) to a user equipment (UE). Both the BS and the UE are equipped with a large number of antennas, and a hybrid analog/digital precoding/combining structure is used to reduce the hardware cost and energy consumption. We aim to maximize the spectral efficiency by jointly optimizing the LIS's reflection coefficients and the hybrid precoder (combiner) at the BS (UE). To tackle this non-convex problem, we reformulate the complex optimization problem into a much more friendly optimization problem by exploiting the inherent structure of the effective (cascade) mmWave channel. A manifold optimization (MO)-based algorithm is then developed. Simulation results show that by carefully devising LIS's reflection coefficients, our proposed method can help realize a favorable propagation environment with a small channel matrix condition number. Besides, it can achieve a performance comparable to those of state-of-the-art algorithms, while at a much lower computational complexity.
Learning Adaptive Language Interfaces through Decomposition
Venue: arXiv cs.CL 2020
Year: 2020

Our goal is to create an interactive natural language interface that efficiently and reliably learns from users to complete tasks in simulated robotics settings. We introduce a neural semantic parsing system that learns new high-level abstractions through decomposition: users interactively teach the system by breaking down high-level utterances describing novel behavior into low-level steps that it can understand. Unfortunately, existing methods either rely on grammars which parse sentences with limited flexibility, or neural sequence-to-sequence models that do not learn efficiently or reliably from individual examples. Our approach bridges this gap, demonstrating the flexibility of modern neural systems, as well as the one-shot reliable generalization of grammar-based methods. Our crowdsourced interactive experiments suggest that over time, users complete complex tasks more efficiently while using our system by leveraging what they just taught. At the same time, getting users to trust the system enough to be incentivized to teach high-level utterances is still an ongoing challenge. We end with a discussion of some of the obstacles we need to overcome to fully realize the potential of the interactive paradigm.