OpenRaiser/Intern-Atlas huggingface dataset:
ABMOF: A Novel Optical Flow Algorithm for Dynamic Vision Sensors
Venue: arXiv cs.CV 2018
Year: 2018

Dynamic Vision Sensors (DVS), which output asynchronous log intensity change events, have potential applications in high-speed robotics, autonomous cars and drones. The precise event timing, sparse output, and wide dynamic range of the events are well suited for optical flow, but conventional optical flow (OF) algorithms are not well matched to the event stream data. This paper proposes an event-driven OF algorithm called adaptive block-matching optical flow (ABMOF). ABMOF uses time slices of accumulated DVS events. The time slices are adaptively rotated based on the input events and OF results. Compared with other methods such as gradient-based OF, ABMOF can efficiently be implemented in compact logic circuits. Results show that ABMOF achieves comparable accuracy to conventional standards such as Lucas-Kanade (LK). The main contributions of our paper are new adaptive time-slice rotation methods that ensure the generated slices have sufficient features for matching,including a feedback mechanism that controls the generated slices to have average slice displacement within the block search range. An LK method using our adapted slices is also implemented. The ABMOF accuracy is compared with this LK method on natural scene data including sparse and dense texture, high dynamic range, and fast motion exceeding 30,000 pixels per second.The paper dataset and source code are available from http://sensors.ini.uzh.ch/databases.html.
From Word to Sense Embeddings: A Survey on Vector Representations of Meaning
Venue: arXiv cs.CL 2018
Year: 2018

Over the past years, distributed semantic representations have proved to be effective and flexible keepers of prior knowledge to be integrated into downstream applications. This survey focuses on the representation of meaning. We start from the theoretical background behind word vector space models and highlight one of their major limitations: the meaning conflation deficiency, which arises from representing a word with all its possible meanings as a single vector. Then, we explain how this deficiency can be addressed through a transition from the word level to the more fine-grained level of word senses (in its broader acceptation) as a method for modelling unambiguous lexical meaning. We present a comprehensive overview of the wide range of techniques in the two main branches of sense representation, i.e., unsupervised and knowledge-based. Finally, this survey covers the main evaluation procedures and applications for this type of representation, and provides an analysis of four of its important aspects: interpretability, sense granularity, adaptability to different domains and compositionality.
Achieving Super-Resolution with Redundant Sensing
Venue: arXiv cs.IT 2018
Year: 2018

Analog-to-digital (quantization) and digital-to-analog (de-quantization) conversion are fundamental operations of many information processing systems. In practice, the precision of these operations is always bounded, first by the random mismatch error (ME) occurred during system implementation, and subsequently by the intrinsic quantization error (QE) determined by the system architecture itself. In this manuscript, we present a new mathematical interpretation of the previously proposed redundant sensing (RS) architecture that not only suppresses ME but also allows achieving an effective resolution exceeding the system's intrinsic resolution, i.e. super-resolution (SR). SR is enabled by an endogenous property of redundant structures regarded as "code diffusion" where the references' value spreads into the neighbor sample space as a result of ME. The proposed concept opens the possibility for a wide range of applications in low-power fully-integrated sensors and devices where the cost-accuracy trade-off is inevitable.
Deep Neural Machine Translation with Weakly-Recurrent Units
Venue: arXiv cs.CL 2018
Year: 2018

Recurrent neural networks (RNNs) have represented for years the state of the art in neural machine translation. Recently, new architectures have been proposed, which can leverage parallel computation on GPUs better than classical RNNs. Faster training and inference combined with different sequence-to-sequence modeling also lead to performance improvements. While the new models completely depart from the original recurrent architecture, we decided to investigate how to make RNNs more efficient. In this work, we propose a new recurrent NMT architecture, called Simple Recurrent NMT, built on a class of fast and weakly-recurrent units that use layer normalization and multiple attentions. Our experiments on the WMT14 English-to-German and WMT16 English-Romanian benchmarks show that our model represents a valid alternative to LSTMs, as it can achieve better results at a significantly lower computational cost.
An Unsupervised Clustering-Based Short-Term Solar Forecasting Methodology Using Multi-Model Machine Learning Blending
Venue: arXiv cs.LG 2018
Year: 2018

