OpenRaiser/Intern-Atlas huggingface dataset:
Programming with Neural Surrogates of Programs
Venue: arXiv cs.PL 2021
Year: 2021

Surrogates, models that mimic the behavior of programs, form the basis of a variety of development workflows. We study three surrogate-based design patterns, evaluating each in case studies on a large-scale CPU simulator. With surrogate compilation, programmers develop a surrogate that mimics the behavior of a program to deploy to end-users in place of the original program. Surrogate compilation accelerates the CPU simulator under study by $1.6\times$. With surrogate adaptation, programmers develop a surrogate of a program then retrain that surrogate on a different task. Surrogate adaptation decreases the simulator's error by up to $50\%$. With surrogate optimization, programmers develop a surrogate of a program, optimize input parameters of the surrogate, then plug the optimized input parameters back into the original program. Surrogate optimization finds simulation parameters that decrease the simulator's error by $5\%$ compared to the error induced by expert-set parameters. In this paper we formalize this taxonomy of surrogate-based design patterns. We further describe the programming methodology common to all three design patterns. Our work builds a foundation for the emerging class of workflows based on programming with surrogates of programs.
Deep network for rolling shutter rectification
Venue: arXiv cs.CV 2021
Year: 2021

CMOS sensors employ row-wise acquisition mechanism while imaging a scene, which can result in undesired motion artifacts known as rolling shutter (RS) distortions in the captured image. Existing single image RS rectification methods attempt to account for these distortions by either using algorithms tailored for specific class of scenes which warrants information of intrinsic camera parameters or a learning-based framework with known ground truth motion parameters. In this paper, we propose an end-to-end deep neural network for the challenging task of single image RS rectification. Our network consists of a motion block, a trajectory module, a row block, an RS rectification module and an RS regeneration module (which is used only during training). The motion block predicts camera pose for every row of the input RS distorted image while the trajectory module fits estimated motion parameters to a third-order polynomial. The row block predicts the camera motion that must be associated with every pixel in the target i.e, RS rectified image. Finally, the RS rectification module uses motion trajectory and the output of row block to warp the input RS image to arrive at a distortionfree image. For faster convergence during training, we additionally use an RS regeneration module which compares the input RS image with the ground truth image distorted by estimated motion parameters. The end-to-end formulation in our model does not constrain the estimated motion to ground-truth motion parameters, thereby successfully rectifying the RS images with complex real-life camera motion. Experiments on synthetic and real datasets reveal that our network outperforms prior art both qualitatively and quantitatively.
Multivariate Goppa codes
Venue: arXiv cs.IT 2021
Year: 2021

In this paper, we introduce multivariate Goppa codes, which contain as a special case the well-known, classical Goppa codes. We provide a parity check matrix for a multivariate Goppa code in terms of a tensor product of generalized Reed-Solomon codes. We prove that multivariate Goppa codes are subfield subcodes of augmented Cartesian codes. By showing how this new family of codes relates to tensor products of generalized Reed-Solomon codes and augmented codes, we obtain information about the parameters, subcodes, duals, and hulls of multivariate Goppa codes. We see that in certain cases, the hulls of multivariate Goppa codes (resp., tensor product of generalized Reed-Solomon codes), are also multivariate Goppa codes (resp. tensor product of generalized Reed-Solomon codes). We utilize the multivariate Goppa codes to obtain entanglement-assisted quantum error-correcting codes and to build families of long LCD, self-dual, or self-orthogonal codes.
ValueNet: A New Dataset for Human Value Driven Dialogue System
Venue: arXiv cs.CL 2021
Year: 2021

Building a socially intelligent agent involves many challenges, one of which is to teach the agent to speak guided by its value like a human. However, value-driven chatbots are still understudied in the area of dialogue systems. Most existing datasets focus on commonsense reasoning or social norm modeling. In this work, we present a new large-scale human value dataset called ValueNet, which contains human attitudes on 21,374 text scenarios. The dataset is organized in ten dimensions that conform to the basic human value theory in intercultural research. We further develop a Transformer-based value regression model on ValueNet to learn the utility distribution. Comprehensive empirical results show that the learned value model could benefit a wide range of dialogue tasks. For example, by teaching a generative agent with reinforcement learning and the rewards from the value model, our method attains state-of-the-art performance on the personalized dialog generation dataset: Persona-Chat. With values as additional features, existing emotion recognition models enable capturing rich human emotions in the context, which further improves the empathetic response generation performance in the EmpatheticDialogues dataset. To the best of our knowledge, ValueNet is the first large-scale text dataset for human value modeling, and we are the first one trying to incorporate a value model into emotionally intelligent dialogue systems. The dataset is available at https://liang-qiu.github.io/ValueNet/.
WOOD: Wasserstein-based Out-of-Distribution Detection
Venue: arXiv cs.LG 2021
Year: 2021

