Reviewerly/exHarmony huggingface dataset:
A Comparison of Pre-trained Vision-and-Language Models for Multimodal Representation Learning across Medical Images and Reports

Joint image-text embedding extracted from medical images and associated contextual reports is the bedrock for most biomedical vision-and-language (V+L) tasks, including medical visual question answering, clinical image-text retrieval, clinical report auto-generation. In this study, we adopt four pre-trained V+L models: LXMERT, VisualBERT, UNIER and PixelBERT to learn multimodal representation from MIMIC-CXR images and associated reports. External evaluation using the OpenI dataset shows that the joint embedding learned by pre-trained V+L models demonstrates performance improvement of 1.4% in thoracic finding classification tasks compared to a pioneering CNN+RNN model. Ablation studies are conducted to further analyze the contribution of certain model components and validate the advantage of joint embedding over text-only embedding. Attention maps are also visualized to illustrate the attention mechanism of V+L models.
Analyzing and mitigating data stalls in DNN training

Training Deep Neural Networks (DNNs) is resource-intensive and time-consuming. While prior research has explored many different ways of reducing DNN training time, the impact of input data pipeline , i.e., fetching raw data items from storage and performing data pre-processing in memory, has been relatively unexplored. This paper makes the following contributions: (1) We present the first comprehensive analysis of how the input data pipeline affects the training time of widely-used computer vision and audio Deep Neural Networks (DNNs), that typically involve complex data pre-processing. We analyze nine different models across three tasks and four datasets while varying factors such as the amount of memory, number of CPU threads, storage device, GPU generation etc on servers that are a part of a large production cluster at Microsoft. We find that in many cases, DNN training time is dominated by data stall time : time spent waiting for data to be fetched and pre-processed. (2) We build a tool, DS-Analyzer to precisely measure data stalls using a differential technique, and perform predictive what-if analysis on data stalls. (3) Finally, based on the insights from our analysis, we design and implement three simple but effective techniques in a data-loading library, CoorDL, to mitigate data stalls. Our experiments on a range of DNN tasks, models, datasets, and hardware configs show that when PyTorch uses CoorDL instead of the state-of-the-art DALI data loading library, DNN training time is reduced significantly (by as much as 5X on a single server).
Ten-Port Unitary Optical Processor on a Silicon Photonic Chip

Unitary optical processors (UOPs) are task-specific computing units that can ultimately enable ultrafast and energy-efficient unitary matrix-vector multiplications based on the interference between coherent optical beams. The UOP using multiport directional couplers (MDCs) holds great promise in large-scale integration because of its unique robustness against fabrication errors. Here, we demonstrate a 10-port robust UOP on a silicon photonic chip, which is so far the largest-scale UOP using multiport directional couplers. We further show the unique flexibility of this architecture by demonstrating operations for both the transverse electric (TE) and the transverse magnetic (TM) polarizations, which has never been realized in previous UOPs. This flexible and robust architecture is suitable for various scenarios in deep learning, optical communication, and quantum information processing.
A survey on personality-aware recommendation systems

With the emergence of personality computing as a new research field related to artificial intelligence and personality psychology, we have witnessed an unprecedented proliferation of personality-aware recommendation systems. Unlike conventional recommendation systems, these new systems solve traditional problems such as the cold start and data sparsity problems. This survey aims to study and systematically classify personality-aware recommendation systems. To the best of our knowledge, this survey is the first that focuses on personality-aware recommendation systems. We explore the different design choices of personality-aware recommendation systems, by comparing their personality modeling methods, as well as their recommendation techniques. Furthermore, we present the commonly used datasets and point out some of the challenges of personality-aware recommendation systems.
Graph Drawing by Stochastic Gradient Descent

A popular method of force-directed graph drawing is multidimensional scaling using graph-theoretic distances as input. We present an algorithm to minimize its energy function, known as stress, by using stochastic gradient descent (SGD) to move a single pair of vertices at a time. Our results show that SGD can reach lower stress levels faster and more consistently than majorization, without needing help from a good initialization. We then show how the unique properties of SGD make it easier to produce constrained layouts than previous approaches. We also show how SGD can be directly applied within the sparse stress approximation of Ortmann et al. [1], making the algorithm scalable up to large graphs.
New entanglement-assisted MDS quantum codes from constacyclic codes

