OpenRaiser/Intern-Atlas huggingface dataset:
Linear System Identification in a Nonlinear Setting - Nonparametric analysis of the nonlinear distortions and their impact on the best linear approximation
Venue: arXiv cs.SY 2018
Year: 2018

This article addresses the following problems: 1) First, a nonlinearity analysis is made looking for the presence of nonlinearities in an early phase of the identification process. The level and the nature of the nonlinearities should be retrieved without a significant increase in the amount of measured data. 2) Next it is studied if it is safe to use a linear system identification approach, even if the presence of nonlinear distortions is detected. The properties of the linear system identification approach under these conditions are studied, and the reliability of the uncertainty bounds is checked. 3) Eventually, tools are provided to check how much can be gained if a nonlinear model were identified instead of a linear model. Addressing these three questions forms the outline of this article. The possibilities and pitfalls of using a linear identification framework in the presence of nonlinear distortions will be discussed and illustrated on lab-scale and industrial examples. In this article, the focus is on nonparametric and parametric black box identification methods, however the results might also be useful for physical modeling methods. Knowing the actual nonlinear distortion level can help to choose the required level of detail that is needed in the physical model. This will strongly influence the modeling effort. Also, in this case, significant time can be saved if it is known from experiments that the system behaves almost linearly. The converse is also true. If the experiments show that some (sub-)systems are highly nonlinear, it helps to focus the physical modeling effort on these critical elements.
When is there a Representer Theorem? Nondifferentiable Regularisers and Banach spaces
Venue: arXiv cs.LG 2018
Year: 2018

We consider a general regularised interpolation problem for learning a parameter vector from data. The well known representer theorem says that under certain conditions on the regulariser there exists a solution in the linear span of the data points. This is the core of kernel methods in machine learning as it makes the problem computationally tractable. Necessary and sufficient conditions for differentiable regularisers on Hilbert spaces to admit a representer theorem have been proved. We extend those results to nondifferentiable regularisers on uniformly convex and uniformly smooth Banach spaces. This gives a (more) complete answer to the question when there is a representer theorem. We then note that for regularised interpolation in fact the solution is determined by the function space alone and independent of the regulariser, making the extension to Banach spaces even more valuable.
The Creation Phase in Network Slicing: From a Service Order to an Operative Network Slice
Venue: arXiv cs.NI 2018
Year: 2018

Network slicing is considered a key mechanism to serve the multitude of tenants (e.g. vertical industries) targeted by forthcoming 5G systems in a flexible and cost-efficient manner. In this paper, we present a SDN/NFV architecture with multi-tenancy support. This architecture enables a network slice provider to deploy network slice instances for multiple tenants on-the-fly, and simultaneously provision them with isolation guarantees. Following the Network Slice as-a-Service delivery model, a tenant may access a Service Catalog, selecting the slice that best fits its needs and ordering its deployment. This work provides a detailed view on the stages that a network slice provider must follow to deploy the ordered network slice instance, accommodating it into a multi-domain infrastructure, and putting it operative for tenant's consumption. These stages address critical issues identified in the literature, including (i) the mapping from high-level service requirements to network functions and infrastructure requirements, (ii) the admission control, and (iii) the specific information a network slice descriptor should have. With the proposed architecture and the recommended set of stages, network slice providers can deploy (and later operate) slice instances with great agility, flexibility, and full automation.
Structure Discrimination in Block-Oriented Models Using Linear Approximations: A Theoretic Framework
Venue: arXiv cs.SY 2018
Year: 2018

In this paper we show that it is possible to retrieve structural information about complex block-oriented nonlinear systems, starting from linear approximations of the nonlinear system around different setpoints.The key idea is to monitor the movements of the poles and zeros of the linearized models and to reduce the number of candidate models on the basis of these observations. Besides the well known open loop single branch Wiener-, Hammerstein-, and Wiener-Hammerstein systems, we also cover a number of more general structures like parallel (multi branch) Wiener-Hammerstein models, and closed loop block oriented models, including linear fractional representation (LFR) models.
DisguiseNet : A Contrastive Approach for Disguised Face Verification in the Wild
Venue: arXiv cs.CV 2018
Year: 2018

This paper describes our approach for the Disguised Faces in the Wild (DFW) 2018 challenge. The task here is to verify the identity of a person among disguised and impostors images. Given the importance of the task of face verification it is essential to compare methods across a common platform. Our approach is based on VGG-face architecture paired with Contrastive loss based on cosine distance metric. For augmenting the data set, we source more data from the internet. The experiments show the effectiveness of the approach on the DFW data. We show that adding extra data to the DFW dataset with noisy labels also helps in increasing the generalization performance of the network. The proposed network achieves 27.13% absolute increase in accuracy over the DFW baseline.
Positive Solutions of Systems of Signed Parametric Polynomial Inequalities
Venue: arXiv cs.SC 2018
Year: 2018

