OpenRaiser/Intern-Atlas huggingface dataset:
Probabilistic Inference for Camera Calibration in Light Microscopy under Circular Motion
Venue: arXiv cs.CV 2019
Year: 2019

Robust and accurate camera calibration is essential for 3D reconstruction in light microscopy under circular motion. Conventional methods require either accurate key point matching or precise segmentation of the axial-view images. Both remain challenging because specimens often exhibit transparency/translucency in a light microscope. To address those issues, we propose a probabilistic inference based method for the camera calibration that does not require sophisticated image pre-processing. Based on 3D projective geometry, our method assigns a probability on each of a range of voxels that cover the whole object. The probability indicates the likelihood of a voxel belonging to the object to be reconstructed. Our method maximizes a joint probability that distinguishes the object from the background. Experimental results show that the proposed method can accurately recover camera configurations in both light microscopy and natural scene imaging. Furthermore, the method can be used to produce high-fidelity 3D reconstructions and accurate 3D measurements.
Solving Parity Games Using An Automata-Based Algorithm
Venue: arXiv cs.GT 2019
Year: 2019

Parity games are abstract infinite-round games that take an important role in formal verification. In the basic setting, these games are two-player, turn-based, and played under perfect information on directed graphs, whose nodes are labeled with priorities. The winner of a play is determined according to the parities (even or odd) of the minimal priority occurring infinitely often in that play. The problem of finding a winning strategy in parity games is known to be in UPTime $\cap$ CoUPTime and deciding whether a polynomial time solution exists is a long-standing open question. In the last two decades, a variety of algorithms have been proposed. Many of them have been also implemented in a platform named PGSolver. This has enabled an empirical evaluation of these algorithms and a better understanding of their relative merits. In this paper, we further contribute to this subject by implementing, for the first time, an algorithm based on alternating automata. More precisely, we consider an algorithm introduced by Kupferman and Vardi that solves a parity game by solving the emptiness problem of a corresponding alternating parity automaton. Our empirical evaluation demonstrates that this algorithm outperforms other algorithms when the game has a a small number of priorities relative to the size of the game. In many concrete applications, we do indeed end up with parity games where the number of priorities is relatively small. This makes the new algorithm quite useful in practice.
Deep Learning vs. Traditional Computer Vision
Venue: arXiv cs.CV 2019
Year: 2019

Deep Learning has pushed the limits of what was possible in the domain of Digital Image Processing. However, that is not to say that the traditional computer vision techniques which had been undergoing progressive development in years prior to the rise of DL have become obsolete. This paper will analyse the benefits and drawbacks of each approach. The aim of this paper is to promote a discussion on whether knowledge of classical computer vision techniques should be maintained. The paper will also explore how the two sides of computer vision can be combined. Several recent hybrid methodologies are reviewed which have demonstrated the ability to improve computer vision performance and to tackle problems not suited to Deep Learning. For example, combining traditional computer vision techniques with Deep Learning has been popular in emerging domains such as Panoramic Vision and 3D vision for which Deep Learning models have not yet been fully optimised
Linear Speedup in Saddle-Point Escape for Decentralized Non-Convex Optimization
Venue: arXiv cs.MA 2019
Year: 2019

Under appropriate cooperation protocols and parameter choices, fully decentralized solutions for stochastic optimization have been shown to match the performance of centralized solutions and result in linear speedup (in the number of agents) relative to non-cooperative approaches in the strongly-convex setting. More recently, these results have been extended to the pursuit of first-order stationary points in non-convex environments. In this work, we examine in detail the dependence of second-order convergence guarantees on the spectral properties of the combination policy for non-convex multi agent optimization. We establish linear speedup in saddle-point escape time in the number of agents for symmetric combination policies and study the potential for further improvement by employing asymmetric combination weights. The results imply that a linear speedup can be expected in the pursuit of second-order stationary points, which exclude local maxima as well as strict saddle-points and correspond to local or even global minima in many important learning settings.
Hidden Markov Models for sepsis detection in preterm infants
Venue: arXiv cs.LG 2019
Year: 2019

We explore the use of traditional and contemporary hidden Markov models (HMMs) for sequential physiological data analysis and sepsis prediction in preterm infants. We investigate the use of classical Gaussian mixture model based HMM, and a recently proposed neural network based HMM. To improve the neural network based HMM, we propose a discriminative training approach. Experimental results show the potential of HMMs over logistic regression, support vector machine and extreme learning machine.
SMS-WSJ: Database, performance measures, and baseline recipe for multi-channel source separation and recognition
Venue: arXiv cs.SD 2019
Year: 2019

