OpenRaiser/Intern-Atlas huggingface dataset:
A3T: Adversarially Augmented Adversarial Training
Venue: arXiv cs.LG 2018
Year: 2018

Recent research showed that deep neural networks are highly sensitive to so-called adversarial perturbations, which are tiny perturbations of the input data purposely designed to fool a machine learning classifier. Most classification models, including deep learning models, are highly vulnerable to adversarial attacks. In this work, we investigate a procedure to improve adversarial robustness of deep neural networks through enforcing representation invariance. The idea is to train the classifier jointly with a discriminator attached to one of its hidden layer and trained to filter the adversarial noise. We perform preliminary experiments to test the viability of the approach and to compare it to other standard adversarial training methods.
How Many Samples Required in Big Data Collection: A Differential Message Importance Measure
Venue: arXiv cs.IT 2018
Year: 2018

Information collection is a fundamental problem in big data, where the size of sampling sets plays a very important role. This work considers the information collection process by taking message importance into account. Similar to differential entropy, we define differential message importance measure (DMIM) as a measure of message importance for continuous random variable. It is proved that the change of DMIM can describe the gap between the distribution of a set of sample values and a theoretical distribution. In fact, the deviation of DMIM is equivalent to Kolmogorov-Smirnov statistic, but it offers a new way to characterize the distribution goodness-of-fit. Numerical results show some basic properties of DMIM and the accuracy of the proposed approximate values. Furthermore, it is also obtained that the empirical distribution approaches the real distribution with decreasing of the DMIM deviation, which contributes to the selection of suitable sampling points in actual system.
Symbolic Timed Observational Equivalence
Venue: arXiv cs.LO 2018
Year: 2018

Intruders can infer properties of a system by measuring the time it takes for the system to respond to some request of a given protocol, that is, by exploiting time side channels. These properties may help intruders distinguish whether a system is a honeypot or concrete system helping him avoid defense mechanisms, or track a user among others violating his privacy. Observational equivalence is the technical machinery used for verifying whether two systems are distinguishable. Moreover, efficient symbolic methods have been developed for automating the check of observational equivalence of systems. This paper introduces a novel definition of timed observational equivalence which also distinguishes systems according to their time side channels. Moreover, as our definition uses symbolic time constraints, it can be automated by using SMT-solvers.
Trust-Aware Decision Making for Human-Robot Collaboration: Model Learning and Planning
Venue: arXiv cs.RO 2018
Year: 2018

Trust in autonomy is essential for effective human-robot collaboration and user adoption of autonomous systems such as robot assistants. This paper introduces a computational model which integrates trust into robot decision-making. Specifically, we learn from data a partially observable Markov decision process (POMDP) with human trust as a latent variable. The trust-POMDP model provides a principled approach for the robot to (i) infer the trust of a human teammate through interaction, (ii) reason about the effect of its own actions on human trust, and (iii) choose actions that maximize team performance over the long term. We validated the model through human subject experiments on a table-clearing task in simulation (201 participants) and with a real robot (20 participants). In our studies, the robot builds human trust by manipulating low-risk objects first. Interestingly, the robot sometimes fails intentionally in order to modulate human trust and achieve the best team performance. These results show that the trust-POMDP calibrates trust to improve human-robot team performance over the long term. Further, they highlight that maximizing trust alone does not always lead to the best performance.
Deep Episodic Memory: Encoding, Recalling, and Predicting Episodic Experiences for Robot Action Execution
Venue: arXiv cs.AI 2018
Year: 2018

We present a novel deep neural network architecture for representing robot experiences in an episodic-like memory which facilitates encoding, recalling, and predicting action experiences. Our proposed unsupervised deep episodic memory model 1) encodes observed actions in a latent vector space and, based on this latent encoding, 2) infers most similar episodes previously experienced, 3) reconstructs original episodes, and 4) predicts future frames in an end-to-end fashion. Results show that conceptually similar actions are mapped into the same region of the latent vector space. Based on these results, we introduce an action matching and retrieval mechanism, benchmark its performance on two large-scale action datasets, 20BN-something-something and ActivityNet and evaluate its generalization capability in a real-world scenario on a humanoid robot.
Desingularization in the $q$-Weyl algebra
Venue: arXiv cs.SC 2018
Year: 2018

In this paper, we study the desingularization problem in the first $q$-Weyl algebra. We give an order bound for desingularized operators, and thus derive an algorithm for computing desingularized operators in the first $q$-Weyl algebra. Moreover, an algorithm is presented for computing a generating set of the first $q$-Weyl closure of a given $q$-difference operator. As an application, we certify that several instances of the colored Jones polynomial are Laurent polynomial sequences by computing the corresponding desingularized operator.
Machine Intelligence Techniques for Next-Generation Context-Aware Wireless Networks
Venue: arXiv cs.IT 2018
Year: 2018

