OpenRaiser/Intern-Atlas huggingface dataset:
Bounds on the Number of Measurements for Reliable Compressive Classification
Venue: arXiv cs.IT 2016
Year: 2016

This paper studies the classification of high-dimensional Gaussian signals from low-dimensional noisy, linear measurements. In particular, it provides upper bounds (sufficient conditions) on the number of measurements required to drive the probability of misclassification to zero in the low-noise regime, both for random measurements and designed ones. Such bounds reveal two important operational regimes that are a function of the characteristics of the source: i) when the number of classes is less than or equal to the dimension of the space spanned by signals in each class, reliable classification is possible in the low-noise regime by using a one-vs-all measurement design; ii) when the dimension of the spaces spanned by signals in each class is lower than the number of classes, reliable classification is guaranteed in the low-noise regime by using a simple random measurement design. Simulation results both with synthetic and real data show that our analysis is sharp, in the sense that it is able to gauge the number of measurements required to drive the misclassification probability to zero in the low-noise regime.
Mapping distributional to model-theoretic semantic spaces: a baseline
Venue: arXiv cs.CL 2016
Year: 2016

Word embeddings have been shown to be useful across state-of-the-art systems in many natural language processing tasks, ranging from question answering systems to dependency parsing. (Herbelot and Vecchi, 2015) explored word embeddings and their utility for modeling language semantics. In particular, they presented an approach to automatically map a standard distributional semantic space onto a set-theoretic model using partial least squares regression. We show in this paper that a simple baseline achieves a +51% relative improvement compared to their model on one of the two datasets they used, and yields competitive results on the second dataset.
Capacity Bounds for Networks with Correlated Sources and Characterisation of Distributions by Entropies
Venue: arXiv cs.IT 2016
Year: 2016

Characterising the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of characterising all information inequalities. The majority of computable outer bounds in the literature are relaxations of the Linear Programming bound which involves entropy functions of random variables related to the sources and link messages. When sources are not independent, the problem is even more complicated. Extension of Linear Programming bounds to networks with correlated sources is largely open. Source dependence is usually specified via a joint probability distribution, and one of the main challenges in extending linear program bounds is the difficulty (or impossibility) of characterising arbitrary dependencies via entropy functions. This paper tackles the problem by answering the question of how well entropy functions can characterise correlation among sources. We show that by using carefully chosen auxiliary random variables, the characterisation can be fairly "accurate" Using such auxiliary random variables we also give implicit and explicit outer bounds on the capacity of networks with correlated sources. The characterisation of correlation or joint distribution via Shannon entropy functions is also applicable to other information measures such as Renyi entropy and Tsallis entropy.
Classifying Variable-Length Audio Files with All-Convolutional Networks and Masked Global Pooling
Venue: arXiv cs.NE 2016
Year: 2016

We trained a deep all-convolutional neural network with masked global pooling to perform single-label classification for acoustic scene classification and multi-label classification for domestic audio tagging in the DCASE-2016 contest. Our network achieved an average accuracy of 84.5% on the four-fold cross-validation for acoustic scene recognition, compared to the provided baseline of 72.5%, and an average equal error rate of 0.17 for domestic audio tagging, compared to the baseline of 0.21. The network therefore improves the baselines by a relative amount of 17% and 19%, respectively. The network only consists of convolutional layers to extract features from the short-time Fourier transform and one global pooling layer to combine those features. It particularly possesses neither fully-connected layers, besides the fully-connected output layer, nor dropout layers.
On the Structure of Equilibrium Strategies in Dynamic Gaussian Signaling Games
Venue: arXiv cs.SY 2016
Year: 2016

