Reviewerly/exHarmony huggingface dataset:
RoIFusion: 3D Object Detection From LiDAR and Vision

When localizing and detecting 3D objects for autonomous driving scenes, obtaining information from multiple sensors (e.g., camera, LIDAR) is capable of mutually offering useful complementary information to enhance the robustness of 3D detectors. In this paper, a deep neural network architecture, named RoIFusion, is proposed to efficiently fuse the multi-modality features for 3D object detection by leveraging the advantages of LIDAR and camera sensors. In order to achieve this task, instead of densely combining the point-wise feature of the point cloud with the related pixel features, our fusion method novelly aggregates a small set of 3D Region of Interests (RoIs) in the point clouds with the corresponding 2D RoIs in the images, which are beneficial for reducing the computation cost and avoiding the viewpoint misalignment during the feature aggregation from different sensors. Finally, Extensive experiments are performed on the KITTI 3D object detection challenging benchmark to show the effectiveness of our fusion method and demonstrate that our deep fusion approach achieves state-of-the-art performance.
Adaptive multi-level feature fusion and attention-based network for arbitrary-oriented object detection in remote sensing imagery

Compared with the classic object detection problem, detecting objects in aerial images has some special challenges including huge orientation variations, complicated and large background, and wide multi-scale distribution. Considering these three challenges together, we propose a novel arbitrary-oriented object detection framework consisting of three main parts. Firstly, the Cascading Attention Network (CA-Net) composed of a patching self-attention module and a supervised spatial attention module is proposed for enhancing the feature representations from objects of interest and suppressing the background noises in Feature Pyramid Network (FPN) from coarse to fine. Then, the Adaptive Feature Concatenate Network (AFC-Net) is proposed to adaptively stack the feature maps pooled from all FPN levels as well as the global semantic features, for dealing with the multi-scale change of objects. Lastly, the OBB Multi-Definition and Selection Strategy (OBB-MDS-Strategy) is proposed to regress rotated bounding boxes more smoothly and detect oriented objects more accurately in the training process. Our experiments are conducted on two common and challenging aerial datasets, i.e., DOTA and HRSC2016. Experiments results show that the proposed method has superior performances in multi-orientated objects detection compared with the representative methods.
Self-Training with Weak Supervision

State-of-the-art deep neural networks require large-scale labeled training data that is often expensive to obtain or not available for many tasks.Weak supervision in the form of domainspecific rules has been shown to be useful in such settings to automatically generate weakly labeled training data.However, learning with weak rules is challenging due to their inherent heuristic and noisy nature.An additional challenge is rule coverage and overlap, where prior work on weak supervision only considers instances that are covered by weak rules, thus leaving valuable unlabeled data behind.In this work, we develop a weak supervision framework (ASTRA 1 ) that leverages all the available data for a given task.To this end, we leverage task-specific unlabeled data through self-training with a model (student) that considers contextualized representations and predicts pseudo-labels for instances that may not be covered by weak rules.We further develop a rule attention network (teacher) that learns how to aggregate student pseudo-labels with weak rule labels, conditioned on their fidelity and the underlying context of an instance.Finally, we construct a semi-supervised learning objective for end-to-end training with unlabeled data, domain-specific rules, and a small amount of labeled data.Extensive experiments on six benchmark datasets for text classification demonstrate the effectiveness of our approach with significant improvements over state-of-the-art baselines.
Competency Problems: On Finding and Removing Artifacts in Language Data

Much recent work in NLP has documented dataset artifacts, bias, and spurious correlations between input features and output labels.However, how to tell which features have "spurious" instead of legitimate correlations is typically left unspecified.In this work we argue that for complex language understanding tasks, all simple feature correlations are spurious, and we formalize this notion into a class of problems which we call competency problems.For example, the word "amazing" on its own should not give information about a sentiment label independent of the context in which it appears, which could include negation, metaphor, sarcasm, etc.We theoretically analyze the difficulty of creating data for competency problems when human bias is taken into account, showing that realistic datasets will increasingly deviate from competency problems as dataset size increases.This analysis gives us a simple statistical test for dataset artifacts, which we use to show more subtle biases than were described in prior work, including demonstrating that models are inappropriately affected by these less extreme biases.Our theoretical treatment of this problem also allows us to analyze proposed solutions, such as making local edits to dataset instances, and to give recommendations for future data collection and model design efforts that target competency problems.
An Integrated Architecture for Maintaining Security in Cloud Computing Based on Blockchain

