Reviewerly/exHarmony huggingface dataset:
Learn to abstract via concept graph for weakly-supervised few-shot learning

• To the best of our knowledge, we are the first to introduce the concept graph and explore the concept hierarchy for addressing the WSFSL problem. • We propose a novel concept graph-based meta-learning framework, consisting of a multi-level conceptual abstraction-based regularization and a meta concept inference network. • Extensive experimental results are reported on two realistic datasets, namely, WS-ImageNet-Pure and WS-ImageNet-Mix, which demonstrate the effectiveness of the proposed framework. In recent years, a large number of meta-learning methods have been proposed to address few-shot learning problems and have shown superior performance. However, the explicit prior knowledge (e.g., concept graph) and weakly-supervised information are rarely explored in existing methods, which are usually free or cheap to collect. In this paper, we introduce a concept graph for the weakly-supervised few-shot learning, and propose a novel meta-learning framework, namely, MetaConcept. Our key idea is to learn a universal meta-learner inferring any-level classifier, so as to boost the classification performance of meta-learning on the novel classes. Specifically, we firstly propose a novel regularization with multi-level conceptual abstraction to train a universal meta-learner to infer not only an entity classifier but also a concept classifier at different levels via the concept graph (i.e., learn to abstract). Then, we propose a meta concept inference network as the universal meta-learner for the base learner, aiming to quickly adapt to a novel task by the joint inference of the abstract concepts and a few annotated samples. We have conducted extensive experiments on two weakly-supervised few-shot learning benchmarks, namely, WS-ImageNet-Pure and WS-ImageNet-Mix. Our experimental results show that (1) the proposed MetaConcept outperforms state-of-the-art methods with an improvement of 2% to 6% in classification accuracy; (2) the proposed MetaConcept is able to yield a good performance though merely training with weakly-labeled datasets.
Iterative graph attention memory network for cross-modal retrieval

How to eliminate the semantic gap between multi-modal data and effectively fuse multi-modal data is the key problem of cross-modal retrieval. The abstractness of semantics makes semantic representation one-sided. In order to obtain complementary semantic information for samples with the same semantics, we construct a local graph for each instance and utilize a graph feature extractor (GFE) to reconstruct the sample representation based on the adjacency relationship between the sample itself and its neighbors. Owing to the problem that some cross-modal methods only focus on the learning of paired samples and cannot integrate more cross-modal information from the other modalities, we propose a cross-modal graph attention strategy to generate the graph attention representation for each sample from the local graph of its corresponding paired sample. In order to eliminate heterogeneous gap between modalities, we fuse the features of the two modalities using a recurrent gated memory network to choose prominent features from other modalities and filter out unimportant information to obtain a more discriminative feature representation in the common latent space. Experiments on four benchmark datasets demonstrate the superiority of our proposed model compared with state-of-the-art cross-modal methods.
A Context-Based Automated Approach for Method Name Consistency Checking and Suggestion

Misleading method names in software projects can confuse developers, which may lead to software defects and affect code understandability. In this paper, we present DeepName, a context-based, deep learning approach to detect method name inconsistencies and suggest a proper name for a method. The key departure point is the philosophy of "Show Me Your Friends, I'll Tell You Who You Are". Unlike the state-of-the-art approaches, in addition to the method's body, we also consider the interactions of the current method under study with the other ones including the caller and callee methods, and the sibling methods in the same enclosing class. The sequences of sub-tokens in the program entities' names in the contexts are extracted and used as the input for an RNN-based encoder-decoder to produce the representations for the current method. We modify that RNN model to integrate the copy mechanism and our newly developed component, called the non-copy mechanism, to emphasize on the possibility of a certain sub-token not to be copied to follow the current sub-token in the currently generated method name. We conducted several experiments to evaluate DeepName on large datasets with +14M methods. For consistency checking, DeepName improves the state-of-the-art approach by 2.1%, 19.6%, and 11.9% relatively in recall, precision, and F-score, respectively. For name suggestion, DeepName improves relatively over the state-of-the-art approaches in precision (1.8%-30.5%), recall (8.8%-46.1%), and F-score (5.2%-38.2%). To assess DeepName's usefulness, we detected inconsistent methods and suggested new method names in active projects. Among 50 pull requests, 12 were merged into the main branch. In total, in 30/50 cases, the team members agree that our suggested method names are more meaningful than the current names.
A Scaled Spherical Simplex Filter (S3F) with a decreased n + 2 sigma points set size and equivalent 2n + 1 Unscented Kalman Filter (UKF) accuracy