This paper analyzes a finite horizon dynamic signaling game motivated by the well-known strategic information transmission problems in economics. The mathematical model involves information transmission between two agents, a sender who observes two Gaussian processes, state and bias, and a receiver who takes an action based on the received message from the sender. The players incur quadratic instantaneous costs as functions of the state, bias and action variables. Our particular focus is on the Stackelberg equilibrium, which corresponds to information disclosure and Bayesian persuasion problems in economics. Prior work solved the static game, and showed that the Stackelberg equilibrium is achieved by pure strategies that are linear functions of the state and the bias variables. The main focus of this work is on the dynamic (multi-stage) setting, where we show that the existence of a pure strategy Stackelberg equilibrium, within the set of linear strategies, depends on the problem parameters. Surprisingly, for most problem parameters, a pure linear strategy does not achieve the Stackelberg equilibrium which implies the existence of a trade-off between exploiting and revealing information, which was also encountered in several other asymmetric information games.
Initial Experiments on Learning-Based Randomized Bin-Picking Allowing Finger Contact with Neighboring Objects
Venue: arXiv cs.RO 2016
Year: 2016

This paper proposes a novel method for randomized bin-picking based on learning. When a two-fingered gripper tries to pick an object from the pile, a finger often contacts a neighboring object. Even if a finger contacts a neighboring object, the target object will be successfully picked depending on the configuration of neighboring objects. In our proposed method, we use the visual information on neighboring objects to train the discriminator. Corresponding to a grasping posture of an object, the discriminator predicts whether or not the pick will be successful even if a finger contacts a neighboring object. We examine two learning algorithms, the linear support vector machine (SVM) and the random forest (RF) approaches. By using both methods, we demonstrate that the picking success rate is significantly higher than with conventional methods without learning.
Minimum Description Length Principle in Supervised Learning with Application to Lasso
Venue: arXiv cs.IT 2016
Year: 2016

The minimum description length (MDL) principle in supervised learning is studied. One of the most important theories for the MDL principle is Barron and Cover's theory (BC theory), which gives a mathematical justification of the MDL principle. The original BC theory, however, can be applied to supervised learning only approximately and limitedly. Though Barron et al. recently succeeded in removing a similar approximation in case of unsupervised learning, their idea cannot be essentially applied to supervised learning in general. To overcome this issue, an extension of BC theory to supervised learning is proposed. The derived risk bound has several advantages inherited from the original BC theory. First, the risk bound holds for finite sample size. Second, it requires remarkably few assumptions. Third, the risk bound has a form of redundancy of the two-stage code for the MDL procedure. Hence, the proposed extension gives a mathematical justification of the MDL principle to supervised learning like the original BC theory. As an important example of application, new risk and (probabilistic) regret bounds of lasso with random design are derived. The derived risk bound holds for any finite sample size $n$ and feature number $p$ even if $n\ll p$ without boundedness of features in contrast to the past work. Behavior of the regret bound is investigated by numerical simulations. We believe that this is the first extension of BC theory to general supervised learning with random design without approximation.
Wireless Power Transfer in Massive MIMO Aided HetNets with User Association
Venue: arXiv cs.IT 2016
Year: 2016

This paper explores the potential of wireless power transfer (WPT) in massive multiple input multiple output (MIMO) aided heterogeneous networks (HetNets), where massive MIMO is applied in the macrocells, and users aim to harvest as much energy as possible and reduce the uplink path loss for enhancing their information transfer. By addressing the impact of massive MIMO on the user association, we compare and analyze two user association schemes. We adopt the linear maximal ratio transmission beam-forming for massive MIMO power transfer to recharge users. By deriving new statistical properties, we obtain the exact and asymptotic expressions for the average harvested energy. Then we derive the average uplink achievable rate under the harvested energy constraint.
Clearing an Orthogonal Polygon Using Sliding Robots
Venue: arXiv cs.CG 2016
Year: 2016

