OpenRaiser/Intern-Atlas huggingface dataset:
On Generality and Knowledge Transferability in Cross-Domain Duplicate Question Detection for Heterogeneous Community Question Answering
Venue: arXiv cs.CL 2018
Year: 2018

Duplicate question detection is an ongoing challenge in community question answering because semantically equivalent questions can have significantly different words and structures. In addition, the identification of duplicate questions can reduce the resources required for retrieval, when the same questions are not repeated. This study compares the performance of deep neural networks and gradient tree boosting, and explores the possibility of domain adaptation with transfer learning to improve the under-performing target domains for the text-pair duplicates classification task, using three heterogeneous datasets: general-purpose Quora, technical Ask Ubuntu, and academic English Stack Exchange. Ultimately, our study exposes the alternative hypothesis that the meaning of a "duplicate" is not inherently general-purpose, but rather is dependent on the domain of learning, hence reducing the chance of transfer learning through adapting to the domain.
Iso-parametric tool path planning for point clouds
Venue: arXiv cs.GR 2018
Year: 2018

The computational consuming and non-robust reconstruction from point clouds to either meshes or spline surfaces motivates the direct tool path planning for point clouds. In this paper, a novel approach for planning iso-parametric tool path from a point cloud is presented. The planning depends on the parameterization of point clouds. Accordingly, a conformal map is employed to build the parameterization which leads to a significant simplification of computing tool path parameters and boundary conformed paths. Then, Tool path is generated through linear interpolation with the forward and side step computed against specified chord deviation and scallop height, respectively. Experimental results are given to illustrate effectiveness of the proposed methods.
Unconstrained Submodular Maximization with Constant Adaptive Complexity
Venue: arXiv cs.DS 2018
Year: 2018

In this paper, we consider the unconstrained submodular maximization problem. We propose the first algorithm for this problem that achieves a tight $(1/2-\varepsilon)$-approximation guarantee using $\tilde{O}(\varepsilon^{-1})$ adaptive rounds and a linear number of function evaluations. No previously known algorithm for this problem achieves an approximation ratio better than $1/3$ using less than $Ω(n)$ rounds of adaptivity, where $n$ is the size of the ground set. Moreover, our algorithm easily extends to the maximization of a non-negative continuous DR-submodular function subject to a box constraint and achieves a tight $(1/2-\varepsilon)$-approximation guarantee for this problem while keeping the same adaptive and query complexities.
Economics of Human-AI Ecosystem: Value Bias and Lost Utility in Multi-Dimensional Gaps
Venue: arXiv cs.AI 2018
Year: 2018

In recent years, artificial intelligence (AI) decision-making and autonomous systems became an integrated part of the economy, industry, and society. The evolving economy of the human-AI ecosystem raising concerns regarding the risks and values inherited in AI systems. This paper investigates the dynamics of creation and exchange of values and points out gaps in perception of cost-value, knowledge, space and time dimensions. It shows aspects of value bias in human perception of achievements and costs that encoded in AI systems. It also proposes rethinking hard goals definitions and cost-optimal problem-solving principles in the lens of effectiveness and efficiency in the development of trusted machines. The paper suggests a value-driven with cost awareness strategy and principles for problem-solving and planning of effective research progress to address real-world problems that involve diverse forms of achievements, investments, and survival scenarios.
Motion Style Extraction Based on Sparse Coding Decomposition
Venue: arXiv cs.MM 2018
Year: 2018

We present a sparse coding-based framework for motion style decomposition and synthesis. Dynamic Time Warping is firstly used to synchronized input motions in the time domain as a pre-processing step. A sparse coding-based decomposition has been proposed, we also introduce the idea of core component and basic motion. Decomposed motions are then combined, transfer to synthesize new motions. Lastly, we develop limb length constraint as a post-processing step to remove distortion skeletons. Our framework has the advantage of less time-consuming, no manual alignment and large dataset requirement. As a result, our experiments show smooth and natural synthesized motion.
Streaming End-to-end Speech Recognition For Mobile Devices
Venue: arXiv cs.CL 2018
Year: 2018

End-to-end (E2E) models, which directly predict output character sequences given input speech, are good candidates for on-device speech recognition. E2E models, however, present numerous challenges: In order to be truly useful, such models must decode speech utterances in a streaming fashion, in real time; they must be robust to the long tail of use cases; they must be able to leverage user-specific context (e.g., contact lists); and above all, they must be extremely accurate. In this work, we describe our efforts at building an E2E speech recognizer using a recurrent neural network transducer. In experimental evaluations, we find that the proposed approach can outperform a conventional CTC-based model in terms of both latency and accuracy in a number of evaluation categories.
Cybercrime and You: How Criminals Attack and the Human Factors That They Seek to Exploit
Venue: arXiv cs.CR 2018
Year: 2018