The next generation wireless networks (i.e. 5G and beyond), which would be extremely dynamic and complex due to the ultra-dense deployment of heterogeneous networks (HetNets), poses many critical challenges for network planning, operation, management and troubleshooting. At the same time, generation and consumption of wireless data are becoming increasingly distributed with ongoing paradigm shift from people-centric to machine-oriented communications, making the operation of future wireless networks even more complex. In mitigating the complexity of future network operation, new approaches of intelligently utilizing distributed computational resources with improved context-awareness becomes extremely important. In this regard, the emerging fog (edge) computing architecture aiming to distribute computing, storage, control, communication, and networking functions closer to end users, have a great potential for enabling efficient operation of future wireless networks. These promising architectures make the adoption of artificial intelligence (AI) principles which incorporate learning, reasoning and decision-making mechanism, as natural choices for designing a tightly integrated network. Towards this end, this article provides a comprehensive survey on the utilization of AI integrating machine learning, data analytics and natural language processing (NLP) techniques for enhancing the efficiency of wireless network operation. In particular, we provide comprehensive discussion on the utilization of these techniques for efficient data acquisition, knowledge discovery, network planning, operation and management of the next generation wireless networks. A brief case study utilizing the AI techniques for this network has also been provided.
Generalization Error Bounds for Noisy, Iterative Algorithms
Venue: arXiv cs.LG 2018
Year: 2018

In statistical learning theory, generalization error is used to quantify the degree to which a supervised machine learning algorithm may overfit to training data. Recent work [Xu and Raginsky (2017)] has established a bound on the generalization error of empirical risk minimization based on the mutual information $I(S;W)$ between the algorithm input $S$ and the algorithm output $W$, when the loss function is sub-Gaussian. We leverage these results to derive generalization error bounds for a broad class of iterative algorithms that are characterized by bounded, noisy updates with Markovian structure. Our bounds are very general and are applicable to numerous settings of interest, including stochastic gradient Langevin dynamics (SGLD) and variants of the stochastic gradient Hamiltonian Monte Carlo (SGHMC) algorithm. Furthermore, our error bounds hold for any output function computed over the path of iterates, including the last iterate of the algorithm or the average of subsets of iterates, and also allow for non-uniform sampling of data in successive updates of the algorithm.
Light Field Super-Resolution using a Low-Rank Prior and Deep Convolutional Neural Networks
Venue: arXiv cs.CV 2018
Year: 2018

Light field imaging has recently known a regain of interest due to the availability of practical light field capturing systems that offer a wide range of applications in the field of computer vision. However, capturing high-resolution light fields remains technologically challenging since the increase in angular resolution is often accompanied by a significant reduction in spatial resolution. This paper describes a learning-based spatial light field super-resolution method that allows the restoration of the entire light field with consistency across all sub-aperture images. The algorithm first uses optical flow to align the light field and then reduces its angular dimension using low-rank approximation. We then consider the linearly independent columns of the resulting low-rank model as an embedding, which is restored using a deep convolutional neural network (DCNN). The super-resolved embedding is then used to reconstruct the remaining sub-aperture images. The original disparities are restored using inverse warping where missing pixels are approximated using a novel light field inpainting algorithm. Experimental results show that the proposed method outperforms existing light field super-resolution algorithms, achieving PSNR gains of 0.23 dB over the second best performing method. This performance can be further improved using iterative back-projection as a post-processing step.
Prototypicality effects in global semantic description of objects
Venue: arXiv cs.CV 2018
Year: 2018

In this paper, we introduce a novel approach for semantic description of object features based on the prototypicality effects of the Prototype Theory. Our prototype-based description model encodes and stores the semantic meaning of an object, while describing its features using the semantic prototype computed by CNN-classifications models. Our method uses semantic prototypes to create discriminative descriptor signatures that describe an object highlighting its most distinctive features within the category. Our experiments show that: i) our descriptor preserves the semantic information used by the CNN-models in classification tasks; ii) our distance metric can be used as the object's typicality score; iii) our descriptor signatures are semantically interpretable and enables the simulation of the prototypical organization of objects within a category.
A Computational Model of Commonsense Moral Decision Making
Venue: arXiv cs.AI 2018
Year: 2018

