pwc-archive/papers-with-abstracts huggingface dataset:
Changing Clusters of Indian States with respect to number of Cases of COVID-19 using incrementalKMN Method
Authors: Rabinder Kumar Prasad, Rosy Sarmah, Subrata Chakraborty
Date: 2020-07-12 00:00:00
Tasks: Clustering

The novel Coronavirus (COVID-19) incidence in India is currently experiencing exponential rise but with apparent spatial variation in growth rate and doubling time rate. We classify the states into five clusters with low to the high-risk category and study how the different states moved from one cluster to the other since the onset of the first case on $30^{th}$ January 2020 till the end of unlock 1 that is $30^{th}$ June 2020. We have implemented a new clustering technique called the incrementalKMN (Prasad, R. K., Sarmah, R., Chakraborty, S.(2019))
Self-Supervised Drivable Area and Road Anomaly Segmentation using RGB-D Data for Robotic Wheelchairs
Authors: Hengli Wang, Yuxiang Sun, Ming Liu
Date: 2020-07-12 00:00:00
Tasks: Anomaly Segmentation, Autonomous Navigation, Segmentation, Self-Supervised Learning, Semantic Segmentation

The segmentation of drivable areas and road anomalies are critical capabilities to achieve autonomous navigation for robotic wheelchairs. The recent progress of semantic segmentation using deep learning techniques has presented effective results. However, the acquisition of large-scale datasets with hand-labeled ground truth is time-consuming and labor-intensive, making the deep learning-based methods often hard to implement in practice. We contribute to the solution of this problem for the task of drivable area and road anomaly segmentation by proposing a self-supervised learning approach. We develop a pipeline that can automatically generate segmentation labels for drivable areas and road anomalies. Then, we train RGB-D data-based semantic segmentation neural networks and get predicted labels. Experimental results show that our proposed automatic labeling pipeline achieves an impressive speed-up compared to manual labeling. In addition, our proposed self-supervised approach exhibits more robust and accurate results than the state-of-the-art traditional algorithms as well as the state-of-the-art self-supervised algorithms.
Dual Adversarial Network: Toward Real-world Noise Removal and Noise Generation
Authors: Zongsheng Yue, Qian Zhao, Lei Zhang, Deyu Meng
Date: 2020-07-12 00:00:00
Proceeding: ECCV 2020 8
Tasks: Denoising, Image Denoising, Noise Estimation

Real-world image noise removal is a long-standing yet very challenging task in computer vision. The success of deep neural network in denoising stimulates the research of noise generation, aiming at synthesizing more clean-noisy image pairs to facilitate the training of deep denoisers. In this work, we propose a novel unified framework to simultaneously deal with the noise removal and noise generation tasks. Instead of only inferring the posteriori distribution of the latent clean image conditioned on the observed noisy image in traditional MAP framework, our proposed method learns the joint distribution of the clean-noisy image pairs. Specifically, we approximate the joint distribution with two different factorized forms, which can be formulated as a denoiser mapping the noisy image to the clean one and a generator mapping the clean image to the noisy one. The learned joint distribution implicitly contains all the information between the noisy and clean images, avoiding the necessity of manually designing the image priors and noise assumptions as traditional. Besides, the performance of our denoiser can be further improved by augmenting the original training dataset with the learned generator. Moreover, we propose two metrics to assess the quality of the generated noisy image, for which, to the best of our knowledge, such metrics are firstly proposed along this research line. Extensive experiments have been conducted to demonstrate the superiority of our method over the state-of-the-arts both in the real noise removal and generation tasks. The training and testing code is available at https://github.com/zsyOAOA/DANet.
On the generalization of Tanimoto-type kernels to real valued functions
Authors: Sandor Szedmak, Eric Bach
Date: 2020-07-12 00:00:00
Tasks: Vocal Bursts Type Prediction

