Reviewerly/exHarmony huggingface dataset:
A dynamic stochastic search algorithm for high-dimensional optimization problems and its application to feature selection

As the number of dimensions of an optimization problem increases, the process of deriving the solution becomes more complicated and difficult. Metaheuristic algorithms are effective methods for solving many optimization problems, whereas most of these algorithms perform poorly on high-dimensional problems. In this paper, a novel metaheuristic algorithm called Dynamic Stochastic Search (DSS) is proposed for high-dimensional optimization problems. To effectively execute the exploration (diversification) and exploitation (intensification) processes of DSS, a dynamic stochastic search process is designed by defining a stochastic search control factor, a search process based on the Gaussian distribution, two shrink modes inspired by the Whale Optimization Algorithm, and a balance mechanism derived from the Bat Algorithm. The proposed algorithm has the following advantages: no specific control parameters other than the population size and the maximum number of iterations, a simple structure, and less computational effort in the implementation. Analyzing the computational complexity of DSS demonstrates its simplicity. To evaluate the performance of DSS, twenty 300-dimensional and 3000-dimensional classical benchmark functions as well as thirty 100-dimensional CEC2014 benchmark functions are utilized. The statistical results prove the effectiveness and feasibility of DSS for high-dimensional optimization problems because it shows better convergence performance and higher efficiency than various advanced optimization algorithms. Moreover, the superiority of DSS in solving high-dimensional real-world optimization problems is validated by applying it to feature selection for ten real-world benchmark classification datasets from the UCI machine learning repository.
Relationship Extraction Method for Urban Rail Transit Operation Emergencies Records

The text records of urban rail transit operation emergencies contain information about the relationship between events, which can provide auxiliary support for emergency decision-making. However, most of the current text records of urban rail transit operation emergencies are unstructured data, which makes it difficult to extract the correlation of events directly. Therefore, this paper proposes an effective approach to extract the event relations from the text records of urban rail transit operation emergencies by using natural language processing technology. Since the research object of this paper is Chinese semantics, the characteristics of the Chinese language are considered to make a better performance. Specifically, since the shortcomings of insufficient information representation and single perspectives in the expression of word vector, this paper combines Chinese word vector with Chinese character vector to obtain the information of the text data from different levels. Then, the obtained information is input into the bidirectional long short-term memory neural network-attention mechanism model (BiLSTM-Attention), which makes the overall and local features of the text can be simultaneously extracted. Finally, the experiments illustrate the model BiLSTM-Attention proposed in this paper can effectively and accurately extract the relationship between events, which provides an effective reference for emergency decision-making.
Online Scalable Streaming Feature Selection via Dynamic Decision

Feature selection is one of the core concepts in machine learning, which hugely impacts the model’s performance. For some real-world applications, features may exist in a stream mode that arrives one by one over time, while we cannot know the exact number of features before learning. Online streaming feature selection aims at selecting optimal stream features at each timestamp on the fly. Without the global information of the entire feature space, most of the existing methods select stream features in terms of individual feature information or the comparison of features in pairs. This article proposes a new online scalable streaming feature selection framework from the dynamic decision perspective that is scalable on running time and selected features by dynamic threshold adjustment. Regarding the philosophy of “Thinking-in-Threes”, we classify each new arrival feature as selecting, discarding, or delaying, aiming at minimizing the overall decision risks. With the dynamic updating of global statistical information, we add the selecting features into the candidate feature subset, ignore the discarding features, cache the delaying features into the undetermined feature subset, and wait for more information. Meanwhile, we perform the redundancy analysis for the candidate features and uncertainty analysis for the undetermined features. Extensive experiments on eleven real-world datasets demonstrate the efficiency and scalability of our new framework compared with state-of-the-art algorithms.
C-NMC: B-lineage acute lymphoblastic leukaemia: A blood cancer dataset

Development of computer-aided cancer diagnostic tools is an active research area owing to the advancements in deep-learning domain. Such technological solutions provide affordable and easily deployable diagnostic tools. Leukaemia, or blood cancer, is one of the leading cancers causing more than 0.3 million deaths every year. In order to aid the development of such an AI-enabled tool, we collected and curated a microscopic image dataset, namely C-NMC, of more than 15000 cancer cell images at a very high resolution of B-Lineage Acute Lymphoblastic Leukaemia (B-ALL). The dataset is prepared at the subject-level and contains images of both healthy and cancer patients. So far, this is the largest (as well as curated) dataset on B-ALL cancer in the public domain. C-NMC is available at The Cancer Imaging Archive (TCIA), USA and can be helpful for the research community worldwide for the development of B-ALL cancer diagnostic tools. This dataset was utilized in an international medical imaging challenge held at ISBI 2019 conference in Venice, Italy. In this paper, we present a detailed description and challenges of this dataset. We also present benchmarking results of all the methods applied so far on this dataset.
Perspective: Narrative Storyliving in Virtual Reality Design