Cybercrime is a significant challenge to society, but it can be particularly harmful to the individuals who become victims. This chapter engages in a comprehensive and topical analysis of the cybercrimes that target individuals. It also examines the motivation of criminals that perpetrate such attacks and the key human factors and psychological aspects that help to make cybercriminals successful. Key areas assessed include social engineering (e.g., phishing, romance scams, catfishing), online harassment (e.g., cyberbullying, trolling, revenge porn, hate crimes), identity-related crimes (e.g., identity theft, doxing), hacking (e.g., malware, cryptojacking, account hacking), and denial-of-service crimes. As a part of its contribution, the chapter introduces a summary taxonomy of cybercrimes against individuals and a case for why they will continue to occur if concerted interdisciplinary efforts are not pursued.
Generating Albums with SampleRNN to Imitate Metal, Rock, and Punk Bands
Venue: arXiv cs.SD 2018
Year: 2018

This early example of neural synthesis is a proof-of-concept for how machine learning can drive new types of music software. Creating music can be as simple as specifying a set of music influences on which a model trains. We demonstrate a method for generating albums that imitate bands in experimental music genres previously unrealized by traditional synthesis techniques (e.g. additive, subtractive, FM, granular, concatenative). Raw audio is generated autoregressively in the time-domain using an unconditional SampleRNN. We create six albums this way. Artwork and song titles are also generated using materials from the original artists' back catalog as training data. We try a fully-automated method and a human-curated method. We discuss its potential for machine-assisted production.
Stability of Gaussian Process State Space Models
Venue: arXiv cs.SY 2018
Year: 2018

Gaussian Process State Space Models (GP-SSMs) are a non-parametric model class suitable to represent nonlinear dynamics. They become increasingly popular in data-driven modeling approaches, i.e. when no first-order physics-based models are available. Although a GP-SSM produces well-behaved approximations and gains increasing popularity, the fundamental system dynamics are just sparsely researched. In this paper, we present stability results for the GP-SSM depending on selected covariance function employing a deterministic point of view as widely done in the literature. The focus is set on the squared exponential function which is one of the most used covariance functions for nonlinear regression. We start with calculations according to the equilibrium points of GP-SSM and continue with conditions for stability.
Equilibrium Distributions and Stability Analysis of Gaussian Process State Space Models
Venue: arXiv cs.SY 2018
Year: 2018

Gaussian Process State Space Models (GP-SSM) are a data-driven stochastic model class suitable to represent nonlinear dynamics. They have become increasingly popular in non-parametric modeling approaches since they provide not only a prediction of the system behavior but also an accuracy of the prediction. For the application of these models, the analysis of fundamental system properties is required. In this paper, we analyze equilibrium distributions and stability properties of the GP-SSM. The computation of equilibrium distributions is based on the numerical solution of a Fredholm integral equation of the second kind and is suitable for any covariance function. Besides, we show that the GP-SSM with squared exponential covariance function is always mean square bounded and there exists a set which is positive recurrent.
Content-Aware Personalised Rate Adaptation for Adaptive Streaming via Deep Video Analysis
Venue: arXiv cs.MM 2018
Year: 2018

Adaptive bitrate (ABR) streaming is the de facto solution for achieving smooth viewing experiences under unstable network conditions. However, most of the existing rate adaptation approaches for ABR are content-agnostic, without considering the semantic information of the video content. Nevertheless, semantic information largely determines the informativeness and interestingness of the video content, and consequently affects the QoE for video streaming. One common case is that the user may expect higher quality for the parts of video content that are more interesting or informative so as to reduce video distortion and information loss, given that the overall bitrate budgets are limited. This creates two main challenges for such a problem: First, how to determine which parts of the video content are more interesting? Second, how to allocate bitrate budgets for different parts of the video content with different significances? To address these challenges, we propose a Content-of-Interest (CoI) based rate adaptation scheme for ABR. We first design a deep learning approach for recognizing the interestingness of the video content, and then design a Deep Q-Network (DQN) approach for rate adaptation by incorporating video interestingness information. The experimental results show that our method can recognize video interestingness precisely, and the bitrate allocation for ABR can be aligned with the interestingness of video content while not compromising the performances on objective QoE metrics.
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts
Venue: arXiv cs.DS 2018
Year: 2018

