OpenRaiser/Intern-Atlas huggingface dataset:
Practical Polar Code Construction Using Generalised Generator Matrices
Venue: arXiv cs.IT 2019
Year: 2019

Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel capacities approach 1, while the remaining channel capacities approach 0. Due to the specific size of this original generator matrix, polar codes can only have code lengths equal to the powers of 2, resulting in inefficiency for codes of practical lengths. In this paper, the performance of finite-length polar codes over the binary erasure channel is analysed. A normalised polarisation distance measure is defined and polar codes from different generator matrices showing different amount of polarisation are compared using this measure. Encoding structures for these generalised polar codes are proposed and polarisation performances in both asymptotical and finite-length cases are investigated for generator matrices of size 3x3 and 4x4. A generalised decoder is also proposed for this generator matrix and its erasure rate is compared with that of the original generator matrix. It is shown that polar codes that have performance similar to the original construction can be constructed and used for a variety of code lengths, not necessarily equal to powers of 2, using generalised generator matrices.
Optimal Decision-Making in Mixed-Agent Partially Observable Stochastic Environments via Reinforcement Learning
Venue: arXiv cs.LG 2019
Year: 2019

Optimal decision making with limited or no information in stochastic environments where multiple agents interact is a challenging topic in the realm of artificial intelligence. Reinforcement learning (RL) is a popular approach for arriving at optimal strategies by predicating stimuli, such as the reward for following a strategy, on experience. RL is heavily explored in the single-agent context, but is a nascent concept in multiagent problems. To this end, I propose several principled model-free and partially model-based reinforcement learning approaches for several multiagent settings. In the realm of normative reinforcement learning, I introduce scalable extensions to Monte Carlo exploring starts for partially observable Markov Decision Processes (POMDP), dubbed MCES-P, where I expand the theory and algorithm to the multiagent setting. I first examine MCES-P with probably approximately correct (PAC) bounds in the context of multiagent setting, showing MCESP+PAC holds in the presence of other agents. I then propose a more sample-efficient methodology for antagonistic settings, MCESIP+PAC. For cooperative settings, I extend MCES-P to the Multiagent POMDP, dubbed MCESMP+PAC. I then explore the use of reinforcement learning as a methodology in searching for optima in realistic and latent model environments. First, I explore a parameterized Q-learning approach in modeling humans learning to reason in an uncertain, multiagent environment. Next, I propose an implementation of MCES-P, along with image segmentation, to create an adaptive team-based reinforcement learning technique to positively identify the presence of phenotypically-expressed water and pathogen stress in crop fields.
Metrics matter in community detection
Venue: arXiv cs.SI 2019
Year: 2019

We present a critical evaluation of normalized mutual information (NMI) as an evaluation metric for community detection. NMI exaggerates the leximin method's performance on weak communities: Does leximin, in finding the trivial singletons clustering, truly outperform eight other community detection methods? Three NMI improvements from the literature are AMI, rrNMI, and cNMI. We show equivalences under relevant random models, and for evaluating community detection, we advise one-sided AMI under the $\mathbb{M}_{\mathrm{all}}$ model (all partitions of $n$ nodes). This work seeks (1) to start a conversation on robust measurements, and (2) to advocate evaluations which do not give "free lunch".
On hybrid modular recommendation systems for video streaming
Venue: arXiv cs.IR 2019
Year: 2019

The recommendation systems aim to improve the user engagement by recommending appropriate personalized content to users, exploiting information about their preferences. We propose the enabler, a hybrid recommendation system which employs various machine-learning (ML) algorithms for learning an efficient combination of several recommendation algorithms and selects the best blending for a given input.Specifically, it integrates three layers, namely, the trainer which trains the underlying recommenders, the blender which determines the most efficient combination of the recommenders, and the tester for assessing the performance of the system. The enabler incorporates a variety of recommendation algorithms that span from collaborative filtering and content-based techniques to ones based on neural networks. It uses the nested cross validation for automatically selecting the best ML algorithm along with its hyper-parameter values for the given input, according to a specific metric. The enabler can be easily extended to include other recommenders and blenders. The enabler has been extensively evaluated in the context of video-streaming. It outperforms various other algorithms, when tested on the Movielens 1M benchmark dataset.encouraging results. Moreover For example, it achieves an RMSE of 0.8206, compared to the state-of-the-art performance of the AutoRec and SVD, 0.827 and 0.845, respectively. A pilot web-based recommendation system was developed and tested in the production environment of a large telecom operator in Greece. Volunteer customers of the video-streaming service provided by the telecom operator employed the system in the context of an out-in-the-wild field study with a post-analysis of the enabler, using the collected ratings of the pilot, demonstrated that it significantly outperforms several popular recommendation algorithms.
A Unified Spatial Framework for UAV-aided MmWave Networks
Venue: arXiv cs.IT 2019
Year: 2019