We present a multi-channel database of overlapping speech for training, evaluation, and detailed analysis of source separation and extraction algorithms: SMS-WSJ -- Spatialized Multi-Speaker Wall Street Journal. It consists of artificially mixed speech taken from the WSJ database, but unlike earlier databases we consider all WSJ0+1 utterances and take care of strictly separating the speaker sets present in the training, validation and test sets. When spatializing the data we ensure a high degree of randomness w.r.t. room size, array center and rotation, as well as speaker position. Furthermore, this paper offers a critical assessment of recently proposed measures of source separation performance. Alongside the code to generate the database we provide a source separation baseline and a Kaldi recipe with competitive word error rates to provide common ground for evaluation.
Neural networks trained with WiFi traces to predict airport passenger behavior
Venue: arXiv cs.LG 2019
Year: 2019

The use of neural networks to predict airport passenger activity choices inside the terminal is presented in this paper. Three network architectures are proposed: Feedforward Neural Networks (FNN), Long Short-Term Memory (LSTM) networks, and a combination of the two. Inputs to these models are both static (passenger and trip characteristics) and dynamic (real-time passenger tracking). A real-world case study exemplifies the application of these models, using anonymous WiFi traces collected at Bologna Airport to train the networks. The performance of the models were evaluated according to the misclassification rate of passenger activity choices. In the LSTM approach, two different multi-step forecasting strategies are tested. According to our findings, the direct LSTM approach provides better results than the FNN, especially when the prediction horizon is relatively short (20 minutes or less).
LaplacianNet: Learning on 3D Meshes with Laplacian Encoding and Pooling
Venue: arXiv cs.GR 2019
Year: 2019

3D models are commonly used in computer vision and graphics. With the wider availability of mesh data, an efficient and intrinsic deep learning approach to processing 3D meshes is in great need. Unlike images, 3D meshes have irregular connectivity, requiring careful design to capture relations in the data. To utilize the topology information while staying robust under different triangulation, we propose to encode mesh connectivity using Laplacian spectral analysis, along with Mesh Pooling Blocks (MPBs) that can split the surface domain into local pooling patches and aggregate global information among them. We build a mesh hierarchy from fine to coarse using Laplacian spectral clustering, which is flexible under isometric transformation. Inside the MPBs there are pooling layers to collect local information and multi-layer perceptrons to compute vertex features with increasing complexity. To obtain the relationships among different clusters, we introduce a Correlation Net to compute a correlation matrix, which can aggregate the features globally by matrix multiplication with cluster features. Our network architecture is flexible enough to be used on meshes with different numbers of vertices. We conduct several experiments including shape segmentation and classification, and our LaplacianNet outperforms state-of-the-art algorithms for these tasks on ShapeNet and COSEG datasets.
Towards Generalizable Neuro-Symbolic Systems for Commonsense Question Answering
Venue: arXiv cs.CL 2019
Year: 2019

Non-extractive commonsense QA remains a challenging AI task, as it requires systems to reason about, synthesize, and gather disparate pieces of information, in order to generate responses to queries. Recent approaches on such tasks show increased performance, only when models are either pre-trained with additional information or when domain-specific heuristics are used, without any special consideration regarding the knowledge resource type. In this paper, we perform a survey of recent commonsense QA methods and we provide a systematic analysis of popular knowledge resources and knowledge-integration methods, across benchmarks from multiple commonsense datasets. Our results and analysis show that attention-based injection seems to be a preferable choice for knowledge integration and that the degree of domain overlap, between knowledge bases and datasets, plays a crucial role in determining model success.
Sample Complexity of Learning Mixtures of Sparse Linear Regressions
Venue: arXiv cs.LG 2019
Year: 2019

In the problem of learning mixtures of linear regressions, the goal is to learn a collection of signal vectors from a sequence of (possibly noisy) linear measurements, where each measurement is evaluated on an unknown signal drawn uniformly from this collection. This setting is quite expressive and has been studied both in terms of practical applications and for the sake of establishing theoretical guarantees. In this paper, we consider the case where the signal vectors are sparse; this generalizes the popular compressed sensing paradigm. We improve upon the state-of-the-art results as follows: In the noisy case, we resolve an open question of Yin et al. (IEEE Transactions on Information Theory, 2019) by showing how to handle collections of more than two vectors and present the first robust reconstruction algorithm, i.e., if the signals are not perfectly sparse, we still learn a good sparse approximation of the signals. In the noiseless case, as well as in the noisy case, we show how to circumvent the need for a restrictive assumption required in the previous work. Our techniques are quite different from those in the previous work: for the noiseless case, we rely on a property of sparse polynomials and for the noisy case, we provide new connections to learning Gaussian mixtures and use ideas from the theory of error-correcting codes.
Lexical Learning as an Online Optimal Experiment: Building Efficient Search Engines through Human-Machine Collaboration
Venue: arXiv cs.AI 2019
Year: 2019