The Tanimoto kernel (Jaccard index) is a well known tool to describe the similarity between sets of binary attributes. It has been extended to the case when the attributes are nonnegative real values. This paper introduces a more general Tanimoto kernel formulation which allows to measure the similarity of arbitrary real-valued functions. This extension is constructed by unifying the representation of the attributes via properly chosen sets. After deriving the general form of the kernel, explicit feature representation is extracted from the kernel function, and a simply way of including general kernels into the Tanimoto kernel is shown. Finally, the kernel is also expressed as a quotient of piecewise linear functions, and a smooth approximation is provided.
Fruit classification using deep feature maps in the presence of deceptive similar classes
Authors: Mohit Dandekar, Narinder Singh Punn, Sanjay Kumar Sonbhadra, Sonali Agarwal
Date: 2020-07-12 00:00:00
Tasks: Classification, General Classification

Autonomous detection and classification of objects are admired area of research in many industrial applications. Though, humans can distinguish objects with high multi-granular similarities very easily; but for the machines, it is a very challenging task. The convolution neural networks (CNN) have illustrated efficient performance in multi-level representations of objects for classification. Conventionally, the existing deep learning models utilize the transformed features generated by the rearmost layer for training and testing. However, it is evident that this does not work well with multi-granular data, especially, in presence of deceptive similar classes (almost similar but different classes). The objective of the present research is to address the challenge of classification of deceptively similar multi-granular objects with an ensemble approach thfat utilizes activations from multiple layers of CNN (deep features). These multi-layer activations are further utilized to build multiple deep decision trees (known as Random forest) for classification of objects with similar appearance. The Fruits-360 dataset is utilized for evaluation of the proposed approach. With extensive trials it was observed that the proposed model outperformed over the conventional deep learning approaches.
Adversarial Self-Supervised Learning for Semi-Supervised 3D Action Recognition
Authors: Chenyang Si, Xuecheng Nie, Wei Wang, Liang Wang, Tieniu Tan, Jiashi Feng
Date: 2020-07-12 00:00:00
Proceeding: ECCV 2020 8
Tasks: 3D Action Recognition, Action Recognition, Self-Supervised Learning

We consider the problem of semi-supervised 3D action recognition which has been rarely explored before. Its major challenge lies in how to effectively learn motion representations from unlabeled data. Self-supervised learning (SSL) has been proved very effective at learning representations from unlabeled data in the image domain. However, few effective self-supervised approaches exist for 3D action recognition, and directly applying SSL for semi-supervised learning suffers from misalignment of representations learned from SSL and supervised learning tasks. To address these issues, we present Adversarial Self-Supervised Learning (ASSL), a novel framework that tightly couples SSL and the semi-supervised scheme via neighbor relation exploration and adversarial learning. Specifically, we design an effective SSL scheme to improve the discrimination capability of learned representations for 3D action recognition, through exploring the data relations within a neighborhood. We further propose an adversarial regularization to align the feature distributions of labeled and unlabeled samples. To demonstrate effectiveness of the proposed ASSL in semi-supervised 3D action recognition, we conduct extensive experiments on NTU and N-UCLA datasets. The results confirm its advantageous performance over state-of-the-art semi-supervised methods in the few label regime for 3D action recognition.
Data-Efficient Reinforcement Learning with Self-Predictive Representations
Authors: Max Schwarzer, Ankesh Anand, Rishab Goel, R. Devon Hjelm, Aaron Courville, Philip Bachman
Date: 2020-07-12 00:00:00
Proceeding: ICLR 2021 1
Tasks: Atari Games 100k, Data Augmentation, Deep Reinforcement Learning, Future prediction, General Reinforcement Learning, reinforcement-learning, Reinforcement Learning, Reinforcement Learning (RL), Self-Supervised Learning

