Learning From Geometry In Learning For Tactical And Strategic Decision Domains

Artificial neural networks (ANNs) are an abstraction of the low-level architecture of biological brains that are often applied in general problem solving and function approximation. Neuroevolution (NE), i.e. the evolution of ANNs, has proven effective at solving problems in a variety of domains. Information from the domain is input to the ANN, which outputs its desired actions. This dissertation presents a new NE algorithm called Hypercube-based NeuroEvolution of Augmenting Topologies (HyperNEAT), based on a novel indirect encoding of ANNs. The key insight in HyperNEAT is to make the algorithm aware of the geometry in which the ANNs are embedded and thereby exploit such domain geometry to evolve ANNs more effectively. The dissertation focuses on applying HyperNEAT to tactical and strategic decision domains. These domains involve simultaneously considering short-term tactics while also balancing long-term strategies. Board games such as checkers and Go are canonical examples of such domains; however, they also include real-time strategy games and military scenarios. The dissertation details three proposed extensions to HyperNEAT designed to work in tactical and strategic decision domains. The first is an action selector ANN architecture that allows the ANN to indicate its judgements on every possible action all at once. The second technique is called substrate extrapolation. It allows learning basic concepts at a low resolution, and then increasing the resolution to learn more advanced concepts. The iii final extension is geometric game-tree pruning, whereby HyperNEAT can endow the ANN the ability to focus on specific areas of a domain (such as a checkers board) that deserve more inspection. The culminating contribution is to demonstrate the ability of HyperNEAT with these extensions to play Go, a most challenging game for artificial intelligence, by combining HyperNEAT with UC

Neural Packet Classification

Packet classification is a fundamental problem in computer networking. This problem exposes a hard tradeoff between the computation and state complexity, which makes it particularly challenging. To navigate this tradeoff, existing solutions rely on complex hand-tuned heuristics, which are brittle and hard to optimize. In this paper, we propose a deep reinforcement learning (RL) approach to solve the packet classification problem. There are several characteristics that make this problem a good fit for Deep RL. First, many of the existing solutions are iteratively building a decision tree by splitting nodes in the tree. Second, the effects of these actions (e.g., splitting nodes) can only be evaluated once we are done with building the tree. These two characteristics are naturally captured by the ability of RL to take actions that have sparse and delayed rewards. Third, it is computationally efficient to generate data traces and evaluate decision trees, which alleviate the notoriously high sample complexity problem of Deep RL algorithms. Our solution, NeuroCuts, uses succinct representations to encode state and action space, and efficiently explore candidate decision trees to optimize for a global objective. It produces compact decision trees optimized for a specific set of rules and a given performance metric, such as classification time, memory footprint, or a combination of the two. Evaluation on ClassBench shows that NeuroCuts outperforms existing hand-crafted algorithms in classification time by 18% at the median, and reduces both time and memory footprint by up to 3x

Literature review of machine learning techniques to analyse flight data

This paper analyses the increasing trend of using modern machine learning technologies to analyze flight data efficiently. Flight data offers an important insight into the operations of an aircraft. This paper reviews the research undertaken so far on the use of Machine Learning techniques for the analyses of flight data by evaluating various anomaly detection algorithms and the significance of feature selection in Flight Data Monitoring. These algorithms are compared to determine the best class of algorithms for highlighting significant flight anomalies. Furthermore, these algorithms are analyzed for various flight data parameters to determine which class of algorithms is sensitive to continuous parameters and which is sensitive to discrete parameters of flight data. The paper also addresses the ability of each anomaly detection algorithm to be easily adaptable to different datasets and different phases of flight, including take-off and landing.peer-reviewe

Design of experiment for the pilot evaluation of an airborne runway incursion alerting system

Runway incursions pose a significant threat to the continued safety of commercial aviation. In response, the Runway Collision Avoidance Function (RCAF) was developed by the University of Malta and evaluated at Cranfield University as part of the European Programme FLYSAFE. This paper discusses the design of experiment developed in preparation of the said evaluations, addressing the objectives of the test programme and explains how these objectives were met.peer-reviewe

Roles of Electrostatics and Conformation in Protein-Crystal Interactions

In vitro studies have shown that the phosphoprotein osteopontin (OPN) inhibits the nucleation and growth of hydroxyapatite (HA) and other biominerals. In vivo, OPN is believed to prevent the calcification of soft tissues. However, the nature of the interaction between OPN and HA is not understood. In the computational part of the present study, we used molecular dynamics simulations to predict the adsorption of 19 peptides, each 16 amino acids long and collectively covering the entire sequence of OPN, to the {100} face of HA. This analysis showed that there is an inverse relationship between predicted strength of adsorption and peptide isoelectric point (P<0.0001). Analysis of the OPN sequence by PONDR (Predictor of Naturally Disordered Regions) indicated that OPN sequences predicted to adsorb well to HA are highly disordered. In the experimental part of the study, we synthesized phosphorylated and non-phosphorylated peptides corresponding to OPN sequences 65–80 (pSHDHMDDDDDDDDDGD) and 220–235 (pSHEpSTEQSDAIDpSAEK). In agreement with the PONDR analysis, these were shown by circular dichroism spectroscopy to be largely disordered. A constant-composition/seeded growth assay was used to assess the HA-inhibiting potencies of the synthetic peptides. The phosphorylated versions of OPN65-80 (IC50 = 1.93 µg/ml) and OPN220-235 (IC50 = 1.48 µg/ml) are potent inhibitors of HA growth, as is the nonphosphorylated version of OPN65-80 (IC50 = 2.97 µg/ml); the nonphosphorylated version of OPN220-235 has no measurable inhibitory activity. These findings suggest that the adsorption of acidic proteins to Ca2+-rich crystal faces of biominerals is governed by electrostatics and is facilitated by conformational flexibility of the polypeptide chain