For unmanned aerial vehicle (UAV) aided millimeter wave (mmWave) networks, we propose a unified three-dimensional (3D) spatial framework in this paper to model a general case that uncovered users send messages to base stations via UAVs. More specifically, the locations of transceivers in downlink and uplink are modeled through the Poisson point processes and Poisson cluster processes (PCPs), respectively. For PCPs, Matern cluster and Thomas cluster processes, are analyzed. Furthermore, both 3D blockage processes and 3D antenna patterns are introduced for appraising the effect of altitudes. Based on this unified framework, several closed-form expressions for the coverage probability in the uplink and downlink, are derived. By investigating the entire communication process, which includes the two aforementioned phases and the cooperative transmission between them, tractable expressions of system coverage probabilities are derived. Next, three practical applications in UAV networks are provided as case studies of the proposed framework. The results reveal that the impact of thermal noise and non-line-of-sight mmWave transmissions is negligible. In the considered networks, mmWave outperforms sub-6 GHz in terms of the data rate, due to the sharp direction beamforming and large transmit bandwidth. Additionally, there exists an optimal altitude of UAVs, which maximizes the system coverage probability.
Addressing Objects and Their Relations: The Conversational Entity Dialogue Model
Venue: arXiv cs.CL 2019
Year: 2019

Statistical spoken dialogue systems usually rely on a single- or multi-domain dialogue model that is restricted in its capabilities of modelling complex dialogue structures, e.g., relations. In this work, we propose a novel dialogue model that is centred around entities and is able to model relations as well as multiple entities of the same type. We demonstrate in a prototype implementation benefits of relation modelling on the dialogue level and show that a trained policy using these relations outperforms the multi-domain baseline. Furthermore, we show that by modelling the relations on the dialogue level, the system is capable of processing relations present in the user input and even learns to address them in the system response.
Exact Selectivity Computation for Modern In-Memory Database Query Optimization
Venue: arXiv cs.DB 2019
Year: 2019

Selectivity estimation remains a critical task in query optimization even after decades of research and industrial development. Optimizers rely on accurate selectivities when generating execution plans. They maintain a large range of statistical synopses for efficiently estimating selectivities. Nonetheless, small errors -- propagated exponentially -- can lead to severely sub-optimal plans---especially, for complex predicates. Database systems for modern computing architectures rely on extensive in-memory processing supported by massive multithread parallelism and vectorized instructions. However, they maintain the same synopses approach to query optimization as traditional disk-based databases. We introduce a novel query optimization paradigm for in-memory and GPU-accelerated databases based on \textit{exact selectivity computation (ESC)}. The central idea in ESC is to compute selectivities exactly through queries during query optimization. In order to make the process efficient, we propose several optimizations targeting the selection and materialization of tables and predicates to which ESC is applied. We implement ESC in the MapD open-source database system. Experiments on the TPC-H and SSB benchmarks show that ESC records constant and less than 30 milliseconds overhead when running on GPU and generates improved query execution plans that are as much as 32X faster.
Understanding the (un)interpretability of natural image distributions using generative models
Venue: arXiv cs.LG 2019
Year: 2019

Probability density estimation is a classical and well studied problem, but standard density estimation methods have historically lacked the power to model complex and high-dimensional image distributions. More recent generative models leverage the power of neural networks to implicitly learn and represent probability models over complex images. We describe methods to extract explicit probability density estimates from GANs, and explore the properties of these image density functions. We perform sanity check experiments to provide evidence that these probabilities are reasonable. However, we also show that density functions of natural images are difficult to interpret and thus limited in use. We study reasons for this lack of interpretability, and show that we can get interpretability back by doing density estimation on latent representations of images.
Exploring applications of deep reinforcement learning for real-world autonomous driving systems
Venue: arXiv cs.LG 2019
Year: 2019

Deep Reinforcement Learning (DRL) has become increasingly powerful in recent years, with notable achievements such as Deepmind's AlphaGo. It has been successfully deployed in commercial vehicles like Mobileye's path planning system. However, a vast majority of work on DRL is focused on toy examples in controlled synthetic car simulator environments such as TORCS and CARLA. In general, DRL is still at its infancy in terms of usability in real-world applications. Our goal in this paper is to encourage real-world deployment of DRL in various autonomous driving (AD) applications. We first provide an overview of the tasks in autonomous driving systems, reinforcement learning algorithms and applications of DRL to AD systems. We then discuss the challenges which must be addressed to enable further progress towards real-world deployment.
Unsupervised uncertainty estimation using spatiotemporal cues in video saliency detection
Venue: arXiv cs.CV 2019
Year: 2019