Compact and I/O-efficient data representations play an important role in efficient algorithm design, as memory bandwidth and latency can present a significant performance bottleneck, slowing the computation by orders of magnitude. While this problem is very well explored in e.g. uniform numerical data processing, structural data applications (e.g. on huge graphs) require different algorithm-dependent approaches. Separable graph classes (i.e. graph classes with balanced separators of size $\mathcal{O}(n^c)$ with $c < 1$) include planar graphs, bounded genus graphs, and minor-free graphs. In this article we present two generalizations of the separator theorem, to partitions with small regions only on average and to weighted graphs. Then we propose I/O-efficient succinct representation and memory layout for random walks in(weighted) separable graphs in the pointer machine model, including an efficient algorithm to compute them. Finally, we present a worst-case I/O-optimal tree layout algorithm for root-leaf path traversal, show an additive (+1)-approximation of optimal compact layout and contrast this with NP-completeness proof of finding an optimal compact layout.
DropFilter: A Novel Regularization Method for Learning Convolutional Neural Networks
Venue: arXiv cs.LG 2018
Year: 2018

The past few years have witnessed the fast development of different regularization methods for deep learning models such as fully-connected deep neural networks (DNNs) and Convolutional Neural Networks (CNNs). Most of previous methods mainly consider to drop features from input data and hidden layers, such as Dropout, Cutout and DropBlocks. DropConnect select to drop connections between fully-connected layers. By randomly discard some features or connections, the above mentioned methods control the overfitting problem and improve the performance of neural networks. In this paper, we proposed two novel regularization methods, namely DropFilter and DropFilter-PLUS, for the learning of CNNs. Different from the previous methods, DropFilter and DropFilter-PLUS selects to modify the convolution filters. For DropFilter-PLUS, we find a suitable way to accelerate the learning process based on theoretical analysis. Experimental results on MNIST show that using DropFilter and DropFilter-PLUS may improve performance on image classification tasks.
Evolutionary Diversity Optimization Using Multi-Objective Indicators
Venue: arXiv cs.NE 2018
Year: 2018

Evolutionary diversity optimization aims to compute a diverse set of solutions where all solutions meet a given quality criterion. With this paper, we bridge the areas of evolutionary diversity optimization and evolutionary multi-objective optimization. We show how popular indicators frequently used in the area of multi-objective optimization can be used for evolutionary diversity optimization. Our experimental investigations for evolving diverse sets of TSP instances and images according to various features show that two of the most prominent multi-objective indicators, namely the hypervolume indicator and the inverted generational distance, provide excellent results in terms of visualization and various diversity indicators.
Using recurrences in time and frequency within U-net architecture for speech enhancement
Venue: arXiv cs.LG 2018
Year: 2018

When designing fully-convolutional neural network, there is a trade-off between receptive field size, number of parameters and spatial resolution of features in deeper layers of the network. In this work we present a novel network design based on combination of many convolutional and recurrent layers that solves these dilemmas. We compare our solution with U-nets based models known from the literature and other baseline models on speech enhancement task. We test our solution on TIMIT speech utterances combined with noise segments extracted from NOISEX-92 database and show clear advantage of proposed solution in terms of SDR (signal-to-distortion ratio), SIR (signal-to-interference ratio) and STOI (spectro-temporal objective intelligibility) metrics compared to the current state-of-the-art.
Tetris: Re-architecting Convolutional Neural Network Computation for Machine Learning Accelerators
Venue: arXiv cs.LG 2018
Year: 2018

Inference efficiency is the predominant consideration in designing deep learning accelerators. Previous work mainly focuses on skipping zero values to deal with remarkable ineffectual computation, while zero bits in non-zero values, as another major source of ineffectual computation, is often ignored. The reason lies on the difficulty of extracting essential bits during operating multiply-and-accumulate (MAC) in the processing element. Based on the fact that zero bits occupy as high as 68.9% fraction in the overall weights of modern deep convolutional neural network models, this paper firstly proposes a weight kneading technique that could eliminate ineffectual computation caused by either zero value weights or zero bits in non-zero weights, simultaneously. Besides, a split-and-accumulate (SAC) computing pattern in replacement of conventional MAC, as well as the corresponding hardware accelerator design called Tetris are proposed to support weight kneading at the hardware level. Experimental results prove that Tetris could speed up inference up to 1.50x, and improve power efficiency up to 5.33x compared with the state-of-the-art baselines.
Improving Fingerprint Pore Detection with a Small FCN
Venue: arXiv cs.CV 2018
Year: 2018

