OpenRaiser/Intern-Atlas huggingface dataset:
The Game Performance Index for Mobile Phones
Venue: arXiv cs.HC 2019
Year: 2019

With the recent increase in the quantity of high fidelity games appearing on mobile devices and the recent trend of gaming focused mobile devices, there is a new requirement for a clear and comprehensive measure of the quality of gaming performance on the mobile device platform. This paper proposes a conceptual framework for a user-experience and user-perception based set of performance measures for mobile devices. This paper presents a specific implementation and measurement use case which has been beneficial to Samsung Electronics when applied to our own product range, allowing us to better understand and quantify device performance. We believe that the methods outlined are potentially useful to the consumer, by providing an understandable public facing score for device performance to guide consumers with purchasing decisions. The methods may be useful to game developers and could better enable the developer to add new richer game features based on the performance of the device.
Comprehensive Video Understanding: Video summarization with content-based video recommender design
Venue: arXiv cs.CV 2019
Year: 2019

Video summarization aims to extract keyframes/shots from a long video. Previous methods mainly take diversity and representativeness of generated summaries as prior knowledge in algorithm design. In this paper, we formulate video summarization as a content-based recommender problem, which should distill the most useful content from a long video for users who suffer from information overload. A scalable deep neural network is proposed on predicting if one video segment is a useful segment for users by explicitly modelling both segment and video. Moreover, we accomplish scene and action recognition in untrimmed videos in order to find more correlations among different aspects of video understanding tasks. Also, our paper will discuss the effect of audio and visual features in summarization task. We also extend our work by data augmentation and multi-task learning for preventing the model from early-stage overfitting. The final results of our model win the first place in ICCV 2019 CoView Workshop Challenge Track.
Interplay between Topology and Social Learning over Weak Graphs
Venue: arXiv cs.MA 2019
Year: 2019

We consider a social learning problem, where a network of agents is interested in selecting one among a finite number of hypotheses. We focus on weakly-connected graphs where the network is partitioned into a sending part and a receiving part. The data collected by the agents might be heterogeneous. For example, some sub-networks might intentionally generate data from a fake hypothesis in order to influence other agents. The social learning task is accomplished via a diffusion strategy where each agent: i) updates individually its belief using its private data; ii) computes a new belief by exponentiating a linear combination of the log-beliefs of its neighbors. First, we examine what agents learn over weak graphs (social learning problem). We obtain analytical formulas for the beliefs at the different agents, which reveal how the agents' detection capability and the network topology interact to influence the beliefs. In particular, the formulas allow us to predict when a leader-follower behavior is possible, where some sending agents can control the mind of the receiving agents by forcing them to choose a particular hypothesis. Second, we consider the dual or reverse learning problem that reveals how agents learned: given a stream of beliefs collected at a receiving agent, we would like to discover the global influence that any sending component exerts on this receiving agent (topology learning problem). A remarkable and perhaps unexpected interplay between social and topology learning is observed: given $H$ hypotheses and $S$ sending components, topology learning can be feasible when $H\geq S$. The latter being only a necessary condition, we examine the feasibility of topology learning for two useful classes of problems. The analysis reveals that a critical element to enable faithful topology learning is the diversity in the statistical models of the sending sub-networks.
The Internet of Things: a Survey and Outlook
Venue: arXiv cs.NI 2019
Year: 2019

The recent history has witnessed disruptive advances in disciplines related to information and communication technologies that have laid a rich technological ecosystem for the growth and maturity of latent paradigms in this domain. Among them, sensor networks have evolved from the originally conceived set-up where hundreds of nodes with sensing and actuating functionalities were deployed to capture information from their environment and act accordingly (coining the so-called wireless sensor network concept) to the provision of such functionalities embedded in quotidian objects that communicate and work together to collaboratively accomplish complex tasks based on the information they acquire by sensing the environment. This is nowadays a reality, embracing the original idea of an Internet of things (IoT) forged in the late twentieth century, yet featuring unprecedented scales, capabilities and applications ignited by new radio interfaces, communication protocols and intelligent data-based models. This chapter examines the latest findings reported in the literature around these topics, with a clear focus on IoT communications, protocols and platforms, towards ultimately identifying opportunities and trends that will be at the forefront of IoT-related research in the near future.
DADI: Dynamic Discovery of Fair Information with Adversarial Reinforcement Learning
Venue: arXiv cs.LG 2019
Year: 2019

