OpenRaiser/Intern-Atlas huggingface dataset:
Differential Privacy in Blockchain Technology: A Futuristic Approach
Venue: arXiv cs.CR 2020
Year: 2020

Blockchain has received a widespread attention because of its decentralized, tamper-proof, and transparent nature. Blockchain works over the principle of distributed, secured, and shared ledger, which is used to record, and track data within a decentralized network. This technology has successfully replaced certain systems of economic transactions in organizations and has the potential to overtake various industrial business models in future. Blockchain works over peer-to-peer (P2P) phenomenon for its operation and does not require any trusted-third party authorization for data tracking and storage. The information stored in blockchain is distributed throughout the decentralized network and is usually protected using cryptographic hash functions. Since the beginning of blockchain technology, its use in different applications is increasing exponentially, but this increased use has also raised some questions regarding privacy and security of data being stored in it. Protecting privacy of blockchain data using data perturbation strategy such as differential privacy could be a novel approach to overcome privacy issues in blockchain. In this article, we cover the topic of integration of differential privacy in each layer of blockchain and in certain blockchain based scenarios. Moreover, we highlight some future challenges and application scenarios in which integration of differential privacy in blockchain can produce fruitful results.
RLCard: A Toolkit for Reinforcement Learning in Card Games
Venue: arXiv cs.AI 2020
Year: 2020

RLCard is an open-source toolkit for reinforcement learning research in card games. It supports various card environments with easy-to-use interfaces, including Blackjack, Leduc Hold'em, Texas Hold'em, UNO, Dou Dizhu and Mahjong. The goal of RLCard is to bridge reinforcement learning and imperfect information games, and push forward the research of reinforcement learning in domains with multiple agents, large state and action space, and sparse reward. In this paper, we provide an overview of the key components in RLCard, a discussion of the design principles, a brief introduction of the interfaces, and comprehensive evaluations of the environments. The codes and documents are available at https://github.com/datamllab/rlcard
Adaptive and Azimuth-Aware Fusion Network of Multimodal Local Features for 3D Object Detection
Venue: arXiv cs.CV 2020
Year: 2020

This paper focuses on the construction of stronger local features and the effective fusion of image and LiDAR data. We adopt different modalities of LiDAR data to generate richer features and present an adaptive and azimuth-aware network to aggregate local features from image, bird's eye view maps and point cloud. Our network mainly consists of three subnetworks: ground plane estimation network, region proposal network and adaptive fusion network. The ground plane estimation network extracts features of point cloud and predicts the parameters of a plane which are used for generating abundant 3D anchors. The region proposal network generates features of image and bird's eye view maps to output region proposals. To integrate heterogeneous image and point cloud features, the adaptive fusion network explicitly adjusts the intensity of multiple local features and achieves the orientation consistency between image and LiDAR data by introduce an azimuth-aware fusion module. Experiments are conducted on KITTI dataset and the results validate the advantages of our aggregation of multimodal local features and the adaptive fusion network.
Coarse-To-Fine Visual Localization Using Semantic Compact Map
Venue: arXiv cs.RO 2020
Year: 2020

Robust visual localization for urban vehicles remains challenging and unsolved. The limitation of computation efficiency and memory size has made it harder for large-scale applications. Since semantic information serves as a stable and compact representation of the environment, we propose a coarse-to-fine localization system based on a semantic compact map. Pole-like objects are stored in the compact map, then are extracted from semantically segmented images as observations. Localization is performed by a particle filter, followed by a pose alignment module decoupling translation and rotation to achieve better accuracy. We evaluate our system both on synthetic and realistic datasets and compare it with two baselines, a state-of-art semantic feature-based system, and a traditional SIFT feature-based system. Experiments demonstrate that even with a significantly small map, such as a 10 KB map for a 3.7 km long trajectory, our system provides a comparable accuracy with the baselines.
Regret Bounds for Batched Bandits
Venue: arXiv cs.DS 2020
Year: 2020