Information retrieval (IR) systems need to constantly update their knowledge as target objects and user queries change over time. Due to the power-law nature of linguistic data, learning lexical concepts is a problem resisting standard machine learning approaches: while manual intervention is always possible, a more general and automated solution is desirable. In this work, we propose a novel end-to-end framework that models the interaction between a search engine and users as a virtuous human-in-the-loop inference. The proposed framework is the first to our knowledge combining ideas from psycholinguistics and experiment design to maximize efficiency in IR. We provide a brief overview of the main components and initial simulations in a toy world, showing how inference works end-to-end and discussing preliminary results and next steps.
Secure Logging with Security against Adaptive Crash Attack
Venue: arXiv cs.CR 2019
Year: 2019

Logging systems are an essential component of security systems and their security has been widely studied. Recently (2017) it was shown that existing secure logging protocols are vulnerable to crash attack in which the adversary modifies the log file and then crashes the system to make it indistinguishable from a normal system crash. The attacker was assumed to be non-adaptive and not be able to see the file content before modifying and crashing it (which will be immediately after modifying the file). The authors also proposed a system called SLiC that protects against this attacker. In this paper, we consider an (insider) adaptive adversary who can see the file content as new log operations are performed. This is a powerful adversary who can attempt to rewind the system to a past state. We formalize security against this adversary and introduce a scheme with provable security. We show that security against this attacker requires some (small) protected memory that can become accessible to the attacker after the system compromise. We show that existing secure logging schemes are insecure in this setting, even if the system provides some protected memory as above. We propose a novel mechanism that, in its basic form, uses a pair of keys that evolve at different rates, and employ this mechanism in an existing logging scheme that has forward integrity to obtain a system with provable security against adaptive (and hence non-adaptive) crash attack. We implemented our scheme on a desktop computer and a Raspberry Pi, and showed in addition to higher security, a significant efficiency gain over SLiC.
Towards A Logical Account of Epistemic Causality
Venue: arXiv cs.AI 2019
Year: 2019

Reasoning about observed effects and their causes is important in multi-agent contexts. While there has been much work on causality from an objective standpoint, causality from the point of view of some particular agent has received much less attention. In this paper, we address this issue by incorporating an epistemic dimension to an existing formal model of causality. We define what it means for an agent to know the causes of an effect. Then using a counterexample, we prove that epistemic causality is a different notion from its objective counterpart.
Parameter Sharing Decoder Pair for Auto Composing
Venue: arXiv cs.LG 2019
Year: 2019

Auto Composing is an active and appealing research area in the past few years, and lots of efforts have been put into inventing more robust models to solve this problem. With the fast evolution of deep learning techniques, some deep neural network-based language models are becoming dominant. Notably, the transformer structure has been proven to be very efficient and promising in modeling texts. However, the transformer-based language models usually contain huge number of parameters and the size of the model is usually too large to put in production for some storage limited applications. In this paper, we propose a parameter sharing decoder pair (PSDP), which reduces the number of parameters dramatically and at the same time maintains the capability of generating understandable and reasonable compositions. Works created by the proposed model are presented to demonstrate the effectiveness of the model.
Joint Communication and Computation Optimization for Wireless Powered Mobile Edge Computing with D2D Offloading
Venue: arXiv cs.IT 2019
Year: 2019

This paper studies a wireless powered mobile edge computing (MEC) system with device-to-device (D2D)-enabled task offloading. In this system, a set of distributed multi-antenna energy transmitters (ETs) use collaborative energy beamforming to wirelessly charge multiple users. By using the harvested energy, the actively computing user nodes can offload their computation tasks to nearby idle users (as helper nodes) via D2D communication links for self-sustainable remote computing. We consider the frequency division multiple access (FDMA) protocol, such that the D2D communications of different user-helper pairs are implemented over orthogonal frequency bands. Furthermore, we focus on a particular time block for task execution, which is divided into three slots for computation task offloading, remote computing, and result downloading, respectively, at different user-helper pairs. Under this setup, we jointly optimize the collaborative energy beamforming at ETs, the communication and computation resource allocation at users and helpers, and the user-helper pairing, so as to maximize the sum computation rate (i.e., the number of task input-bits executed over this block) of the users, subject to individual energy neutrality constraints at both users and helpers. First, we consider the computation rate maximization problem under any given user-helper pairs, for which an efficient solution is proposed by using the techniques of alternating optimization and convex optimization. Next, we develop the optimal user-helper pairing scheme based on exhaustive search and a low-complexity scheme based on greedy selection. Numerical results show that the proposed design significantly improves the sum computation rate at users, as compared to benchmark schemes without such joint optimization.
A neural document language modeling framework for spoken document retrieval
Venue: arXiv cs.CL 2019
Year: 2019