Due to its wide accessibility, cloud services are susceptible to attacks. Data manipulation is a serious threat to data integrity which can occur in cloud computing - a relatively new offering under the umbrella of cloud services. Data can be tampered with, and malicious actors could use this to their advantage. Cloud computing clients in various application domains want to be assured that their data is accurate and trustworthy. On another spectrum, blockchain is a tamper-proof digital ledger that can be used alongside cloud technology to provide a tamper-proof cloud computing environment. This paper proposes a scheme that combines cloud computing with blockchain that assures data integrity for all homomorphic encryption schemes. To overcome the cloud service provider's (CSP) ultimate authority over the data, the proposed scheme relies on the Byzantine Fault Tolerance consensus to build a distributed network of processing CSPs based on the client requirements. After certain computations performed by all CSPs, they produce a master hash value for their database. To ensure immutable data is produced, master hash values are preserved in Bitcoin or Ethereum blockchain networks. The master hash values can be obtained by tracking the block header address for verification purposes. A theoretical analysis of the overhead costs associated with creating master hash values for each of the cryptocurrencies is presented. We found that Ethereum leads to lower client financial costs and better online performance than Bitcoin. We also specify the data security requirements the proposed scheme provides, the ground-level implementation, and future work. The proposed verification scheme is based on public cryptocurrency as a back-end service and does not require additional setup actions by the client other than a wallet for the chosen cryptocurrency.
Reputation-Based Federated Learning for Secure Wireless Networks

The dilemma between the ever-increasing demands for data processing, and the limited capabilities of mobile devices in a wireless communication system calls for the appearance of federated learning (FL). As a distributed machine learning (ML) method, FL executes in an iterative manner by distributing the global model parameters and aggregating the local model parameters, which avoids the transmission of huge raw data and preserves data privacy during the training process. However, since FL cannot control the local training and transmission process, this gives malicious users the opportunity to deteriorate the global aggregation. We adopt a reputation model based on beta distribution function to measure the credibility of local users, and propose a reputation-based scheduling policy with user fairness constraint. By taking into account the impact of wireless channel conditions and malicious attack features, we derive tractable expressions for the convergence rate of FL in a wireless setting. Moreover, we validate the superiority of the proposed reputation-based scheduling policy via numerical analysis and empirical simulations. The results show that the proposed secure wireless FL framework can not only distinguish malicious users from normal users but also effectively defend against several typical attack types featured in attack intensity and attack frequency. The analysis also reveals that the effect of average attack intensity on the convergence performance of FL is dominated by the percentage of malicious user equipments (UEs), and imposes even greater negative effect on the convergence performance of FL as the percentage of malicious UEs increases.
Fast End-to-End Speech Recognition Via Non-Autoregressive Models and Cross-Modal Knowledge Transferring From BERT

Attention-based encoder-decoder (AED) models have achieved promising performance in speech recognition. However, because the decoder predicts text tokens (such as characters or words) in an autoregressive manner, it is difficult for an AED model to predict all tokens in parallel. This makes the inference speed relatively slow. In contrast, we propose an end-to-end non-autoregressive speech recognition model called LASO (Listen Attentively, and Spell Once). The model aggregates encoded speech features into the hidden representations corresponding to each token with attention mechanisms. Thus, the model can capture the token relations by self-attention on the aggregated hidden representations from the whole speech signal rather than autoregressive modeling on tokens. Without explicitly autoregressive language modeling, this model predicts all tokens in the sequence in parallel so that the inference is efficient. Moreover, we propose a cross-modal transfer learning method to use a text-modal language model to improve the performance of speech-modal LASO by aligning token semantics. We conduct experiments on two scales of public Chinese speech datasets AISHELL-1 and AISHELL-2. Experimental results show that our proposed model achieves a speedup of about 50× and competitive performance, compared with the autoregressive transformer models. And the cross-modal knowledge transferring from the text-modal model can improve the performance of the speech-modal model.
Clean and Dirty Code Comprehension by Eye-tracking Based Evaluation using GP3 Eye Tracker