In a multi-robot system, a number of autonomous robots would sense, communicate, and decide to move within a given domain to achieve a common goal. In this paper, we consider a new variant of the pursuit-evasion problem in which the robots (pursuers) each move back and forth along an orthogonal line segment inside a simple orthogonal polygon $P$. A point $p$ can be covered by a sliding robot that moves along a line segment s, if there exists a point $q\in s$ such that $\overline{pq}$ is a line segment perpendicular to $s$. In the pursuit-evasion problem, a polygonal region is given and a robot called a pursuer tries to find some mobile targets called evaders. The goal of this problem is to design a motion strategy for the pursuer such that it can detect all the evaders. We assume that $P$ includes unpredictable, moving evaders that have unbounded speed. We propose a motion-planning algorithm for a group of sliding robots, assuming that they move along the pre-located line segments with a constant speed to detect all the evaders with unbounded speed.
Inexact Block Coordinate Descent Methods For Symmetric Nonnegative Matrix Factorization
Venue: arXiv cs.NA 2016
Year: 2016

Symmetric nonnegative matrix factorization (SNMF) is equivalent to computing a symmetric nonnegative low rank approximation of a data similarity matrix. It inherits the good data interpretability of the well-known nonnegative matrix factorization technique and have better ability of clustering nonlinearly separable data. In this paper, we focus on the algorithmic aspect of the SNMF problem and propose simple inexact block coordinate decent methods to address the problem, leading to both serial and parallel algorithms. The proposed algorithms have guaranteed stationary convergence and can efficiently handle large-scale and/or sparse SNMF problems. Extensive simulations verify the effectiveness of the proposed algorithms compared to recent state-of-the-art algorithms.
Systholic Boolean Orthonormalizer Network in Wavelet Domain for SAR Image Despeckling
Venue: arXiv cs.CV 2016
Year: 2016

We describe a novel method for removing speckle (in wavelet domain) of unknown variance from SAR images. The me-thod is based on the following procedure: We apply 1) Bidimentional Discrete Wavelet Transform (DWT-2D) to the speckled image, 2) scaling and rounding to the coefficients of the highest subbands (to obtain integer and positive coefficients), 3) bit-slicing to the new highest subbands (to obtain bit-planes), 4) then we apply the Systholic Boolean Orthonormalizer Network (SBON) to the input bit-plane set and we obtain two orthonormal output bit-plane sets (in a Boolean sense), we project a set on the other one, by means of an AND operation, and then, 5) we apply re-assembling, and, 6) re-sca-ling. Finally, 7) we apply Inverse DWT-2D and reconstruct a SAR image from the modified wavelet coefficients. Despeckling results compare favorably to the most of methods in use at the moment.
Privacy-Enhanced Architecture for Occupancy-based HVAC Control
Venue: arXiv cs.CR 2016
Year: 2016

Large-scale sensing and actuation infrastructures have allowed buildings to achieve significant energy savings; at the same time, these technologies introduce significant privacy risks that must be addressed. In this paper, we present a framework for modeling the trade-off between improved control performance and increased privacy risks due to occupancy sensing. More specifically, we consider occupancy-based HVAC control as the control objective and the location traces of individual occupants as the private variables. Previous studies have shown that individual location information can be inferred from occupancy measurements. To ensure privacy, we design an architecture that distorts the occupancy data in order to hide individual occupant location information while maintaining HVAC performance. Using mutual information between the individual's location trace and the reported occupancy measurement as a privacy metric, we are able to optimally design a scheme to minimize privacy risk subject to a control performance guarantee. We evaluate our framework using real-world occupancy data: first, we verify that our privacy metric accurately assesses the adversary's ability to infer private variables from the distorted sensor measurements; then, we show that control performance is maintained through simulations of building operations using these distorted occupancy readings.
Gland Instance Segmentation by Deep Multichannel Side Supervision
Venue: arXiv cs.CV 2016
Year: 2016