Recent developments in deep learning have led to a significant innovation in various classic and practical subjects, including speech recognition, computer vision, question answering, information retrieval and so on. In the context of natural language processing (NLP), language representations have shown giant successes in many downstream tasks, so the school of studies have become a major stream of research recently. Because the immenseness of multimedia data along with speech have spread around the world in our daily life, spoken document retrieval (SDR) has become an important research subject in the past decades. Targeting on enhancing the SDR performance, the paper concentrates on proposing a neural retrieval framework, which assembles the merits of using language modeling (LM) mechanism in SDR and leveraging the abstractive information learned by the language representation models. Consequently, to our knowledge, this is a pioneer study on supervised training of a neural LM-based SDR framework, especially combined with the pretrained language representation methods.
Hybrid Beamforming for Reconfigurable Intelligent Surface based Multi-user Communications: Achievable Rates with Limited Discrete Phase Shifts
Venue: arXiv cs.IT 2019
Year: 2019

Reconfigurable intelligent surface (RIS) has drawn considerable attention from the research society recently, which creates favorable propagation conditions by controlling the phase shifts of the reflected waves at the surface, thereby enhancing wireless transmissions. In this paper, we study a downlink multi-user system where the transmission from a multi-antenna base station (BS) to various users is achieved by the RIS reflecting the incident signals of the BS towards the users. Unlike most existing works, we consider the practical case where only a limited number of discrete phase shifts can be realized by the finite-sized RIS. Based on the reflection-dominated one-hop propagation model between the BS and users via the RIS, a hybrid beamforming scheme is proposed and the sum-rate maximization problem is formulated. Specifically, the continuous digital beamforming and discrete RIS-based analog beamforming are performed at the BS and the RIS, respectively, and an iterative algorithm is designed to solve this problem. Both theoretical analysis and numerical validations show that the RIS-based system can achieve a good sum-rate performance by setting a reasonable size of RIS and a small number of discrete phase shifts.
Blockchain and the Common Good Reimagined
Venue: arXiv cs.CY 2019
Year: 2019

Blockchain, Smart Contracts and Distributed Ledger Technology (DLT) are being touted to revolutionise digital services - through decentralisation. Cryptocurrencies, self-sovereign identities, decentralised certificate registries, and transparent voting systems are but a few applications which promise to empower endusers and provide assurances that neither data nor the associated computational logic have been tampered with. Decentralisation, disintermediation, transparency, verifiability, auditability, openness, inclusion, tamper-proof, immutability are just some of the buzz words that continue to be swung around in the promotion of the benefits brought about by Blockchain-based systems to the users. The rhetoric used creates parallels between the features brought about through blockchains and values that many try to uphold, for example honesty, openness, transparency, teamwork and unchanging truth. In this paper a number of blockchain applications aimed at supporting initiatives for common good are highlighted. This is followed by a discussion on technology de/centralisation and a thought experiment used to raise questions regarding the use of decentralised technology in terms of social implications.
Anisotropic compressed sensing for non-Cartesian MRI acquisitions
Venue: arXiv cs.IT 2019
Year: 2019

In the present note we develop some theoretical results in the theory of anisotropic compressed sensing that allow to take structured sparsity and variable density structured sampling into account. We expect that the obtained results will be useful to derive explicit expressions for optimal sampling strategies in the non-Cartesian (radial, spiral, etc.) setting in MRI.
Age-Based Scheduling Policy for Federated Learning in Mobile Edge Networks
Venue: arXiv cs.IT 2019
Year: 2019

Federated learning (FL) is a machine learning model that preserves data privacy in the training process. Specifically, FL brings the model directly to the user equipments (UEs) for local training, where an edge server periodically collects the trained parameters to produce an improved model and sends it back to the UEs. However, since communication usually occurs through a limited spectrum, only a portion of the UEs can update their parameters upon each global aggregation. As such, new scheduling algorithms have to be engineered to facilitate the full implementation of FL. In this paper, based on a metric termed the age of update (AoU), we propose a scheduling policy by jointly accounting for the staleness of the received parameters and the instantaneous channel qualities to improve the running efficiency of FL. The proposed algorithm has low complexity and its effectiveness is demonstrated by Monte Carol simulations.