Africa
Iteratively Pruned Deep Learning Ensembles for COVID-19 Detection in Chest X-rays
Rajaraman, Sivaramakrishnan, Siegelman, Jen, Alderson, Philip O., Folio, Lucas S., Folio, Les R., Antani, Sameer K.
We demonstrate use of iteratively pruned deep learning model ensembles for detecting pulmonary manifestation of COVID-19 with chest X-rays. This disease is caused by the novel Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-CoV-2) virus, also known as the novel Coronavirus (2019-nCoV). A custom convolutional neural network and a selection of ImageNet pretrained models are trained and evaluated at patient-level on publicly available CXR collections to learn modality-specific feature representations. The learned knowledge is transferred and fine-tuned to improve performance and generalization in the related task of classifying CXRs as normal, showing bacterial pneumonia, or COVID-19-viral abnormalities. The best performing models are iteratively pruned to reduce complexity and improve memory efficiency. The predictions of the best-performing pruned models are combined through different ensemble strategies to improve classification performance. Empirical evaluations demonstrate that the weighted average of the best-performing pruned models significantly improves performance resulting in an accuracy of 99.01% and area under the curve of 0.9972 in detecting COVID-19 findings on CXRs. The combined use of modality-specific knowledge transfer, iterative model pruning, and ensemble learning resulted in improved predictions. We expect that this model can be quickly adopted for COVID-19 screening using chest radiographs.
Subspace Clustering for Action Recognition with Covariance Representations and Temporal Pruning
Paoletti, Giancarlo, Cavazza, Jacopo, Beyan, Cigdem, Del Bue, Alessio
Despite the fact that subspace clustering has become a powerful Given a trimmed sequence, in which a single action or activity technique for problems such as face clustering or digit is assumed to be present, the final goal of HAR is to correctly recognition, its applicability to the problems like skeletonbased classifying it. Although significant progresses have been made HAR was only explored by a limited number of works in the last years, accurate action recognition in videos is still a [7], [8], [9]. This is due to many operative limitations including challenging task because of the complexity of the visual data how to handle the temporal dimensions, the inherent noise e.g., due to varying camera viewpoints, occlusions and abrupt present in the skeletal data and the related computational changes in lighting conditions.
A Survey on Machine Reading Comprehension: Tasks, Evaluation Metrics, and Benchmark Datasets
Zeng, Chengchang, Li, Shaobo, Li, Qin, Hu, Jie, Hu, Jianjun
Machine Reading Comprehension (MRC) is a challenging NLP research field with wide real world applications. The great progress of this field in recent years is mainly due to the emergence of large-scale datasets and deep learning. At present, a lot of MRC models have already surpassed the human performance on many datasets despite the obvious giant gap between existing MRC models and genuine human-level reading comprehension. This shows the need of improving existing datasets, evaluation metrics and models to move the MRC models toward 'real' understanding. To address this lack of comprehensive survey of existing MRC tasks, evaluation metrics and datasets, herein, (1) we analyzed 57 MRC tasks and datasets; proposed a more precise classification method of MRC tasks with 4 different attributes (2) we summarized 9 evaluation metrics of MRC tasks and (3) 7 attributes and 10 characteristics of MRC datasets; (4) We also discussed some open issues in MRC research and highlight some future research directions. In addition, to help the community, we have collected, organized, and published our data on a companion website(https://mrc-datasets.github.io/) where MRC researchers could directly access each MRC dataset, papers, baseline projects and browse the leaderboard.
Spatio-Temporal Tensor Sketching via Adaptive Sampling
Ma, Jing, Zhang, Qiuchen, Ho, Joyce C., Xiong, Li
Mining massive spatio-temporal data can help a variety of real-world applications such as city capacity planning, event management, and social network analysis. The tensor representation can be used to capture the correlation between space and time and simultaneously exploit the latent structure of the spatial and temporal patterns in an unsupervised fashion. However, the increasing volume of spatio-temporal data has made it prohibitively expensive to store and analyze using tensor factorization. In this paper, we propose SkeTenSmooth, a novel tensor factorization framework that uses adaptive sampling to compress the tensor in a temporally streaming fashion and preserves the underlying global structure. SkeTenSmooth adaptively samples incoming tensor slices according to the detected data dynamics. Thus, the sketches are more representative and informative of the tensor dynamic patterns. In addition, we propose a robust tensor factorization method that can deal with the sketched tensor and recover the original patterns. Experiments on the New York City Yellow Taxi data show that SkeTenSmooth greatly reduces the memory cost and outperforms random sampling and fixed rate sampling method in terms of retaining the underlying patterns.
On Optimism in Model-Based Reinforcement Learning
Pacchiano, Aldo, Ball, Philip, Parker-Holder, Jack, Choromanski, Krzysztof, Roberts, Stephen
The principle of optimism in the face of uncertainty is prevalent throughout sequential decision making problems such as multi-armed bandits and reinforcement learning (RL), often coming with strong theoretical guarantees. However, it remains a challenge to scale these approaches to the deep RL paradigm, which has achieved a great deal of attention in recent years. In this paper, we introduce a tractable approach to optimism via noise augmented Markov Decision Processes (MDPs), which we show can obtain a competitive regret bound: $\tilde{\mathcal{O}}( |\mathcal{S}|H\sqrt{|\mathcal{S}||\mathcal{A}| T } )$ when augmenting using Gaussian noise, where $T$ is the total number of environment steps. This tractability allows us to apply our approach to the deep RL setting, where we rigorously evaluate the key factors for success of optimistic model-based RL algorithms, bridging the gap between theory and practice.
Deep Polynomial Neural Networks
Chrysos, Grigorios, Moschoglou, Stylianos, Bouritsas, Giorgos, Deng, Jiankang, Panagakis, Yannis, Zafeiriou, Stefanos
Deep Convolutional Neural Networks (DCNNs) are currently the method of choice both for generative, as well as for discriminative learning in computer vision and machine learning. The success of DCNNs can be attributed to the careful selection of their building blocks (e.g., residual blocks, rectifiers, sophisticated normalization schemes, to mention but a few). In this paper, we propose $\Pi$-Nets, a new class of DCNNs. $\Pi$-Nets are polynomial neural networks, i.e., the output is a high-order polynomial of the input. The unknown parameters, which are naturally represented by high-order tensors, are estimated through a collective tensor factorization with factors sharing. We introduce three tensor decompositions that significantly reduce the number of parameters and show how they can be efficiently implemented by hierarchical neural networks. We empirically demonstrate that $\Pi$-Nets are very expressive and they even produce good results without the use of non-linear activation functions in a large battery of tasks and signals, i.e., images, graphs, and audio. When used in conjunction with activation functions, $\Pi$-Nets produce state-of-the-art results in three challenging tasks, i.e. image generation, face verification and 3D mesh representation learning.
Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization
Khaled, Ahmed, Sebbouh, Othmane, Loizou, Nicolas, Gower, Robert M., Richtรกrik, Peter
We present a unified theorem for the convergence analysis of stochastic gradient algorithms for minimizing a smooth and convex loss plus a convex regularizer. We do this by extending the unified analysis of Gorbunov, Hanzely \& Richt\'arik (2020) and dropping the requirement that the loss function be strongly convex. Instead, we only rely on convexity of the loss function. Our unified analysis applies to a host of existing algorithms such as proximal SGD, variance reduced methods, quantization and some coordinate descent type methods. For the variance reduced methods, we recover the best known convergence rates as special cases. For proximal SGD, the quantization and coordinate type methods, we uncover new state-of-the-art convergence rates. Our analysis also includes any form of sampling and minibatching. As such, we are able to determine the minibatch size that optimizes the total complexity of variance reduced methods. We showcase this by obtaining a simple formula for the optimal minibatch size of two variance reduced methods (\textit{L-SVRG} and \textit{SAGA}). This optimal minibatch size not only improves the theoretical total complexity of the methods but also improves their convergence in practice, as we show in several experiments.
The global AI agenda: The Middle East and Africa
The Middle East and Africa are unique settings for AI, compared to Western regions--and to each other. The wealthier Gulf Cooperation Council (GCC) nations are exploring AI as part of broad economic transformation plans to wean themselves from oil and reinvest surpluses into innovation, while in Africa, above and below the Sahara, AI efforts are more bottom-up, often through partnerships with global tech companies and local startups, tackling social challenges including health care and food security.
How scientists are using supercomputers to combat COVID-19
Alongside the White House Office of Science and Technology Policy (OSTP), IBM announced in March that it would help coordinate an effort to provide hundreds of petaflops of compute to scientists researching the coronavirus. As part of the newly launched COVID-19 High Performance Computing (HPC) Consortium, IBM pledged to assist in evaluating proposals and to provide access to resources for projects that "make the most immediate impact." Much work remains, but some of the Consortium's most prominent members -- among them Microsoft, Intel, and Nvidia -- claim that progress is being made. Powerful computers allow researchers to undertake high volumes of calculations in epidemiology, bioinformatics, and molecular modeling, many of which would take months on traditional computing platforms (or years if done by hand). Moreover, because the computers are available in the cloud, they enable teams to collaborate from anywhere in the world. Insights generated by the experiments can help advance our understanding of key aspects of COVID-19, such as viral-human interaction, viral structure and function, small molecule design, drug repurposing, and patient trajectory and outcomes.
How AI Will Transform Healthcare In Developing Regions -- AI Daily - Artificial Intelligence News
With all the buzz surrounding artificial intelligence, it is so important that we roll out our technologies and toolkits to bring global healthcare forward. From surveillance of cases to the progression of mutative strains (perhaps more relevant to viruses), it is no doubt that many parts of the world have leaps and bounds to make in improvement, as highlighted in our COVID-19 pandemic. Even though we are still using age-old methods such as quarantining to this day, it is no doubt that AI could play a fundamental part in our future technologies to combat the next viral arrival. However, there must be a great deal of caution in the ethics of deploying AI toolkits on demographics that vary greatly from those used in the training dataset. How we can get a rapid solution to this conundrum will be paramount in helping developing regions catch up with the west.