While deep reinforcement learning excels at solving tasks where large amounts of data can be collected through virtually unlimited interaction with the environment, learning from limited interaction remains a key challenge. We posit that an agent can learn more efficiently if we augment reward maximization with self-supervised objectives based on structure in its visual input and sequential interaction with the environment. Our method, Self-Predictive Representations(SPR), trains an agent to predict its own latent state representations multiple steps into the future. We compute target representations for future states using an encoder which is an exponential moving average of the agent's parameters and we make predictions using a learned transition model. On its own, this future prediction objective outperforms prior methods for sample-efficient deep RL from pixels. We further improve performance by adding data augmentation to the future prediction loss, which forces the agent's representations to be consistent across multiple views of an observation. Our full self-supervised objective, which combines future prediction and data augmentation, achieves a median human-normalized score of 0.415 on Atari in a setting limited to 100k steps of environment interaction, which represents a 55% relative improvement over the previous state-of-the-art. Notably, even in this limited data regime, SPR exceeds expert human scores on 7 out of 26 games. The code associated with this work is available at https://github.com/mila-iqia/spr
India's rank and global share in scientific research -- how publication counting method and subject selection can vary the outcomes
Authors: Vivek Kumar Singh, Parveen Arora, Ashraf Uddin, Sujit Bhattacharya
Date: 2020-07-12 00:00:00

During the last two decades, India has emerged as a major knowledge producer in the world, however different reports put it at different ranks, varying from 3rd to 9th places. The recent commissioned study reports of Department of Science and Technology (DST) done by Elsevier and Clarivate Analytics, rank India at 5thand 9th places, respectively. On the other hand, an independent report by National Science Foundation (NSF) of United States (US), ranks India at 3rd place on research output in Science and Engineering area. Interestingly, both, the Elsevier and the NSF reports use Scopus data, and yet surprisingly their outcomes are different. This article, therefore, attempts to investigate as to how the use of same database can still produce different outcomes, due to differences in methodological approaches. The publication counting method used and the subject selection approach are the two main exogenous factors identified to cause these variations. The implications of the analytical outcomes are discussed with special focus on policy perspectives.
India's rank and global share in scientific research -- how data sourced from different databases can produce varying outcomes
Authors: Prashasti Singh, Vivek Kumar Singh, Parveen Arora, Sujit Bhattacharya
Date: 2020-07-12 00:00:00

India is emerging as a major knowledge producer of the world in terms of proportionate share of global research output and the overall research productivity rank. Many recent reports, both of commissioned studies from Government of India as well as independent international agencies, show India at different ranks of global research productivity (variations as large as from 3rd to 9th place). The paper examines this contradiction; tries to analyse as to why different reports places India at different ranks and what may be the reasons thereof. The research output data for India, along with the ten most productive countries in the world, is analysed from three major scholarly databases: Web of Science, Scopus and Dimensions for this purpose. Results show that both, the endogenous factors (such as database coverage variation and different subject classification schemes) and the exogenous factors (such as subject selection and publication counting methodology) cause the variations in different reports. This paper reports first part of the analysis, focusing mainly on variations due to use of data from different databases. The policy implications of the study are also discussed.
The ASRU 2019 Mandarin-English Code-Switching Speech Recognition Challenge: Open Datasets, Tracks, Methods and Results
Authors: Xian Shi, Qiangze Feng, Lei Xie
Date: 2020-07-12 00:00:00
Tasks: Data Augmentation, Language Identification, speech-recognition, Speech Recognition

Code-switching (CS) is a common phenomenon and recognizing CS speech is challenging. But CS speech data is scarce and there' s no common testbed in relevant research. This paper describes the design and main outcomes of the ASRU 2019 Mandarin-English code-switching speech recognition challenge, which aims to improve the ASR performance in Mandarin-English code-switching situation. 500 hours Mandarin speech data and 240 hours Mandarin-English intra-sentencial CS data are released to the participants. Three tracks were set for advancing the AM and LM part in traditional DNN-HMM ASR system, as well as exploring the E2E models' performance. The paper then presents an overview of the results and system performance in the three tracks. It turns out that traditional ASR system benefits from pronunciation lexicon, CS text generating and data augmentation. In E2E track, however, the results highlight the importance of using language identification, building-up a rational set of modeling units and spec-augment. The other details in model training and method comparsion are discussed.
Two-Stream Deep Feature Modelling for Automated Video Endoscopy Data Analysis
Authors: Harshala Gammulle, Simon Denman, Sridha Sridharan, Clinton Fookes
Date: 2020-07-12 00:00:00
Tasks: Diagnostic, Vocal Bursts Valence Prediction