Construction of good quantum codes via classical codes is an important task for quantum information and quantum computing. In this work, by virtue of a decomposition of the defining set of constacyclic codes we have constructed eight new classes of entanglement-assisted quantum maximum distance separable codes.
Nasal cytology with deep learning techniques

In recent years, cytological observations in the Rhinology field are being increasingly utilized. This development has taken place over the last two decades and has proven to be fundamental in defining new nosological entities and in driving changes in the previous classification of rhinitis. The simplicity of the technique and its low invasiveness make nasal cytology a practical diagnostic tool for all rhino-allergology services. Furthermore, since it allows the monitoring of responses to treatment, this method plays an important role in guiding a more effective and less expensive diagnostic program. Microscopic observation requires prolonged effort by a specialist, but the modern scanning systems for cytological preparations and the new affordable digital microscopes allow to design a software support system, based on deep learning techniques, to relieve specialist’s tiring activity. By means of the system presented in this paper, it is possible to automatically identify and classify cells present on a nasal cytological preparation based on a digital image of the preparation itself. Thus, an interesting diagnostic support has been made available to the rhino-cytologist, who can quickly verify that the cells have been correctly classified by the software system: any few unclassified or incorrectly classified cells can be quickly sorted by the specialist itself, then one or more diagnosis can be suggested by this system, taking into consideration also the anamnesis of each patient. The final diagnosis can be defined by the specialist, also based on the result of the prick test and the observation of the nasal cavity. In the system presented herein, image processing and image segmentation techniques have been used to find images of cellular elements within the preparation. Cell classification is based on a convolutional neural network composed of three blocks of main layers. Cell identification (first step, image segmentation) exhibits sensitivity greater than 97%, while cell classification (second step, seven cytotypes) attained a mean accuracy of approximately 99% on the test set and 94% on the validation set. This complete system supports clinicians in the preparation of a rhino-cytogram report.
Complexity-Weighted Loss and Diverse Reranking for Sentence Simplification

Reno Kriz, João Sedoc, Marianna Apidianaki, Carolina Zheng, Gaurav Kumar, Eleni Miltsakaki, Chris Callison-Burch. Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers). 2019.
Super-Resolution via Image-Adapted Denoising CNNs: Incorporating External and Internal Learning

While deep neural networks exhibit state-of-the-art results in the task of image super-resolution (SR) with a fixed known acquisition process (e.g., a bicubic downscaling kernel), they experience a huge performance loss when the real observation model mismatches the one used in training. Recently, two different techniques suggested to mitigate this deficiency, i.e., enjoy the advantages of deep learning without being restricted by the training phase. The first one follows the plug-and-play (P&P) approach that solves general inverse problems (e.g., SR) by using Gaussian denoisers for handling the prior term in model-based optimization schemes. The second builds on internal recurrence of information inside a single image, and trains a super-resolver network at test time on examples synthesized from the low-resolution image. Our letter incorporates these two independent strategies, enjoying the impressive generalization capabilities of deep learning, captured by the first, and further improving it through internal learning at test time. First, we apply a recent P&P strategy to SR. Then, we show how it may become image-adaptive in test time. This technique outperforms the above two strategies on popular datasets and gives better results than other state-of-the-art methods in practical cases where the observation model is inexact or unknown in advance.
SANAD: Single-label Arabic News Articles Dataset for automatic text categorization

Text Classification is one of the most popular Natural Language Processing (NLP) tasks. Text classification (aka categorization) is an active research topic in recent years. However, much less attention was directed towards this task in Arabic, due to the lack of rich representative resources for training an Arabic text classifier. Therefore, we introduce a large Single-labeled Arabic News Articles Dataset (SANAD) of textual data collected from three news portals. The dataset is a large one consisting of almost 200k articles distributed into seven categories that we offer to the research community on Arabic computational linguistics. We anticipate that this rich dataset would make a great aid for a variety of NLP tasks on Modern Standard Arabic (MSA) textual data, especially for single label text classification purposes. We present the data in raw form. SANAD is composed of three main datasets scraped from three news portals, which are AlKhaleej, AlArabiya, and Akhbarona. SANAD is made public and freely available at https://data.mendeley.com/datasets/57zpx667y9.
Quantum Semiparametric Estimation

A new analysis offers a way to derive relatively simple analytical limits on quantum measurements even for complex or poorly understood systems, with applications in imaging, interferometry, and quantum-information processing.
Clustering-based undersampling with random over sampling examples and support vector machine for imbalanced classification of breast cancer diagnosis

