OpenRaiser/Intern-Atlas huggingface dataset:
Massively parallel finite difference elasticity using block-structured adaptive mesh refinement with a geometric multigrid solver
Venue: arXiv cs.CE 2020
Year: 2020

Computationally solving the equations of elasticity is a key component in many materials science and mechanics simulations. Phenomena such as deformation-induced microstructure evolution, microfracture, and microvoid nucleation are examples of applications for which accurate stress and strain fields are required. A characteristic feature of these simulations is that the problem domain is simple (typically a rectilinear representative volume element (RVE)), but the evolution of internal topological features is extremely complex. Traditionally, the finite element method (FEM) is used for elasticity calculations; FEM is nearly ubiquituous due to (1) its ability to handle meshes of complex geometry using isoparametric elements, and (2) the weak formulation which eschews the need for computation of second derivatives. However, variable topology problems (e.g. microstructure evolution) require either remeshing, or adaptive mesh refinement (AMR) - both of which can cause extensive overhead and limited scaling. Block-structured AMR (BSAMR) is a method for adaptive mesh refinement that exhibits good scaling and is well-suited for many problems in materials science. Here, it is shown that the equations of elasticity can be efficiently solved using BSAMR using the finite difference method. The boundary operator method is used to treat different types of boundary conditions, and the "reflux-free" method is introduced to efficiently and easily treat the coarse-fine boundaries that arise in BSAMR. Examples are presented that demonstrate the use of this method in a variety of cases relevant to materials science: Eshelby inclusions, fracture, and microstructure evolution. Reasonable scaling is demonstrated up to $\sim$4000 processors with tens of millions of grid points, and good AMR efficiency is observed.
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power
Venue: arXiv cs.IT 2020
Year: 2020

We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring $\mathbb{Z}_{p^r}$, where $p$ is a prime and $r$ is a positive integer. LRPC codes have originally been proposed by Gaborit et al.(2013) over finite fields for cryptographic applications. The adaption to finite rings is inspired by a recent paper by Kamche et al. (2019), which constructed Gabidulin codes over finite principle ideal rings with applications to space-time codes and network coding. We give a decoding algorithm based on simple linear-algebraic operations. Further, we derive an upper bound on the failure probability of the decoder. The upper bound is valid for errors whose rank is equal to the free rank.
Testing with Jupyter notebooks: NoteBook VALidation (nbval) plug-in for pytest
Venue: arXiv cs.SE 2020
Year: 2020

The Notebook validation tool nbval allows to load and execute Python code from a Jupyter notebook file. While computing outputs from the cells in the notebook, these outputs are compared with the outputs saved in the notebook file, treating each cell as a test. Deviations are reported as test failures, with various configuration options available to control the behaviour. Application use cases include the validation of notebook-based documentation, tutorials and textbooks, as well as the use of notebooks as additional unit, integration and system tests for the libraries that are used in the notebook. Nbval is implemented as a plugin for the pytest testing software.
Quantisation and Pruning for Neural Network Compression and Regularisation
Venue: arXiv cs.LG 2020
Year: 2020

Deep neural networks are typically too computationally expensive to run in real-time on consumer-grade hardware and low-powered devices. In this paper, we investigate reducing the computational and memory requirements of neural networks through network pruning and quantisation. We examine their efficacy on large networks like AlexNet compared to recent compact architectures: ShuffleNet and MobileNet. Our results show that pruning and quantisation compresses these networks to less than half their original size and improves their efficiency, particularly on MobileNet with a 7x speedup. We also demonstrate that pruning, in addition to reducing the number of parameters in a network, can aid in the correction of overfitting.
Efficient parameterized algorithms for computing all-pairs shortest paths
Venue: arXiv cs.DS 2020
Year: 2020