We introduce a framework for dynamic adversarial discovery of information (DADI), motivated by a scenario where information (a feature set) is used by third parties with unknown objectives. We train a reinforcement learning agent to sequentially acquire a subset of the information while balancing accuracy and fairness of predictors downstream. Based on the set of already acquired features, the agent decides dynamically to either collect more information from the set of available features or to stop and predict using the information that is currently available. Building on previous work exploring adversarial representation learning, we attain group fairness (demographic parity) by rewarding the agent with the adversary's loss, computed over the final feature set. Importantly, however, the framework provides a more general starting point for fair or private dynamic information discovery. Finally, we demonstrate empirically, using two real-world datasets, that we can trade-off fairness and predictive performance
Weighted matrix completion from non-random, non-uniform sampling patterns
Venue: arXiv cs.IT 2019
Year: 2019

We study the matrix completion problem when the observation pattern is deterministic and possibly non-uniform. We propose a simple and efficient debiased projection scheme for recovery from noisy observations and analyze the error under a suitable weighted metric. We introduce a simple function of the weight matrix and the sampling pattern that governs the accuracy of the recovered matrix. We derive theoretical guarantees that upper bound the recovery error and nearly matching lower bounds that showcase optimality in several regimes. Our numerical experiments demonstrate the computational efficiency and accuracy of our approach, and show that debiasing is essential when using non-uniform sampling patterns.
Explainable Prediction of Adverse Outcomes Using Clinical Notes
Venue: arXiv cs.LG 2019
Year: 2019

Clinical notes contain a large amount of clinically valuable information that is ignored in many clinical decision support systems due to the difficulty that comes with mining that information. Recent work has found success leveraging deep learning models for the prediction of clinical outcomes using clinical notes. However, these models fail to provide clinically relevant and interpretable information that clinicians can utilize for informed clinical care. In this work, we augment a popular convolutional model with an attention mechanism and apply it to unstructured clinical notes for the prediction of ICU readmission and mortality. We find that the addition of the attention mechanism leads to competitive performance while allowing for the straightforward interpretation of predictions. We develop clear visualizations to present important spans of text for both individual predictions and high-risk cohorts. We then conduct a qualitative analysis and demonstrate that our model is consistently attending to clinically meaningful portions of the narrative for all of the outcomes that we explore.
Meta-Learning to Cluster
Venue: arXiv cs.LG 2019
Year: 2019

Clustering is one of the most fundamental and wide-spread techniques in exploratory data analysis. Yet, the basic approach to clustering has not really changed: a practitioner hand-picks a task-specific clustering loss to optimize and fit the given data to reveal the underlying cluster structure. Some types of losses---such as k-means, or its non-linear version: kernelized k-means (centroid based), and DBSCAN (density based)---are popular choices due to their good empirical performance on a range of applications. Although every so often the clustering output using these standard losses fails to reveal the underlying structure, and the practitioner has to custom-design their own variation. In this work we take an intrinsically different approach to clustering: rather than fitting a dataset to a specific clustering loss, we train a recurrent model that learns how to cluster. The model uses as training pairs examples of datasets (as input) and its corresponding cluster identities (as output). By providing multiple types of training datasets as inputs, our model has the ability to generalize well on unseen datasets (new clustering tasks). Our experiments reveal that by training on simple synthetically generated datasets or on existing real datasets, we can achieve better clustering performance on unseen real-world datasets when compared with standard benchmark clustering techniques. Our meta clustering model works well even for small datasets where the usual deep learning models tend to perform worse.
Belief revision and 3-valued logics: Characterization of 19,683 belief change operators
Venue: arXiv cs.LO 2019
Year: 2019

In most classical models of belief change, epistemic states are represented by theories (AGM) or formulas (Katsuno-Mendelzon) and the new pieces of information by formulas. The Representation Theorem for revision operators says that operators are represented by total preorders. This important representation is exploited by Darwiche and Pearl to shift the notion of epistemic state to a more abstract one, where the paradigm of epistemic state is indeed that of a total preorder over interpretations. In this work, we introduce a 3-valued logic where the formulas can be identified with a generalisation of total preorders of three levels: a ranking function mapping interpretations into the truth values. Then we analyse some sort of changes in this kind of structures and give syntactical characterizations of them.
MmWave Amplify-and-Forward MIMO Relay Networks with Hybrid Precoding/Combining Design
Venue: arXiv cs.IT 2019
Year: 2019

In this paper, we consider the amplify-and-forward relay networks in mmWave systems and propose a hybrid precoder/combiner design approach. The phase-only RF precoding/combining matrices are first designed to support multi-stream transmission, where we compensate the phase for the eigenmodes of the channel. Then, the baseband precoders/combiners are performed to achieve the maximum mutual information. Based on the data processing inequality for the mutual information, we first jointly design the baseband source and relay nodes to maximize the mutual information before the destination baseband receiver. The proposed low-complexity iterative algorithm for the source and relay nodes is based on the equivalence between mutual information maximization and the weighted MMSE. After we obtain the optimal precoder and combiner for the source and relay nodes, we implement the MMSE-SIC filter at the baseband receiver to keep the mutual information unchanged, thus obtaining the optimal mutual information for the whole relay system. Simulation results show that our algorithm achieves better performance with lower complexity compared with other algorithms in the literature. In addition, we also propose a robust joint transceiver design for imperfect channel state information.
DiaNet: BERT and Hierarchical Attention Multi-Task Learning of Fine-Grained Dialect
Venue: arXiv cs.CL 2019
Year: 2019