The computational efficiency of a sampling based nonlinear Kalman filtering process is mainly conditional on the number of sigma/sample points required by the filter at each time step to effectively quantify statistical properties of related states and parameters. Efficaciously minimizing the needed number of points would therefore have important implications, especially for large n-dimensional nonlinear systems. A set of minimum number of n + 1 sigma points is necessary in each filtering application in order to provide mean and nonsingular covariance estimates. Incorporating additional sigma points than this minimum set improves the accuracy of the estimates and can take advantage of a richer information content that can possibly exist, but at the same time increases the computational demand. To this end, by adding one more sigma point to this minimum set, and assigning general, well defined weights and scaling factors, a new Scaled Spherical Simplex Filter (S3F) with n + 2 sigma points set size is presented in this work, and it is theoretically proven that it can practically achieve in all cases the same accuracy and numerical stability as the typical 2n + 1 sigma points Unscented Kalman Filter (UKF), with almost 50% less computational requirements. A comprehensive study of the suggested filter is presented, including detailed derivations, theoretical examples and numerical results, demonstrating the efficiency, robustness, and accuracy of the S3F.
A chaotic path planning generator enhanced by a memory technique

This work considers the problem of chaotic path planning, using an improved memory technique to boost performance. In this application, the dynamics of two simple chaotic maps are first used to generate a pseudo-random bit generator. Using this as a source, a series of navigation commands are generated and used by an autonomous robot to explore an area, while maintaining a random and unpredictable motion. This navigation strategy can bring overall area coverage, but also yields numerous revisits to previous cells. Here, a memory technique is applied to limit the chaotic motion of the robot to adjacent cells with the least number of visits, leading to overall improvement in performance. Numerical simulations are performed to evaluate the path planning strategy. The simulation results showcase a major improvement in coverage performance compared to the memory-free technique and also compared to an inverse pheromone technique previously developed by the authors. Also, the number of multiple visits to previous cells is significantly reduced with the proposed technique. • Creation of a Bit Generator for producing the motion commands of a mobile robot. • Randomness validation of the produced motion sequence by using the NIST statistical package. • Coverage rate computation for a given terrain. • Insertion of the Memory Technique for improving the results. • Comparison between memory-free and Memory Technique.
DAWM: Cost-Aware Asset Claim Analysis Approach on Big Data Analytic Computation Model for Cloud Data Centre

The heterogeneous resource-required application tasks increase the cloud service provider (CSP) energy cost and revenue by providing demand resources. Enhancing CSP profit and preserving energy cost is a challenging task. Most of the existing approaches consider task deadline violation rate rather than performance cost and server size ratio during profit estimation, which impacts CSP revenue and causes high service cost. To address this issue, we develop two algorithms for profit maximization and adequate service reliability. First, a belief propagation-influenced cost-aware asset scheduling approach is derived based on the data analytic weight measurement (DAWM) model for effective performance and server size optimization. Second, the multiobjective heuristic user service demand (MHUSD) approach is formulated based on the CPS profit estimation model and the user service demand (USD) model with dynamic acyclic graph (DAG) phenomena for adequate service reliability. The DAWM model classifies prominent servers to preserve the server resource usage and cost during an effective resource slicing process by considering each machine execution factor (remaining energy, energy and service cost, workload execution rate, service deadline violation rate, cloud server configuration (CSC), service requirement rate, and service level agreement violation (SLAV) penalty rate). The MHUSD algorithm measures the user demand service rate and cost based on the USD and CSP profit estimation models by considering service demand weight, tenant cost, and energy cost. The simulation results show that the proposed system has accomplished the average revenue gain of 35%, cost of 51%, and profit of 39% than the state-of-the-art approaches.
Doubly supervised parameter transfer classifier for diagnosis of breast cancer with imbalanced ultrasound imaging modalities

The bimodal ultrasound, namely B-mode ultrasound (BUS) and elastography ultrasound (EUS), provide complementary information to improve the diagnostic accuracy of breast cancers. However, in clinical practice, it is easier to acquire the labeled BUS images than the paired bimodal ultrasound data with shared labels due to the lack of EUS devices, especially in many rural hospitals. Thus, the single-modal BUS-based computer-aided diagnosis (CAD) generally has wide applications. Transfer learning (TL) can promote a BUS-based CAD model by transferring additional knowledge from EUS modality. To make full use of labeled paired bimodal data and the additional single-modal BUS images for knowledge transfer, a novel doubly supervised parameter transfer classifier (DSPTC) is proposed to well handle the TL between imbalanced modalities with the guidance of label information. Specifically, the proposed DSPTC consists of two loss functions corresponding to the paired bimodal ultrasound data with shared labels and the unpaired images with different labels, respectively. The former uses the loss function in the specially designed TL paradigm of support vector machine plus, while the latter adopts the Hilbert-Schmidt Independence Criterion (HSIC) for knowledge transfer between the unpaired images, which consist of the single-modal BUS images and the EUS images from the paired bimodal data. Consequently, the doubly supervised knowledge transfer is implemented by way of parameter transfer in a unified optimization framework. Two experiments are designed to evaluate the proposed DSPTC for the ultrasound-based diagnosis of breast cancers. The experimental results indicate that DSPTC outperforms all the compared algorithms, suggesting its wide potential applications.
Proximal Policy Optimization With Policy Feedback