We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of positive real solutions of our system for all choices of coefficients subject to our sign conditions. We give a decision procedure for the existence of such solutions. In the positive case our procedure yields a parametric positive solution as a rational function in the coefficients. Our framework allows to reformulate heuristic subtropical approaches for non-parametric systems of polynomial inequalities that have been recently used in qualitative biological network analysis and, independently, in satisfiability modulo theory solving. We apply our results to characterize the incompleteness of those methods.
An Faster Network Motif Detection Tool
Venue: arXiv cs.DS 2018
Year: 2018

Network motif provides a way to uncover the basic building blocks of most complex networks. This task usually demands high computer processing, specially for motif with 5 or more vertices. This paper presents an extended methodology with the following features: (i) search for motifs up to 6 vertices, (ii) multithread processing, and a (iii) new enumeration algorithm with lower complexity. The algorithm to compute motifs solve isomorphism in $O(1)$ with the use of hash table. Concurrent threads evaluates distinct graphs. The enumeration algorithm has smaller computational complexity. The experiments shows better performance with respect to other methods available in literature, allowing bioinformatic researchers to efficiently identify motifs of size 3, 4, 5, and 6.
Progressive Neural Networks for Image Classification
Venue: arXiv cs.CV 2018
Year: 2018

The inference structures and computational complexity of existing deep neural networks, once trained, are fixed and remain the same for all test images. However, in practice, it is highly desirable to establish a progressive structure for deep neural networks which is able to adapt its inference process and complexity for images with different visual recognition complexity. In this work, we develop a multi-stage progressive structure with integrated confidence analysis and decision policy learning for deep neural networks. This new framework consists of a set of network units to be activated in a sequential manner with progressively increased complexity and visual recognition power. Our extensive experimental results on the CIFAR-10 and ImageNet datasets demonstrate that the proposed progressive deep neural network is able to obtain more than 10 fold complexity scalability while achieving the state-of-the-art performance using a single network model satisfying different complexity-accuracy requirements.
HG-means: A scalable hybrid genetic algorithm for minimum sum-of-squares clustering
Venue: arXiv cs.LG 2018
Year: 2018

Minimum sum-of-squares clustering (MSSC) is a widely used clustering model, of which the popular K-means algorithm constitutes a local minimizer. It is well known that the solutions of K-means can be arbitrarily distant from the true MSSC global optimum, and dozens of alternative heuristics have been proposed for this problem. However, no other algorithm has been predominantly adopted in the literature. This may be related to differences of computational effort, or to the assumption that a near-optimal solution of the MSSC has only a marginal impact on clustering validity. In this article, we dispute this belief. We introduce an efficient population-based metaheuristic that uses K-means as a local search in combination with problem-tailored crossover, mutation, and diversification operators. This algorithm can be interpreted as a multi-start K-means, in which the initial center positions are carefully sampled based on the search history. The approach is scalable and accurate, outperforming all recent state-of-the-art algorithms for MSSC in terms of solution quality, measured by the depth of local minima. This enhanced accuracy leads to clusters which are significantly closer to the ground truth than those of other algorithms, for overlapping Gaussian-mixture datasets with a large number of features. Therefore, improved global optimization methods appear to be essential to better exploit the MSSC model in high dimension.
Multiagent Soft Q-Learning
Venue: arXiv cs.AI 2018
Year: 2018

Policy gradient methods are often applied to reinforcement learning in continuous multiagent games. These methods perform local search in the joint-action space, and as we show, they are susceptable to a game-theoretic pathology known as relative overgeneralization. To resolve this issue, we propose Multiagent Soft Q-learning, which can be seen as the analogue of applying Q-learning to continuous controls. We compare our method to MADDPG, a state-of-the-art approach, and show that our method achieves better coordination in multiagent cooperative tasks, converging to better local optima in the joint action space.
An ASP Methodology for Understanding Narratives about Stereotypical Activities
Venue: arXiv cs.AI 2018
Year: 2018

