Reviewerly/exHarmony huggingface dataset:
MinTL: Minimalist Transfer Learning for Task-Oriented Dialogue Systems

In this paper, we propose Minimalist Transfer Learning (MinTL) to simplify the system design process of task-oriented dialogue systems and alleviate the over-dependency on annotated data.MinTL is a simple yet effective transfer learning framework, which allows us to plug-and-play pre-trained seq2seq models, and jointly learn dialogue state tracking and dialogue response generation.Unlike previous approaches, which use a copy mechanism to "carryover" the old dialogue states to the new one, we introduce Levenshtein belief spans (Lev), that allows efficient dialogue state tracking with a minimal generation length.We instantiate our learning framework with two pretrained backbones: T5 (Raffel et al., 2019) and BART (Lewis et al., 2019), and evaluate them on MultiWOZ.Extensive experiments demonstrate that: 1) our systems establish new state-of-the-art results on end-to-end response generation, 2) MinTL-based systems are more robust than baseline methods in the low resource setting, and they achieve competitive results with only 20% training data, and 3) Lev greatly improves the inference efficiency 1 .
AlphaStar

In January 2019, DeepMind revealed AlphaStar to the world-the first artificial intelligence (AI) system to beat a professional player at the game of StarCraft II-representing a milestone in the progress of AI. AlphaStar draws on many areas of AI research, including deep learning, reinforcement learning, game theory, and evolutionary computation (EC). In this paper we analyze AlphaStar primarily through the lens of EC, presenting a new look at the system and relating it to many concepts in the field. We highlight some of its most interesting aspects-the use of Lamarckian evolution, competitive co-evolution, and quality diversity. In doing so, we hope to provide a bridge between the wider EC community and one of the most significant AI systems developed in recent times.
Non-Parallel Sequence-to-Sequence Voice Conversion With Disentangled Linguistic and Speaker Representations

This paper presents a method of sequence-to-sequence (seq2seq) voice conversion using non-parallel training data. In this method, disentangled linguistic and speaker representations are extracted from acoustic features, and voice conversion is achieved by preserving the linguistic representations of source utterances while replacing the speaker representations with the target ones. Our model is built under the framework of encoder-decoder neural networks. A recognition encoder is designed to learn the disentangled linguistic representations with two strategies. First, phoneme transcriptions of training data are introduced to provide the references for leaning linguistic representations of audio signals. Second, an adversarial training strategy is employed to further wipe out speaker information from the linguistic representations. Meanwhile, speaker representations are extracted from audio signals by a speaker encoder. The model parameters are estimated by two-stage training, including a pretraining stage using a multi-speaker dataset and a fine-tuning stage using the dataset of a specific conversion pair. Since both the recognition encoder and the decoder for recovering acoustic features are seq2seq neural networks, there are no constrains of frame alignment and frame-by-frame conversion in our proposed method. Experimental results showed that our method obtained higher similarity and naturalness than the best non-parallel voice conversion method in Voice Conversion Challenge 2018. Besides, the performance of our proposed method was closed to the state-of-the-art parallel seq2seq voice conversion method.
A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H$_4$ and the $\pi$-system of Hexatriene (C$_6$H$_8$).
A two-stage method for text line detection in historical documents

This work presents a two-stage text line detection method for historical documents. Each detected text line is represented by its baseline. In a first stage, a deep neural network called ARU-Net labels pixels to belong to one of the three classes: baseline, separator or other. The separator class marks beginning and end of each text line. The ARU-Net is trainable from scratch with manageably few manually annotated example images (less than 50). This is achieved by utilizing data augmentation strategies. The network predictions are used as input for the second stage which performs a bottom-up clustering to build baselines. The developed method is capable of handling complex layouts as well as curved and arbitrarily oriented text lines. It substantially outperforms current state-of-the-art approaches. For example, for the complex track of the cBAD: ICDAR2017 Competition on Baseline Detection the F-value is increased from 0.859 to 0.922. The framework to train and run the ARU-Net is open source.
Bridging Knowledge Graphs to Generate Scene Graphs