Solar forecasting accuracy is affected by weather conditions, and weather awareness forecasting models are expected to improve the performance. However, it may not be available and reliable to classify different forecasting tasks by using only meteorological weather categorization. In this paper, an unsupervised clustering-based (UC-based) solar forecasting methodology is developed for short-term (1-hour-ahead) global horizontal irradiance (GHI) forecasting. This methodology consists of three parts: GHI time series unsupervised clustering, pattern recognition, and UC-based forecasting. The daily GHI time series is first clustered by an Optimized Cross-validated ClUsteRing (OCCUR) method, which determines the optimal number of clusters and best clustering results. Then, support vector machine pattern recognition (SVM-PR) is adopted to recognize the category of a certain day using the first few hours' data in the forecasting stage. GHI forecasts are generated by the most suitable models in different clusters, which are built by a two-layer Machine learning based Multi-Model (M3) forecasting framework. The developed UC-based methodology is validated by using 1-year of data with six solar features. Numerical results show that (i) UC-based models outperform non-UC (all-in-one) models with the same M3 architecture by approximately 20%; (ii) M3-based models also outperform the single-algorithm machine learning (SAML) models by approximately 20%.
AIWC: OpenCL-based Architecture-Independent Workload Characterisation
Venue: arXiv cs.SE 2018
Year: 2018

Measuring performance-critical characteristics of application workloads is important both for developers, who must understand and optimize the performance of codes, as well as designers and integrators of HPC systems, who must ensure that compute architectures are suitable for the intended workloads. However, if these workload characteristics are tied to architectural features that are specific to a particular system, they may not generalize well to alternative or future systems. An architecture-independent method ensures an accurate characterization of inherent program behaviour, without bias due to architecture-dependent features that vary widely between different types of accelerators. This work presents the first architecture- independent workload characterization framework for heterogeneous compute platforms, proposing a set of metrics determining the suitability and performance of an application on any parallel HPC architecture. The tool, AIWC, is a plugin for the open-source Oclgrind simulator. It supports parallel workloads and is capable of characterizing OpenCL codes currently in use in the supercomputing setting. AIWC simulates an OpenCL device by directly interpreting LLVM instructions, and the resulting metrics may be used for performance prediction and developer feedback to guide device-specific optimizations. An evaluation of the metrics collected over a subset of the Extended OpenDwarfs Benchmark Suite is also presented.
Performance Study of LTE and mmWave in Vehicle-to-Network Communications
Venue: arXiv cs.NI 2018
Year: 2018

A key enabler for the emerging autonomous and cooperative driving services is high-throughput and reliable Vehicle-to-Network (V2N) communication. In this respect, the millimeter wave (mmWave) frequencies hold great promises because of the large available bandwidth which may provide the required link capacity. However, this potential is hindered by the challenging propagation characteristics of high-frequency channels and the dynamic topology of the vehicular scenarios, which affect the reliability of the connection. Moreover, mmWave transmissions typically leverage beamforming gain to compensate for the increased path loss experienced at high frequencies. This, however, requires fine alignment of the transmitting and receiving beams, which may be difficult in vehicular scenarios. Those limitations may undermine the performance of V2N communications and pose new challenges for proper vehicular communication design. In this paper, we study by simulation the practical feasibility of some mmWave-aware strategies to support V2N, in comparison to the traditional LTE connectivity below 6 GHz. The results show that the orchestration among different radios represents a viable solution to enable both high-capacity and robust V2N communications.
Blockage Modeling for Inter-layer UAVs Communications in Urban Environments
Venue: arXiv cs.IT 2018
Year: 2018

The impact of buildings blockage on the UAVs communications in different UAVs heights is studied, when UAVs fly in a given rectangular urban area. This paper analyzes the properties of blockage behavior of communication links between UAVs from layers of different heights, including two main stochastic properties, namely the blockage (or LOS) probabilities, and the state transition models (birth-death process of LOS propagation). Based on stochastic geometry methods, the relation between LOS probability and the parameters of the region and the buildings is derived and verified with simulations. Furthermore, based on the simulations of the channel state transition process, we also find the birth-death process can be modeled as a distance continuous Markov process, and the transition rates are also extracted with their relation with the height of layers.
Towards scalable pattern-based optimization for dense linear algebra
Venue: arXiv cs.DC 2018
Year: 2018

Linear algebraic expressions are the essence of many computationally intensive problems, including scientific simulations and machine learning applications. However, translating high-level formulations of these expressions to efficient machine-level representations is far from trivial: developers should be assisted by automatic optimization tools so that they can focus their attention on high-level problems, rather than low-level details. The tractability of these optimizations is highly dependent on the choice of the primitive constructs in terms of which the computations are to be expressed. In this work we propose to describe operations on multi-dimensional arrays using a selection of higher-order functions, inspired by functional programming, and we present rewrite rules for these such that they can be automatically optimized for modern hierarchical and heterogeneous architectures. Using this formalism we systematically construct and analyse different subdivisions and permutations of the dense matrix multiplication problem.
Channel Model in Urban Environment for Unmanned Aerial Vehicle Communications
Venue: arXiv cs.IT 2018
Year: 2018