We describe an application of Answer Set Programming to the understanding of narratives about stereotypical activities, demonstrated via question answering. Substantial work in this direction was done by Erik Mueller, who modeled stereotypical activities as scripts. His systems were able to understand a good number of narratives, but could not process texts describing exceptional scenarios. We propose addressing this problem by using a theory of intentions developed by Blount, Gelfond, and Balduccini. We present a methodology in which we substitute scripts by activities (i.e., hierarchical plans associated with goals) and employ the concept of an intentional agent to reason about both normal and exceptional scenarios. We exemplify the application of this methodology by answering questions about a number of restaurant stories. This paper is under consideration for acceptance in TPLP.
Competitive Learning Enriches Learning Representation and Accelerates the Fine-tuning of CNNs
Venue: arXiv cs.LG 2018
Year: 2018

In this study, we propose the integration of competitive learning into convolutional neural networks (CNNs) to improve the representation learning and efficiency of fine-tuning. Conventional CNNs use back propagation learning, and it enables powerful representation learning by a discrimination task. However, it requires huge amount of labeled data, and acquisition of labeled data is much harder than that of unlabeled data. Thus, efficient use of unlabeled data is getting crucial for DNNs. To address the problem, we introduce unsupervised competitive learning into the convolutional layer, and utilize unlabeled data for effective representation learning. The results of validation experiments using a toy model demonstrated that strong representation learning effectively extracted bases of images into convolutional filters using unlabeled data, and accelerated the speed of the fine-tuning of subsequent supervised back propagation learning. The leverage was more apparent when the number of filters was sufficiently large, and, in such a case, the error rate steeply decreased in the initial phase of fine-tuning. Thus, the proposed method enlarged the number of filters in CNNs, and enabled a more detailed and generalized representation. It could provide a possibility of not only deep but broad neural networks.
iTeleScope: Intelligent Video Telemetry and Classification in Real-Time using Software Defined Networking
Venue: arXiv cs.NI 2018
Year: 2018

Video continues to dominate network traffic, yet operators today have poor visibility into the number, duration, and resolutions of the video streams traversing their domain. Current approaches are inaccurate, expensive, or unscalable, as they rely on statistical sampling, middle-box hardware, or packet inspection software. We present {\em iTelescope}, the first intelligent, inexpensive, and scalable SDN-based solution for identifying and classifying video flows in real-time. Our solution is novel in combining dynamic flow rules with telemetry and machine learning, and is built on commodity OpenFlow switches and open-source software. We develop a fully functional system, train it in the lab using multiple machine learning algorithms, and validate its performance to show over 95\% accuracy in identifying and classifying video streams from many providers including Youtube and Netflix. Lastly, we conduct tests to demonstrate its scalability to tens of thousands of concurrent streams, and deploy it live on a campus network serving several hundred real users. Our system gives unprecedented fine-grained real-time visibility of video streaming performance to operators of enterprise and carrier networks at very low cost.
Integrating Local Context and Global Cohesiveness for Open Information Extraction
Venue: arXiv cs.CL 2018
Year: 2018

Extracting entities and their relations from text is an important task for understanding massive text corpora. Open information extraction (IE) systems mine relation tuples (i.e., entity arguments and a predicate string to describe their relation) from sentences. These relation tuples are not confined to a predefined schema for the relations of interests. However, current Open IE systems focus on modeling local context information in a sentence to extract relation tuples, while ignoring the fact that global statistics in a large corpus can be collectively leveraged to identify high-quality sentence-level extractions. In this paper, we propose a novel Open IE system, called ReMine, which integrates local context signals and global structural signals in a unified, distant-supervision framework. Leveraging facts from external knowledge bases as supervision, the new system can be applied to many different domains to facilitate sentence-level tuple extractions using corpus-level statistics. Our system operates by solving a joint optimization problem to unify (1) segmenting entity/relation phrases in individual sentences based on local context; and (2) measuring the quality of tuples extracted from individual sentences with a translating-based objective. Learning the two subtasks jointly helps correct errors produced in each subtask so that they can mutually enhance each other. Experiments on two real-world corpora from different domains demonstrate the effectiveness, generality, and robustness of ReMine when compared to state-of-the-art open IE systems.
An Integer Programming Approach to the Student-Project Allocation Problem with Preferences over Projects
Venue: arXiv cs.DM 2018
Year: 2018

