Goto

Collaborating Authors

 Oceania


British Airways trials A.I. at London's Heathrow Airport to reduce delays

#artificialintelligence

British Airways (BA) has introduced artificial intelligence (AI) technology to parts of its "airside operation" at Heathrow Airport. In an announcement Monday, the airline said that AI would be used to tackle challenges faced when an aircraft is being prepared for departure after passengers from its previous flight have disembarked. It's during this time that staff on the ground undertake manual checks related to 18 different things, making records of what they are doing, British Airways said. These checks have to be done before the plane takes to the air again and are, among other things, related to refueling, the unloading and reloading of luggage, and cleaning of the aircraft's inside. BA said that if one of these tasks encounters an issue, it could potentially disrupt the whole process, resulting in a delayed departure.


Bayesian Curiosity for Efficient Exploration in Reinforcement Learning

arXiv.org Machine Learning

Balancing exploration and exploitation is a fundamental part of reinforcement learning, yet most state-of-the-art algorithms use a naive exploration protocol like $\epsilon$-greedy. This contributes to the problem of high sample complexity, as the algorithm wastes effort by repeatedly visiting parts of the state space that have already been explored. We introduce a novel method based on Bayesian linear regression and latent space embedding to generate an intrinsic reward signal that encourages the learning agent to seek out unexplored parts of the state space. This method is computationally efficient, simple to implement, and can extend any state-of-the-art reinforcement learning algorithm. We evaluate the method on a range of algorithms and challenging control tasks, on both simulated and physical robots, demonstrating how the proposed method can significantly improve sample complexity.


Shared Visual Abstractions

arXiv.org Artificial Intelligence

This paper presents abstract art created by neural networks and broadly recognizable across various computer vision systems. The existence of abstract forms that trigger specific labels independent of neural architecture or training set suggests convolutional neural networks build shared visual representations for the categories they understand. Computer vision classifiers encountering these drawings often respond with strong responses for specific labels - in extreme cases stronger than all examples from the validation set. By surveying human subjects we confirm that these abstract artworks are also broadly recognizable by people, suggesting visual representations triggered by these drawings are shared across human and computer vision systems.


Bayesian sparse convex clustering via global-local shrinkage priors

arXiv.org Machine Learning

Sparse convex clustering is to cluster observations and conduct variable selection simultaneously in the framework of convex clustering. Although the weighted $L_1$ norm as the regularization term is usually employed in the sparse convex clustering, this increases the dependence on the data and reduces the estimation accuracy if the sample size is not sufficient. To tackle these problems, this paper proposes a Bayesian sparse convex clustering via the idea of Bayesian lasso and global-local shrinkage priors. We introduce Gibbs sampling algorithms for our method using scale mixtures of normals. The effectiveness of the proposed methods is shown in simulation studies and a real data analysis.


Evaluating task-agnostic exploration for fixed-batch learning of arbitrary future tasks

arXiv.org Machine Learning

Deep reinforcement learning has been shown to solve challenging tasks where large amounts of training experience is available, usually obtained online while learning the task. Robotics is a significant potential application domain for many of these algorithms, but generating robot experience in the real world is expensive, especially when each task requires a lengthy online training procedure. Off-policy algorithms can in principle learn arbitrary tasks from a diverse enough fixed dataset. In this work, we evaluate popular exploration methods by generating robotics datasets for the purpose of learning to solve tasks completely offline without any further interaction in the real world. We present results on three popular continuous control tasks in simulation, as well as continuous control of a high-dimensional real robot arm. Code documenting all algorithms, experiments, and hyper-parameters is available at https://github.com/qutrobotlearning/batchlearning.


Deep Anomaly Detection with Deviation Networks

arXiv.org Machine Learning