We present simple and efficient algorithms for the batched stochastic multi-armed bandit and batched stochastic linear bandit problems. We prove bounds for their expected regrets that improve over the best-known regret bounds for any number of batches. In particular, our algorithms in both settings achieve the optimal expected regrets by using only a logarithmic number of batches. We also study the batched adversarial multi-armed bandit problem for the first time and find the optimal regret, up to logarithmic factors, of any algorithm with predetermined batch sizes.
Multi-modal Deep Analysis for Multimedia
Venue: arXiv cs.MM 2020
Year: 2020

With the rapid development of Internet and multimedia services in the past decade, a huge amount of user-generated and service provider-generated multimedia data become available. These data are heterogeneous and multi-modal in nature, imposing great challenges for processing and analyzing them. Multi-modal data consist of a mixture of various types of data from different modalities such as texts, images, videos, audios etc. In this article, we present a deep and comprehensive overview for multi-modal analysis in multimedia. We introduce two scientific research problems, data-driven correlational representation and knowledge-guided fusion for multimedia analysis. To address the two scientific problems, we investigate them from the following aspects: 1) multi-modal correlational representation: multi-modal fusion of data across different modalities, and 2) multi-modal data and knowledge fusion: multi-modal fusion of data with domain knowledge. More specifically, on data-driven correlational representation, we highlight three important categories of methods, such as multi-modal deep representation, multi-modal transfer learning, and multi-modal hashing. On knowledge-guided fusion, we discuss the approaches for fusing knowledge with data and four exemplar applications that require various kinds of domain knowledge, including multi-modal visual question answering, multi-modal video summarization, multi-modal visual pattern mining and multi-modal recommendation. Finally, we bring forward our insights and future research directions.
Artistic Glyph Image Synthesis via One-Stage Few-Shot Learning
Venue: arXiv cs.CV 2020
Year: 2020

Automatic generation of artistic glyph images is a challenging task that attracts many research interests. Previous methods either are specifically designed for shape synthesis or focus on texture transfer. In this paper, we propose a novel model, AGIS-Net, to transfer both shape and texture styles in one-stage with only a few stylized samples. To achieve this goal, we first disentangle the representations for content and style by using two encoders, ensuring the multi-content and multi-style generation. Then we utilize two collaboratively working decoders to generate the glyph shape image and its texture image simultaneously. In addition, we introduce a local texture refinement loss to further improve the quality of the synthesized textures. In this manner, our one-stage model is much more efficient and effective than other multi-stage stacked methods. We also propose a large-scale dataset with Chinese glyph images in various shape and texture styles, rendered from 35 professional-designed artistic fonts with 7,326 characters and 2,460 synthetic artistic fonts with 639 characters, to validate the effectiveness and extendability of our method. Extensive experiments on both English and Chinese artistic glyph image datasets demonstrate the superiority of our model in generating high-quality stylized glyph images against other state-of-the-art methods.
Differentially Private Survival Function Estimation
Venue: arXiv cs.LG 2020
Year: 2020

Survival function estimation is used in many disciplines, but it is most common in medical analytics in the form of the Kaplan-Meier estimator. Sensitive data (patient records) is used in the estimation without any explicit control on the information leakage, which is a significant privacy concern. We propose a first differentially private estimator of the survival function and show that it can be easily extended to provide differentially private confidence intervals and test statistics without spending any extra privacy budget. We further provide extensions for differentially private estimation of the competing risk cumulative incidence function, Nelson-Aalen's estimator for the hazard function, etc. Using eleven real-life clinical datasets, we provide empirical evidence that our proposed method provides good utility while simultaneously providing strong privacy guarantees.
On Empirical Comparisons of Optimizers for Deep Learning
Venue: arXiv cs.LG 2020
Year: 2020