Scene graphs are powerful representations that parse images into their abstract semantic elements, i.e., objects and their interactions, which facilitates visual comprehension and explainable reasoning. On the other hand, commonsense knowledge graphs are rich repositories that encode how the world is structured, and how general concepts interact. In this paper, we present a unified formulation of these two constructs, where a scene graph is seen as an image-conditioned instantiation of a commonsense knowledge graph. Based on this new perspective, we re-formulate scene graph generation as the inference of a bridge between the scene and commonsense graphs, where each entity or predicate instance in the scene graph has to be linked to its corresponding entity or predicate class in the commonsense graph. To this end, we propose a novel graph-based neural network that iteratively propagates information between the two graphs, as well as within each of them, while gradually refining their bridge in each iteration. Our Graph Bridging Network, GB-Net, successively infers edges and nodes, allowing to simultaneously exploit and refine the rich, heterogeneous structure of the interconnected scene and commonsense graphs. Through extensive experimentation, we showcase the superior accuracy of GB-Net compared to the most recent methods, resulting in a new state of the art. We publicly release the source code of our method ( https://github.com/alirezazareian/gbnet ).
A conversion guide: solar irradiance and lux illuminance

The standard for measuring solar irradiance utilizes the units of watts per meter squared (W/m 2 ). Irradiance meters are both costly and limited in the ability to measure low irradiance values. With a lower cost and higher sensitivity in low light conditions, light meters measure luminous flux per unit area (illuminance) utilizing the units of lumens per meter squared or lux (lx). An effective conversion factor between W/m 2 and lx would enable the use of light meters to evaluate photovoltaic performance under low solar irradiance conditions. A survey of the literature found no definitive and readily available “rule of thumb” conversion standard between solar irradiance and illuminance. Easy-to-find Internet sources contain conflicting and widely varying values ranging from 688449 to 21000 lx for 1000 W/m 2 (1 Sun) of solar irradiance. Peer-reviewed literature contains Luminous Efficacy equivalent values ranging from 21 to 131 lx per W/m 2 . This manuscript explores the relationship and establishes a theoretical and laboratory measurement guide for the conversion between solar irradiance and illuminance. The conversion factor includes standards data, equipment calibration accuracy, and uncertainty estimates. Solar Irradiance of 1 Sun (1000 W/m 2 ) for an LED-based solar simulator is (116 ± 3) klx and (122 ± 1) klx for outdoor sunlight.
A Taxonomy of Attacks on Federated Learning

Federated learning is a privacy-by-design framework that enables training deep neural networks from decentralized sources of data, but it is fraught with innumerable attack surfaces. We provide a taxonomy of recent attacks on federated learning systems and detail the need for more robust threat modeling in federated learning environments.
Immersive virtual reality as a tool to learn problem-solving skills

Immersive virtual reality (IVR) technology has demonstrated positive educational outcomes related to its use and is gaining traction in educational and training settings; IVR is expected to have widespread adoption within the classroom in the upcoming years. However, the educational potential of IVR with children has not been thoroughly investigated, especially as a tool for problem-solving skills. Therefore, this study was designed to answer the following questions: (1) Is IVR a useful tool to learn and practice problem-solving skills? More specifically, do children using IVR solve a game better than those using a tablet application or a board game? (2) Does IVR provide a more engaging experience for children to practice problem-solving skills than on a tablet or a board game? (3) Do problem-solving skills learned with IVR technology transfer to real-life (physical game)? Children (n = 120) aged 7–9.9 years were randomly assigned to a problem-solving game in one of three conditions: board game, tablet, or IVR. The results showed that, overall, the percentage of children who completed the problem-solving game was higher in the IVR condition (77.5%), compared with those in the tablet (32.5%) or board game (30%) conditions. We also found that the interest and enjoyment scores of participants using IVR were significantly higher than participants in the other two conditions, and that the children in the IVR condition were able to learn how to solve the problem and transfer their learning to the physical game. IVR is a technology capable of engaging interest and motivating the user, as well as having the potential to assist in cognitive processing and knowledge transfer.
Efficient English text classification using selected Machine Learning Techniques

Text classification (TC) is an approach used for the classification of any kind of documents for the target category or out. In this paper, we implemented the Support Vector Machines (SVM) model in classifying English text and documents. Here we did two analytical experiments to check the selected classifiers using English documents. Experimental results performed on a set of 1033 text document present that the Rocchio classifier provides the best performance results when the size of the feature set is small while SVM outperforms the other classifiers. From the experimental analysis, we observed that the classification rate exceeds 90% when using more than 4000 features.
Hybrid deep neural model for hourly solar irradiance forecasting

Owing to integrating photovoltaic solar systems into power networks, accurate prediction of solar irradiance plays an increasingly significant role in electric energy planning and management. However, the existing hybrid models ignore the influence of other factors except for the irradiance time series and adopt a single branch independent network structure, which may lead to decrease prediction accuracy. In this paper, a novel multivariate hybrid deep neural model named WPD–CNN–LSTM-MLP for 1-h-ahead solar irradiance forecasting is proposed. The novel WPD–CNN–LSTM-MLP model is based on a sophisticated multi-branch hybrid structure with multi-variable inputs, which the multi-branch hybrid structure combines wavelet packet decomposition (WPD), convolutional neural network (CNN), long short-term memory (LSTM) networks, and multi-layer perceptron network (MLP), and the multi-variable inputs include hourly solar irradiance and three climate variables, namely: temperature, relative humidity, and wind speed and their combination. The new model extracts the inherent characteristics of multi-layer inputs sufficiently, overcomes the shortcomings of traditional models, and achieves more accurate forecasting results. The performance of the model is verified by actual data from Denver, Clark, and Folsom, the United States. Comparative studies of traditional individual back propagation neural network, support vector machine, recurrent neural network, LSTM, the climatology–persistence reference forecasts method and the proposed LSTM-MLP model, CNN-LSTM-MLP model, and WPD–CNN–LSTM model reveal that the proposed WPD–CNN–LSTM-MLP deep learning model has better prediction accuracy in hourly irradiance forecasting.
Fine-Tuning and training of densenet for histopathology image representation using TCGA diagnostic slides

Feature vectors provided by pre-trained deep artificial neural networks have become a dominant source for image representation in recent literature. Their contribution to the performance of image analysis can be improved through fine-tuning. As an ultimate solution, one might even train a deep network from scratch with the domain-relevant images, a highly desirable option which is generally impeded in pathology by lack of labeled images and the computational expense. In this study, we propose a new network, namely KimiaNet, that employs the topology of the DenseNet with four dense blocks, fine-tuned and trained with histopathology images in different configurations. We used more than 240,000 image patches with 1000×1000 pixels acquired at 20× magnification through our proposed “high-cellularity mosaic” approach to enable the usage of weak labels of 7126 whole slide images of formalin-fixed paraffin-embedded human pathology samples publicly available through The Cancer Genome Atlas (TCGA) repository. We tested KimiaNet using three public datasets, namely TCGA, endometrial cancer images, and colorectal cancer images by evaluating the performance of search and classification when corresponding features of different networks are used for image representation. As well, we designed and trained multiple convolutional batch-normalized ReLU (CBR) networks. The results show that KimiaNet provides superior results compared to the original DenseNet and smaller CBR networks when used as feature extractor to represent histopathology images.
Developing Real-Time Streaming Transformer Transducer for Speech Recognition on Large-Scale Dataset

Recently, Transformer based end-to-end models have achieved great success in many areas including speech recognition. However, compared to LSTM models, the heavy computational cost of the Transformer during inference is a key issue to prevent their applications. In this work, we explored the potential of Transformer Transducer (T-T) models for the fist pass decoding with low latency and fast speed on a large-scale dataset. We combine the idea of Transformer- XL and chunk-wise streaming processing to design a streamable Transformer Transducer model. We demonstrate that T-T outperforms the hybrid model, RNN Transducer (RNN-T), and streamable Transformer attention-based encoder-decoder model in the streaming scenario. Furthermore, the runtime cost and latency can be optimized with a relatively small look-ahead.
DeepFake Detection Based on Discrepancies Between Faces and Their Context

We propose a method for detecting face swapping and other identity manipulations in single images. Face swapping methods, such as DeepFake, manipulate the face region, aiming to adjust the face to the appearance of its context, while leaving the context unchanged. We show that this modus operandi produces discrepancies between the two regions (e.g., Fig. 1). These discrepancies offer exploitable telltale signs of manipulation. Our approach involves two networks: (i) a face identification network that considers the face region bounded by a tight semantic segmentation, and (ii) a context recognition network that considers the face context (e.g., hair, ears, neck). We describe a method which uses the recognition signals from our two networks to detect such discrepancies, providing a complementary detection signal that improves conventional real versus fake classifiers commonly used for detecting fake images. Our method achieves state of the art results on the FaceForensics++ and Celeb-DF-v2 benchmarks for face manipulation detection, and even generalizes to detect fakes produced by unseen methods.
Uncertainty-aware Joint Salient Object and Camouflaged Object Detection

Visual salient object detection (SOD) aims at finding the salient object(s) that attract human attention, while camouflaged object detection (COD) on the contrary intends to discover the camouflaged object(s) that hidden in the surrounding. In this paper, we propose a paradigm of lever-aging the contradictory information to enhance the detection ability of both salient object detection and camouflaged object detection. We start by exploiting the easy positive samples in the COD dataset to serve as hard positive samples in the SOD task to improve the robustness of the SOD model. Then, we introduce a "similarity measure" module to explicitly model the contradicting attributes of these two tasks. Furthermore, considering the uncertainty of labeling in both tasks’ datasets, we propose an adversarial learning network to achieve both higher order similarity measure and network confidence estimation. Experimental results on benchmark datasets demonstrate that our solution leads to state-of-the-art (SOTA) performance for both tasks <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> .
Dynamic Weighted Learning for Unsupervised Domain Adaptation

Unsupervised domain adaptation (UDA) aims to improve the classification performance on an unlabeled target domain by leveraging information from a fully labeled source domain. Recent approaches explore domain-invariant and class-discriminant representations to tackle this task. These methods, however, ignore the interaction between domain alignment learning and class discrimination learning. As a result, the missing or inadequate tradeoff between domain alignment and class discrimination are prone to the problem of negative transfer. In this paper, we propose Dynamic Weighted Learning (DWL) to avoid the discriminability vanishing problem caused by excessive alignment learning and domain misalignment problem caused by excessive discriminant learning. Technically, DWL dynamically weights the learning losses of alignment and discriminability by introducing the degree of alignment and discriminability. Besides, the problem of sample imbalance across domains is first considered in our work, and we solve the problem by weighing the samples to guarantee information balance across domains. Extensive experiments demonstrate that DWL has an excellent performance in several benchmark datasets. Code is available at https://github.com/NiXiao-cqu/TransferLearning-dwl-cvpr2021.
Blockchain for Electronic Voting System—Review and Open Research Challenges

Online voting is a trend that is gaining momentum in modern society. It has great potential to decrease organizational costs and increase voter turnout. It eliminates the need to print ballot papers or open polling stations—voters can vote from wherever there is an Internet connection. Despite these benefits, online voting solutions are viewed with a great deal of caution because they introduce new threats. A single vulnerability can lead to large-scale manipulations of votes. Electronic voting systems must be legitimate, accurate, safe, and convenient when used for elections. Nonetheless, adoption may be limited by potential problems associated with electronic voting systems. Blockchain technology came into the ground to overcome these issues and offers decentralized nodes for electronic voting and is used to produce electronic voting systems mainly because of their end-to-end verification advantages. This technology is a beautiful replacement for traditional electronic voting solutions with distributed, non-repudiation, and security protection characteristics. The following article gives an overview of electronic voting systems based on blockchain technology. The main goal of this analysis was to examine the current status of blockchain-based voting research and online voting systems and any related difficulties to predict future developments. This study provides a conceptual description of the intended blockchain-based electronic voting application and an introduction to the fundamental structure and characteristics of the blockchain in connection to electronic voting. As a consequence of this study, it was discovered that blockchain systems may help solve some of the issues that now plague election systems. On the other hand, the most often mentioned issues in blockchain applications are privacy protection and transaction speed. For a sustainable blockchain-based electronic voting system, the security of remote participation must be viable, and for scalability, transaction speed must be addressed. Due to these concerns, it was determined that the existing frameworks need to be improved to be utilized in voting systems.
Learning-Based Quantum Error Mitigation

If NISQ-era quantum computers are to perform useful tasks, they will need to employ powerful error mitigation techniques. Quasi-probability methods can permit perfect error compensation at the cost of additional circuit executions, provided that the nature of the error model is fully understood and sufficiently local both spatially and temporally. Unfortunately these conditions are challenging to satisfy. Here we present a method by which the proper compensation strategy can instead be learned ab initio. Our training process uses multiple variants of the primary circuit where all non-Clifford gates are substituted with gates that are efficient to simulate classically. The process yields a configuration that is near-optimal versus noise in the real system with its non-Clifford gate set. Having presented a range of learning strategies, we demonstrate the power of the technique both with real quantum hardware (IBM devices) and exactly-emulated imperfect quantum computers. The systems suffer a range of noise severities and types, including spatially and temporally correlated variants. In all cases the protocol successfully adapts to the noise and mitigates it to a high degree.