The development and relative affordability of Virtual Reality in recent years have provided opportunities to experience representations of both concrete and abstract situations; from nuclear engineering to particle physics, art galleries to three-dimensional prehistoric paintings, person-to-person communication to artificial agent collaboration, and 360-degree journalism to animated movies. Yet, it still remains challenging for participants to create personal narratives within a virtual world beyond that structured by its original designers. Setting aside technological considerations, we attribute this limitation largely to a restricted conceptualization of time and space that is fixed to present events, emotions and experiences. Consequently, Virtual Reality scenarios, as immersive and plausible as they might be, are nonetheless prone to a thin and static view of the (virtual) world where growth and experiential learning are not always possible or privileged. In this Perspective we propose a recasting of Virtual Reality that combines novelistic storytelling in the physical world with “narrative storyliving” as a mechanism for meaning-making within and across large dialogic arenas. This involves us drawing on ideas from the Russian philosopher and theorist, Mikhail Bakhtin, relating to the literary artistic chronotope. Ultimately, we intend to advance the discourse about what Virtual Reality is at present, and where it could go as seen through a critical literary lens.
Longevity Foundation: Perspective on Decentralized Autonomous Organization for Special-Purpose Financing

Decentralized autonomous organizations (DAO) launched on a blockchain and governed by a smart contract promises to bring self-organization to a new technological level.Crisis management has no standard decentralized solution within DAO yet.A central authority is a natural component due to compliance reasons in certain domains, for example, special-purpose financing, in which the DAO governance model could be reasonably applied.More generally, a centralized DAO representative could streamline implementing DAO decisions that involve interactions with legacy systems.The article presents a perspective of modern technologies for organizing a foundation for special-purpose financing and considers longevity as a model example of the purpose.
IHGC-GAN: influence hypergraph convolutional generative adversarial network for risk prediction of late mild cognitive impairment based on imaging genetic data

Predicting disease progression in the initial stage to implement early intervention and treatment can effectively prevent the further deterioration of the condition. Traditional methods for medical data analysis usually fail to perform well because of their incapability for mining the correlation pattern of pathogenies. Therefore, many calculation methods have been excavated from the field of deep learning. In this study, we propose a novel method of influence hypergraph convolutional generative adversarial network (IHGC-GAN) for disease risk prediction. First, a hypergraph is constructed with genes and brain regions as nodes. Then, an influence transmission model is built to portray the associations between nodes and the transmission rule of disease information. Third, an IHGC-GAN method is constructed based on this model. This method innovatively combines the graph convolutional network (GCN) and GAN. The GCN is used as the generator in GAN to spread and update the lesion information of nodes in the brain region-gene hypergraph. Finally, the prediction accuracy of the method is improved by the mutual competition and repeated iteration between generator and discriminator. This method can not only capture the evolutionary pattern from early mild cognitive impairment (EMCI) to late MCI (LMCI) but also extract the pathogenic factors and predict the deterioration risk from EMCI to LMCI. The results on the two datasets indicate that the IHGC-GAN method has better prediction performance than the advanced methods in a variety of indicators.
A Density Peaks Clustering Algorithm With Sparse Search and K-d Tree

Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a density peaks clustering algorithm with sparse search and K-d tree is developed to solve this problem. Firstly, a sparse distance matrix is calculated by using K-d tree to replace the original full rank distance matrix, so as to accelerate the calculation of local density. Secondly, a sparse search strategy is proposed to accelerate the computation of relative-separation with the intersection between the set of $k$ nearest neighbors and the set consisting of the data points with larger local density for any data point. Furthermore, a second-order difference method for decision values is adopted to determine the cluster centers adaptively. Finally, experiments are carried out on datasets with different distribution characteristics, by comparing with other six state-of-the-art clustering algorithms. It is proved that the algorithm can effectively reduce the computational complexity of the original DPC from $O(n^2K)$ to $O(n(n^{1-1/K}+k))$. Especially for larger datasets, the efficiency is elevated more remarkably. Moreover, the clustering accuracy is also improved to a certain extent. Therefore, it can be concluded that the overall performance of the newly proposed algorithm is excellent.
AISHELL-NER: Named Entity Recognition from Chinese Speech