Although deep learning has been applied to successfully address many data mining problems, relatively limited work has been done on deep learning for anomaly detection. Existing deep anomaly detection methods, which focus on learning new feature representations to enable downstream anomaly detection methods, perform indirect optimization of anomaly scores, leading to data-inefficient learning and suboptimal anomaly scoring. Also, they are typically designed as unsupervised learning due to the lack of large-scale labeled anomaly data. As a result, they are difficult to leverage prior knowledge (e.g., a few labeled anomalies) when such information is available as in many real-world anomaly detection applications. This paper introduces a novel anomaly detection framework and its instantiation to address these problems. Instead of representation learning, our method fulfills an end-to-end learning of anomaly scores by a neural deviation learning, in which we leverage a few (e.g., multiple to dozens) labeled anomalies and a prior probability to enforce statistically significant deviations of the anomaly scores of anomalies from that of normal data objects in the upper tail. Extensive results show that our method can be trained substantially more data-efficiently and achieves significantly better anomaly scoring than state-of-the-art competing methods.


Learning internal representations

arXiv.org Machine Learning

Probably the most important problem in machine learning is the preliminary biasing of a learner's hypothesis space so that it is small enough to ensure good generalisation from reasonable training sets, yet large enough that it contains a good solution to the problem being learnt. In this paper a mechanism for {\em automatically} learning or biasing the learner's hypothesis space is introduced. It works by first learning an appropriate {\em internal representation} for a learning environment and then using that representation to bias the learner's hypothesis space for the learning of future tasks drawn from the same environment. An internal representation must be learnt by sampling from {\em many similar tasks}, not just a single task as occurs in ordinary machine learning. It is proved that the number of examples $m$ {\em per task} required to ensure good generalisation from a representation learner obeys $m = O(a+b/n)$ where $n$ is the number of tasks being learnt and $a$ and $b$ are constants. If the tasks are learnt independently ({\em i.e.} without a common representation) then $m=O(a+b)$. It is argued that for learning environments such as speech and character recognition $b\gg a$ and hence representation learning in these environments can potentially yield a drastic reduction in the number of examples required per task. It is also proved that if $n = O(b)$ (with $m=O(a+b/n)$) then the representation learnt will be good for learning novel tasks from the same environment, and that the number of examples required to generalise well on a novel task will be reduced to $O(a)$ (as opposed to $O(a+b)$ if no representation is used). It is shown that gradient descent can be used to train neural network representations and experiment results are reported providing strong qualitative support for the theoretical results.


Artificial Intelligence in Education System Market 2019: Popular Trends, Growth, Rising Demand & Progressive Technologies To Watch Out For Near Future - Sound On Sound Fest

#artificialintelligence

The statistical study, the report outlines the Global Artificial Intelligence in Education System Industry including production, cost/profit, supply-demand, and import-export. The total market is further bifurcated into a company, by country, and by various segmentation for the competitive landscape study.


Global Military Artificial Intelligence (AI) and Cybernetics Market: Focus on Platform, Technology, Application and Services - Analysis and Forecast, 2019-2024

#artificialintelligence

Key Questions Answered in this Report: • What are the trends in the global military artificial intelligence and cybernetics across different regions? Global Military Artificial Intelligence Market Forecast, 2019-2024 The Global Military Artificial Intelligence Market report projects the market to grow at a significant CAGR of 18.66% on the basis of value during the forecast period from 2019 to 2024. North America dominated the global military artificial intelligence market with a share of 48.23% in 2019. North America, including the major countries such as the U.S., is the most prominent region for the military artificial intelligence market. In North America, the U.S. acquired a major market share in 2019 due to the major deployment of counter measures in defense sector in the country.


What happens when a bot writes your blog posts

#artificialintelligence

What did you choose to do as a writer, then? I was very naive when it comes to writing a series. I had no idea what was going to happen. I wanted it to be a lighthearted, realistic tale and I also wanted it to have a sense of drama, emotion, and suspense. I had no idea what I should do with the main characters in the first place, but I knew I had to make it a lighthearted, realistic story that would have the main characters struggling to find their happiness and love.