Computing all-pairs shortest paths is a fundamental and much-studied problem with many applications. Unfortunately, despite intense study, there are still no significantly faster algorithms for it than the $\mathcal{O}(n^3)$ time algorithm due to Floyd and Warshall (1962). Somewhat faster algorithms exist for the vertex-weighted version if fast matrix multiplication may be used. Yuster (SODA 2009) gave an algorithm running in time $\mathcal{O}(n^{2.842})$, but no combinatorial, truly subcubic algorithm is known. Motivated by the recent framework of efficient parameterized algorithms (or "FPT in P"), we investigate the influence of the graph parameters clique-width ($cw$) and modular-width ($mw$) on the running times of algorithms for solving All-Pairs Shortest Paths. We obtain efficient (and combinatorial) parameterized algorithms on non-negative vertex-weighted graphs of times $\mathcal{O}(cw^2n^2)$, resp. $\mathcal{O}(mw^2n + n^2)$. If fast matrix multiplication is allowed then the latter can be improved to $\mathcal{O}(mw^{1.842}n + n^2)$ using the algorithm of Yuster as a black box. The algorithm relative to modular-width is adaptive, meaning that the running time matches the best unparameterized algorithm for parameter value $mw$ equal to $n$, and they outperform them already for $mw \in \mathcal{O}(n^{1 - \varepsilon})$ for any $\varepsilon > 0$.
A circular proof system for the hybrid mu-calculus
Venue: arXiv cs.LO 2020
Year: 2020

We present a circular and cut-free proof system for the hybrid mu-calculus and prove its soundness and completeness. The system uses names for fixpoint unfoldings, like the circular proof system for the mu-calculus previously developed by Stirling.
Modeling Product Search Relevance in e-Commerce
Venue: arXiv cs.IR 2020
Year: 2020

With the rapid growth of e-Commerce, online product search has emerged as a popular and effective paradigm for customers to find desired products and engage in online shopping. However, there is still a big gap between the products that customers really desire to purchase and relevance of products that are suggested in response to a query from the customer. In this paper, we propose a robust way of predicting relevance scores given a search query and a product, using techniques involving machine learning, natural language processing and information retrieval. We compare conventional information retrieval models such as BM25 and Indri with deep learning models such as word2vec, sentence2vec and paragraph2vec. We share some of our insights and findings from our experiments.
Robot Rights? Let's Talk about Human Welfare Instead
Venue: arXiv cs.CY 2020
Year: 2020