Named Entity Recognition (NER) from speech is among Spoken Language Understanding (SLU) tasks, aiming to extract semantic information from the speech signal. NER from speech is usually made through a two-step pipeline that consists of (1) processing the audio using an Automatic Speech Recognition (ASR) system and (2) applying an NER tagger to the ASR outputs. Recent works have shown the capability of the End-to-End (E2E) approach for NER from English and French speech, which is essentially entity-aware ASR. However, due to the many homophones and polyphones that exist in Chinese, NER from Chinese speech is effectively a more challenging task. In this paper, we introduce a new dataset AISEHLL-NER for NER from Chinese speech. Extensive experiments are conducted to explore the performance of several state-of-the-art methods. The results demonstrate that the performance could be improved by combining entity-aware ASR and pretrained NER tagger, which can be easily applied to the modern SLU pipeline. The dataset is publicly available at github.com/Alibaba-NLP/AISHELL-NER.
Attention-based cross-layer domain alignment for unsupervised domain adaptation

Unsupervised domain adaptation (UDA) aims to learn transferable knowledge from a labeled source domain and adapts a trained model to an unlabeled target domain. To bridge the gap between source and target domains, one prevailing strategy is to minimize the distribution discrepancy by aligning their semantic features extracted by deep models. The existing alignment-based methods mainly focus on reducing domain divergence in the same model layer. However, the same level of semantic information could distribute across model layers due to the domain shifts. To further boost model adaptation performance, we propose a novel method called Attention-based Cross-layer Domain Alignment (ACDA), which captures the semantic relationship between the source and target domains across model layers and calibrates each level of semantic information automatically through a dynamic attention mechanism. An elaborate attention mechanism is designed to reweight each cross-layer pair based on their semantic similarity for precise domain alignment, effectively matching each level of semantic information during model adaptation. Extensive experiments on multiple benchmark datasets consistently show that the proposed method ACDA yields state-of-the-art performance.
Complete classification of steerability under local filters and its relation with measurement incompatibility

Quantum steering is the central resource for one-sided device-independent quantum information. It is manipulated via one-way local operations and classical communication, such as local filtering on the trusted party. Here, we provide a necessary and sufficient condition for a steering assemblage to be transformable into another one via local filtering. We characterize the equivalence classes with respect to filters in terms of the steering equivalent observables measurement assemblage (SEO), first proposed to connect the problem of steerability with measurement incompatibility. We provide an efficient method to compute the maximal extractable steerability via local filters and show that it coincides with the incompatibility of the SEO. Moreover, we show that there always exists a bipartite state that provides an assemblage with steerability equal to the incompatibility of the measurements on the untrusted party. Finally, we investigate the optimal success probability and rates for transformation protocols (distillation and dilution) in the single-shot scenario together with examples.
Differentially Private Federated Learning with Local Regularization and Sparsification

User-level differential privacy (DP) provides certifiable privacy guarantees to the information that is specific to any user's data in federated learning. Existing methods that ensure user-level DP come at the cost of severe accuracy decrease. In this paper, we study the cause of model performance degradation in federated learning with user-level DP guarantee. We find the key to solving this issue is to naturally restrict the norm of local updates before ex-ecuting operations that guarantee DP. To this end, we propose two techniques, Bounded Local Update Regularization and Local Update Sparsification, to increase model quality without sacrificing privacy. We provide theoretical analysis on the convergence of our framework and give rigorous privacy guarantees. Extensive experiments show that our framework significantly improves the privacy-utility trade-off over the state-of-the-arts for federated learning with user-level DP guarantee.
DRVC: A Framework of Any-to-Any Voice Conversion with Self-Supervised Learning

Any-to-any voice conversion problem aims to convert voices for source and target speakers, which are out of the training data. Previous works wildly utilize the disentangle-based models. The disentangle-based model assumes the speech consists of content and speaker style information and aims to untangle them to change the style information for conversion. Previous works focus on reducing the dimension of speech to get the content information. But the size is hard to determine to lead to the untangle overlapping problem. We propose the Disentangled Representation Voice Conversion (DRVC) model to address the issue. DRVC model is an end-to-end self-supervised model consisting of the content encoder, timbre encoder, and generator. Instead of the previous work for reducing speech size to get content, we propose a cycle for restricting the disentanglement by the Cycle Reconstruct Loss and Same Loss. The experiments show there is an improvement for converted speech on quality and voice similarity.
Educational Question Generation of Children Storybooks via Question Type Distribution Learning and Event-centric Summarization