The Student-Project Allocation problem with preferences over Projects (SPA-P) involves sets of students, projects and lecturers, where the students and lecturers each have preferences over the projects. In this context, we typically seek a stable matching of students to projects (and lecturers). However, these stable matchings can have different sizes, and the problem of finding a maximum stable matching (MAX-SPA-P) is NP-hard. There are two known approximation algorithms for MAX-SPA-P, with performance guarantees of 2 and 3/2. In this paper, we describe an Integer Programming (IP) model to enable MAX-SPA-P to be solved optimally. Following this, we present results arising from an empirical analysis that investigates how the solution produced by the approximation algorithms compares to the optimal solution obtained from the IP model, with respect to the size of the stable matchings constructed, on instances that are both randomly-generated and derived from real datasets. Our main finding is that the 3/2-approximation algorithm finds stable matchings that are very close to having maximum cardinality.
Symbolic Automata with Memory: a Computational Model for Complex Event Processing
Venue: arXiv cs.FL 2018
Year: 2018

We propose an automaton model which is a combination of symbolic and register automata, i.e., we enrich symbolic automata with memory. We call such automata Register Match Automata (RMA). RMA extend the expressive power of symbolic automata, by allowing formulas to be applied not only to the last element read from the input string, but to multiple elements, stored in their registers. RMA also extend register automata, by allowing arbitrary formulas, besides equality predicates. We study the closure properties of RMA under union, concatenation, Kleene+, complement and determinization and show that RMA, contrary to symbolic automata, are not determinizable when viewed as recognizers, without taking the output of transitions into account. However, when a window operator, a quintessential feature in Complex Event Processing, is used, RMA are indeed determinizable even when viewed as recognizers. We present detailed algorithms for constructing deterministic RMA from regular expressions extended with $n$-ary constraints. We show how RMA can be used in Complex Event Processing in order to detect patterns upon streams of events, using a framework that provides denotational and compositional semantics, and that allows for a systematic treatment of such automata.
First-order answer set programming as constructive proof search
Venue: arXiv cs.LO 2018
Year: 2018

We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the Mints hierarchy in first-order intuitionistic logic. It follows that Sigma_1 formulas using predicates of fixed arity (in particular unary) is of the same strength as FOASP. Our construction reveals a close similarity between constructive provability and stable entailment, or equivalently, between the construction of an answer set and an intuitionistic refutation. This paper is under consideration for publication in Theory and Practice of Logic Programming
Deep Keyframe Detection in Human Action Videos
Venue: arXiv cs.CV 2018
Year: 2018

Detecting representative frames in videos based on human actions is quite challenging because of the combined factors of human pose in action and the background. This paper addresses this problem and formulates the key frame detection as one of finding the video frames that optimally maximally contribute to differentiating the underlying action category from all other categories. To this end, we introduce a deep two-stream ConvNet for key frame detection in videos that learns to directly predict the location of key frames. Our key idea is to automatically generate labeled data for the CNN learning using a supervised linear discriminant method. While the training data is generated taking many different human action videos into account, the trained CNN can predict the importance of frames from a single video. We specify a new ConvNet framework, consisting of a summarizer and discriminator. The summarizer is a two-stream ConvNet aimed at, first, capturing the appearance and motion features of video frames, and then encoding the obtained appearance and motion features for video representation. The discriminator is a fitting function aimed at distinguishing between the key frames and others in the video. We conduct experiments on a challenging human action dataset UCF101 and show that our method can detect key frames with high accuracy.
Extended Vertical Lists for Temporal Pattern Mining from Multivariate Time Series
Venue: arXiv cs.LG 2018
Year: 2018

Temporal Pattern Mining (TPM) is the problem of mining predictive complex temporal patterns from multivariate time series in a supervised setting. We develop a new method called the Fast Temporal Pattern Mining with Extended Vertical Lists. This method utilizes an extension of the Apriori property which requires a more complex pattern to appear within records only at places where all of its subpatterns are detected as well. The approach is based on a novel data structure called the Extended Vertical List that tracks positions of the first state of the pattern inside records. Extensive computational results indicate that the new method performs significantly faster than the previous version of the algorithm for TMP. However, the speed-up comes at the expense of memory usage.
Maximum Throughput Scheduling for Multi-connectivity in Millimeter-Wave Networks
Venue: arXiv cs.NI 2018
Year: 2018

Multi-connectivity is emerging as promising solution to provide reliable communications and seamless connectivity at the millimeter-wave frequency range. Due to the obstacles that cause frequent interruptions at such high frequency range, connectivity to multiple cells can drastically increase the network performance in terms of throughput and reliability by coordination among the network elements. In this paper, we propose an algorithm for the link scheduling optimization that maximizes the network throughput for multi-connectivity in millimeter-wave cellular networks. The considered approach exploits a centralized architecture, fast link switching, proactive context preparation and data forwarding between millimeter-wave access points and the users. The proposed algorithm is able to numerically approach the global optimum and to quantify the potential gain of multi-connectivity in millimeter-wave cellular networks.