In this paper, we address the problem of quantifying reliability of computational saliency for videos, which can be used to improve saliency-based video processing and enable more reliable performance and risk assessment of such processing. Our approach is twofold. First, we explore spatial correlations in both saliency map and eye-fixation map. Then, we learn spatiotemporal correlations that define a reliable saliency map. We first study spatiotemporal eye-fixation data from a public dataset and investigate a common feature in human visual attention, which dictates correlation in saliency between a pixel and its direct neighbors. Based on the study, we then develop an algorithm that estimates a pixel-wise uncertainty map that reflects our confidence in the associated computational saliency map by relating a pixel's saliency to the saliency of its neighbors. To estimate such uncertainties, we measure the divergence of a pixel, in a saliency map, from its local neighborhood. Additionally, we propose a systematic procedure to evaluate the estimation performance by explicitly computing uncertainty ground truth as a function of a given saliency map and eye fixations of human subjects. In our experiments, we explore multiple definitions of locality and neighborhoods in spatiotemporal video signals. In addition, we examine the relationship between the parameters of our proposed algorithm and the content of the videos. The proposed algorithm is unsupervised, making it more suitable for generalization to most natural videos. Also, it is computationally efficient and flexible for customization to specific video content. Experiments using three publicly available video datasets show that the proposed algorithm outperforms state-of-the-art uncertainty estimation methods with improvement in accuracy up to 63% and offers efficiency and flexibility that make it more useful in practical situations.
Promoting effective application and management of ICT to enhance performance in secondary schools
Venue: arXiv cs.CY 2019
Year: 2019

Information and Communication Technology (ICT) is widely used to enhance teaching and learning in modern education. However, it is still difficult in some countries to exploit the full potential of ICT in this regard due to various constraints. The paper explores existing barriers for the effective use of ICT to enhance the performance of secondary schools. The study was focused on secondary schools in the North Central Province (NCP) of Sri Lanka. Results show a very low use of ICT among schools in the territory due to poor ICT infrastructure, leadership support, school planning, and ICT competency. However, teachers fairly positive attitudes towards ICT indicated a positive aspect of future developments. Individuals demographic characteristics show significant differences in the use of ICT in schools. Moreover, positive relationships were found between ICT usage and performance as perceived by teachers.
Generalization in Deep Networks: The Role of Distance from Initialization
Venue: arXiv cs.LG 2019
Year: 2019

Why does training deep neural networks using stochastic gradient descent (SGD) result in a generalization error that does not worsen with the number of parameters in the network? To answer this question, we advocate a notion of effective model capacity that is dependent on {\em a given random initialization of the network} and not just the training algorithm and the data distribution. We provide empirical evidences that demonstrate that the model capacity of SGD-trained deep networks is in fact restricted through implicit regularization of {\em the $\ell_2$ distance from the initialization}. We also provide theoretical arguments that further highlight the need for initialization-dependent notions of model capacity. We leave as open questions how and why distance from initialization is regularized, and whether it is sufficient to explain generalization.
Generative Adversarial Networks for Financial Trading Strategies Fine-Tuning and Combination
Venue: arXiv cs.LG 2019
Year: 2019

Systematic trading strategies are algorithmic procedures that allocate assets aiming to optimize a certain performance criterion. To obtain an edge in a highly competitive environment, the analyst needs to proper fine-tune its strategy, or discover how to combine weak signals in novel alpha creating manners. Both aspects, namely fine-tuning and combination, have been extensively researched using several methods, but emerging techniques such as Generative Adversarial Networks can have an impact into such aspects. Therefore, our work proposes the use of Conditional Generative Adversarial Networks (cGANs) for trading strategies calibration and aggregation. To this purpose, we provide a full methodology on: (i) the training and selection of a cGAN for time series data; (ii) how each sample is used for strategies calibration; and (iii) how all generated samples can be used for ensemble modelling. To provide evidence that our approach is well grounded, we have designed an experiment with multiple trading strategies, encompassing 579 assets. We compared cGAN with an ensemble scheme and model validation methods, both suited for time series. Our results suggest that cGANs are a suitable alternative for strategies calibration and combination, providing outperformance when the traditional techniques fail to generate any alpha.
"Ge Shu Zhi Zhi": Towards Deep Understanding about Worlds
Venue: arXiv cs.AI 2019
Year: 2019