Proximal policy optimization (PPO) is a deep reinforcement learning algorithm based on the actor–critic (AC) architecture. In the classic AC architecture, the Critic (value) network is used to estimate the value function while the Actor (policy) network optimizes the policy according to the estimated value function. The efficiency of the classic AC architecture is limited due that the policy does not directly participate in the value function update. The classic AC architecture will make the value function estimation inaccurate, which will affect the performance of the PPO algorithm. For improvement, we designed a novel AC architecture with policy feedback (AC-PF) by introducing the policy into the update process of the value function and further proposed the PPO with policy feedback (PPO-PF). For the AC-PF architecture, the policy-based expected (PBE) value function and discount reward formulas are designed by drawing inspiration from expected Sarsa. In order to enhance the sensitivity of the value function to the change of policy and to improve the accuracy of PBE value estimation at the early learning stage, we proposed a policy update method based on the clipped discount factor. Moreover, we specifically defined the loss functions of the policy network and value network to ensure that the policy update of PPO-PF satisfies the unbiased estimation of the trust region. Experiments on Atari games and control tasks show that compared to PPO, PPO-PF has faster convergence speed, higher reward, and smaller variance of reward.
An Algorithm for Large-Scale Multitarget Tracking and Parameter Estimation

Modern tracking problems require fast, scalable, and robust solutions for tracking multiple targets from noisy sensor data. In this article, an algorithm that has linear computational complexity with respect to the number of targets and measurements is presented. The method is based on the propagation of the first two factorial cumulants of a point process. The algorithm is demonstrated for tracking a million targets in cluttered environments in the fastest time yet for any such solution. A low-computational-complexity solution to the problem of joint multitarget tracking and parameter estimation is also presented. The multitarget filtering approach utilizes a single-cluster point process method for joint multiobject estimation and parameter estimation and is shown to be more computationally efficient and robust than previous implementations.
SaccadeFork: A lightweight multi-sensor fusion-based target detector

Commercialization of self-driving applications requires precision and reliability of the perception system due to the highly dynamic and complex road environment. Early perception systems either rely on the camera or on LiDAR for moving obstacle detection. With the development of vehicular sensors and deep learning technologies, the multi-view and sensor fusion based convolutional neural network (CNN) model for detection tasks has become a popular research area. In this paper, we present a novel multi-sensor fusion-based CNN model–SaccadeFork–that integrates the image and upsampled LiDAR point clouds as the input. SaccadeFork includes two modules: (1) a lightweight backbone that consists of hourglass convolution feature extraction module and a parallel dilation convolution module for adaptation of the system to different target sizes; (2) an anchor-based detection head. The model also considers deployment of resource-limited edge devices in the vehicle. Two refinement strategies, i.e., Mixup and Swish activation function are also adopted to improve the model. Comparison with a series of latest models on public dataset of KITTI shows that SaccadeFork can achieve the optimal detection accuracy on vehicles and pedestrians under different scenarios. The final model is also deployed and tested on a local dataset collected based on edge devices and low-cost sensor solutions, and the results show that the model can achieve real-time efficiency and high detection accuracy.
Blockchain Technology for Supply Chain Management

Blockchain technology offers important opportunities for the supply chain management. This paper aims to overview the employment of blockchain technology in the field of the supply chain. Although the technology has been widely associated with cryptocurrencies, non-financial applications such as supply chain, power, and food industry are also promising. Blockchain can provide a permanent, shareable, auditable record of products through their supply chain, which improves product traceability, authenticity, and legality in a more cost-effective way. In this chapter, the potential improvement expectations via blockchain technology for the case of agribusiness were discussed. The proposed case for automotive manufacturing-micro factory with blockchain technology was also introduced.
CrossNorm and SelfNorm for Generalization under Distribution Shifts

Traditional normalization techniques (e.g., Batch Normalization and Instance Normalization) generally and simplistically assume that training and test data follow the same distribution. As distribution shifts are inevitable in real-world applications, well-trained models with previous normalization methods can perform badly in new environments. Can we develop new normalization methods to improve generalization robustness under distribution shifts? In this paper, we answer the question by proposing Cross-Norm and SelfNorm. CrossNorm exchanges channel-wise mean and variance between feature maps to enlarge training distribution, while SelfNorm uses attention to recalibrate the statistics to bridge gaps between training and test distributions. CrossNorm and SelfNorm can complement each other, though exploring different directions in statistics usage. Extensive experiments on different fields (vision and language), tasks (classification and segmentation), settings (supervised and semi-supervised), and distribution shift types (synthetic and natural) show the effectiveness. Code is available at https://github.com/amazon-research/crossnorm-selfnorm
Predicting unstable software benchmarks using static source code features