Automating the analysis of imagery of the Gastrointestinal (GI) tract captured during endoscopy procedures has substantial potential benefits for patients, as it can provide diagnostic support to medical practitioners and reduce mistakes via human error. To further the development of such methods, we propose a two-stream model for endoscopic image analysis. Our model fuses two streams of deep feature inputs by mapping their inherent relations through a novel relational network model, to better model symptoms and classify the image. In contrast to handcrafted feature-based models, our proposed network is able to learn features automatically and outperforms existing state-of-the-art methods on two public datasets: KVASIR and Nerthus. Our extensive evaluations illustrate the importance of having two streams of inputs instead of a single stream and also demonstrates the merits of the proposed relational network architecture to combine those streams.
Robust Learning of Mixtures of Gaussians
Authors: Daniel M. Kane
Date: 2020-07-12 00:00:00

We resolve one of the major outstanding problems in robust statistics. In particular, if $X$ is an evenly weighted mixture of two arbitrary $d$-dimensional Gaussians, we devise a polynomial time algorithm that given access to samples from $X$ an $\eps$-fraction of which have been adversarially corrupted, learns $X$ to error $\poly(\eps)$ in total variation distance.
Graph Factorization Machines for Cross-Domain Recommendation
Authors: Dongbo Xi, Fuzhen Zhuang, Yongchun Zhu, Pengpeng Zhao, Xiangliang Zhang, Qing He
Date: 2020-07-12 00:00:00
Tasks: Recommendation Systems

Recently, graph neural networks (GNNs) have been successfully applied to recommender systems. In recommender systems, the user's feedback behavior on an item is usually the result of multiple factors acting at the same time. However, a long-standing challenge is how to effectively aggregate multi-order interactions in GNN. In this paper, we propose a Graph Factorization Machine (GFM) which utilizes the popular Factorization Machine to aggregate multi-order interactions from neighborhood for recommendation. Meanwhile, cross-domain recommendation has emerged as a viable method to solve the data sparsity problem in recommender systems. However, most existing cross-domain recommendation methods might fail when confronting the graph-structured data. In order to tackle the problem, we propose a general cross-domain recommendation framework which can be applied not only to the proposed GFM, but also to other GNN models. We conduct experiments on four pairs of datasets to demonstrate the superior performance of the GFM. Besides, based on general cross-domain recommendation experiments, we also demonstrate that our cross-domain framework could not only contribute to the cross-domain recommendation task with the GFM, but also be universal and expandable for various existing GNN models.
Framework for Passenger Seat Availability Using Face Detection in Passenger Bus
Authors: Khawar Islam, Uzma Afzal
Date: 2020-07-12 00:00:00
Tasks: Face Detection, Management

Advancements in Intelligent Transportation System (IES) improve passenger traveling by providing information systems for bus arrival time and counting the number of passengers and buses in cities. Passengers still face bus waiting and seat unavailability issues which have adverse effects on traffic management and controlling authority. We propose a Face Detection based Framework (FDF) to determine passenger seat availability in a camera-equipped bus through face detection which is based on background subtraction to count empty, filled, and total seats. FDF has an integrated smartphone Passenger Application (PA) to identify the nearest bus stop. We evaluate FDF in a live test environment and results show that it gives 90% accuracy. We believe our results have the potential to address traffic management concerns and assist passengers to save their valuable time
Editable AI: Mixed Human-AI Authoring of Code Patterns
Authors: Kartik Chugh, Andrea Y. Solis, Thomas D. LaToza
Date: 2020-07-12 00:00:00

