OpenRaiser/Intern-Atlas huggingface dataset:
STREAMLINE: A Simple, Transparent, End-To-End Automated Machine Learning Pipeline Facilitating Data Analysis and Algorithm Comparison
Venue: arXiv cs.LG 2022
Year: 2022

Machine learning (ML) offers powerful methods for detecting and modeling associations often in data with large feature spaces and complex associations. Many useful tools/packages (e.g. scikit-learn) have been developed to make the various elements of data handling, processing, modeling, and interpretation accessible. However, it is not trivial for most investigators to assemble these elements into a rigorous, replicatable, unbiased, and effective data analysis pipeline. Automated machine learning (AutoML) seeks to address these issues by simplifying the process of ML analysis for all. Here, we introduce STREAMLINE, a simple, transparent, end-to-end AutoML pipeline designed as a framework to easily conduct rigorous ML modeling and analysis (limited initially to binary classification). STREAMLINE is specifically designed to compare performance between datasets, ML algorithms, and other AutoML tools. It is unique among other autoML tools by offering a fully transparent and consistent baseline of comparison using a carefully designed series of pipeline elements including: (1) exploratory analysis, (2) basic data cleaning, (3) cross validation partitioning, (4) data scaling and imputation, (5) filter-based feature importance estimation, (6) collective feature selection, (7) ML modeling with `Optuna' hyperparameter optimization across 15 established algorithms (including less well-known Genetic Programming and rule-based ML), (8) evaluation across 16 classification metrics, (9) model feature importance estimation, (10) statistical significance comparisons, and (11) automatically exporting all results, plots, a PDF summary report, and models that can be easily applied to replication data.
A multi-model-based deep learning framework for short text multiclass classification with the imbalanced and extremely small data set
Venue: arXiv cs.CL 2022
Year: 2022

Text classification plays an important role in many practical applications. In the real world, there are extremely small datasets. Most existing methods adopt pre-trained neural network models to handle this kind of dataset. However, these methods are either difficult to deploy on mobile devices because of their large output size or cannot fully extract the deep semantic information between phrases and clauses. This paper proposes a multimodel-based deep learning framework for short-text multiclass classification with an imbalanced and extremely small data set. Our framework mainly includes five layers: The encoder layer uses DISTILBERT to obtain context-sensitive dynamic word vectors that are difficult to represent in traditional feature engineering methods. Since the transformer part of this layer is distilled, our framework is compressed. Then, we use the next two layers to extract deep semantic information. The output of the encoder layer is sent to a bidirectional LSTM network, and the feature matrix is extracted hierarchically through the LSTM at the word and sentence level to obtain the fine-grained semantic representation. After that, the max-pooling layer converts the feature matrix into a lower-dimensional matrix, preserving only the obvious features. Finally, the feature matrix is taken as the input of a fully connected softmax layer, which contains a function that can convert the predicted linear vector into the output value as the probability of the text in each classification. Extensive experiments on two public benchmarks demonstrate the effectiveness of our proposed approach on an extremely small data set. It retains the state-of-the-art baseline performance in terms of precision, recall, accuracy, and F1 score, and through the model size, training time, and convergence epoch, we can conclude that our method can be deployed faster and lighter on mobile devices.
The Second Place Solution for The 4th Large-scale Video Object Segmentation Challenge--Track 3: Referring Video Object Segmentation
Venue: arXiv cs.CV 2022
Year: 2022

The referring video object segmentation task (RVOS) aims to segment object instances in a given video referred by a language expression in all video frames. Due to the requirement of understanding cross-modal semantics within individual instances, this task is more challenging than the traditional semi-supervised video object segmentation where the ground truth object masks in the first frame are given. With the great achievement of Transformer in object detection and object segmentation, RVOS has been made remarkable progress where ReferFormer achieved the state-of-the-art performance. In this work, based on the strong baseline framework--ReferFormer, we propose several tricks to boost further, including cyclical learning rates, semi-supervised approach, and test-time augmentation inference. The improved ReferFormer ranks 2nd place on CVPR2022 Referring Youtube-VOS Challenge.
New Classes of Binary Sequences with High Merit Factor
Venue: arXiv cs.IT 2022
Year: 2022

The Merit Factor (MF) measure was first introduced by Golay in 1972. Sequences possessing large values of MF are of great interest to a rich list of disciplines - from physics and chemistry to digital communications, signal processing, and cryptography. Throughout the last half-century, manifold approaches and strategies were proposed for finding such sequences. Referenced as one of the most difficult optimization problems, Golay wrote that it is a "challenging and charming problem". His publications on this problem spanned more than 20 years. Golay himself introduced one beneficial class of sequences, called skew-symmetric sequences, or finite binary sequences with odd lengths with alternate autocorrelation values equal to 0. Their sieving construction greatly reduces the computational efforts of finding binary sequences with odd lengths and high MF. Having this in mind, the majority of papers to be found in the literature are focused solely on this class, preferring them over binary sequences with even lengths. In this work, a new class of finite binary sequences with even lengths with alternate autocorrelation absolute values equal to 1 is presented. We show that the MF values of the new class are closely related to the MF values of adjacent classes of skew-symmetric sequences. We further introduce new sub-classes of sequences using the partition number problem and the notion of potentials, measured by helper ternary sequences. Throughout our experiments, MF records for binary sequences with many lengths less than 225, and all lengths greater than 225, are discovered. Binary sequences of all lengths, odd or even, less than $2^8$ and with MF $>8$, and all lengths, odd or even, less than $2^9$ and with MF $>7$, are now revealed.
Evolution of Activation Functions for Deep Learning-Based Image Classification
Venue: arXiv cs.NE 2022
Year: 2022

Activation functions (AFs) play a pivotal role in the performance of neural networks. The Rectified Linear Unit (ReLU) is currently the most commonly used AF. Several replacements to ReLU have been suggested but improvements have proven inconsistent. Some AFs exhibit better performance for specific tasks, but it is hard to know a priori how to select the appropriate one(s). Studying both standard fully connected neural networks (FCNs) and convolutional neural networks (CNNs), we propose a novel, three-population, coevolutionary algorithm to evolve AFs, and compare it to four other methods, both evolutionary and non-evolutionary. Tested on four datasets -- MNIST, FashionMNIST, KMNIST, and USPS -- coevolution proves to be a performant algorithm for finding good AFs and AF architectures.
Do You Know My Emotion? Emotion-Aware Strategy Recognition towards a Persuasive Dialogue System
Venue: arXiv cs.CL 2022
Year: 2022

Persuasive strategy recognition task requires the system to recognize the adopted strategy of the persuader according to the conversation. However, previous methods mainly focus on the contextual information, little is known about incorporating the psychological feedback, i.e. emotion of the persuadee, to predict the strategy. In this paper, we propose a Cross-channel Feedback memOry Network (CFO-Net) to leverage the emotional feedback to iteratively measure the potential benefits of strategies and incorporate them into the contextual-aware dialogue information. Specifically, CFO-Net designs a feedback memory module, including strategy pool and feedback pool, to obtain emotion-aware strategy representation. The strategy pool aims to store historical strategies and the feedback pool is to obtain updated strategy weight based on feedback emotional information. Furthermore, a cross-channel fusion predictor is developed to make a mutual interaction between the emotion-aware strategy representation and the contextual-aware dialogue information for strategy recognition. Experimental results on \textsc{PersuasionForGood} confirm that the proposed model CFO-Net is effective to improve the performance on M-F1 from 61.74 to 65.41.
Self Supervised Learning for Few Shot Hyperspectral Image Classification
Venue: arXiv cs.CV 2022
Year: 2022

Deep learning has proven to be a very effective approach for Hyperspectral Image (HSI) classification. However, deep neural networks require large annotated datasets to generalize well. This limits the applicability of deep learning for HSI classification, where manually labelling thousands of pixels for every scene is impractical. In this paper, we propose to leverage Self Supervised Learning (SSL) for HSI classification. We show that by pre-training an encoder on unlabeled pixels using Barlow-Twins, a state-of-the-art SSL algorithm, we can obtain accurate models with a handful of labels. Experimental results demonstrate that this approach significantly outperforms vanilla supervised learning.
HARU: Haptic Augmented Reality-Assisted User-Centric Industrial Network Planning
Venue: arXiv cs.NI 2022
Year: 2022

To support Industry 4.0 applications with haptics and human-machine interaction, 6G requires a new framework that is fully autonomous, visual, and interactive. In this paper, we provide an end-to-end solution, HARU, for private network planning services, especially industrial networks. The solution consists of the following functions: collecting visual and sensory data from the user device, reconstructing 3D radio propagation environment and conducting network planning on a server, and visualizing network performance with AR on the user device with enabled haptic feedback. The functions are empowered by three key technical components: 1) vision- and sensor fusion-based 3D environment reconstruction, 2) ray tracing-based radio map generation and network planning, and 3) AR-assisted network visualization enabled by real-time camera relocalization. We conducted the proof-of-concept in a Bosch plant in Germany and showed good network coverage of the optimized antenna location, as well as high accuracy in both environment reconstruction and camera relocalization. We also achieved real-time AR-supported network monitoring with an end-to-end latency of about $32$ ms per frame.
Bioinspired composite learning control under discontinuous friction for industrial robots
Venue: arXiv cs.RO 2022
Year: 2022

Adaptive control can be applied to robotic systems with parameter uncertainties, but improving its performance is usually difficult, especially under discontinuous friction. Inspired by the human motor learning control mechanism, an adaptive learning control approach is proposed for a broad class of robotic systems with discontinuous friction, where a composite error learning technique that exploits data memory is employed to enhance parameter estimation. Compared with the classical feedback error learning control, the proposed approach can achieve superior transient and steady-state tracking without high-gain feedback and persistent excitation at the cost of extra computational burden and memory usage. The performance improvement of the proposed approach has been verified by experiments based on a DENSO industrial robot.
Capture Salient Historical Information: A Fast and Accurate Non-Autoregressive Model for Multi-turn Spoken Language Understanding
Venue: arXiv cs.CL 2022
Year: 2022

Spoken Language Understanding (SLU), a core component of the task-oriented dialogue system, expects a shorter inference facing the impatience of human users. Existing work increases inference speed by designing non-autoregressive models for single-turn SLU tasks but fails to apply to multi-turn SLU in confronting the dialogue history. The intuitive idea is to concatenate all historical utterances and utilize the non-autoregressive models directly. However, this approach seriously misses the salient historical information and suffers from the uncoordinated-slot problems. To overcome those shortcomings, we propose a novel model for multi-turn SLU named Salient History Attention with Layer-Refined Transformer (SHA-LRT), which composes of an SHA module, a Layer-Refined Mechanism (LRM), and a Slot Label Generation (SLG) task. SHA captures salient historical information for the current dialogue from both historical utterances and results via a well-designed history-attention mechanism. LRM predicts preliminary SLU results from Transformer's middle states and utilizes them to guide the final prediction, and SLG obtains the sequential dependency information for the non-autoregressive encoder. Experiments on public datasets indicate that our model significantly improves multi-turn SLU performance (17.5% on Overall) with accelerating (nearly 15 times) the inference process over the state-of-the-art baseline as well as effective on the single-turn SLU tasks.
On the Optimisation of the GSACA Suffix Array Construction Algorithm
Venue: arXiv cs.DS 2022
Year: 2022

The suffix array is arguably one of the most important data structures in sequence analysis and consequently there is a multitude of suffix sorting algorithms. However, to this date the GSACA algorithm introduced in 2015 is the only known non-recursive linear-time suffix array construction algorithm (SACA). Despite its interesting theoretical properties, there has been little effort in improving the algorithm's subpar real-world performance. There is a super-linear algorithm DSH which relies on the same sorting principle and is faster than DivSufSort, the fastest SACA for over a decade. This paper is concerned with analysing the sorting principle used in GSACA and DSH and exploiting its properties in order to give an optimised linear-time algorithm. Our resulting algorithm is not only significantly faster than GSACA but also outperforms DivSufSort and DSH.
Content Popularity Prediction Based on Quantized Federated Bayesian Learning in Fog Radio Access Networks
Venue: arXiv cs.LG 2022
Year: 2022

In this paper, we investigate the content popularity prediction problem in cache-enabled fog radio access networks (F-RANs). In order to predict the content popularity with high accuracy and low complexity, we propose a Gaussian process based regressor to model the content request pattern. Firstly, the relationship between content features and popularity is captured by our proposed model. Then, we utilize Bayesian learning to train the model parameters, which is robust to overfitting. However, Bayesian methods are usually unable to find a closed-form expression of the posterior distribution. To tackle this issue, we apply a stochastic variance reduced gradient Hamiltonian Monte Carlo (SVRG-HMC) method to approximate the posterior distribution. To utilize the computing resources of other fog access points (F-APs) and to reduce the communications overhead, we propose a quantized federated learning (FL) framework combining with Bayesian learning. The quantized federated Bayesian learning framework allows each F-AP to send gradients to the cloud server after quantizing and encoding. It can achieve a tradeoff between prediction accuracy and communications overhead effectively. Simulation results show that the performance of our proposed policy outperforms the existing policies.
The Bounded Beam Search algorithm for the Block Relocation Problem
Venue: arXiv cs.OH 2022
Year: 2022

In this paper we deal with the restricted Block Relocation Problem. We present a new lower bound and a heuristic approach for the problem. The proposed lower bound can be computed in polynomial time and it is provably better than some previously known lower bounds. We use it within a bounded beam search algorithm to solve the Block Relocation Problem and show that the considered heuristic approach outperforms the other existing algorithms on most of the instances in the literature. In order to test the approaches on real-size dimensions, new large instances of the Block Relocation Problem are also introduced.
How to train accurate BNNs for embedded systems?
Venue: arXiv cs.LG 2022
Year: 2022

A key enabler of deploying convolutional neural networks on resource-constrained embedded systems is the binary neural network (BNN). BNNs save on memory and simplify computation by binarizing both features and weights. Unfortunately, binarization is inevitably accompanied by a severe decrease in accuracy. To reduce the accuracy gap between binary and full-precision networks, many repair methods have been proposed in the recent past, which we have classified and put into a single overview in this chapter. The repair methods are divided into two main branches, training techniques and network topology changes, which can further be split into smaller categories. The latter category introduces additional cost (energy consumption or additional area) for an embedded system, while the former does not. From our overview, we observe that progress has been made in reducing the accuracy gap, but BNN papers are not aligned on what repair methods should be used to get highly accurate BNNs. Therefore, this chapter contains an empirical review that evaluates the benefits of many repair methods in isolation over the ResNet-20\&CIFAR10 and ResNet-18\&CIFAR100 benchmarks. We found three repair categories most beneficial: feature binarizer, feature normalization, and double residual. Based on this review we discuss future directions and research opportunities. We sketch the benefit and costs associated with BNNs on embedded systems because it remains to be seen whether BNNs will be able to close the accuracy gap while staying highly energy-efficient on resource-constrained embedded systems.
How to hide your voice: Noise-cancelling bird photography blind
Venue: arXiv cs.HC 2022
Year: 2022

Getting close to birds is a great challenge in wildlife photography. Bird photography blinds may be the most effective and least intrusive way if properly designed. However, the acoustic design of the blinds has been overlooked so far. Herein, we present noise-cancelling blinds which allow photographing birds at close range. Firstly, we conduct a questionnaire in the eco-tourism centre located in Yunnan, China. Thus, we determine the birders' expectations of the indoor sound environment. We then identify diverse variables to examine the impact of architectural and acoustic decisions on noise propagation. Finally, we examine the acoustic performance of the blinds by considering the birds' hearing threshold. The numerical simulations are performed in the acoustics module of Comsol MultiPhysics. Our study demonstrated that photography blinds require a strong and thorough acoustic design for both human and bird well-being.
A hybrid volume-surface integral equation method for rapid electromagnetic simulations in MRI
Venue: arXiv cs.CE 2022
Year: 2022

Objective: We developed a hybrid volume surface integral equation (VSIE) method based on domain decomposition to perform fast and accurate magnetic resonance imaging (MRI) simulations that include both remote and local conductive elements. Methods: We separated the conductive surfaces present in MRI setups into two domains and optimized electromagnetic (EM) modeling for each case. Specifically, interactions between the body and EM waves originating from local radiofrequency (RF) coils were modeled with the precorrected fast Fourier transform, whereas the interactions with remote conductive surfaces (RF shield, scanner bore) were modeled with a novel cross tensor train-based algorithm. We compared the hybrid- VSIE with other VSIE methods for realistic MRI simulation setups. Results: The hybrid-VSIE was the only practical method for simulation using 1 mm voxel isotropic resolution (VIR). For 2 mm VIR, our method could be solved at least 23 times faster and required 760 times lower memory than traditional VSIE methods. Conclusion: The hybrid-VSIE demonstrated a marked improvement in terms of convergence times of the numerical EM simulation compared to traditional approaches in multiple realistic MRI scenarios. Significance: The efficiency of the novel hybrid-VSIE method could enable rapid simulations of complex and comprehensive MRI setups.
A Grey-box Launch-profile Aware Model for C+L Band Raman Amplification
Venue: arXiv cs.LG 2022
Year: 2022

Based on the physical features of Raman amplification, we propose a three-step modelling scheme based on neural networks (NN) and linear regression. Higher accuracy, less data requirements and lower computational complexity are demonstrated through simulations compared with the pure NN-based method.
Modeling Adaptive Platoon and Reservation Based Autonomous Intersection Control: A Deep Reinforcement Learning Approach
Venue: arXiv cs.LG 2022
Year: 2022

As a strategy to reduce travel delay and enhance energy efficiency, platooning of connected and autonomous vehicles (CAVs) at non-signalized intersections has become increasingly popular in academia. However, few studies have attempted to model the relation between the optimal platoon size and the traffic conditions around the intersection. To this end, this study proposes an adaptive platoon based autonomous intersection control model powered by deep reinforcement learning (DRL) technique. The model framework has following two levels: the first level adopts a First Come First Serve (FCFS) reservation based policy integrated with a nonconflicting lane selection mechanism to determine vehicles' passing priority; and the second level applies a deep Q-network algorithm to identify the optimal platoon size based on the real-time traffic condition of an intersection. When being tested on a traffic micro-simulator, our proposed model exhibits superior performances on travel efficiency and fuel conservation as compared to the state-of-the-art methods.
OPERA: Harmonizing Task-Oriented Dialogs and Information Seeking Experience
Venue: arXiv cs.CL 2022
Year: 2022

Existing studies in conversational AI mostly treat task-oriented dialog (TOD) and question answering (QA) as separate tasks. Towards the goal of constructing a conversational agent that can complete user tasks and support information seeking, it is important to build a system that handles both TOD and QA with access to various external knowledge. In this work, we propose a new task, Open-Book TOD (OB-TOD), which combines TOD with QA task and expand external knowledge sources to include both explicit knowledge sources (e.g., the Web) and implicit knowledge sources (e.g., pre-trained language models). We create a new dataset OB-MultiWOZ, where we enrich TOD sessions with QA-like information seeking experience grounded on external knowledge. We propose a unified model OPERA (Open-book End-to-end Task-oriented Dialog) which can appropriately access explicit and implicit external knowledge to tackle the defined task. Experimental results demonstrate OPERA's superior performance compared to closed-book baselines and illustrate the value of both knowledge types.