During the observation, analysis, and examination of cognitive processes, human-computer interfaces are increasingly becoming widespread.Programming could also be seen as a complex cognitive process.This study aims to examine the efficiency of the clean code paradigm and compares it to the dirty code produced without the principles formulated in this technique.In addition to the traditional knowledge level test and subjective judgment, the readability and comprehensibility of the implemented code were determined by analysing the heatmap and gaze route besides measuring and evaluating eye movement parameters.Based on the statistical evaluation, it can be stated that there is a significant difference in the average number of fixations, the average fixation time, and the average length of routes between fixations measured by studying two differently written source codes.This means that in the case of the clean code, significantly less and shorter information recording and processing were necessary to understand the code.
Cascade versus Direct Speech Translation: Do the Differences Still Make a Difference?

Five years after the first published proofs of concept, direct approaches to speech translation (ST) are now competing with traditional cascade solutions.In light of this steady progress, can we claim that the performance gap between the two is closed?Starting from this question, we present a systematic comparison between state-of-the-art systems representative of the two paradigms.Focusing on three language directions (English-German/Italian/Spanish), we conduct automatic and manual evaluations, exploiting highquality professional post-edits and annotations.Our multi-faceted analysis on one of the few publicly available ST benchmarks attests for the first time that: i) the gap between the two paradigms is now closed, and ii) the subtle differences observed in their behavior are not sufficient for humans neither to distinguish them nor to prefer one over the other.
Exposing the limits of Zero-shot Cross-lingual Hate Speech Detection

Reducing and counter-acting hate speech on Social Media is a significant concern.Most of the proposed automatic methods are conducted exclusively on English and very few consistently labeled, non-English resources have been proposed.Learning to detect hate speech on English and transferring to unseen languages seems an immediate solution.This work is the first to shed light on the limits of this zero-shot, cross-lingual transfer learning framework for hate speech detection.We use benchmark data sets in English, Italian, and Spanish to detect hate speech towards immigrants and women.Investigating post-hoc explanations of the model, we discover that nonhateful, language-specific taboo interjections are misinterpreted as signals of hate speech.Our findings demonstrate that zero-shot, crosslingual models cannot be used as they are, but need to be carefully designed.
Guiding Non-Autoregressive Neural Machine Translation Decoding with Reordering Information

Non-autoregressive neural machine translation (NAT) generates each target word in parallel and has achieved promising inference acceleration. However, existing NAT models still have a big gap in translation quality compared to autoregressive neural machine translation models due to the multimodality problem: the target words may come from multiple feasible translations. To address this problem, we propose a novel NAT framework ReorderNAT which explicitly models the reordering information to guide the decoding of NAT. Specially, ReorderNAT utilizes deterministic and non-deterministic decoding strategies that leverage reordering information as a proxy for the final translation to encourage the decoder to choose words belonging to the same translation. Experimental results on various widely-used datasets show that our proposed model achieves better performance compared to most existing NAT models, and even achieves comparable translation quality as autoregressive translation models with a significant speedup.
Defense against Synonym Substitution-based Adversarial Attacks via Dirichlet Neighborhood Ensemble

Although deep neural networks have achieved prominent performance on many NLP tasks, they are vulnerable to adversarial examples.We propose Dirichlet Neighborhood Ensemble (DNE), a randomized method for training a robust model to defense synonym substitutionbased attacks.During training, DNE forms virtual sentences by sampling embedding vectors for each word in an input sentence from a convex hull spanned by the word and its synonyms, and it augments them with the training data.In such a way, the model is robust to adversarial attacks while maintaining the performance on the original clean data.DNE is agnostic to the network architectures and scales to large models (e.g., BERT) for NLP applications.Through extensive experimentation, we demonstrate that our method consistently outperforms recently proposed defense methods by a significant margin across different network architectures and multiple data sets.
RealFormer: Transformer Likes Residual Attention

Transformer is the backbone of modern NLP models.In this paper, we propose Real-Former, a simple and generic technique to create Residual Attention Layer Transformer networks that significantly outperform the canonical Transformer and its variants (BERT, ETC, etc.) on a wide spectrum of tasks including Masked Language Modeling, GLUE, SQuAD, Neural Machine Translation, WikiHop, HotpotQA, Natural Questions, and OpenKP.We also observe empirically that RealFormer stabilizes training and leads to models with sparser attention.
Intelligent Fraud Detection in Financial Statements Using Machine Learning and Data Mining: A Systematic Literature Review