Selecting an optimizer is a central step in the contemporary deep learning pipeline. In this paper, we demonstrate the sensitivity of optimizer comparisons to the hyperparameter tuning protocol. Our findings suggest that the hyperparameter search space may be the single most important factor explaining the rankings obtained by recent empirical comparisons in the literature. In fact, we show that these results can be contradicted when hyperparameter search spaces are changed. As tuning effort grows without bound, more general optimizers should never underperform the ones they can approximate (i.e., Adam should never perform worse than momentum), but recent attempts to compare optimizers either assume these inclusion relationships are not practically relevant or restrict the hyperparameters in ways that break the inclusions. In our experiments, we find that inclusion relationships between optimizers matter in practice and always predict optimizer comparisons. In particular, we find that the popular adaptive gradient methods never underperform momentum or gradient descent. We also report practical tips around tuning often ignored hyperparameters of adaptive gradient methods and raise concerns about fairly benchmarking optimizers for neural network training.
Saliency Guided Self-attention Network for Weakly and Semi-supervised Semantic Segmentation
Venue: arXiv cs.CV 2020
Year: 2020

Weakly supervised semantic segmentation (WSSS) using only image-level labels can greatly reduce the annotation cost and therefore has attracted considerable research interest. However, its performance is still inferior to the fully supervised counterparts. To mitigate the performance gap, we propose a saliency guided self-attention network (SGAN) to address the WSSS problem. The introduced self-attention mechanism is able to capture rich and extensive contextual information but may mis-spread attentions to unexpected regions. In order to enable this mechanism to work effectively under weak supervision, we integrate class-agnostic saliency priors into the self-attention mechanism and utilize class-specific attention cues as an additional supervision for SGAN. Our SGAN is able to produce dense and accurate localization cues so that the segmentation performance is boosted. Moreover, by simply replacing the additional supervisions with partially labeled ground-truth, SGAN works effectively for semi-supervised semantic segmentation as well. Experiments on the PASCAL VOC 2012 and COCO datasets show that our approach outperforms all other state-of-the-art methods in both weakly and semi-supervised settings.
McLeish Distribution: Performance of Digital Communications over Additive White McLeish Noise (AWMN) Channels
Venue: arXiv cs.IT 2020
Year: 2020

The objective of this article is to propose and statistically validate a more general additive non-Gaussian noise distribution, which we term McLeish distribution, whose random nature can model different impulsive noise environments commonly encountered in practice and provides a robust alternative to Gaussian noise distribution. In particular, for the first time in the literature, we establish the laws of McLeish distribution and therefrom derive the laws of the sum of McLeish distributions by obtaining closed-form expressions for their PDF, CDF, complementary CDF (C$^2$DF), MGF and higher-order moments. Further, for certain problems related to the envelope of complex random signals, we extend McLeish distribution to complex McLeish distribution and thereby propose circularly/elliptically symmetric (CS/ES) complex McLeish distributions with closed-form PDF, CDF, MGF and higher-order moments. For generalization of one-dimensional distribution to multi-dimensional distribution, we develop and propose both multivariate McLeish distribution and multivariate complex CS/ES (CCS/CES) McLeish distribution with analytically tractable and closed-form PDF, CDF, C$^2$DF and MGF. In addition to the proposed McLeish distribution framework and for its practical illustration, we theoretically investigate and prove the existence of McLeish distribution as additive noise in communication systems. Accordingly, we introduce additive white McLeish noise (AWMN) channels. For coherent/non-coherent signaling over AWMN channels, we propose novel expressions for MAP and ML symbol decisions and thereby obtain closed-form expressions for both BER of binary modulation schemes and SER of various M-ary modulation schemes. Further, we verify the validity and accuracy of our novel BER/SER expressions with some selected numerical examples and some computer-based simulations.
Open-plan Glare Evaluator (OGE): A Demonstration of a New Glare Prediction Approach Using Machine Learning Algorithms
Venue: arXiv cs.LG 2020
Year: 2020