Obstacle detection in aerodrome areas through the use of computer vision

This thesis addresses the problem of ground collisions between an aircraft and obstacles (including other aircraft) on the ramp and taxiway regions of an aireld. A safety study is conducted by looking at current operating procedures and analysing accident statistics and reports. An onboard non-collaborative system for large transport aircraft is proposed and its main requirements and performance characteristics are discussed. The main requirement is to detect and track generic obstacles around an aircraft during taxi manoeuvres. The suitability of computer vision to the application of interest of this work is investigated through comparison with other candidate sensor technologies and computer vision, using visible cameras, is selected as the preferred technology. A study of dierent optical solutions is carried out and stereo vision is considered to be the most suitable choice. Two locations on the aircraft are considered for camera installation and the installation of a stereo vision system on each wingtip is chosen. Algorithms are implemented for the dierent processing blocks of the stereo vision system. These comprise calibration, rectication, correspondence, reconstruction, detection, clustering, and tracking algorithms. For each process, existing methods and techniques are reviewed and the most appropriate ones are selected, modied and improved in order to meet the specic requirements of this application. The values of several parameters of each algorithm are found experimentally using synthetic data and each algorithm is tested individually before being integrated with the rest of the system. Overall system performance is evaluated by testing for positional accuracy, generic obstacle detection and tracking capabilities, and sensitivity to calibration errors. Testing is conducted for a range of realistic conict scenarios, under dierent illumination, visibility, and image noise conditions. Both synthetic images and real images are used. The results of both sets of images are compared and these suggest that the stereo vision system developed in this research has the potential to reduce wingtip collisions and can therefore improve safety and situational awareness in aerodrome areas

ABSTRACT

Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that excite adjacent locations on the retina map to neurons that are similarly adjacent in the visual cortex. That way, neural connectivity can exploit geometric locality in the outside world by employing local connections in the brain. If such regularities could be discovered by methods that evolve artificial neural networks (ANNs), then they could be similarly exploited to solve problems that would otherwise require optimizing too many dimensions to solve. This paper introduces such a method, called Hypercube-based Neuroevolution of Augmenting Topologies (HyperNEAT), which evolves a novel generative encoding called connective Compositional Pattern Producing Networks (connective CPPNs) to discover geometric regularities in the task domain. Connective CPPNs encode connectivity patterns as concepts that are independent of the number of inputs or outputs, allowing functional large-scale neural networks to be evolved. In this paper, this approach is tested in a simple visual task for which it effectively discovers the correct underlying regularity, allowing the solution to both generalize and scale without loss of function to an ANN of over eight million connections

Generating Large-Scale Neural Networks Through Discovering Geometric Regularities

Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that excite adjacent locations on the retina map to neurons that are similarly adjacent in the visual cortex. That way, neural connectivity can exploit geometric locality in the outside world by employing local connections in the brain. If such regularities could be discovered by methods that evolve artificial neural networks (ANNs), then they could be similarly exploited to solve problems that would otherwise require optimizing too many dimensions to solve. This paper introduces such a method, called Hypercube-based Neuroevolution of Augmenting Topologies (HyperNEAT), which evolves a novel generative encoding called connective Compositional Pattern Producing Networks (connective CPPNs) to discover geometric regularities in the task domain. Connective CPPNs encode connectivity patterns as concepts that are independent of the number of inputs or outputs, allowing functional large-scale neural networks to be evolved. In this paper, this approach is tested in a simple visual task for which it effectively discovers the correct underlying regularity, allowing the solution to both generalize and scale without loss of function to an ANN of over eight million connections

Generating Large-Scale Neural Networks Through Discovering Geometric Regularities

Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that excite adjacent locations on the retina map to neurons that are similarly adjacent in the visual cortex. That way, neural connectivity can exploit geometric locality in the outside world by employing local connections in the brain. If such regularities could be discovered by methods that evolve artificial neural networks (ANNs), then they could be similarly exploited to solve problems that would otherwise require optimizing too many dimensions to solve. This paper introduces such a method, called Hypercube-based Neuroevolution of Augmenting Topologies (HyperNEAT), which evolves a novel generative encoding called connective Compositional Pattern Producing Networks (connective CPPNs) to discover geometric regularities in the task domain. Connective CPPNs encode connectivity patterns as concepts that are independent of the number of inputs or outputs, allowing functional large-scale neural networks to be evolved. In this paper, this approach is tested in a simple visual task for which it effectively discovers the correct underlying regularity, allowing the solution to both generalize and scale without loss of function to an ANN of over eight million connections. Copyright 2007 ACM