Asia
Visualisation and 'Diagnostic Classifiers' Reveal How Recurrent and Recursive Neural Networks Process Hierarchical Structure
Hupkes, Dieuwke, Veldhoen, Sara, Zuidema, Willem
We investigate how neural networks can learn and process languages with hierarchical, compositional semantics. To this end, we define the artificial task of processing nested arithmetic expressions, and study whether different types of neural networks can learn to compute their meaning. We find that recursive neural networks can implement a generalising solution to this problem, and we visualise this solution by breaking it up in three steps: project, sum and squash. As a next step, we investigate recurrent neural networks, and show that a gated recurrent unit, that processes its input incrementally, also performs very well on this task: the network learns to predict the outcome of the arithmetic expressions with high accuracy, although performance deteriorates somewhat with increasing length. To develop an understanding of what the recurrent network encodes, visualisation techniques alone do not suffice. Therefore, we develop an approach where we formulate and test multiple hypotheses on the information encoded and processed by the network. For each hypothesis, we derive predictions about features of the hidden state representations at each time step, and train 'diagnostic classifiers' to test those predictions. Our results indicate that the networks follow a strategy similar to our hypothesised 'cumulative strategy', which explains the high accuracy of the network on novel expressions, the generalisation to longer expressions than seen in training, and the mild deterioration with increasing length. This in turn shows that diagnostic classifiers can be a useful technique for opening up the black box of neural networks. We argue that diagnostic classification, unlike most visualisation techniques, does scale up from small networks in a toy domain, to larger and deeper recurrent networks dealing with real-life data, and may therefore contribute to a better understanding of the internal dynamics of current state-of-the-art models in natural language processing.
Memory-augmented Dialogue Management for Task-oriented Dialogue Systems
Zhang, Zheng, Huang, Minlie, Zhao, Zhongzhou, Ji, Feng, Chen, Haiqing, Zhu, Xiaoyan
Dialogue management (DM) decides the next action of a dialogue system according to the current dialogue state, and thus plays a central role in task-oriented dialogue systems. Since dialogue management requires to have access to not only local utterances, but also the global semantics of the entire dialogue session, modeling the long-range history information is a critical issue. To this end, we propose a novel Memory-Augmented Dialogue management model (MAD) which employs a memory controller and two additional memory structures, i.e., a slot-value memory and an external memory. The slot-value memory tracks the dialogue state by memorizing and updating the values of semantic slots (for instance, cuisine, price, and location), and the external memory augments the representation of hidden states of traditional recurrent neural networks through storing more context information. To update the dialogue state efficiently, we also propose slot-level attention on user utterances to extract specific semantic information for each slot. Experiments show that our model can obtain state-of-the-art performance and outperforms existing baselines.
Towards Diverse Text Generation with Inverse Reinforcement Learning
Shi, Zhan, Chen, Xinchi, Qiu, Xipeng, Huang, Xuanjing
Text generation is a crucial task in NLP. Recently, several adversarial generative models have been proposed to improve the exposure bias problem in text generation. Though these models gain great success, they still suffer from the problems of reward sparsity and mode collapse. In order to address these two problems, in this paper, we employ inverse reinforcement learning (IRL) for text generation. Specifically, the IRL framework learns a reward function on training data, and then an optimal policy to maximum the expected total reward. Similar to the adversarial models, the reward and policy function in IRL are optimized alternately. Our method has two advantages: (1) the reward function can produce more dense reward signals. (2) the generation policy, trained by "entropy regularized" policy gradient, encourages to generate more diversified texts. Experiment results demonstrate that our proposed method can generate higher quality texts than the previous methods.
A Non-parametric Multi-stage Learning Framework for Cognitive Spectrum Access in IoT Networks
Tholeti, Thulasi, Raj, Vishnu, Kalyani, Sheetal
Given the increasing number of devices that is going to get connected to wireless networks with the advent of Internet of Things, spectrum scarcity will present a major challenge. Application of opportunistic spectrum access mechanisms to IoT networks will become increasingly important to solve this. In this paper, we present a cognitive radio network architecture which uses multi-stage online learning techniques for spectrum assignment to devices, with the aim of improving the throughput and energy efficiency of the IoT devices. In the first stage, we use an AI technique to learn the quality of a user-channel pairing. The next stage utilizes a non-parametric Bayesian learning algorithm to estimate the Primary User OFF time in each channel. The third stage augments the Bayesian learner with implicit exploration to accelerate the learning procedure. The proposed method leads to significant improvement in throughput and energy efficiency of the IoT devices while keeping the interference to the primary users minimal. We provide comprehensive empirical validation of the method with other learning based approaches.
Staircase Network: structural language identification via hierarchical attentive units
Trong, Trung Ngo, Hautamรคki, Ville, Jokinen, Kristiina
Language recognition system is typically trained directly to optimize classification error on the target language labels, without using the external, or meta-information in the estimation of the model parameters. However labels are not independent of each other, there is a dependency enforced by, for example, the language family, which affects negatively on classification. The other external information sources (e.g. audio encoding, telephony or video speech) can also decrease classification accuracy. In this paper, we attempt to solve these issues by constructing a deep hierarchical neural network, where different levels of meta-information are encapsulated by attentive prediction units and also embedded into the training progress. The proposed method learns auxiliary tasks to obtain robust internal representation and to construct a variant of attentive units within the hierarchical model. The final result is the structural prediction of the target language and a closely related language family. The algorithm reflects a "staircase" way of learning in both its architecture and training, advancing from the fundamental audio encoding to the language family level and finally to the target language level. This process not only improves generalization but also tackles the issues of imbalanced class priors and channel variability in the deep neural network model. Our experimental findings show that the proposed architecture outperforms the state-of-the-art i-vector approaches on both small and big language corpora by a significant margin.
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
Liu, Yulan, Bi, Shujun, Pan, Shaohua
This paper proposes a mechanism to produce equivalent Lipschitz surrogates for zero-norm and rank optimization problems by means of the global exact penalty for their equivalent mathematical programs with an equilibrium constraint (MPECs). Specifically, we reformulate these combinatorial problems as equivalent MPECs by the variational characterization of the zero-norm and rank function, show that their penalized problems, yielded by moving the equilibrium constraint into the objective, are the global exact penalization, and obtain the equivalent Lipschitz surrogates by eliminating the dual variable in the global exact penalty. These surrogates, including the popular SCAD function in statistics, are also difference of two convex functions (D.C.) if the function and constraint set involved in zero-norm and rank optimization problems are convex. We illustrate an application by designing a multi-stage convex relaxation approach to the rank plus zero-norm regularized minimization problem.
OMG - Emotion Challenge Solution
Cui, Yuqi, Zhang, Xiao, Wang, Yang, Guo, Chenfeng, Wu, Dongrui
Abstract--This short paper describes our solution to the 2018 IEEE World Congress on Computational Intelligence One-Minute Gradual-Emotional Behavior Challenge, whose goal was to estimate continuous arousal and valence values from short videos. We designed four base regression models using visual and audio features, and then used a spectral approach to fuse them to obtain improved performance. (IEEE WCCI 2018). The dataset was composed of 420 relatively long emotion videos with an average length of 1 minute, collected from a variety of Youtube channels. Videos were separated into clips based on utterances, and each utterance's valence and arousal levels were annotated by at least five independent subjects using the Amazon Mechanical Turk tool.
How Artificial Intelligence And Big Data Are Changing Engineering Forever
The convergence of artificial intelligence (AI), big data, automation and the internet of things (IoT) already has widespread implications on the way we design, make and maintain things. These transformative technologies collectively are the drivers of a "fourth industrial revolution". Previous seismic shifts in industrialisation were brought about by the advent of steam, electricity and digital technology. Today, it is data-driven, autonomous and self-learning technologies which are driving the rapid changes we are seeing across many sectors of business and industry. Of course, information has always been the lifeblood of engineering and manufacturing.
AI, robotics and healthcare: It's all about augmentation, not replacement (via Passle)
If I see a robot coming to kill me, I'll just look for the off-switch or how I can unplug it". I'm ever so slightly paraphrasing Pete Trainor, one of yesterday's speakers at Wired Health 2018, but this was the jist of what he said to me over a coffee as we discussed AI, robotics and its place in the the world. And if I can draw a theme from yesterday's excellent Wired Health event held at the very impressive Francis Crick Institute, it's that AI, robotics and digital technology are not here to replace people in healthcare provision. Rather, they are here to augment and "scale-up" the amount that a healthcare professional can do. This was a theme which was alighted on by a number of speakers.
Startups are bringing IoT and AI to real-estate
Imagine a home that sends you a text message if the gas pipe is leaking or when your fridge is out of milk. Imagine waking up to your go-to playlist streaming on your home music system automatically. Imagine zeroing in on a neighbourhood to buy a home and being able to look at price trends and your payment plans for them on your phone. As real-estate starts to incorporate Internet of Things (IoT), artificial intelligence (AI), chatbots and blockchain, the buying, selling and actually living in homes promises to be more efficient, safer and better controlled. New tech start-ups are aiming to reduce tedious and time-consuming tasks that buyers and brokers did.