"Ge She Zhi Zhi" is a novel saying in Chinese, stated as "To investigate things from the underlying principle(s) and to acquire knowledge in the form of mathematical representations". The saying is adopted and modified based on the ideas from the Eastern and Western philosophers. This position paper discusses the saying in the background of artificial intelligence (AI). Some related subjects, such as the ultimate goals of AI and two levels of knowledge representations, are discussed from the perspective of machine learning. A case study on objective evaluations over multi attributes, a typical problem in the filed of social computing, is given to support the saying for wide applications. A methodology of meta rules is proposed for examining the objectiveness of the evaluations. The possible problems of the saying are also presented.
Age-of-Information for Computation-Intensive Messages in Mobile Edge Computing
Venue: arXiv cs.DC 2019
Year: 2019

Age-of-information (AoI) is a novel metric that measures the freshness of information in status update scenarios. It is essential for real-time applications to transmit status update packets to the destination node as timely as possible. However, for some applications, status information embedded in the packets is not revealed until complicated data processing, which is computational expensive and time consuming. As mobile edge server has sufficient computational resource and is placed close to users, mobile edge computing (MEC) is expected to reduce age for computation-intensive messages. In this paper, we study the AoI for computation-intensive data in MEC, and consider two schemes: local computing by user itself and remote computing at MEC server. The two computing models are unified into a two-node tandem queuing model. Zero-wait policy is adopted, i.e., a new message is generated once the previous one leaves the first node. We consider exponentially distributed service time and infinite queue size, and hence, the second node can be seen as a First-Come-First-Served (FCFS) M/M/1 system. Closed-form average AoI is derived for the two computing schemes. The region where remote computing outperforms local computing is characterized. Simulation results show that the remote computing is greatly superior to the local computing when the remote computing rate is large enough, and that there exists an optimal transmission rate so that remote computing is better than local computing for a largest range.
Resilient Design of 5G Mobile-Edge Computing Over Intermittent mmWave Links
Venue: arXiv cs.IT 2019
Year: 2019

Two enablers of the 5th Generation (5G) of mobile communication systems are the high data rates achievable with millimeter-wave radio signals and the cloudification of the network's mobile edge, made possible also by Multi-access Edge Computing (MEC). In 5G networks, user devices may exploit the high capacity of their mobile connection and the computing capabilities of the edge cloud to offload computational tasks to MEC servers, which run applications on devices' behalf. This paper investigates new methods to perform power- and latency-constrained offloading. First, aiming to minimize user devices' transmit power, the opportunity to exploit concurrent communication links between the device and the edge cloud is studied. The optimal number of channels for simultaneous transmission is characterized in a deterministic and a probabilistic scenario. Subsequently, blocking events that obstruct millimeter-wave channels making them `intermittent' are considered. Resource overprovisioning and error-correcting codes against asymmetric block erasures are proposed to jointly contrast blocking and exploit multi-link communications' diversity. The asymmetric block-erasure channel is characterized by a study of its outage probability. The analysis is performed in a framework that yields closed-form expressions. These, together with corroborating numerical results, are intended to provide reference points and bounds to optimal performance in practical applications.
A semi-structured approach to curvilinear mesh generation around streamlined bodies
Venue: arXiv cs.CG 2019
Year: 2019

We present an approach for robust high-order mesh generation specially tailored to streamlined bodies. The method is based on a semi-sructured approach which combines the high quality of structured meshes in the near-field with the flexibility of unstructured meshes in the far-field. We utilise medial axis technology to robustly partition the near-field into blocks which can be meshed coarsely with a linear swept mesher. A high-order mesh of the near-field is then generated and split using an isoparametric approach which allows us to obtain highly stretched elements aligned with the flow field. Special treatment of the partition is performed on the wing root juntion and the trailing edge --- into the wake --- to obtain an H-type mesh configuration with anisotropic hexahedra ideal for the strong shear of high Reynolds number simulations. We then proceed to discretise the far-field using traditional robust tetrahedral meshing tools. This workflow is made possible by two sets of tools: CADfix, focused on CAD system, the block partitioning of the near-field and the generation of a linear mesh; and NekMesh, focused on the curving of the high-order mesh and the generation of highly-stretched boundary layer elements. We demonstrate this approach on a NACA0012 wing attached to a wall and show that a gap between the wake partition and the wall can be inserted to remove the dependency of the partitioning procedure on the local geometry.