Prediction of language varieties and dialects is an important language processing task, with a wide range of applications. For Arabic, the native tongue of ~ 300 million people, most varieties remain unsupported. To ease this bottleneck, we present a very large scale dataset covering 319 cities from all 21 Arab countries. We introduce a hierarchical attention multi-task learning (HA-MTL) approach for dialect identification exploiting our data at the city, state, and country levels. We also evaluate use of BERT on the three tasks, comparing it to the MTL approach. We benchmark and release our data and models.
Faster Energy Maximization for Faster Maximum Flow
Venue: arXiv cs.DS 2019
Year: 2019

In this paper we provide an algorithm which given any $m$-edge $n$-vertex directed graph with integer capacities at most $U$ computes a maximum $s$-$t$ flow for any vertices $s$ and $t$ in $m^{11/8+o(1)}U^{1/4}$ time with high probability. This running time improves upon the previous best of $\tilde{O}(m^{10/7} U^{1/7})$ (Mądry 2016), $\tilde{O}(m \sqrt{n} \log U)$ (Lee Sidford 2014), and $O(mn)$ (Orlin 2013) when the graph is not too dense or has large capacities. We achieve this result by leveraging recent advances in solving undirected flow problems on graphs. We show that in the maximum flow framework of (Mądry 2016) the problem of optimizing the amount of perturbation of the central path needed to maximize energy and thereby reduce congestion can be efficiently reduced to a smoothed $\ell_2$-$\ell_p$ flow optimization problem, which can be solved approximately via recent work (Kyng, Peng, Sachdeva, Wang 2019). Leveraging this new primitive, we provide a new long-step interior point method for maximum flow with faster convergence and simpler analysis that no longer needs global potential functions involving energy as in previous methods (Mądry 2013, Mądry 2016).
Parameterized Synthesis for Fragments of First-Order Logic over Data Words
Venue: arXiv cs.LO 2019
Year: 2019

We study the synthesis problem for systems with a parameterized number of processes. As in the classical case due to Church, the system selects actions depending on the program run so far, with the aim of fulfilling a given specification. The difficulty is that, at the same time, the environment executes actions that the system cannot control. In contrast to the case of fixed, finite alphabets, here we consider the case of parameterized alphabets. An alphabet reflects the number of processes that are static but unknown. The synthesis problem then asks whether there is a finite number of processes for which the system can satisfy the specification. This variant is already undecidable for very limited logics. Therefore, we consider a first-order logic without the order on word positions. We show that even in this restricted case synthesis is undecidable if both the system and the environment have access to all processes. On the other hand, we prove that the problem is decidable if the environment only has access to a bounded number of processes. In that case, there is even a cutoff meaning that it is enough to examine a bounded number of process architectures to solve the synthesis problem.
Formal Analysis of Hybrid-Dynamic Timing Behaviors in Cyber-Physical Systems
Venue: arXiv cs.SE 2019
Year: 2019

Ensuring correctness of timed behaviors in cyber-physical systems (CPS) using closed-loop verification is challenging due to the hybrid dynamics in both systems and environments. Simulink and Stateflow are tools for model-based design that support a variety of mechanisms for modeling and analyzing hybrid dynamics of real-time embedded systems. In this paper, we present an SMT-based approach for formal analysis of the hybrid-dynamic timing behaviors of CPS modeled in Simulink blocks and Stateflow states (S/S). The hierarchically interconnected S/S are flattened and translated into the input language of SMT solver for formal verification. A translation algorithm is provided to facilitate the translation. Formal verification of timing constraints against the S/S models is reduced to the validity checking of the resulting SMT encodings. The applicability of our approach is demonstrated on an unmanned surface vessel case study.
Weakly Supervised Tracklet Person Re-Identification by Deep Feature-wise Mutual Learning
Venue: arXiv cs.CV 2019
Year: 2019