Predicting discomfort glare in open-plan offices is a challenging problem. Although glare research has existed for more than 50 years, all current glare metrics have accuracy limitations, especially in open-plan offices with low lighting levels. Thus, it is crucial to develop a new method to predict glare more accurately. This paper is the first to adopt Machine Learning (ML) approaches in the prediction of glare. This research aims to demonstrate the validity of this approach by comparing the accuracy of the new ML model for open-plan offices (OGE) to the accuracy of the existing glare metrics using local dataset. To utilize and test this approach, Post-Occupancy Evaluation (POE) and High Dynamic Range (HDR) images were collected from 80 occupants (n=80) in four different open-plan offices in Brisbane, Australia. Consequently, various multi-region luminance values, luminance, and glare indices were calculated and examined as input features to train ML models. The accuracy of the ML model was compared to the accuracy of 24 indices which were also evaluated using a Receiver Operating Characteristic (ROC) analysis to identify the best cutoff values (thresholds) for each index in open-plan configurations. Results showed that the ML approach could predict glare with an accuracy of 83.8% (0.80 true positive rate and 0.86 true negative rate), which outperformed the accuracy of the previously developed glare metrics. OGE is applicable for open-plan office situations with low vertical illuminance (200 to 600 lux). However, ML models can be trained with more substantial datasets to achieve global model.
A CNN-RNN Framework for Image Annotation from Visual Cues and Social Network Metadata
Venue: arXiv cs.CV 2020
Year: 2020

Images represent a commonly used form of visual communication among people. Nevertheless, image classification may be a challenging task when dealing with unclear or non-common images needing more context to be correctly annotated. Metadata accompanying images on social-media represent an ideal source of additional information for retrieving proper neighborhoods easing image annotation task. To this end, we blend visual features extracted from neighbors and their metadata to jointly leverage context and visual cues. Our models use multiple semantic embeddings to achieve the dual objective of being robust to vocabulary changes between train and test sets and decoupling the architecture from the low-level metadata representation. Convolutional and recurrent neural networks (CNNs-RNNs) are jointly adopted to infer similarity among neighbors and query images. We perform comprehensive experiments on the NUS-WIDE dataset showing that our models outperform state-of-the-art architectures based on images and metadata, and decrease both sensory and semantic gaps to better annotate images.
Capacity Region of Erasure Broadcast Channels with Common Message and Feedback
Venue: arXiv cs.IT 2020
Year: 2020

Jolfaei et al. used feedback to create transmit signals that are simultaneously useful for multiple users in a broadcast channel. Later, Georgiadis and Tassiulas studied erasure broadcast channels with feedback, and presented the capacity region under certain assumptions. These results provided the fundamental ideas used in communication protocols for networks with delayed channel state information. However, to the best of our knowledge, the capacity region of erasure broadcast channels with feedback and with a common message for both receivers has never been presented. This latter problem shows up as a sub-problem in many multi-terminal communication networks such as the X-Channel, and the two-unicast problem. In this work, we present the capacity region of the two-user erasure broadcast channels with delayed feedback, private messages, and a common message. We consider arbitrary and possibly correlated erasure distributions. We develop new outer-bounds that capture feedback and quantify the impact of delivering a common message on the capacity region. We also propose a transmission strategy that achieves the outer-bounds. Our transmission strategy differs from prior results in that to achieve the capacity, it creates side-information at the weaker user such that the decodability is ensured even if we multicast the common message with a rate higher than its link capacity.
Neural Collision Clearance Estimator for Batched Motion Planning
Venue: arXiv cs.RO 2020
Year: 2020