The training and test data for deep-neural-network-based classifiers are usually assumed to be sampled from the same distribution. When part of the test samples are drawn from a distribution that is sufficiently far away from that of the training samples (a.k.a. out-of-distribution (OOD) samples), the trained neural network has a tendency to make high confidence predictions for these OOD samples. Detection of the OOD samples is critical when training a neural network used for image classification, object detection, etc. It can enhance the classifier's robustness to irrelevant inputs, and improve the system resilience and security under different forms of attacks. Detection of OOD samples has three main challenges: (i) the proposed OOD detection method should be compatible with various architectures of classifiers (e.g., DenseNet, ResNet), without significantly increasing the model complexity and requirements on computational resources; (ii) the OOD samples may come from multiple distributions, whose class labels are commonly unavailable; (iii) a score function needs to be defined to effectively separate OOD samples from in-distribution (InD) samples. To overcome these challenges, we propose a Wasserstein-based out-of-distribution detection (WOOD) method. The basic idea is to define a Wasserstein-distance-based score that evaluates the dissimilarity between a test sample and the distribution of InD samples. An optimization problem is then formulated and solved based on the proposed score function. The statistical learning bound of the proposed method is investigated to guarantee that the loss value achieved by the empirical optimizer approximates the global optimum. The comparison study results demonstrate that the proposed WOOD consistently outperforms other existing OOD detection methods.
CSI Feedback with Model-Driven Deep Learning of Massive MIMO Systems
Venue: arXiv cs.IT 2021
Year: 2021

In order to achieve reliable communication with a high data rate of massive multiple-input multiple-output (MIMO) systems in frequency division duplex (FDD) mode, the estimated channel state information (CSI) at the receiver needs to be fed back to the transmitter. However, the feedback overhead becomes exorbitant with the increasing number of antennas. In this paper, a two stages low rank (TSLR) CSI feedback scheme for millimeter wave (mmWave) massive MIMO systems is proposed to reduce the feedback overhead based on model-driven deep learning. Besides, we design a deep iterative neural network, named FISTA-Net, by unfolding the fast iterative shrinkage thresholding algorithm (FISTA) to achieve more efficient CSI feedback. Moreover, a shrinkage thresholding network (ST-Net) is designed in FISTA-Net based on the attention mechanism, which can choose the threshold adaptively. Simulation results show that the proposed TSLR CSI feedback scheme and FISTA-Net outperform the existing algorithms in various scenarios.
A Survey of Toxic Comment Classification Methods
Venue: arXiv cs.CL 2021
Year: 2021

While in real life everyone behaves themselves at least to some extent, it is much more difficult to expect people to behave themselves on the internet, because there are few checks or consequences for posting something toxic to others. Yet, for people on the other side, toxic texts often lead to serious psychological consequences. Detecting such toxic texts is challenging. In this paper, we attempt to build a toxicity detector using machine learning methods including CNN, Naive Bayes model, as well as LSTM. While there has been numerous groundwork laid by others, we aim to build models that provide higher accuracy than the predecessors. We produced very high accuracy models using LSTM and CNN, and compared them to the go-to solutions in language processing, the Naive Bayes model. A word embedding approach is also applied to empower the accuracy of our models.
Automated Evidence Collection for Fake News Detection
Venue: arXiv cs.CL 2021
Year: 2021

Fake news, misinformation, and unverifiable facts on social media platforms propagate disharmony and affect society, especially when dealing with an epidemic like COVID-19. The task of Fake News Detection aims to tackle the effects of such misinformation by classifying news items as fake or real. In this paper, we propose a novel approach that improves over the current automatic fake news detection approaches by automatically gathering evidence for each claim. Our approach extracts supporting evidence from the web articles and then selects appropriate text to be treated as evidence sets. We use a pre-trained summarizer on these evidence sets and then use the extracted summary as supporting evidence to aid the classification task. Our experiments, using both machine learning and deep learning-based methods, help perform an extensive evaluation of our approach. The results show that our approach outperforms the state-of-the-art methods in fake news detection to achieve an F1-score of 99.25 over the dataset provided for the CONSTRAINT-2021 Shared Task. We also release the augmented dataset, our code and models for any further research.
Anatomizing Bias in Facial Analysis
Venue: arXiv cs.CV 2021
Year: 2021