Developers authoring HTML documents define elements following patterns which establish and reflect the visual structure of a document, such as making all images in a footer the same height by applying a class to each. To surface these patterns to developers and support developers in authoring consistent with these patterns, we propose a mixed human-AI technique for creating code patterns. Patterns are first learned from individual HTML documents through a decision tree, generating a representation which developers may view and edit. Code patterns are used to offer developers autocomplete suggestions, list examples, and flag violations. To evaluate our technique, we conducted a user study in which 24 participants wrote, edited, and corrected HTML documents. We found that our technique enabled developers to edit and correct documents more quickly and create, edit, and correct documents more successfully.
Learning Abstract Models for Strategic Exploration and Fast Reward Transfer
Authors: Evan Zheran Liu, Ramtin Keramati, Sudarshan Seshadri, Kelvin Guu, Panupong Pasupat, Emma Brunskill, Percy Liang
Date: 2020-07-12 00:00:00
Tasks: Atari Games, Model-based Reinforcement Learning, Montezuma's Revenge, Navigate, Reinforcement Learning (RL)

Model-based reinforcement learning (RL) is appealing because (i) it enables planning and thus more strategic exploration, and (ii) by decoupling dynamics from rewards, it enables fast transfer to new reward functions. However, learning an accurate Markov Decision Process (MDP) over high-dimensional states (e.g., raw pixels) is extremely challenging because it requires function approximation, which leads to compounding errors. Instead, to avoid compounding errors, we propose learning an abstract MDP over abstract states: low-dimensional coarse representations of the state (e.g., capturing agent position, ignoring other objects). We assume access to an abstraction function that maps the concrete states to abstract states. In our approach, we construct an abstract MDP, which grows through strategic exploration via planning. Similar to hierarchical RL approaches, the abstract actions of the abstract MDP are backed by learned subpolicies that navigate between abstract states. Our approach achieves strong results on three of the hardest Arcade Learning Environment games (Montezuma's Revenge, Pitfall!, and Private Eye), including superhuman performance on Pitfall! without demonstrations. After training on one task, we can reuse the learned abstract MDP for new reward functions, achieving higher reward in 1000x fewer samples than model-free methods trained from scratch.
PA-GAN: Progressive Attention Generative Adversarial Network for Facial Attribute Editing
Authors: Zhenliang He, Meina Kan, Jichao Zhang, Shiguang Shan
Date: 2020-07-12 00:00:00
Tasks: Attribute, Generative Adversarial Network

Facial attribute editing aims to manipulate attributes on the human face, e.g., adding a mustache or changing the hair color. Existing approaches suffer from a serious compromise between correct attribute generation and preservation of the other information such as identity and background, because they edit the attributes in the imprecise area. To resolve this dilemma, we propose a progressive attention GAN (PA-GAN) for facial attribute editing. In our approach, the editing is progressively conducted from high to low feature level while being constrained inside a proper attribute area by an attention mask at each level. This manner prevents undesired modifications to the irrelevant regions from the beginning, and then the network can focus more on correctly generating the attributes within a proper boundary at each level. As a result, our approach achieves correct attribute editing with irrelevant details much better preserved compared with the state-of-the-arts. Codes are released at https://github.com/LynnHo/PA-GAN-Tensorflow.
HyperGrid: Efficient Multi-Task Transformers with Grid-wise Decomposable Hyper Projections
Authors: Yi Tay, Zhe Zhao, Dara Bahri, Donald Metzler, Da-Cheng Juan
Date: 2020-07-12 00:00:00
Tasks: Multi-Task Learning, Natural Language Understanding

Achieving state-of-the-art performance on natural language understanding tasks typically relies on fine-tuning a fresh model for every task. Consequently, this approach leads to a higher overall parameter cost, along with higher technical maintenance for serving multiple models. Learning a single multi-task model that is able to do well for all the tasks has been a challenging and yet attractive proposition. In this paper, we propose \textsc{HyperGrid}, a new approach for highly effective multi-task learning. The proposed approach is based on a decomposable hypernetwork that learns grid-wise projections that help to specialize regions in weight matrices for different tasks. In order to construct the proposed hypernetwork, our method learns the interactions and composition between a global (task-agnostic) state and a local task-specific state. We apply our proposed \textsc{HyperGrid} on the current state-of-the-art T5 model, demonstrating strong performance across the GLUE and SuperGLUE benchmarks when using only a single multi-task model. Our method helps bridge the gap between fine-tuning and multi-task learning approaches.