The 'robot rights' debate, and its related question of 'robot responsibility', invokes some of the most polarized positions in AI ethics. While some advocate for granting robots rights on a par with human beings, others, in a stark opposition argue that robots are not deserving of rights but are objects that should be our slaves. Grounded in post-Cartesian philosophical foundations, we argue not just to deny robots 'rights', but to deny that robots, as artifacts emerging out of and mediating human being, are the kinds of things that could be granted rights in the first place. Once we see robots as mediators of human being, we can understand how the `robots rights' debate is focused on first world problems, at the expense of urgent ethical concerns, such as machine bias, machine elicited human labour exploitation, and erosion of privacy all impacting society's least privileged individuals. We conclude that, if human being is our starting point and human welfare is the primary concern, the negative impacts emerging from machinic systems, as well as the lack of taking responsibility by people designing, selling and deploying such machines, remains the most pressing ethical discussion in AI.
Non-Intrusive Parametric Model Order Reduction With Error Correction Modeling for Changing Well Locations Using a Machine Learning Framework
Venue: arXiv cs.CE 2020
Year: 2020

The objective of this paper is to develop a global non-intrusive Parametric Model Order Reduction (PMOR) methodology for the problem of changing well locations in an oil field, that can eventually be used for well placement optimization to gain significant computational savings. In this work, we propose a proper orthogonal decomposition (POD) based PMOR strategy that is non-intrusive to the simulator source code and hence extends its applicability to any commercial simulator. The non-intrusiveness of the proposed technique stems from formulating a novel Machine Learning (ML) based framework used with POD. The features of ML model are designed such that they take into consideration the temporal evolution of the state solutions and thereby avoiding simulator access for time dependency of the solutions. We represent well location changes as a parameter by introducing geometry-based features and flow diagnostics inspired physics-based features. An error correction model based on reduced model solutions is formulated later to correct for discrepancies in the state solutions at well gridblocks. It was observed that the global PMOR could predict the overall trend in pressure and saturation solutions at the well blocks but some bias was observed that resulted in discrepancies in prediction of quantities of interest (QoI). Thus, the error correction model that considers the physics based reduced model solutions as features, proved to reduce the error in QoI significantly. This workflow is applied to a heterogeneous channelized reservoir that showed good solution accuracies and speed-ups of 50x-100x were observed for different cases considered. The method is formulated such that all the simulation time steps are independent and hence can make use of parallel resources very efficiently and also avoid stability issues that can result from error accumulation over timesteps.
Understanding Generalization in Deep Learning via Tensor Methods
Venue: arXiv cs.LG 2020
Year: 2020

Deep neural networks generalize well on unseen data though the number of parameters often far exceeds the number of training examples. Recently proposed complexity measures have provided insights to understanding the generalizability in neural networks from perspectives of PAC-Bayes, robustness, overparametrization, compression and so on. In this work, we advance the understanding of the relations between the network's architecture and its generalizability from the compression perspective. Using tensor analysis, we propose a series of intuitive, data-dependent and easily-measurable properties that tightly characterize the compressibility and generalizability of neural networks; thus, in practice, our generalization bound outperforms the previous compression-based ones, especially for neural networks using tensors as their weight kernels (e.g. CNNs). Moreover, these intuitive measurements provide further insights into designing neural network architectures with properties favorable for better/guaranteed generalizability. Our experimental results demonstrate that through the proposed measurable properties, our generalization error bound matches the trend of the test error well. Our theoretical analysis further provides justifications for the empirical success and limitations of some widely-used tensor-based compression approaches. We also discover the improvements to the compressibility and robustness of current neural networks when incorporating tensor operations via our proposed layer-wise structure.
Parameterized Complexity Analysis of Randomized Search Heuristics
Venue: arXiv cs.NE 2020
Year: 2020

This chapter compiles a number of results that apply the theory of parameterized algorithmics to the running-time analysis of randomized search heuristics such as evolutionary algorithms. The parameterized approach articulates the running time of algorithms solving combinatorial problems in finer detail than traditional approaches from classical complexity theory. We outline the main results and proof techniques for a collection of randomized search heuristics tasked to solve NP-hard combinatorial optimization problems such as finding a minimum vertex cover in a graph, finding a maximum leaf spanning tree in a graph, and the traveling salesperson problem.
A Knowledge-Enhanced Pretraining Model for Commonsense Story Generation
Venue: arXiv cs.CL 2020
Year: 2020

Story generation, namely generating a reasonable story from a leading context, is an important but challenging task. In spite of the success in modeling fluency and local coherence, existing neural language generation models (e.g., GPT-2) still suffer from repetition, logic conflicts, and lack of long-range coherence in generated stories. We conjecture that this is because of the difficulty of associating relevant commonsense knowledge, understanding the causal relationships, and planning entities and events with proper temporal order. In this paper, we devise a knowledge-enhanced pretraining model for commonsense story generation. We propose to utilize commonsense knowledge from external knowledge bases to generate reasonable stories. To further capture the causal and temporal dependencies between the sentences in a reasonable story, we employ multi-task learning which combines a discriminative objective to distinguish true and fake stories during fine-tuning. Automatic and manual evaluation shows that our model can generate more reasonable stories than state-of-the-art baselines, particularly in terms of logic and global coherence.
Internet of Things-Enabled Overlay Satellite-Terrestrial Networks in the Presence of Interference
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we consider an overlay satellite-terrestrial network (OSTN) where an opportunistically selected terrestrial IoT network assist primary satellite communications as well as access the spectrum for its own communications in the presence of combined interference from extra-terrestrial and terrestrial sources. Hereby, a power domain multiplexing is adopted by the IoT network by splitting its power appropriately among the satellite and IoT signals. Relying upon an amplify-and-forward (AF)-based opportunistic IoT network selection strategy that minimizes the outage probability (OP) of satellite network, we derive the closed-form lower bound OP expressions for both the satellite and IoT networks. We further derive the corresponding asymptotic OP expressions to examine the achievable diversity order of two networks. We show that the proposed OSTN with adaptive power splitting factor benefits IoT network while guaranteeing the quality of service (QoS) of satellite network. We verify the numerical results by simulations.
SMT + ILP
Venue: arXiv cs.AI 2020
Year: 2020

Inductive logic programming (ILP) has been a deeply influential paradigm in AI, enjoying decades of research on its theory and implementations. As a natural descendent of the fields of logic programming and machine learning, it admits the incorporation of background knowledge, which can be very useful in domains where prior knowledge from experts is available and can lead to a more data-efficient learning regime. Be that as it may, the limitation to Horn clauses composed over Boolean variables is a very serious one. Many phenomena occurring in the real-world are best characterized using continuous entities, and more generally, mixtures of discrete and continuous entities. In this position paper, we motivate a reconsideration of inductive declarative programming by leveraging satisfiability modulo theory technology.
How many bots are you following?
Venue: arXiv cs.SI 2020
Year: 2020

Social Media are evolving as a pervasive source of news able to reach a larger audience through their spreading power. The main drawback is given by the presence of malicious accounts, known as social bots, which are often used to diffuse misleading information. Social bots are automated accounts whose goal is to interact with humans and influence them. Starting from the definition of credulous (i.e., human accounts with a high percentage of bot friends among their followees, in this work we aim to single out a regression model to derive, with an acceptable margin of error, the percentage of bot-followees of a human-operated account. The advantage lies in knowing, as a preventive measure, which users may be the target of bots' activities, hence more exposed to the misleading/unreliable content. Our results showed that the best regression model achieves a Mean Absolute Error of 3.62% and a Root Mean Squared Error of 5.96%, thus encouraging further research in this direction.
Single Image Dehazing Using Ranking Convolutional Neural Network
Venue: arXiv cs.CV 2020
Year: 2020

Single image dehazing, which aims to recover the clear image solely from an input hazy or foggy image, is a challenging ill-posed problem. Analysing existing approaches, the common key step is to estimate the haze density of each pixel. To this end, various approaches often heuristically designed haze-relevant features. Several recent works also automatically learn the features via directly exploiting Convolutional Neural Networks (CNN). However, it may be insufficient to fully capture the intrinsic attributes of hazy images. To obtain effective features for single image dehazing, this paper presents a novel Ranking Convolutional Neural Network (Ranking-CNN). In Ranking-CNN, a novel ranking layer is proposed to extend the structure of CNN so that the statistical and structural attributes of hazy images can be simultaneously captured. By training Ranking-CNN in a well-designed manner, powerful haze-relevant features can be automatically learned from massive hazy image patches. Based on these features, haze can be effectively removed by using a haze density prediction model trained through the random forest regression. Experimental results show that our approach outperforms several previous dehazing approaches on synthetic and real-world benchmark images. Comprehensive analyses are also conducted to interpret the proposed Ranking-CNN from both the theoretical and experimental aspects.
A Software-Defined Networking approach for congestion control in Opportunistic Networking
Venue: arXiv cs.NI 2020
Year: 2020

The short-term adoption of opportunistic networks (OppNet) depends on improving the current performance of this type of network. Software-Defined Networks (SDN) architecture is used by Internet applications with high resource demand. SDN technology improves network performance by programmatically managing the network configuration by using a control layer. In this paper, we propose that OppNet nodes use a control layer to get an overview of the whole network and use this knowledge to apply policies to get a better performance of the network. As a use case for our experimentation, we have focused on improving congestion control in OppNet with a control layer that dynamically regulates the replication degree used by forwarding algorithms. We have compared the performance of our proposal with two different configurations of the OppNet, over two community scenarios based on real mobility traces. The results of the test prove that our SDN-like approach overruns the other two approaches in terms of delivery ratio and latency time performance.
Deep Learning for MIR Tutorial
Venue: arXiv cs.IR 2020
Year: 2020

Deep Learning has become state of the art in visual computing and continuously emerges into the Music Information Retrieval (MIR) and audio retrieval domain. In order to bring attention to this topic we propose an introductory tutorial on deep learning for MIR. Besides a general introduction to neural networks, the proposed tutorial covers a wide range of MIR relevant deep learning approaches. \textbf{Convolutional Neural Networks} are currently a de-facto standard for deep learning based audio retrieval. \textbf{Recurrent Neural Networks} have proven to be effective in onset detection tasks such as beat or audio-event detection. \textbf{Siamese Networks} have been shown effective in learning audio representations and distance functions specific for music similarity retrieval. We will incorporate both academic and industrial points of view into the tutorial. Accompanying the tutorial, we will create a Github repository for the content presented at the tutorial as well as references to state of the art work and literature for further reading. This repository will remain public after the conference.
Model-Driven Beamforming Neural Networks
Venue: arXiv cs.IT 2020
Year: 2020

Beamforming is evidently a core technology in recent generations of mobile communication networks. Nevertheless, an iterative process is typically required to optimize the parameters, making it ill-placed for real-time implementation due to high complexity and computational delay. Heuristic solutions such as zero-forcing (ZF) are simpler but at the expense of performance loss. Alternatively, deep learning (DL) is well understood to be a generalizing technique that can deliver promising results for a wide range of applications at much lower complexity if it is sufficiently trained. As a consequence, DL may present itself as an attractive solution to beamforming. To exploit DL, this article introduces general data- and model-driven beamforming neural networks (BNNs), presents various possible learning strategies, and also discusses complexity reduction for the DL-based BNNs. We also offer enhancement methods such as training-set augmentation and transfer learning in order to improve the generality of BNNs, accompanied by computer simulation results and testbed results showing the performance of such BNN solutions.
Improving Spoken Language Understanding By Exploiting ASR N-best Hypotheses
Venue: arXiv cs.CL 2020
Year: 2020

In a modern spoken language understanding (SLU) system, the natural language understanding (NLU) module takes interpretations of a speech from the automatic speech recognition (ASR) module as the input. The NLU module usually uses the first best interpretation of a given speech in downstream tasks such as domain and intent classification. However, the ASR module might misrecognize some speeches and the first best interpretation could be erroneous and noisy. Solely relying on the first best interpretation could make the performance of downstream tasks non-optimal. To address this issue, we introduce a series of simple yet efficient models for improving the understanding of semantics of the input speeches by collectively exploiting the n-best speech interpretations from the ASR module.
A Comprehensive Survey on the Ambulance Routing and Location Problems
Venue: arXiv cs.AI 2020
Year: 2020

In this research, an extensive literature review was performed on the recent developments of the ambulance routing problem (ARP) and ambulance location problem (ALP). Both are respective modifications of the vehicle routing problem (VRP) and maximum covering problem (MCP), with modifications to objective functions and constraints. Although alike, a key distinction is emergency service systems (EMS) are considered critical and the optimization of these has become all the more important as a result. Similar to their parent problems, these are NP-hard and must resort to approximations if the space size is too large. Much of the current work has simply been on modifying existing systems through simulation to achieve a more acceptable result. There has been attempts towards using meta-heuristics, though practical experimentation is lacking when compared to VRP or MCP. The contributions of this work are a comprehensive survey of current methodologies, summarized models, and suggested future improvements.