In this paper, we propose a new image instance segmentation method that segments individual glands (instances) in colon histology images. This is a task called instance segmentation that has recently become increasingly important. The problem is challenging since not only do the glands need to be segmented from the complex background, they are also required to be individually identified. Here we leverage the idea of image-to-image prediction in recent deep learning by building a framework that automatically exploits and fuses complex multichannel information, regional and boundary patterns, with side supervision (deep supervision on side responses) in gland histology images. Our proposed system, deep multichannel side supervision (DMCS), alleviates heavy feature design due to the use of convolutional neural networks guided by side supervision. Compared to methods reported in the 2015 MICCAI Gland Segmentation Challenge, we observe state-of-the-art results based on a number of evaluation metrics.
Modified LLL algorithm with shifted start column
Venue: arXiv cs.IT 2016
Year: 2016

Multiple-input multiple-output (MIMO) systems are playing an important role in the recent wireless communication. The complexity of the different systems models challenge different researches to get a good complexity to performance balance. Lattices Reduction Techniques and Lenstra-Lenstra-Lovasz (LLL) algorithm bring more resources to investigate and can contribute to the complexity reduction purposes. In this paper, we are looking to modify the LLL algorithm to reduce the computation operations by exploiting the structure of the upper triangular matrix without big performance degradation. Basically, the first columns of the upper triangular matrix contain many zeroes, so the algorithm will perform several operations with very limited income. We are presenting a performance and complexity study and our proposal show that we can gain in term of complexity while the performance results remains almost the same.
Performance and Complexity Analysis of a Reduced Iterations LLL Algorithm
Venue: arXiv cs.IT 2016
Year: 2016

Multiple-input multiple-output (MIMO) systems are playing an increasing and interesting role in the recent wireless communication. The complexity and the performance of the systems are driving the different studies and researches. Lattices Reduction techniques bring more resources to investigate the complexity and performances of such systems. In this paper, we look to modify a fixed complexity verity of the LLL algorithm to reduce the computation operations by reducing the number of iterations without important performance degradation. Our proposal shows that we can achieve a good performance results while avoiding extra iteration that does not bring much performance.
Analytical and Simulation Performance of a Typical User in Random Cellular Network
Venue: arXiv cs.IT 2016
Year: 2016

Spatial Poisson Point Process (PPP) network, whose Base Stations (BS)s are distributed according to a Poisson distribution, is currently used as a accurate model to analyse the performance of a cellular network. Most current work on evaluation of PPP network in Rayleigh fading channels are usually assumed that the BSs have fixed transmission power levels and there is only a Resource Block (RB) or a user in each cell. In this paper, the Rayleigh-Lognormal fading channels are considered, and it is assumed that each cell is allocated $N$ Resource Blocks (RB) to serve M users. Furthermore, the serving and interfering BS of a typical user are assumed to transmit at different power levels. The closed-form expression for the network coverage probability for both low and high SNR is derived by using Gauss-Legendre approximation. The analytical results indicates that the performance of the typical user is proportional to the transmission power and density of BSs when SNR<10 dB and λ<1, and reaches the upper bound when SNR>10 dB or λ>1. The variance of Monte Carlo simulation is considered to verify the stability and accuracy of simulation results.
Automatic Bridge Bidding Using Deep Reinforcement Learning
Venue: arXiv cs.AI 2016
Year: 2016

Bridge is among the zero-sum games for which artificial intelligence has not yet outperformed expert human players. The main difficulty lies in the bidding phase of bridge, which requires cooperative decision making under partial information. Existing artificial intelligence systems for bridge bidding rely on and are thus restricted by human-designed bidding systems or features. In this work, we propose a pioneering bridge bidding system without the aid of human domain knowledge. The system is based on a novel deep reinforcement learning model, which extracts sophisticated features and learns to bid automatically based on raw card data. The model includes an upper-confidence-bound algorithm and additional techniques to achieve a balance between exploration and exploitation. Our experiments validate the promising performance of our proposed model. In particular, the model advances from having no knowledge about bidding to achieving superior performance when compared with a champion-winning computer bridge program that implements a human-designed bidding system.
Implicit Negative Feedback in Clinical Information Retrieval
Venue: arXiv cs.IR 2016
Year: 2016