Generating educational questions of fairytales or storybooks is vital for improving children's literacy ability.However, it is challenging to generate questions that capture the interesting aspects of a fairytale story with educational meaningfulness.In this paper, we propose a novel question generation method that first learns the question type distribution of an input story paragraph, and then summarizes salient events which can be used to generate high-cognitive-demand questions.To train the event-centric summarizer, we finetune a pre-trained transformer-based sequenceto-sequence model using silver samples composed by educational question-answer pairs.On a newly proposed educational questionanswering dataset FairytaleQA, we show good performance of our method on both automatic and human evaluation metrics.Our work indicates the necessity of decomposing question type distribution learning and event-centric summary generation for educational question generation.
Endpoint Detection for Streaming End-to-End Multi-Talker ASR

Streaming end-to-end multi-talker speech recognition aims at transcribing the overlapped speech from conversations or meetings with an all-neural model in a streaming fashion, which is fundamentally different from a modular-based approach that usually cascades the speech separation and the speech recognition models trained independently. Previously, we proposed the Streaming Unmixing and Recognition Transducer (SURT) model based on recurrent neural network transducer (RNN-T) for this problem and presented promising results. However, for real applications, the speech recognition system is also required to determine the times-tamp when a speaker finishes speaking for prompt system response. This problem, known as endpoint (EP) detection, has not been studied previously for multi-talker end-to-end models. In this work, we address the EP detection problem in the SURT framework by introducing an end-of-sentence token as an output unit, following the practice of single-talker end-to-end models. Furthermore, we also present a latency penalty approach that can significantly cut down the EP detection latency. Our experimental results based on the 2-speaker LibrispeechMix dataset show that the SURT model can achieve promising EP detection without significantly degradation of the recognition accuracy.
Enhancing and Dissecting Crowd Counting by Synthetic Data

In this article, we propose a simulated crowd counting dataset CrowdX, which has a large scale, accurate labeling, parameterized realization, and high fidelity. The experimental results of using this dataset as data enhancement show that the performance of the proposed streamlined and efficient benchmark network ESA-Net can be improved by 8.4%. The other two classic heterogeneous architectures MCNN and CSRNet pre-trained on CrowdX also show significant performance improvements. Considering many influencing factors determine performance, such as background, camera angle, human density, and resolution. Although these factors are important, there is still a lack of research on how they affect crowd counting. Thanks to the CrowdX dataset with rich annotation information, we conduct a large number of data-driven comparative experiments to analyze these factors. Our research provides a reference for a deeper understanding of the crowd counting problem and puts forward some useful suggestions in the actual deployment of the algorithm.
Multi-Agent Path Finding with Prioritized Communication Learning

Multi-agent pathfinding (MAPF) has been widely used to solve large-scale real-world problems, e.g., automation warehouses. The learning-based, fully decentralized framework has been introduced to alleviate real-time problems and simultaneously pursue optimal planning policy. However, existing methods might generate significantly more vertex conflicts (or collisions), which lead to a low success rate or more makespan. In this paper, we propose a PrIoritized COmmunication learning method (PICO), which incorporates the implicit planning priorities into the communication topology within the decentralized multi-agent reinforcement learning framework. Assembling with the classic coupled planners, the implicit priority learning module can be utilized to form the dynamic communication topology, which also builds an effective collision-avoiding mechanism. PICO performs significantly better in large-scale MAPF tasks in success rates and collision rates than state-of-the-art learning-based planners.
Precision radiotherapy via information integration of expert human knowledge and AI recommendation to optimize clinical decision making

In the precision medicine era, there is a growing need for precision radiotherapy where the planned radiation dose needs to be optimally determined by considering a myriad of patient-specific information in order to ensure treatment efficacy. Existing artificial-intelligence (AI) methods can recommend radiation dose prescriptions within the scope of this available information. However, treating physicians may not fully entrust the AI's recommended prescriptions due to known limitations or at instances when the AI recommendation may go beyond physicians' current knowledge. This paper lays out a systematic method to integrate expert human knowledge with AI recommendations for optimizing clinical decision making. Towards this goal, Gaussian process (GP) models are integrated with deep neural networks (DNNs) to quantify the uncertainty of the treatment outcomes given by physicians and AI recommendations, respectively, which are further used as a guideline to educate clinical physicians and improve AI models performance. The proposed method is demonstrated in a comprehensive dataset where patient-specific information and treatment outcomes are prospectively collected during radiotherapy of 67 non-small cell lung cancer (NSCLC) patients and are retrospectively analyzed.