In order to develop and analyze reliable communications links for unmanned aerial vehicles (UAVs), accurate models for the propagation channel are required. The radio channel properties in the urban scenario are different from those in the suburb scenario and open area due to so many scattering paths from office buildings, especially when the UAV flies in the low altitude. We took some measurement campaigns on the campus of Tsinghua University with crowded apartments and office buildings. Based on the measurement result we extract the main parameters of pathloss model, and propose a simplified Saleh-Valenzuela (SV) model with specific parameters. The typical scene of central lawn is compared with the office buildings in the analysis of K-factor and root-mean-square (RMS) delay spread.
A Sensorimotor Perspective on Grounding the Semantic of Simple Visual Features
Venue: arXiv cs.RO 2018
Year: 2018

In Machine Learning and Robotics, the semantic content of visual features is usually provided to the system by a human who interprets its content. On the contrary, strictly unsupervised approaches have difficulties relating the statistics of sensory inputs to their semantic content without also relying on prior knowledge introduced in the system. We proposed in this paper to tackle this problem from a sensorimotor perspective. In line with the Sensorimotor Contingencies Theory, we make the fundamental assumption that the semantic content of sensory inputs at least partially stems from the way an agent can actively transform it. We illustrate our approach by formalizing how simple visual features can induce invariants in a naive agent's sensorimotor experience, and evaluate it on a simple simulated visual system. Without any a priori knowledge about the way its sensorimotor information is encoded, we show how an agent can characterize the uniformity and edge-ness of the visual features it interacts with.
Decision problems for Clark-congruential languages
Venue: arXiv cs.CL 2018
Year: 2018

A common question when studying a class of context-free grammars is whether equivalence is decidable within this class. We answer this question positively for the class of Clark-congruential grammars, which are of interest to grammatical inference. We also consider the problem of checking whether a given CFG is Clark-congruential, and show that it is decidable given that the CFG is a DCFG.
Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity
Venue: arXiv cs.DS 2018
Year: 2018

We introduce two new "degree of complementarity" measures, which we refer to, respectively, as supermodular width and superadditive width. Both are formulated based on natural witnesses of complementarity. We show that both measures are robust by proving that they, respectively, characterize the gap of monotone set functions from being submodular and subadditive. Thus, they define two new hierarchies over monotone set functions, which we will refer to as Supermodular Width (SMW) hierarchy and Superadditive Width (SAW) hierarchy, with level 0 of the hierarchies resting exactly on submodular and subadditive functions, respectively. We present a comprehensive comparative analysis of the SMW hierarchy and the Supermodular Degree (SD) hierarchy, defined by Feige and Izsak. We prove that the SMW hierarchy is strictly more expressive than the SD hierarchy. We show that previous results regarding approximation guarantees for welfare and constrained maximization as well as regarding the Price of Anarchy (PoA) of simple auctions can be extended without any loss from the SD hierarchy to the SMW hierarchy. We also establish almost matching information-theoretical lower bounds. The combination of these approximation and hardness results illustrate that the SMW hierarchy provides an accurate characterization of "near submodularity" needed for maximization approximation. While SD and SMW hierarchies support nontrivial bounds on the PoA of simple auctions, we show that our SAW hierarchy seems to capture more intrinsic properties needed to realize the efficiency of simple auctions. So far, the SAW hierarchy provides the best dependency for the PoA of Single-bid Auction, and is nearly as competitive as the Maximum over Positive Hypergraphs (MPH) hierarchy for Simultaneous Item First Price Auction (SIA). We provide almost tight lower bounds for the PoA of both auctions with respect to the SAW hierarchy.
Non-Stationary Texture Synthesis by Adversarial Expansion
Venue: arXiv cs.GR 2018
Year: 2018

The real world exhibits an abundance of non-stationary textures. Examples include textures with large-scale structures, as well as spatially variant and inhomogeneous textures. While existing example-based texture synthesis methods can cope well with stationary textures, non-stationary textures still pose a considerable challenge, which remains unresolved. In this paper, we propose a new approach for example-based non-stationary texture synthesis. Our approach uses a generative adversarial network (GAN), trained to double the spatial extent of texture blocks extracted from a specific texture exemplar. Once trained, the fully convolutional generator is able to expand the size of the entire exemplar, as well as of any of its sub-blocks. We demonstrate that this conceptually simple approach is highly effective for capturing large-scale structures, as well as other non-stationary attributes of the input exemplar. As a result, it can cope with challenging textures, which, to our knowledge, no other existing method can handle.
Interactive Reinforcement Learning with Dynamic Reuse of Prior Knowledge from Human/Agent's Demonstration
Venue: arXiv cs.AI 2018
Year: 2018