Existing facial analysis systems have been shown to yield biased results against certain demographic subgroups. Due to its impact on society, it has become imperative to ensure that these systems do not discriminate based on gender, identity, or skin tone of individuals. This has led to research in the identification and mitigation of bias in AI systems. In this paper, we encapsulate bias detection/estimation and mitigation algorithms for facial analysis. Our main contributions include a systematic review of algorithms proposed for understanding bias, along with a taxonomy and extensive overview of existing bias mitigation algorithms. We also discuss open challenges in the field of biased facial analysis.
Efficient spatio-temporal weather forecasting using U-Net
Venue: arXiv cs.LG 2021
Year: 2021

Weather forecast plays an essential role in multiple aspects of the daily life of human beings. Currently, physics based numerical weather prediction is used to predict the weather and requires enormous amount of computational resources. In recent years, deep learning based models have seen wide success in many weather-prediction related tasks. In this paper we describe our experiments for the Weather4cast 2021 Challenge, where 8 hours of spatio-temporal weather data is predicted based on an initial one hour of spatio-temporal data. We focus on SmaAt-UNet, an efficient U-Net based autoencoder. With this model we achieve competent results whilst maintaining low computational resources. Furthermore, several approaches and possible future work is discussed at the end of the paper.
ViQUF: de novo Viral Quasispecies reconstruction using Unitig-based Flow networks
Venue: arXiv cs.DS 2021
Year: 2021

During viral infection, intrahost mutation and recombination can lead to significant evolution, resulting in a population of viruses that harbor multiple haplotypes. The task of reconstructing these haplotypes from short-read sequencing data is called viral quasispecies assembly, and it can be categorized as a multiassembly problem. We consider the de novo version of the problem, where no reference is available. We present ViQUF, a de novo viral quasispecies assembler that addresses haplotype assembly and quantification. ViQUF obtains a first draft of the assembly graph from a de Bruijn graph. Then, solving a min-cost flow over a flow network built for each pair of adjacent vertices based on their paired-end information creates an approximate paired assembly graph with suggested frequency values as edge labels, which is the first frequency estimation. Then, original haplotypes are obtained through a greedy path reconstruction guided by a min-cost flow solution in the approximate paired assembly graph. ViQUF outputs the contigs with their frequency estimations. Results on real and simulated data show that ViQUF is at least four times faster using at most half of the memory than previous methods, while maintaining, and in some cases outperforming, the high quality of assembly and frequency estimation of overlap graph-based methodologies, which are known to be more accurate but slower than the de Bruijn graph-based approaches.
Detecting Emotion Carriers by Combining Acoustic and Lexical Representations
Venue: arXiv cs.CL 2021
Year: 2021

Personal narratives (PN) - spoken or written - are recollections of facts, people, events, and thoughts from one's own experience. Emotion recognition and sentiment analysis tasks are usually defined at the utterance or document level. However, in this work, we focus on Emotion Carriers (EC) defined as the segments (speech or text) that best explain the emotional state of the narrator ("loss of father", "made me choose"). Once extracted, such EC can provide a richer representation of the user state to improve natural language understanding and dialogue modeling. In previous work, it has been shown that EC can be identified using lexical features. However, spoken narratives should provide a richer description of the context and the users' emotional state. In this paper, we leverage word-based acoustic and textual embeddings as well as early and late fusion techniques for the detection of ECs in spoken narratives. For the acoustic word-level representations, we use Residual Neural Networks (ResNet) pretrained on separate speech emotion corpora and fine-tuned to detect EC. Experiments with different fusion and system combination strategies show that late fusion leads to significant improvements for this task.
N-SfC: Robust and Fast Shape Estimation from Caustic Images
Venue: arXiv cs.CV 2021
Year: 2021

This paper deals with the highly challenging problem of reconstructing the shape of a refracting object from a single image of its resulting caustic. Due to the ubiquity of transparent refracting objects in everyday life, reconstruction of their shape entails a multitude of practical applications. The recent Shape from Caustics (SfC) method casts the problem as the inverse of a light propagation simulation for synthesis of the caustic image, that can be solved by a differentiable renderer. However, the inherent complexity of light transport through refracting surfaces currently limits the practicability with respect to reconstruction speed and robustness. To address these issues, we introduce Neural-Shape from Caustics (N-SfC), a learning-based extension that incorporates two components into the reconstruction pipeline: a denoising module, which alleviates the computational cost of the light transport simulation, and an optimization process based on learned gradient descent, which enables better convergence using fewer iterations. Extensive experiments demonstrate the effectiveness of our neural extensions in the scenario of quality control in 3D glass printing, where we significantly outperform the current state-of-the-art in terms of computational speed and final surface error.
Post-Quantum Era in V2X Security: Convergence of Orchestration and Parallel Computation
Venue: arXiv cs.NI 2021
Year: 2021