In this paper, we reflect on ways to improve the quality of bio-medical information retrieval by drawing implicit negative feedback from negated information in noisy natural language search queries. We begin by studying the extent to which negations occur in clinical texts and quantify their detrimental effect on retrieval performance. Subsequently, we present a number of query reformulation and ranking approaches that remedy these shortcomings by resolving natural language negations. Our experimental results are based on data collected in the course of the TREC Clinical Decision Support Track and show consistent improvements compared to state-of-the-art methods. Using our novel algorithms, we are able to reduce the negative impact of negations on early precision by up to 65%.
What Happens After You Both Swipe Right: A Statistical Description of Mobile Dating Communications
Venue: arXiv cs.SI 2016
Year: 2016

Mobile dating applications (MDAs) have skyrocketed in popularity in the last few years, with popular MDA Tinder alone matching 26 million pairs of users per day. In addition to becoming an influential part of modern dating culture, MDAs facilitate a unique form of mediated communication: dyadic mobile text messages between pairs of users who are not already acquainted. Furthermore, mobile dating has paved the way for analysis of these digital interactions via massive sets of data generated by the instant matching and messaging functions of its many platforms at an unprecedented scale. This paper looks at one of these sets of data: metadata of approximately two million conversations, containing 19 million messages, exchanged between 400,000 heterosexual users on an MDA. Through computational analysis methods, this study offers the very first large scale quantitative depiction of mobile dating as a whole. We report on differences in how heterosexual male and female users communicate with each other on MDAs, differences in behaviors of dyads of varying degrees of social separation, and factors leading to "success"-operationalized by the exchange of phone numbers between a match. For instance, we report that men initiate 79% of conversations--and while about half of the initial messages are responded to, conversations initiated by men are more likely to be reciprocated. We also report that the length of conversations, the waiting times, and the length of messages have fat-tailed distributions. That said, the majority of reciprocated conversations lead to a phone number exchange within the first 20 messages.
Real-time Rescheduling in Distributed Railway Network: An Agent-Based Approach
Venue: arXiv cs.MA 2016
Year: 2016

This paper addresses the issues concerning the rescheduling of a static timetable in case of a disaster encountered in a large and complex railway network system. The proposed approach tries to modify the schedule so as to minimise the overall delay of trains. This is achieved by representing the rescheduling problem in the form of a Petri-Net and the highly uncertain disaster recovery times in such a model is handled as Markov Decision Processes (MDP ). For solving the rescheduling problem, a istributed Constraint Optimisation (DCOP ) based strategy involving the use of autonomous agents is used to generate the desired schedule. The proposed approach is evaluated on the actual schedule of the Eastern Railways, India by constructing vari- ous disaster scenarios using the Java Agent DEvelopment Framework (JADE). When compared to the existing approaches, the proposed framework substantially reduces the delay of trains after rescheduling.
Extended Graded Modalities in Strategy Logic
Venue: arXiv cs.GT 2016
Year: 2016

Strategy Logic (SL) is a logical formalism for strategic reasoning in multi-agent systems. Its main feature is that it has variables for strategies that are associated to specific agents with a binding operator. We introduce Graded Strategy Logic (GradedSL), an extension of SL by graded quantifiers over tuples of strategy variables, i.e., "there exist at least g different tuples (x_1,...,x_n) of strategies" where g is a cardinal from the set N union {aleph_0, aleph_1, 2^aleph_0}. We prove that the model-checking problem of GradedSL is decidable. We then turn to the complexity of fragments of GradedSL. When the g's are restricted to finite cardinals, written GradedNSL, the complexity of model-checking is no harder than for SL, i.e., it is non-elementary in the quantifier rank. We illustrate our formalism by showing how to count the number of different strategy profiles that are Nash equilibria (NE), or subgame-perfect equilibria (SPE). By analyzing the structure of the specific formulas involved, we conclude that the important problems of checking for the existence of a unique NE or SPE can both be solved in 2ExpTime, which is not harder than merely checking for the existence of such equilibria.