We present a neural network collision checking heuristic, ClearanceNet, and a planning algorithm, CN-RRT. ClearanceNet learns to predict separation distance (minimum distance between robot and workspace) with respect to a workspace. CN-RRT then efficiently computes a motion plan by leveraging three key features of ClearanceNet. First, CN-RRT explores the space by expanding multiple nodes at the same time, processing batches of thousands of collision checks. Second, CN-RRT adaptively relaxes its clearance requirements for more difficult problems. Third, to repair errors, CN-RRT shifts its nodes in the direction of ClearanceNet's gradient and repairs any residual errors with a traditional RRT, thus maintaining theoretical probabilistic completeness guarantees. In configuration spaces with up to 30 degrees of freedom, ClearanceNet achieves 845x speedup over traditional collision detection methods, while CN-RRT accelerates motion planning by up to 42% over a baseline and finds paths up to 36% more efficient. Experiments on an 11 degree of freedom robot in a cluttered environment confirm the method's feasibility on real robots.
Sketch-Specific Data Augmentation for Freehand Sketch Recognition
Venue: arXiv cs.CV 2020
Year: 2020

Sketch recognition remains a significant challenge due to the limited training data and the substantial intra-class variance of freehand sketches for the same object. Conventional methods for this task often rely on the availability of the temporal order of sketch strokes, additional cues acquired from different modalities and supervised augmentation of sketch datasets with real images, which also limit the applicability and feasibility of these methods in real scenarios. In this paper, we propose a novel sketch-specific data augmentation (SSDA) method that leverages the quantity and quality of the sketches automatically. From the aspect of quantity, we introduce a Bezier pivot based deformation (BPD) strategy to enrich the training data. Towards quality improvement, we present a mean stroke reconstruction (MSR) approach to generate a set of novel types of sketches with smaller intra-class variances. Both of these solutions are unrestricted from any multi-source data and temporal cues of sketches. Furthermore, we show that some recent deep convolutional neural network models that are trained on generic classes of real images can be better choices than most of the elaborate architectures that are designed explicitly for sketch recognition. As SSDA can be integrated with any convolutional neural networks, it has a distinct advantage over the existing methods. Our extensive experimental evaluations demonstrate that the proposed method achieves the state-of-the-art results (84.27%) on the TU-Berlin dataset, outperforming the human performance by a remarkable 11.17% increase. Finally, more experiments show the practical value of our approach for the task of sketch-based image retrieval.
Deep Independently Recurrent Neural Network (IndRNN)
Venue: arXiv cs.CV 2020
Year: 2020

Recurrent neural networks (RNNs) are known to be difficult to train due to the gradient vanishing and exploding problems and thus difficult to learn long-term patterns and construct deep networks. To address these problems, this paper proposes a new type of RNNs with the recurrent connection formulated as Hadamard product, referred to as independently recurrent neural network (IndRNN), where neurons in the same layer are independent of each other and connected across layers. Due to the better behaved gradient backpropagation, IndRNN with regulated recurrent weights effectively addresses the gradient vanishing and exploding problems and thus long-term dependencies can be learned. Moreover, an IndRNN can work with non-saturated activation functions such as ReLU (rectified linear unit) and be still trained robustly. Different deeper IndRNN architectures, including the basic stacked IndRNN, residual IndRNN and densely connected IndRNN, have been investigated, all of which can be much deeper than the existing RNNs. Furthermore, IndRNN reduces the computation at each time step and can be over 10 times faster than the commonly used Long short-term memory (LSTM). Experimental results have shown that the proposed IndRNN is able to process very long sequences and construct very deep networks. Better performance has been achieved on various tasks with IndRNNs compared with the traditional RNN, LSTM and the popular Transformer.
Real-world adversarial attack on MTCNN face detection system
Venue: arXiv cs.CV 2020
Year: 2020

Recent studies proved that deep learning approaches achieve remarkable results on face detection task. On the other hand, the advances gave rise to a new problem associated with the security of the deep convolutional neural network models unveiling potential risks of DCNNs based applications. Even minor input changes in the digital domain can result in the network being fooled. It was shown then that some deep learning-based face detectors are prone to adversarial attacks not only in a digital domain but also in the real world. In the paper, we investigate the security of the well-known cascade CNN face detection system - MTCNN and introduce an easily reproducible and a robust way to attack it. We propose different face attributes printed on an ordinary white and black printer and attached either to the medical face mask or to the face directly. Our approach is capable of breaking the MTCNN detector in a real-world scenario.