Reinforcement learning has enjoyed multiple successes in recent years. However, these successes typically require very large amounts of data before an agent achieves acceptable performance. This paper introduces a novel way of combating such requirements by leveraging existing (human or agent) knowledge. In particular, this paper uses demonstrations from agents and humans, allowing an untrained agent to quickly achieve high performance. We empirically compare with, and highlight the weakness of, HAT and CHAT, methods of transferring knowledge from a source agent/human to a target agent. This paper introduces an effective transfer approach, DRoP, combining the offline knowledge (demonstrations recorded before learning) with online confidence-based performance analysis. DRoP dynamically involves the demonstrator's knowledge, integrating it into the reinforcement learning agent's online learning loop to achieve efficient and robust learning.
Sentiment Composition of Words with Opposing Polarities
Venue: arXiv cs.CL 2018
Year: 2018

In this paper, we explore sentiment composition in phrases that have at least one positive and at least one negative word---phrases like 'happy accident' and 'best winter break'. We compiled a dataset of such opposing polarity phrases and manually annotated them with real-valued scores of sentiment association. Using this dataset, we analyze the linguistic patterns present in opposing polarity phrases. Finally, we apply several unsupervised and supervised techniques of sentiment composition to determine their efficacy on this dataset. Our best system, which incorporates information from the phrase's constituents, their parts of speech, their sentiment association scores, and their embedding vectors, obtains an accuracy of over 80% on the opposing polarity phrases.
Using the Best Linear Approximation With Varying Excitation Signals for Nonlinear System Characterization
Venue: arXiv cs.SY 2018
Year: 2018

Block oriented model structure detection is quite desirable since it helps to imagine the system with real physical elements. In this work we explore experimental methods to detect the internal structure of the system, using a black box approach. Two different strategies are compared and the best combination of these is introduced. The methods are applied on two real systems with a static nonlinear block in the feedback path. The main goal is to excite the system in a way that reduces the total distortion in the measured frequency response functions to have more precise measurements and more reliable decision about the structure of the system.
Using Statistical and Semantic Models for Multi-Document Summarization
Venue: arXiv cs.CL 2018
Year: 2018

We report a series of experiments with different semantic models on top of various statistical models for extractive text summarization. Though statistical models may better capture word co-occurrences and distribution around the text, they fail to detect the context and the sense of sentences /words as a whole. Semantic models help us gain better insight into the context of sentences. We show that how tuning weights between different models can help us achieve significant results on various benchmarks. Learning pre-trained vectors used in semantic models further, on given corpus, can give addition spike in performance. Using weighing techniques in between different statistical models too further refines our result. For Statistical models, we have used TF/IDF, TextRAnk, Jaccard/Cosine Similarities. For Semantic Models, we have used WordNet-based Model and proposed two models based on Glove Vectors and Facebook's InferSent. We tested our approach on DUC 2004 dataset, generating 100-word summaries. We have discussed the system, algorithms, analysis and also proposed and tested possible improvements. ROUGE scores were used to compare to other summarizers.
Randomization Approaches for Reducing PAPR with Partial Transmit Sequences and Semidefinite Relaxation
Venue: arXiv cs.IT 2018
Year: 2018

To reduce peak-to-average power ratio, we propose a method to choose a suitable vector for a partial transmit sequence technique. With a conventional method for this technique, we have to choose a suitable vector from a large amount of candidates. By contrast, our method does not include such a selecting procedure, and consists of generating random vectors from the Gaussian distribution whose covariance matrix is a solution of a relaxed problem. The suitable vector is chosen from the random vectors. This yields lower peak-to-average power ratio, compared to a conventional method for the fixed number of random vectors.
Convolutional CRFs for Semantic Segmentation
Venue: arXiv cs.CV 2018
Year: 2018

For the challenging semantic image segmentation task the most efficient models have traditionally combined the structured modelling capabilities of Conditional Random Fields (CRFs) with the feature extraction power of CNNs. In more recent works however, CRF post-processing has fallen out of favour. We argue that this is mainly due to the slow training and inference speeds of CRFs, as well as the difficulty of learning the internal CRF parameters. To overcome both issues we propose to add the assumption of conditional independence to the framework of fully-connected CRFs. This allows us to reformulate the inference in terms of convolutions, which can be implemented highly efficiently on GPUs. Doing so speeds up inference and training by a factor of more then 100. All parameters of the convolutional CRFs can easily be optimized using backpropagation. To facilitating further CRF research we make our implementation publicly available. Please visit: https://github.com/MarvinTeichmann/ConvCRF