To overcome the two-class imbalanced classification problem existing in the diagnosis of breast cancer, a hybrid of Random Over Sampling Example, K-means and Support vector machine (RK-SVM) model is proposed which is based on sample selection. Random Over Sampling Example (ROSE) is utilized to balance the dataset and further improve the diagnosis accuracy by Support Vector Machine (SVM). As there is one different sample selection factor via clustering that encourages selecting the samples near the class boundary. The purpose of clustering here is to reduce the risk of removing useful samples and improve the efficiency of sample selection. To test the performance of the new hybrid classifier, it is implemented on breast cancer datasets and the other three datasets from the University of California Irvine (UCI) machine learning repository, which are commonly used datasets in class imbalanced learning. The extensive experimental results show that our proposed hybrid method outperforms most of the competitive algorithms in term of G-mean and accuracy indices. Additionally, experimental results show that this method also performs superiorly for binary problems.
Application of the Resource Theory of Channels to Communication Scenarios

We introduce a resource theory of channels relevant to communication via quantum channels, in which the set of constant channels-useless channels for communication tasks-are considered as free resources. We find that our theory with such a simple structure is useful to address central problems in quantum Shannon theory-in particular, we provide a converse bound for the one-shot nonsignaling assisted classical capacity that naturally leads to its strong converse property, as well as obtain the one-shot channel simulation cost with nonsignaling assistance. We clarify an intimate connection between the nonsignaling assistance and our formalism by identifying the nonsignaling assisted channel coding with the channel transformation under the maximal set of resource nongenerating superchannels, providing a physical characterization of the latter. Our results provide new perspectives and concise arguments to those problems, connecting the recently developed fields of resource theories to "classic" settings in quantum information theory and shedding light on the validity of resource theories of channels as effective tools to address practical problems.
Sending classical information via three noisy channels in superposition of causal orders