We introduce a new computational model of moral decision making, drawing on a recent theory of commonsense moral learning via social dynamics. Our model describes moral dilemmas as a utility function that computes trade-offs in values over abstract moral dimensions, which provide interpretable parameter values when implemented in machine-led ethical decision-making. Moreover, characterizing the social structures of individuals and groups as a hierarchical Bayesian model, we show that a useful description of an individual's moral values - as well as a group's shared values - can be inferred from a limited amount of observed data. Finally, we apply and evaluate our approach to data from the Moral Machine, a web application that collects human judgments on moral dilemmas involving autonomous vehicles.
SCLib: A Practical and Lightweight Defense against Component Hijacking in Android Applications
Venue: arXiv cs.CR 2018
Year: 2018

Cross-app collaboration via inter-component communication is a fundamental mechanism on Android. Although it brings the benefits such as functionality reuse and data sharing, a threat called component hijacking is also introduced. By hijacking a vulnerable component in victim apps, an attack app can escalate its privilege for operations originally prohibited. Many prior studies have been performed to understand and mitigate this issue, but no defense is being deployed in the wild, largely due to the deployment difficulties and performance concerns. In this paper we present SCLib, a secure component library that performs in-app mandatory access control on behalf of app components. It does not require firmware modification or app repackaging as in previous works. The library-based nature also makes SCLib more accessible to app developers, and enables them produce secure components in the first place over fragmented Android devices. As a proof of concept, we design six mandatory policies and overcome unique implementation challenges to mitigate attacks originated from both system weaknesses and common developer mistakes. Our evaluation using ten high-profile open source apps shows that SCLib can protect their 35 risky components with negligible code footprint (less than 0.3% stub code) and nearly no slowdown to normal intra-app communications. The worst-case performance overhead to stop attacks is about 5%.
Can you Trust the Trend: Discovering Simpson's Paradoxes in Social Data
Venue: arXiv cs.CY 2018
Year: 2018

We investigate how Simpson's paradox affects analysis of trends in social data. According to the paradox, the trends observed in data that has been aggregated over an entire population may be different from, and even opposite to, those of the underlying subgroups. Failure to take this effect into account can lead analysis to wrong conclusions. We present a statistical method to automatically identify Simpson's paradox in data by comparing statistical trends in the aggregate data to those in the disaggregated subgroups. We apply the approach to data from Stack Exchange, a popular question-answering platform, to analyze factors affecting answerer performance, specifically, the likelihood that an answer written by a user will be accepted by the asker as the best answer to his or her question. Our analysis confirms a known Simpson's paradox and identifies several new instances. These paradoxes provide novel insights into user behavior on Stack Exchange.
Sparse NOMA: A Closed-Form Characterization
Venue: arXiv cs.IT 2018
Year: 2018

Understanding fundamental limits of the various technologies suggested for future 5G and beyond cellular systems is crucial for developing efficient state-of-the-art designs. A leading technology of major interest is non-orthogonal multiple-access (NOMA). In this paper, we derive an explicit rigorous closed-form analytical expression for the optimum spectral efficiency in the large-system limit of regular sparse NOMA, where only a fixed and finite number of orthogonal resources are allocated to any designated user, and vice versa. The basic Verdú-Shamai formula for (dense) randomly-spread code-division multiple-access (RS-CDMA) turns out to coincide with the limit of the derived expression, when the number of orthogonal resources per user grows large. Furthermore, regular sparse NOMA is rigorously shown to be spectrally more efficient than RS-CDMA across the entire system load range. It may therefore serve as an efficient means for reducing the throughput gap to orthogonal transmission in the underloaded regime, and to the ultimate Cover-Wyner bound in overloaded systems. The results analytically reinforce preliminary conclusions in [1], which mostly relied on heuristics and numerical observations. The spectral efficiency is also derived in closed form for the suboptimal linear minimum-mean-square-error (LMMSE) receiver, which again extends the corresponding Verdú-Shamai LMMSE formula to regular sparse NOMA.
Simple Unsupervised Keyphrase Extraction using Sentence Embeddings
Venue: arXiv cs.CL 2018
Year: 2018

Keyphrase extraction is the task of automatically selecting a small set of phrases that best describe a given free text document. Supervised keyphrase extraction requires large amounts of labeled training data and generalizes very poorly outside the domain of the training data. At the same time, unsupervised systems have poor accuracy, and often do not generalize well, as they require the input document to belong to a larger corpus also given as input. Addressing these drawbacks, in this paper, we tackle keyphrase extraction from single documents with EmbedRank: a novel unsupervised method, that leverages sentence embeddings. EmbedRank achieves higher F-scores than graph-based state of the art systems on standard datasets and is suitable for real-time processing of large amounts of Web data. With EmbedRank, we also explicitly increase coverage and diversity among the selected keyphrases by introducing an embedding-based maximal marginal relevance (MMR) for new phrases. A user study including over 200 votes showed that, although reducing the phrases' semantic overlap leads to no gains in F-score, our high diversity selection is preferred by humans.
Non-Orthogonal Multiple Access for mmWave Drone Networks with Limited Feedback
Venue: arXiv cs.IT 2018
Year: 2018

