Entity summarization aims at creating brief but informative descriptions of entities from knowledge graphs. While previous work mostly focused on traditional techniques such as clustering algorithms and graph models, we ask how to apply deep learning methods into this task. In this paper we propose ESA, a neural network with supervised attention mechanisms for entity summarization. Specifically, we calculate attention weights for facts in each entity, and rank facts to generate reliable summaries. We explore techniques to solve difficult learning problems presented by the ESA, and demonstrate the effectiveness of our model in comparison with the state-of-the-art methods. Experimental results show that our model improves the quality of the entity summaries in both F-measure and MAP.

Deep neural networks have obtained astounding successes for important pattern recognition tasks, but they suffer from high computational complexity and the lack of interpretability. The recent Tsetlin Machine (TM) attempts to address this lack by using easy-to-interpret conjunctive clauses in propositional logic to solve complex pattern recognition problems. The TM provides competitive accuracy in several benchmarks, while keeping the important property of interpretability. It further facilitates hardware-near implementation since inputs, patterns, and outputs are expressed as bits, while recognition and learning rely on straightforward bit manipulation. In this paper, we exploit the TM paradigm by introducing the Convolutional Tsetlin Machine (CTM), as an interpretable alternative to convolutional neural networks (CNNs). Whereas the TM categorizes an image by employing each clause once to the whole image, the CTM uses each clause as a convolution filter. That is, a clause is evaluated multiple times, once per image patch taking part in the convolution. To make the clauses location-aware, each patch is further augmented with its coordinates within the image. The output of a convolution clause is obtained simply by ORing the outcome of evaluating the clause on each patch. In the learning phase of the TM, clauses that evaluate to 1 are contrasted against the input. For the CTM, we instead contrast against one of the patches, randomly selected among the patches that made the clause evaluate to 1. Accordingly, the standard Type I and Type II feedback of the classic TM can be employed directly, without further modification. The CTM obtains a peak test accuracy of 99.51% on MNIST, 96.21% on Kuzushiji-MNIST, 89.56% on Fashion-MNIST, and 100.0% on the 2D Noisy XOR Problem, which is competitive with results reported for simple 4-layer CNNs, BinaryConnect, and a recent FPGA-accelerated Binary CNN.

Sounds a lot like the road that led to an AI winter historically... I think we're well past the point where that's a genuine risk of AI interest globally cooling down at all (it's already very practical and profitable in many arenas just with what we have) but openAI themselves? If historical trends are any indication, that kind of talk will buy them at most 5 years of normal investor questions, 5 years of severe questions, then bankruptcy. They've very generously got a decade to figure something actually practical out, and realistically the clock might only have five years on it or less. Wonder if they'll invent a thing that'll teach them to make money before then, haha.

I really think the fundamental idea of the paper is really cool for everyone doing deep learning.

Christoph Stockhammer is an Application Engineer at MathWorks. He focuses on mathematics and statistics in the field of data analytics, the application of machine & deep learning techniques as well as the integration of MATLAB code into other software components.

Christoph Stockhammer is an Application Engineer at MathWorks. He focuses on mathematics and statistics in the field of data analytics, the application of machine & deep learning techniques as well as the integration of MATLAB code into other software components.

In September 1955, John McCarthy, a young assistant professor of mathematics at Dartmouth College, boldly proposed that "every aspect of learning or any other feature of intelligence can in principle be so precisely described that a machine can be made to simulate it." McCarthy called this new field of study "artificial intelligence," and suggested that a two-month effort by a group of 10 scientists could make significant advances in developing machines that could "use language, form abstractions and concepts, solve kinds of problems now reserved for humans, and improve themselves." At the time, scientists optimistically believed we would soon have thinking machines doing any work a human could do. Now, more than six decades later, advances in computer science and robotics have helped us automate many of the tasks that previously required the physical and cognitive labor of humans. But true artificial intelligence, as McCarthy conceived it, continues to elude us.

Ever wonder how neuroscientists are able to monitor and study what happens inside a living brain in action? One of the challenges in neuroscience is observing the activity of neurons intact in brain tissue that is taking place in a living organism--in vivo. One approach, two-photon calcium imaging, is a method developed circa 1990. In mammalian neurons, calcium is an intracellular messenger. This imaging approach involves the loading of calcium ions (Ca2) indicator dyes in the desired brain region for neuronal monitoring and a two-photon laser scanning microscope for visualization.

I have worked with 12 startups. They have spanned verticals from fintech and healthcare to ed-tech and biotech, and ranged from pre-seed to post acquisition. My roles have also varied, from deep-in-the-weeds employee #1 to head of data science and strategic advisor. In all of them I worked on interesting machine learning and data science problems. All tried to build great products.

Deep learning is a branch of machine learning based on a set of algorithms that attempt to model high-level abstractions in data by using model architectures. With the superb memory management and the full integration with multi-node big data platforms, the H2O engine has become more and more popular among data scientists in the field of deep learning. This book will introduce you to the deep learning package H2O with R and help you understand the concepts of deep learning. We will start by setting up important deep learning packages available in R and then move towards building models related to neural networks, prediction, and deep prediction, all of this with the help of real-life examples. After installing the H2O package, you will learn about prediction algorithms.