In this work, we study the transmission of classical information through three completely depolarizing channels in superposition of different causal orders. We exploit the quantum 3-switch as a resource for classical communication. We perform a kind of quantum control that was not accessible to the previously treated two-channel case. The fine and full quantum control achieved using selected combinations of causal orders let us uncover several features: nonmonotonous behavior on the transmission of information with respect to the number of causal orders involved, and different values of the transmission of information depending on the specific combinations of causal orders considered. Our results are a stepping stone to assess the efficiency of coherent quantum control and optimize resources in the implementation of indefinite causal structures. Finally, we suggest an optical implementation using standard telecom technology to test our predictions.
Quantum noise protects quantum classifiers against adversaries

Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. However, noise has often played beneficial roles, from enhancing weak signals in stochastic resonance to protecting the privacy of data in differential privacy. It is then natural to ask, can we harness the power of quantum noise that is beneficial to quantum computing? An important current direction for quantum computing is its application to machine learning, such as classification problems. One outstanding problem in machine learning for classification is its sensitivity to adversarial examples. These are small, undetectable perturbations from the original data where the perturbed data is completely misclassified in otherwise extremely accurate classifiers. They can also be considered as `worst-case' perturbations by unknown noise sources. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived where the robustness improves with increasing noise. This robustness property is intimately connected with an important security concept called differential privacy which can be extended to quantum differential privacy. For the protection of quantum data, this is the first quantum protocol that can be used against the most general adversaries. Furthermore, we show how the robustness in the classical case can be sensitive to the details of the classification model, but in the quantum case the details of classification model are absent, thus also providing a potential quantum advantage for classical data that is independent of quantum speedups. This opens the opportunity to explore other ways in which quantum noise can be used in our favour, as well as identifying other ways quantum algorithms can be helpful that is independent of quantum speedups.
Operational entanglement of symmetry-protected topological edge states

The authors explore the connection between symmetry-protected topological edge states and the amount of operational entanglement that can be transferred to a quantum register, and show that the build-up of entanglement can be inferred from particle number spectroscopy alone.
Collaborative Self-Attention Network for Session-based Recommendation

Session-based recommendation becomes a research hotspot for its ability to make recommendations for anonymous users. However, existing session-based methods have the following limitations: (1) They either lack the capability to learn complex dependencies or focus mostly on the current session without explicitly considering collaborative information. (2) They assume that the representation of an item is static and fixed for all users at each time step. We argue that even the same item can be represented differently for different users at the same time step. To this end, we propose a novel solution, Collaborative Self-Attention Network (CoSAN) for session-based recommendation, to learn the session representation and predict the intent of the current session by investigating neighborhood sessions. Specially, we first devise a collaborative item representation by aggregating the embedding of neighborhood sessions retrieved according to each item in the current session. Then, we apply self-attention to learn long-range dependencies between collaborative items and generate collaborative session representation. Finally, each session is represented by concatenating the collaborative session representation and the embedding of the current session. Extensive experiments on two real-world datasets show that CoSAN constantly outperforms state-of-the-art methods.
DCTRGAN: improving the precision of generative models with reweighting

Significant advances in deep learning have led to more widely used and precise neural network-based generative models such as Generative Adversarial Networks (GANs). We introduce a post-hoc correction to deep generative models to further improve their fidelity, based on the Deep neural networks using the Classification for Tuning and Reweighting (DCTR) protocol. The correction takes the form of a reweighting function that can be applied to generated examples when making predictions from the simulation. We illustrate this approach using GANs trained on standard multimodal probability densities as well as calorimeter simulations from high energy physics. We show that the weighted GAN examples significantly improve the accuracy of the generated samples without a large loss in statistical power. This approach could be applied to any generative model and is a promising refinement method for high energy physics applications and beyond.
Are Labels Necessary for Neural Architecture Search?

Existing neural network architectures in computer vision—whether designed by humans or by machines—were typically found using both images and their associated labels. In this paper, we ask the question: can we find high-quality neural architectures using only images, but no human-annotated labels? To answer this question, we first define a new setup called Unsupervised Neural Architecture Search (UnNAS). We then conduct two sets of experiments. In sample-based experiments, we train a large number (500) of diverse architectures with either supervised or unsupervised objectives, and find that the architecture rankings produced with and without labels are highly correlated. In search-based experiments, we run a well-established NAS algorithm (DARTS) using various unsupervised objectives, and report that the architectures searched without labels can be competitive to their counterparts searched with labels. Together, these results reveal the potentially surprising finding that labels are not necessary, and the image statistics alone may be sufficient to identify good neural architectures.
Dynamical resource theory of quantum coherence

In this work, a resource theory of classical channels is developed. The authors examine the worst-case scenario of uploading and downloading quantum information from a cloud quantum computer. All quantum channels are true resources for quantum information processing, including the identity channel which preserves coherence
Intelligent Health Care: Applications of Deep Learning in Computational Medicine

With the progress of medical technology, biomedical field ushered in the era of big data, based on which and driven by artificial intelligence technology, computational medicine has emerged. People need to extract the effective information contained in these big biomedical data to promote the development of precision medicine. Traditionally, the machine learning methods are used to dig out biomedical data to find the features from data, which generally rely on feature engineering and domain knowledge of experts, requiring tremendous time and human resources. Different from traditional approaches, deep learning, as a cutting-edge machine learning branch, can automatically learn complex and robust feature from raw data without the need for feature engineering. The applications of deep learning in medical image, electronic health record, genomics, and drug development are studied, where the suggestion is that deep learning has obvious advantage in making full use of biomedical data and improving medical health level. Deep learning plays an increasingly important role in the field of medical health and has a broad prospect of application. However, the problems and challenges of deep learning in computational medical health still exist, including insufficient data, interpretability, data privacy, and heterogeneity. Analysis and discussion on these problems provide a reference to improve the application of deep learning in medical health.
Generalize then Adapt: Source-Free Domain Adaptive Semantic Segmentation

Unsupervised domain adaptation (DA) has gained substantial interest in semantic segmentation. However, almost all prior arts assume concurrent access to both labeled source and unlabeled target, making them unsuitable for scenarios demanding source-free adaptation. In this work <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> , we enable source-free DA by partitioning the task into two: a) source-only domain generalization and b) source-free target adaptation. Towards the former, we provide theoretical insights to develop a multi-head framework trained with a virtually extended multi-source dataset, aiming to balance generalization and specificity. Towards the latter, we utilize the multi-head framework to extract reliable target pseudo-labels for self-training. Additionally, we introduce a novel conditional prior-enforcing auto-encoder that discourages spatial irregularities, thereby enhancing the pseudo-label quality. Experiments on the standard GTA5→Cityscapes and SYNTHIA→Cityscapes benchmarks show our superiority even against the non-source-free prior-arts. Further, we show our compatibility with online adaptation enabling deployment in a sequentially changing environment.