Fraudulent financial statements (FFS) are the results of manipulating financial elements by overvaluing incomes, assets, sales, and profits while underrating expenses, debts, or losses. To identify such fraudulent statements, traditional methods, including manual auditing and inspections, are costly, imprecise, and time-consuming. Intelligent methods can significantly help auditors in analyzing a large number of financial statements. In this study, we systematically review and synthesize the existing literature on intelligent fraud detection in corporate financial statements. In particular, the focus of this review is on exploring machine learning and data mining methods, as well as the various datasets that are studied for detecting financial fraud. We adopted the Kitchenham methodology as a well-defined protocol to extract, synthesize, and report the results. Accordingly, 47 articles were selected, synthesized, and analyzed. We present the key issues, gaps, and limitations in the area of fraud detection in financial statements and suggest areas for future research. Since supervised algorithms were employed more than unsupervised approaches like clustering, the future research should focus on unsupervised, semi-supervised, as well as bio-inspired and evolutionary heuristic methods for anomaly (fraud) detection. In terms of datasets, it is envisaged that future research making use of textual and audio data. While imposing new challenges, this unstructured data deserves further study as it can show interesting results for intelligent fraud detection.
Fast and Accurate Single-Image Depth Estimation on Mobile Devices, Mobile AI 2021 Challenge: Report

Depth estimation is an important computer vision problem with many practical applications to mobile devices. While many solutions have been proposed for this task, they are usually very computationally expensive and thus are not applicable for on-device inference. To address this problem, we introduce the first Mobile AI challenge, where the target is to develop an end-to-end deep learning-based depth estimation solutions that can demonstrate a nearly real-time performance on smartphones and IoT platforms. For this, the participants were provided with a new large-scale dataset containing RGB-depth image pairs obtained with a dedicated stereo ZED camera producing high-resolution depth maps for objects located at up to 50 meters. The run-time of all models was evaluated on the popular Raspberry Pi 4 platform with a mobile ARM-based Broadcom chipset. The proposed solutions can generate VGA resolution depth maps at up to 10 FPS on the Raspberry Pi 4 while achieving high fidelity results, and are compatible with any Android or Linux-based mobile devices. A detailed description of all models developed in the challenge is provided in this paper.
Classification of clustered microseismic events in a coal mine using machine learning

Discrimination of seismicity distributed in different areas is essential for reliable seismic risk assessment in mines. Although machine learning has been widely applied in seismic data processing, feasibility and reliability of applying this technique to classify spatially clustered seismic events in underground mines are yet to be investigated. In this research, two groups of seismic events with a minimum local magnitude (ML) of −3 were observed in an underground coal mine. They were respectively located around a dyke and the longwall face. Additionally, two types of undesired signals were also recorded. Four machine learning methods, i.e. random forest (RF), support vector machine (SVM), deep convolutional neural network (DCNN), and residual neural network (ResNN), were used for classifying these signals. The results obtained based on a primary dataset showed that these seismic events could be classified with at least 91% accuracy. The DCNN using seismogram images as the inputs reached the best performance with more than 94% accuracy. As mining is a dynamic progress which could change the characteristics of seismic signals, the temporal variance in the prediction performance of DCNN was also investigated to assess the reliability of this classifier during mining. A cascaded workflow consisting of database update, model training, signal prediction, and results review was established. By progressively calibrating the DCNN model, it achieved up to 99% prediction accuracy. The results demonstrated that machine learning is a reliable tool for the automatic discrimination of spatially clustered seismicity in underground mining.
Correlation-Guided Updating Strategy for Feature Selection in Classification With Surrogate-Assisted Particle Swarm Optimization

Classification data are usually represented by many features, but not all of them are useful. Without domain knowledge, it is challenging to determine which features are useful. Feature selection is an effective preprocessing technique for enhancing the discriminating ability of data, but it is a difficult combinatorial optimization problem because of the challenges of the huge search space and complex interactions between features. Particle swarm optimization (PSO) has been successfully applied to feature selection due to its efficiency and easy implementation. However, most existing PSO-based feature selection methods still face the problem of falling into local optima. To solve this problem, this article proposes a novel PSO-based feature selection approach, which can continuously improve the quality of the population at each iteration. Specifically, a correlation-guided updating strategy based on the characteristic of data is developed, which can effectively use the information of the current population to generate more promising solutions. In addition, a particle selection strategy based on a surrogate technique is presented, which can efficiently select particles with better performance in both convergence and diversity to form a new population. Experimental comparing the proposed approach with a few state-of-the-art feature selection methods on 25 classification problems demonstrate that the proposed approach is able to select a smaller feature subset with higher classification accuracy in most cases.