Oceania
The 10 Top Robotics Investments in January 2019 Analytics Insight
Robotics investments in January 2019 have crossed a minimum of $644 million worldwide, armed with a total of 25 robotics transactions. The $644 million raised in January is lower than the funding into this industry raised in December in tune of $652.7 million. One of the biggest investments in January that is $104 million Series A has been made into the Beijing Auto AI Technology Co. of China. Other notable investments in January 2019 into Robotics include the $100 million JV into Ekso Bionics Holdings Inc. and a $59.61 million Series B funding into China-based NASN Automotive Electronics Co. Here are the Top 10 Investments that ruled the Robotics Technologies space in January 2019.
Māori loanwords project becomes easier with machine learning
A machine learning model was used by researchers from the University of Waikato, in New Zealand, to narrow down a massive 8 million tweets to a more manageable 1.2 million in order to look at how te reo Māori is being used in the genre. According to a recent press release, the team focused on 77 Māori loanwords, or te reo Māori words used in an English context, and used them as training data for their machine learning model. Machine learning allows data scientists to provide a computer with a large data set, and teach it to make predictions based on that data. The initial 8 million tweets contained a fair bit of distracting data'noise'. The irrelevant tweets are those that are not used in a New Zealand English context, or were otherwise unrelated.
SCEF: A Support-Confidence-aware Embedding Framework for Knowledge Graph Refinement
Knowledge graph (KG) refinement mainly aims at KG completion and correction (i.e., error detection). However, most conventional KG embedding models only focus on KG completion with an unreasonable assumption that all facts in KG hold without noises, ignoring error detection which also should be significant and essential for KG refinement.In this paper, we propose a novel support-confidence-aware KG embedding framework (SCEF), which implements KG completion and correction simultaneously by learning knowledge representations with both triple support and triple confidence. Specifically, we build model energy function by incorporating conventional translation-based model with support and confidence. To make our triple support-confidence more sufficient and robust, we not only consider the internal structural information in KG, studying the approximate relation entailment as triple confidence constraints, but also the external textual evidence, proposing two kinds of triple supports with entity types and descriptions respectively.Through extensive experiments on real-world datasets, we demonstrate SCEF's effectiveness.
Deep Convolutional Sum-Product Networks for Probabilistic Image Representations
van de Wolfshaar, Jos, Pronobis, Andrzej
Sum-Product Networks (SPNs) are hierarchical probabilistic graphical models capable of fast and exact inference. Applications of SPNs to real-world data such as large image datasets has been fairly limited in previous literature. We introduce Convolutional Sum-Product Networks (ConvSPNs) which exploit the inherent structure of images in a way similar to deep convolutional neural networks, optionally with weight sharing. ConvSPNs encode spatial relationships through local products and local sum operations. ConvSPNs obtain state-of-the-art results compared to other SPN-based approaches on several visual datasets, including color images, for both generative as well as discriminative tasks. ConvSPNs are the first pure-SPN models applied to color images that do not depend on additional techniques for feature extraction. In addition, we introduce two novel methods for regularizing SPNs trained with hard EM. Both regularization methods have been motivated by observing an exponentially decreasing variance of log probabilities with respect to the depth of randomly structured SPNs. We show that our regularization provides substantial further improvements in generative visual tasks.
An In-Vehicle KWS System with Multi-Source Fusion for Vehicle Applications
Tan, Yue, Zheng, Kan, Lei, Lei
Abstract--In order to maximize detection precision rate as well as the recall rate, this paper proposes an in-vehicle multisource fusionscheme in Keyword Spotting (KWS) System for vehicle applications. Vehicle information, as a new source for the original system, is collected by an in-vehicle data acquisition platform while the user is driving. A Deep Neural Network (DNN) is trained to extract acoustic features and make a speech classification. Based on the posterior probabilities obtained from DNN, the vehicle information including the speed and direction of vehicle is applied to choose the suitable parameter from a pair of sensitivity values for the KWS system. The experimental results show that the KWS system with the proposed multi-source fusion scheme can achieve better performances in term of precision rate, recall rate, and mean square error compared to the system without it. I. INTRODUCTION Keyword Spotting (KWS) System, also known as wakeword detection,refers to the task of detecting specified keyword from a continuous stream of audio provided by the users [1]. Keyword Spotting has been an active research area in speech recognition for decades, and widely used in numerous applications.
Video Friday: Final Goodbye to Opportunity Rover, and More
Video Friday is your weekly selection of awesome robotics videos, collected by your Automaton bloggers. We'll also be posting a weekly calendar of upcoming robotics events for the next few months; here's what we have so far (send us your events!): Let us know if you have suggestions for next week, and enjoy today's videos. I have no idea what to even say about the Opportunity rover. I'm not sure that the amazing people at JPL do, either.
Robots Are Writing the News and Nobody's Talking About It
As journalists face increased layoffs despite the growing appetite for up-to-the-minute, timely news, a new trend has quietly been disrupting the news industry. News organizations are increasingly turning toward artificial intelligence (AI) for production, using a variety of new automated systems to pump out content with minimal need for direct human input. According to a report by The New York Times, Bloomberg News relies on a system called Cyborg to produce about a third of its articles. Most of Cyborg's output takes the form of company earnings reports that are rife with percentages, charts, and other financial data that can be crunched down into a news story quickly and accurately. Increasingly, major news agency like Reuters and Associated Press, along with a number of newspapers such as Washington Post and Los Angeles Times, are using algorithms to crunch out news on everything from local minor league sports games to earthquakes.
Fast Task-Aware Architecture Inference
Kokiopoulou, Efi, Hauth, Anja, Sbaiz, Luciano, Gesmundo, Andrea, Bartok, Gabor, Berent, Jesse
Neural architecture search has been shown to hold great promise towards the automation of deep learning. However in spite of its potential, neural architecture search remains quite costly. To this point, we propose a novel gradient-based framework for efficient architecture search by sharing information across several tasks. We start by training many model architectures on several related (training) tasks. When a new unseen task is presented, the framework performs architecture inference in order to quickly identify a good candidate architecture, before any model is trained on the new task. At the core of our framework lies a deep value network that can predict the performance of input architectures on a task by utilizing task meta-features and the previous model training experiments performed on related tasks. We adopt a continuous parametrization of the model architecture which allows for efficient gradient-based optimization. Given a new task, an effective architecture is quickly identified by maximizing the estimated performance with respect to the model architecture parameters with simple gradient ascent. It is key to point out that our goal is to achieve reasonable performance at the lowest cost. We provide experimental results showing the effectiveness of the framework despite its high computational efficiency.
All the buzz at AI's big shindig
So read the T-shirt sported by Ben Recht, a professor at the University of California, Berkeley, as he collected an award at the Neural Information Processing Systems (NIPS) conference this week. Dr Recht, pictured above in lecture mode, was protesting against the flood of corporate money pouring into NIPS, aping the words Kurt Cobain wrote on a T-shirt when he appeared on the cover of Rolling Stone in 1992. "It's not an academic conference anymore," Dr Recht says wistfully, perched in the Californian sun on the steps of the Long Beach Convention Centre. He complains that folk would rather go to corporate-sponsored parties these days (Intel's featured Flo Rida, a rapper), than poster sessions. AI, it seems, is the new rock and roll.
A Probabilistic framework for Quantum Clustering
Casaña-Eslava, Raúl V., Lisboa, Paulo J. G., Ortega-Martorell, Sandra, Jarman, Ian H., Martín-Guerrero, José D.
Quantum Clustering is a powerful method to detect clusters in data with mixed density. However, it is very sensitive to a length parameter that is inherent to the Schr\"odinger equation. In addition, linking data points into clusters requires local estimates of covariance that are also controlled by length parameters. This raises the question of how to adjust the control parameters of the Schr\"odinger equation for optimal clustering. We propose a probabilistic framework that provides an objective function for the goodness-of-fit to the data, enabling the control parameters to be optimised within a Bayesian framework. This naturally yields probabilities of cluster membership and data partitions with specific numbers of clusters. The proposed framework is tested on real and synthetic data sets, assessing its validity by measuring concordance with known data structure by means of the Jaccard score (JS). This work also proposes an objective way to measure performance in unsupervised learning that correlates very well with JS.