Unmanned aerial vehicle (UAV) base stations (BSs) can be a promising solution to provide connectivity and quality of service (QoS) guarantees during temporary events and after disasters. In this paper, we consider a scenario where UAV-BSs are serving large number of mobile users in a hot spot area (e.g., in a stadium). We introduce non-orthogonal multiple access (NOMA) transmission at UAV-BSs to serve more users simultaneously considering user distances as the available feedback for user ordering during NOMA formulation. With millimeter-wave (mmWave) transmission and multi-antenna techniques, we assume UAV-BS generates directional beams and multiple users are served simultaneously within the same beam. However, due to the limitations of physical vertical beamwidth of the UAV-BS beam, it may not be possible to cover the entire user region at UAV altitudes of practical relevance. During such situations, a beam scanning approach is proposed to maximize the achievable sum rates. We develop a comprehensive framework over which outage probabilities and respective sum rates are derived rigorously and we investigate the optimal operational altitude of UAV-BS to maximize the sum rates using our analytical framework. Our analysis shows that NOMA with distance feedback can provide better outage sum rates compared to orthogonal multiple access.
Entropy Measures of Human Communication Dynamics
Venue: arXiv cs.SI 2018
Year: 2018

Human communication is commonly represented as a temporal social network, and evaluated in terms of its uniqueness. We propose a set of new entropy-based measures for human communication dynamics represented within the temporal social network as event sequences. Using real world datasets and random interaction series of different types we find that real human contact events always significantly differ from random ones. This human distinctiveness increases over time and by means of the proposed entropy measures, we can observe sociological processes that take place within dynamic communities.
Throughput Maximization for UAV-Enabled Wireless Powered Communication Networks
Venue: arXiv cs.IT 2018
Year: 2018

This paper studies an unmanned aerial vehicle (UAV)-enabled wireless powered communication network (WPCN), in which a UAV is dispatched as a mobile access point (AP) to serve a set of ground users periodically. The UAV employs the radio frequency (RF) wireless power transfer (WPT) to charge the users in the downlink, and the users use the harvested RF energy to send independent information to the UAV in the uplink. Unlike the conventional WPCN with fixed APs, the UAV-enabled WPCN can exploit the mobility of the UAV via trajectory design, jointly with the wireless resource allocation optimization, to maximize the system throughput. In particular, we aim to maximize the uplink common (minimum) throughput among all ground users over a finite UAV's flight period, subject to its maximum speed constraint and the users' energy neutrality constraints. The resulted problem is non-convex and thus difficult to be solved optimally. To tackle this challenge, we first consider an ideal case without the UAV's maximum speed constraint, and obtain the optimal solution to the relaxed problem. The optimal solution shows that the UAV should successively hover above a finite number of ground locations for downlink WPT, as well as above each of the ground users for uplink communication. Next, we consider the general problem with the UAV's maximum speed constraint. Based on the above multi-location-hovering solution, we first propose an efficient successive hover-and-fly trajectory design, jointly with the downlink and uplink wireless resource allocation, and then propose a locally optimal solution by applying the techniques of alternating optimization and successive convex programming (SCP). Numerical results show that the proposed UAV-enabled WPCN achieves significant throughput gains over the conventional WPCN with fixed-location AP.
Algorithmic Polynomials
Venue: arXiv cs.CC 2018
Year: 2018

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general. Nearly all known upper bounds on approximate degree arise in an existential manner from bounds on quantum query complexity. We develop a first-principles, classical approach to the polynomial approximation of Boolean functions. We use it to give the first constructive upper bounds on the approximate degree of several fundamental problems: - $O\bigl(n^{\frac{3}{4}-\frac{1}{4(2^{k}-1)}}\bigr)$ for the $k$-element distinctness problem; - $O(n^{1-\frac{1}{k+1}})$ for the $k$-subset sum problem; - $O(n^{1-\frac{1}{k+1}})$ for any $k$-DNF or $k$-CNF formula; - $O(n^{3/4})$ for the surjectivity problem. In all cases, we obtain explicit, closed-form approximating polynomials that are unrelated to the quantum arguments from previous work. Our first three results match the bounds from quantum query complexity. Our fourth result improves polynomially on the $Θ(n)$ quantum query complexity of the problem and refutes the conjecture by several experts that surjectivity has approximate degree $Ω(n)$. In particular, we exhibit the first natural problem with a polynomial gap between approximate degree and quantum query complexity.