Along with the potential emergence of quantum computing, safety and security of new and complex communication services such as automated driving need to be redefined in the post-quantum era. To ensure reliable, continuous and secure operation of these scenarios, quantum resistant security algorithms (QRSAs) that enable secure connectivity must be integrated into the network management and orchestration systems of mobile networks. This paper explores a roadmap study of post-quantum era convergence with cellular connectivity using the Service & Computation Orchestrator (SCO) framework for enhanced data security in radio access and backhaul transmission with a particular focus on Vehicle-to-Everything (V2X) services. Using NTRU as a QSRA, we have shown that the parallelization performance of Toom-Cook and Karatsuba computation methods can vary based on different CPU load conditions through extensive simulations and that the SCO framework can facilitate the selection of the most efficient computation for a given QRSA. Finally, we discuss the evaluation results, identify the current standardization efforts, and possible directions for the coexistence of post-quantum and mobile network connectivity through a SCO framework that leverages parallel computing.
A Data- and Task- Oriented Design Framework for Bivariate Communication of Uncertainty
Venue: arXiv cs.HC 2021
Year: 2021

The communication of uncertainty estimates, predictions and insights based on spatio-temporal models is important for decision-making as it impacts the utilisation and interpretation of information. Bivariate mapping is commonly used for communication of estimates and associated uncertainty; however, it is known that different visual qualities resulting from choics of symbols and consequent interaction between the display dimensions can lead to different interpretations and consequently affect resultant decisions. Characteristics of the data to be presented, such as spatial format, statistical level and continuousness, shape the range of available bivairate symbols. The subsequent utility of these bivariate symbols depends on their ability to achieve end-user's goals. In this paper we present a novel design framework, which, through consideration of both input data characteristics and potential operational tasks (as proxy to end-user goals), assists map designers in appropriate selection of bivariate symbols for the coincident presentation of spatio-temporal modelled data and associated uncertainty. The framework is showcased through application to a case study pertaining to sediment pollution in the Great Barrier Reef.
Teaching a Robot to Walk Using Reinforcement Learning
Venue: arXiv cs.LG 2021
Year: 2021

Classical control techniques such as PID and LQR have been used effectively in maintaining a system state, but these techniques become more difficult to implement when the model dynamics increase in complexity and sensitivity. For adaptive robotic locomotion tasks with several degrees of freedom, this task becomes infeasible with classical control techniques. Instead, reinforcement learning can train optimal walking policies with ease. We apply deep Q-learning and augmented random search (ARS) to teach a simulated two-dimensional bipedal robot how to walk using the OpenAI Gym BipedalWalker-v3 environment. Deep Q-learning did not yield a high reward policy, often prematurely converging to suboptimal local maxima likely due to the coarsely discretized action space. ARS, however, resulted in a better trained robot, and produced an optimal policy which officially "solves" the BipedalWalker-v3 problem. Various naive policies, including a random policy, a manually encoded inch forward policy, and a stay still policy, were used as benchmarks to evaluate the proficiency of the learning algorithm results.
Framework para Caracterizar Fake News en Terminos de Emociones
Venue: arXiv cs.CL 2021
Year: 2021

Social networks have become one of the main information channels for human beings due to the immediate and social interactivity they offer, allowing in some cases to publish what each user considers relevant. This has brought with it the generation of false news or Fake News, publications that only seek to generate uncertainty, misinformation or skew the opinion of readers. It has been shown that the human being is not capable of fully identifying whether an article is really a fact or a Fake News, due to this it is that models arise that seek to characterize and identify articles based on data mining and machine learning. This article proposes a three-layer framework, the main objective of which is to characterize the emotions present in Fake News and to be a tool for future work that identifies the emotional state and intentional state of the public.
Placement and Allocation of Communications Resources in Slicing-aware Flying Networks
Venue: arXiv cs.NI 2021
Year: 2021

Network slicing emerged in 5G networks as a key component to enable the use of multiple services with different performance requirements on top of a shared physical network infrastructure. A major challenge lies on ensuring wireless coverage and enough communications resources to meet the target Quality of Service (QoS) levels demanded by these services, including throughput and delay guarantees. The challenge is exacerbated in temporary events, such as disaster management scenarios and outdoor festivities, where the existing wireless infrastructures may collapse, fail to provide sufficient wireless coverage, or lack the required communications resources. Flying networks, composed of Unmanned Aerial Vehicles (UAVs), emerged as a solution to provide on-demand wireless coverage and communications resources anywhere, anytime. However, existing solutions mostly rely on best-effort networks. The main contribution of this paper is SLICER, an algorithm enabling the placement and allocation of communications resources in slicing-aware flying networks. The evaluation carried out by means of ns-3 simulations shows SLICER can meet the targeted QoS levels, while using the minimum amount of communications resources.