hrnn
Evaluation metrics for behaviour modeling
Im, Daniel Jiwoong, Kwak, Iljung, Branson, Kristin
A primary difficulty with unsupervised discovery of structure in large data sets is a lack of quantitative evaluation criteria. In this work, we propose and investigate several metrics for evaluating and comparing generative models of behavior learned using imitation learning. Compared to the commonly-used model log-likelihood, these criteria look at longer temporal relationships in behavior, are relevant if behavior has some properties that are inherently unpredictable, and highlight biases in the overall distribution of behaviors produced by the model. Pointwise metrics compare real to model-predicted trajectories given true past information. Distribution metrics compare statistics of the model simulating behavior in open loop, and are inspired by how experimental biologists evaluate the effects of manipulations on animal behavior. We show that the proposed metrics correspond with biologists' intuitions about behavior, and allow us to evaluate models, understand their biases, and enable us to propose new research directions.
Decoupling Hierarchical Recurrent Neural Networks With Locally Computable Losses
Mujika, Asier, Weissenberger, Felix, Steger, Angelika
Learning long-term dependencies is a key long-standing challenge of recurrent neural networks (RNNs). Hierarchical recurrent neural networks (HRNNs) have been considered a promising approach as long-term dependencies are resolved through shortcuts up and down the hierarchy. Yet, the memory requirements of Truncated Backpropagation Through Time (TBPTT) still prevent training them on very long sequences. In this paper, we empirically show that in (deep) HRNNs, propagating gradients back from higher to lower levels can be replaced by locally computable losses, without harming the learning capability of the network, over a wide range of tasks. This decoupling by local losses reduces the memory requirements of training by a factor exponential in the depth of the hierarchy in comparison to standard TBPTT.
Crash Catcher: Detecting Car Crashes in Video – Insight Data
Tasks that humans take for granted are often difficult for machines to complete. That's why when you're asked to prove yourself human through those CAPTCHA tests, you're always asked a ridiculously simple question, e.g., whether an image contains a road sign or not, or selecting a subset of images that contain food (see Moravec's Paradox). These tests are effective in determining whether a user is human precisely because image recognition in context is difficult for machines. Training computers to accurately answer these kinds of questions in an automated, efficient way for large amounts of data is complicated. To get around this, companies like Facebook and Amazon spend a lot of money to manually deal with image and video classification problems.