Abstract Software benchmarks are only as good as the performance measurements they yield. Unstable benchmarks show high variability among repeated measurements, which causes uncertainty about the actual performance and complicates reliable change assessment. However, if a benchmark is stable or unstable only becomes evident after it has been executed and its results are available. In this paper, we introduce a machine-learning-based approach to predict a benchmark’s stability without having to execute it. Our approach relies on 58 statically-computed source code features, extracted for benchmark code and code called by a benchmark, related to (1) meta information, e.g., lines of code (LOC), (2) programming language elements, e.g., conditionals or loops, and (3) potentially performance-impacting standard library calls, e.g., file and network input/output (I/O). To assess our approach’s effectiveness, we perform a large-scale experiment on 4,461 Go benchmarks coming from 230 open-source software (OSS) projects. First, we assess the prediction performance of our machine learning models using 11 binary classification algorithms. We find that Random Forest performs best with good prediction performance from 0.79 to 0.90, and 0.43 to 0.68, in terms of AUC and MCC, respectively. Second, we perform feature importance analyses for individual features and feature categories. We find that 7 features related to meta-information, slice usage, nested loops, and synchronization application programming interfaces (APIs) are individually important for good predictions; and that the combination of all features of the called source code is paramount for our model, while the combination of features of the benchmark itself is less important. Our results show that although benchmark stability is affected by more than just the source code, we can effectively utilize machine learning models to predict whether a benchmark will be stable or not ahead of execution. This enables spending precious testing time on reliable benchmarks, supporting developers to identify unstable benchmarks during development, allowing unstable benchmarks to be repeated more often, estimating stability in scenarios where repeated benchmark execution is infeasible or impossible, and warning developers if new benchmarks or existing benchmarks executed in new environments will be unstable.
PQK: Model Compression via Pruning, Quantization, and Knowledge Distillation

As edge devices become prevalent, deploying Deep Neural Networks (DNN) on edge devices has become a critical issue. However, DNN requires a high computational resource which is rarely available for edge devices. To handle this, we propose a novel model compression method for the devices with limited computational resources, called PQK consisting of pruning, quantization, and knowledge distillation (KD) processes. Unlike traditional pruning and KD, PQK makes use of unimportant weights pruned in the pruning process to make a teacher network for training a better student network without pre-training the teacher model. PQK has two phases. Phase 1 exploits iterative pruning and quantization-aware training to make a lightweight and power-efficient model. In phase 2, we make a teacher network by adding unimportant weights unused in phase 1 to a pruned network. By using this teacher network, we train the pruned network as a student network. In doing so, we do not need a pre-trained teacher network for the KD framework because the teacher and the student networks coexist within the same network. We apply our method to the recognition model and verify the effectiveness of PQK on keyword spotting (KWS) and image recognition.
A wrapper based binary bat algorithm with greedy crossover for attribute selection

Attribute selection plays a vital role in optimization and machine learning that involves huge datasets. Classification accuracy of any learning model depends on the dimensionality of data and attributes selected. This leads to a multi-objective problem of obtaining high classification accuracy with fewer attributes. In this research work, a multi-objective optimization algorithm with greedy crossover for attribute selection and classification is proposed. A wrapper based Binary Bat Algorithm (BBA) with Support Vector Machine (SVM) as evaluator is implemented for attribute selection. In general, the optimization algorithms have the tendency to prematurely converge with sub-optimal solutions. This reduces the quality of the attribute selected and efficiency of the algorithm. Here, a multi-objective binary bat algorithm with greedy crossover is proposed to reset the sub-optimal solutions that are obtained due to the premature convergence. The evaluation of the attributes selected is done using the Support Vector Machine with 10-fold cross-validation. The proposed algorithm is implemented and evaluated with the benchmark datasets available in the UC Irvine (UCI) repository. Classification accuracy of 89.25%, 96.45%, 96.57% and 88.50% using the Australian, Ionosphere, Wisconsin Breast Cancer (Original dataset) and Musk is obtained. Further analysis is made with parameter metrics like sensitivity, specificity, precision, recall, fmeasure, Matthews Correlation coefficient (MCC), confusion matrix and Area under the ROC Curve (AUC). The proposed multi-objective binary bat algorithm with greedy crossover yields better performance over the existing bat based algorithms and other nature-inspired algorithms. The solution for the multi-objective problem of obtaining high classification accuracy with minimal number of attributes is attained. Also, the problem of premature convergence occurring in the optimization algorithms with sub-optimal solutions is overcome using the proposed algorithm.