The scalability problem caused by the difficulty in annotating Person Re-identification(Re-ID) datasets has become a crucial bottleneck in the development of Re-ID.To address this problem, many unsupervised Re-ID methods have recently been proposed.Nevertheless, most of these models require transfer from another auxiliary fully supervised dataset, which is still expensive to obtain.In this work, we propose a Re-ID model based on Weakly Supervised Tracklets(WST) data from various camera views, which can be inexpensively acquired by combining the fragmented tracklets of the same person in the same camera view over a period of time.We formulate our weakly supervised tracklets Re-ID model by a novel method, named deep feature-wise mutual learning(DFML), which consists of Mutual Learning on Feature Extractors (MLFE) and Mutual Learning on Feature Classifiers (MLFC).We propose MLFE by leveraging two feature extractors to learn from each other to extract more robust and discriminative features.On the other hand, we propose MLFC by adapting discriminative features from various camera views to each classifier. Extensive experiments demonstrate the superiority of our proposed DFML over the state-of-the-art unsupervised models and even some supervised models on three Re-ID benchmark datasets.
Transfer Learning from Transformers to Fake News Challenge Stance Detection (FNC-1) Task
Venue: arXiv cs.CL 2019
Year: 2019

In this paper, we report improved results of the Fake News Challenge Stage 1 (FNC-1) stance detection task. This gain in performance is due to the generalization power of large language models based on Transformer architecture, invented, trained and publicly released over the last two years. Specifically (1) we improved the FNC-1 best performing model adding BERT sentence embedding of input sequences as a model feature, (2) we fine-tuned BERT, XLNet, and RoBERTa transformers on FNC-1 extended dataset and obtained state-of-the-art results on FNC-1 task.
A machine-learning approach to Detect users' suspicious behaviour through the Facebook wall
Venue: arXiv cs.CR 2019
Year: 2019

Facebook represents the current de-facto choice for social media, changing the nature of social relationships. The increasing amount of personal information that runs through this platform publicly exposes user behaviour and social trends, allowing aggregation of data through conventional intelligence collection techniques such as OSINT (Open Source Intelligence). In this paper, we propose a new method to detect and diagnose variations in overall Facebook user psychology through Open Source Intelligence (OSINT) and machine learning techniques. We are aggregating the spectrum of user sentiments and views by using N-Games charts, which exhibit noticeable variations over time, validated through long term collection. We postulate that the proposed approach can be used by security organisations to understand and evaluate the user psychology, then use the information to predict insider threats or prevent insider attacks.
Robust Beamforming Design for OTFS-NOMA
Venue: arXiv cs.IT 2019
Year: 2019

This paper considers the design of beamforming for orthogonal time frequency space modulation assisted non-orthogonal multiple access (OTFS-NOMA) networks, in which a high-mobility user is sharing the spectrum with multiple low-mobility NOMA users. In particular, the beamforming design is formulated as an optimization problem whose objective is to maximize the low-mobility NOMA users' data rates while guaranteeing that the high-mobility user's targeted data rate can be met. Both the cases with and without channel state information errors are considered, where low-complexity solutions are developed by applying successive convex approximation and semidefinite relaxation. Simulation results are also provided to show that the use of the proposed beamforming schemes can yield a significant performance gain over random beamforming.
How can AI Automate End-to-End Data Science?
Venue: arXiv cs.AI 2019
Year: 2019

Data science is labor-intensive and human experts are scarce but heavily involved in every aspect of it. This makes data science time consuming and restricted to experts with the resulting quality heavily dependent on their experience and skills. To make data science more accessible and scalable, we need its democratization. Automated Data Science (AutoDS) is aimed towards that goal and is emerging as an important research and business topic. We introduce and define the AutoDS challenge, followed by a proposal of a general AutoDS framework that covers existing approaches but also provides guidance for the development of new methods. We categorize and review the existing literature from multiple aspects of the problem setup and employed techniques. Then we provide several views on how AI could succeed in automating end-to-end AutoDS. We hope this survey can serve as insightful guideline for the AutoDS field and provide inspiration for future research.
Structured Channel Covariance Estimation from Limited Samples in Massive MIMO
Venue: arXiv cs.IT 2019
Year: 2019

Obtaining channel covariance knowledge is of great importance in various Multiple-Input Multiple-Output MIMO communication applications, including channel estimation and covariance-based user grouping. In a massive MIMO system, covariance estimation proves to be challenging due to the large number of antennas ($M\gg 1$) employed in the base station and hence, a high signal dimension. In this case, the number of pilot transmissions $N$ becomes comparable to the number of antennas and standard estimators, such as the sample covariance, yield a poor estimate of the true covariance and are undesirable. In this paper, we propose a Maximum-Likelihood (ML) massive MIMO covariance estimator, based on a parametric representation of the channel angular spread function (ASF). The parametric representation emerges from super-resolving discrete ASF components via the well-known MUltiple SIgnal Classification (MUSIC) method plus approximating its continuous component using suitable limited-support density function. We maximize the likelihood function using a concave-convex procedure, which is initialized via a non-negative least-squares optimization problem. Our simulation results show that the proposed method outperforms the state of the art in various estimation quality metrics and for different sample size to signal dimension ($N/M$) ratios.