In this work, we investigate if previously proposed CNNs for fingerprint pore detection overestimate the number of required model parameters for this task. We show that this is indeed the case by proposing a fully convolutional neural network that has significantly fewer parameters. We evaluate this model using a rigorous and reproducible protocol, which was, prior to our work, not available to the community. Using our protocol, we show that the proposed model, when combined with post-processing, performs better than previous methods, albeit being much more efficient. All our code is available at https://github.com/gdahia/fingerprint-pore-detection
Adversarial Unsupervised Representation Learning for Activity Time-Series
Venue: arXiv cs.LG 2018
Year: 2018

Sufficient physical activity and restful sleep play a major role in the prevention and cure of many chronic conditions. Being able to proactively screen and monitor such chronic conditions would be a big step forward for overall health. The rapid increase in the popularity of wearable devices provides a significant new source, making it possible to track the user's lifestyle real-time. In this paper, we propose a novel unsupervised representation learning technique called activity2vec that learns and "summarizes" the discrete-valued activity time-series. It learns the representations with three components: (i) the co-occurrence and magnitude of the activity levels in a time-segment, (ii) neighboring context of the time-segment, and (iii) promoting subject-invariance with adversarial training. We evaluate our method on four disorder prediction tasks using linear classifiers. Empirical evaluation demonstrates that our proposed method scales and performs better than many strong baselines. The adversarial regime helps improve the generalizability of our representations by promoting subject invariant features. We also show that using the representations at the level of a day works the best since human activity is structured in terms of daily routines
Future Perspectives of Co-Simulation in the Smart Grid Domain
Venue: arXiv cs.OH 2018
Year: 2018

The recent attention towards research and development in cyber-physical energy systems has introduced the necessity of emerging multi-domain co-simulation tools. Different educational, research and industrial efforts have been set to tackle the co-simulation topic from several perspectives. The majority of previous works has addressed the standardization of models and interfaces for data exchange, automation of simulation, as well as improving performance and accuracy of co-simulation setups. Furthermore, the domains of interest so far have involved communication, control, markets and the environment in addition to physical energy systems. However, the current characteristics and state of co-simulation testbeds need to be re-evaluated for future research demands. These demands vary from new domains of interest, such as human and social behavior models, to new applications of co-simulation, such as holistic prognosis and system planning. This paper aims to formulate these research demands that can then be used as a road map and guideline for future development of co-simulation in cyber-physical energy systems.
Wing Expansion Menu - An approach for faster and more precise navigation with cascading pull-down menus
Venue: arXiv cs.HC 2018
Year: 2018

This paper presents a new design suggestion for cascading pull-down menus to make user interaction with it faster and therefore easier: The Wing Expansion Menu (WEM). The proposal is based on the Steering Law, which implies a wider steering path for menu items. Our Approach combines this enlargement with a heuristic function that provides a probability with which the user will select an menu item. The menu can also be adapted to a wide variety of situations using certain variables. A user study of a WEM against a standard pull-down menu showed an average improvement of 18.63% in user interaction speed. A second user study, which evaluated one of the significant innovations of the WEM compared to a similar approach, showed an average improvement of 7.01% in user interaction speed.
WURBench: Toward Benchmarking Wake-up Radio-based Systems
Venue: arXiv cs.NI 2018
Year: 2018

The performance of wake-up radios must be clearly measured and understood while designing and developing robust, dependable, and affordable systems, considering both benefits and shortcomings. State-of-the-art WURs display significant diversity in their architecture, processing capability, energy consumption, and receiver sensitivity. Standard methodologies for benchmarking are crucial for quantitatively evaluating the performance of this emerging technology, however, currently, no accepted standard for such quantitative measurement exists. Further, there is no consensus on what objective evaluation procedures and metrics should be used to understand the performance of whole systems exploiting this technology. This lack of standardization has prevented researchers from comparing results and leveraging previous work that could otherwise avoid duplication and speed up the validation process. This paper leads toward an evaluation framework, a benchmark, to enable accurate and repeatable profiling of WUR-based systems, leading to more consistent and therefore comparable evaluations for current and future systems.
Exploring Gameplay With AI Agents
Venue: arXiv cs.AI 2018
Year: 2018

The process of playtesting a game is subjective, expensive and incomplete. In this paper, we present a playtesting approach that explores the game space with automated agents and collects data to answer questions posed by the designers. Rather than have agents interacting with an actual game client, this approach recreates the bare bone mechanics of the game as a separate system. Our agent is able to play in minutes what would take testers days of organic gameplay. The analysis of thousands of game simulations exposed imbalances in game actions, identified inconsequential rewards and evaluated the effectiveness of optional strategic choices. Our test case game, The Sims Mobile, was recently released and the findings shown here influenced design changes that resulted in improved player experience.