United States

Reinforcement learning is a powerful technique that can be used to learn incredibly complex behaviors, from self driving cars, airplanes, robots and other autonomous machines of varying complexity. It can also be used to solve challenging logistics and time series problems that can often be intractable in any other framework. It has a very flexible theoretical framework that can be applied to various environments, and many open source frameworks are now of sufficient maturity and robustness to make the technology readily accessible. We will discuss applications using frameworks such as TensorFlow, PyTorch, and OpenAI, along with the parallel framework Ray, which allows for large scale models to be run on HPC resources. Join us for a fascinating discussion of some of the most exciting AI technology being studied!

NAML 2021

Reinforcement Learning: Frameworks and Applications

reinforcement learning: frameworks and applications

### Looking for Cogsci 2023? Please [click here](https://underline.io/events/405/reception) to switch to 2023 edition.


**Dear Colleagues,**

Welcome to the 43rd Annual Conference of the Cognitive Science Society! 

This year’s conference brings together the latest research from all Cognitive Science and also highlights this year’s theme **Comparative Cognition: Animal Minds.** 

The program features four plenary speakers: Friederike Range (University of Veterinary Medicine, Vienna), Onur Güntürkün (Ruhr University Bochum), Julia Fischer (University of Göttingen), and Erich Jarvis (The Rockefeller University). The keynotes and invited symposia showcase the broad spectrum of ideas that encompass the conference theme of comparative cognition. 

Further, the program includes the Rumelhart Prize keynote presentation by Susan Goldin-Meadow (University of Chicago), and symposia to celebrate the winner of the Elman Prize: Wei Ji Ma (New York University), the Heineken Award winner Robert Zatorre (McGill University), and the Robert J. Glushko Dissertation Prizes session.

The program committee for CogSci 2021 received 1,025 submissions, including 710 full papers, 275 member abstracts, 8 publication-based talks, as well as 15 proposals for symposia, and 17 for workshops and tutorials. After a rigorous review process, the committee selected 152 papers for oral presentation and inclusion in the conference proceedings (14.8%), 332 papers for poster presentation and inclusion in the proceedings (32.4%), and 175 papers for poster presentation with inclusion of abstracts in the proceedings (17.1%) We also selected 275 submitted member abstracts. In addition, we accepted 6 publication-based talks, 12 symposia, and 9 workshops and tutorials to make for an exciting and inclusive program.

We hope that you enjoy the conference this year!<br><br>

**Your Program Chairs,**
![](https://assets.underline.io/uploads/markdown_image/1/image/99984908caba5e6453e5fc5ba34f3507.jpg)

**Learn more about the Vienna Cognitive Science Hub at the University of Vienna, hosts of CogSci 2021**

<iframe width="560" height="315" src="https://www.youtube.com/embed/464h1m3iU68" title="YouTube video player" frameborder="0" allow="accelerometer; autoplay; clipboard-write; encrypted-media; gyroscope; picture-in-picture" allowfullscreen></iframe>

To review the proceedings for the conference or review the searchable program, please visit the [website](https://cognitivesciencesociety.org/program/).


CogSci 2021

The Cognitive Science Society brings together researchers from around the world who hold a common goal: understanding the nature of the human mind. The mission of the Society is to promote Cognitive Science as a discipline, and to foster scientific interchange among researchers in various areas of study, including Artificial Intelligence, Linguistics, Anthropology, Psychology, Neuroscience, Philosophy, and Education. The Society is a non-profit professional organization and its activities include sponsoring an annual conference and publishing the journals Cognitive Science and TopiCS.

technical paper

Naval Information Warfare Center Pacific is partnering with AFCEA San Diego chapter to host the workshop.

The NAML workshop is an opportunity for researchers from Navy research and development centers and our partner organizations to exchange technical ideas and to come together as a team.

The goals of NAML are:

* To spread awareness of current machine learning research relevant to Naval applications

* To connect machine learning researchers with experts in military requirements

* To build and strengthen collaborations within the defense research community

**Watch this video to hear about the AFCEA purpose.**

<iframe width=580 height=700 frameborder="0" scrolling="no" src="https://screencast-o-matic.com/player/creleVVcvRh?v=6&ff=1&title=0&controls=1" allowfullscreen="true"></iframe>

Please log in to explore this event. You need to log in with the email address you registered with. Access credentials have been sent to your email. 

Please be sure to check your spam and other email folders if you do not see an email confirmation right away.

Please log in to explore this event.

Registration for this workshop has now closed. We appreciate your interest and hope to welcome you at a future event. If you’d like to hear about similar upcoming events, please check our website or join our mailing list.

Registration for this workshop has now closed.

The annual workshop on Naval Applications of Machine Learning is an opportunity for researchers from Navy research and development centers and our partner organizations to exchange technical ideas and to come together as a team. The goals of NAML are to spread awareness of current machine learning research relevant to Naval applications, to connect machine learning researchers with experts in military requirements and to build and strengthen collaborations within the defense research community.


In our work, we apply subgraph matching methods for the purpose of adversarial activity detection in large transaction graphs. By modeling adversarial activity as a threat template in graph format, we seek matching subgraphs in the world graph which may be indicative of other potential threat instances. We show results on several synthetic transaction graphs created for the DARPA-MAA program.

Subgraph Isomorphisms for Security Applications

The deep extension of the restricted Boltzmann machine (RBM), known as the deep Boltzmann machine (DBM), is an expressive family of machine learning models which can serve as compact representations of complex probability distributions. 
However, jointly training DBMs in the unsupervised setting has proven to be a formidable task. A recent technique we have proposed, called mode-assisted training, has shown great success in improving the unsupervised training of RBMs. Here, we show that the performance gains of the mode-assisted training are even more dramatic for DBMs. In fact, DBMs jointly trained with the mode-assisted algorithm can represent the same data set with orders of magnitude lower number of total parameters compared to state-of-the-art training procedures and even with respect to RBMs, provided a fan-in network topology is also introduced. This substantial saving in number of parameters makes this training method very appealing also for hardware implementations.

Mode-Assisted Joint Training of Deep Boltzmann Machines

The machine “awareness” of individual entities in massive swarms is a challenge for most conventional approaches, as is the fundamental control of all entities to form these swarms. Such issues can be addressed through alternate mathematical approaches that use self-organizing topologies. One such topological approach
has been used by one author to model 20,000 entities and has shown effective control and awareness for individuals with both limited processing power and bandwidth. The control and awareness result from using an approach to information frequently used in nature - stigmergy, i.e., sparse data which is information-dense, that includes lightweight communications between all nodes allowing
them to self-organize into a MANET. In an earlier paper, one of the authors used a topological structure based upon deterministic chaos, specifically an adaptive fractal. By constraining the entities to “believe” that they exist only within the boundaries of an adaptive fractal forces their topological layout to map to topological clusters. The
invariant yet transformable features allow each node to compute the IFS (Iterative Function System) to effectively “know” the relative positions of all the other entities, and form adaptive, self-healing swarm clusters. In this paper, an in-depth mathematical description of this algorithmic topology is given, which computationally is of O(n).

The Mathematics Behind Massive Swarm Self-Awareness

Acoustic source localization is a long-standing and generically challenging problem in structural acoustics (Worden et al., 2001). Localizability depends on the frequency content of the driving force and the uncertainty in the position of the source, among other factors. Naval applications, such as predictive maintenance for dozens of machines attached to a single hull, require a limited number of sensors to detect a large variety of signals. 


Smart, sparse sensor placement on a 2D plate performs better than random placements, and is fast and automatic


Active learning in semi-supervised classification seeks to select points from the pool of unlabeled data to label that will in turn help to improve the underlying classifier's accuracy. Such potential for classifier improvement is quantified in a real-valued {\it acquisition function}. We present a ``model-change'' acquisition function for batch active learning in graph-based semi-supervised learning (SSL) for multiclass classification.

Multiclass Active Learning for Graph-Based Semi-Supervised Learning

Running machine learning analytics over geographically distributed datasets is a rapidly arising problem in the world of data management policies ensuring privacy and data security. Visualizing high dimensional data using tools such as t-distributed Stochastic Neighbor Embedding (tSNE) and Uniform Manifold Approximation and Projection (UMAP) became common practice for data scientists. Both tools scale poorly in time and memory.
While recent optimizations showed successful handling of 10,000 data points, scaling beyond million points is still challenging. We introduce a novel framework: Sketch and Scale (SnS). 
It leverages a Count Sketch data structure to compress the data on the edge nodes, aggregates the reduced size sketches on the master node, and runs vanilla tSNE or UMAP on the summary, representing the densest areas, extracted from the aggregated sketch. 


TSNE & UMAP: Sketch & Scale

The headline successes of reinforcement learning on video games like StarCraft and DOTA 2 beg questions about the future role of the technology in the Department of Defense. Military simulations seemingly have much in common with video games, and the lack of a strong human behavior model is arguably a limiting factor for their use in the current environment. Training exercises require that opposing forces and adjoining allied forces act intelligently, and human pucksters with appropriate backgrounds and the funding to pay for them is not always forthcoming. The scope of analytical simulations must currently be limited due to the lack of current behavior models that react flexibly and appropriately over a wide range of circumstances. And more aggressive use cases for simulation in operational decision support might become practical with better AI to serve as a sparring partner. It is this last use case that we focus on here.

AI can potentially provide operational decision support by being a competent opponent of the human planner in simulation. The human planner would control his own forces according to his proposed plan, and the AI would do its best to defeat the plan. The planner could then choose to alter the plan and fight the AI again until he is satisfied. But is it actually practical to develop strong players using reinforcement learning?

Previously, it has been shown that reinforcement learning is capable of learning optimal attacking behavior in simple ground combat scenarios [Boron, J and Darken, C. "Developing Combat Behavior through Reinforcement Learning in Wargames and Simulations", IEEE Conference on Games (CoG) 2020]. The primary examples studied were quite small (e.g. three units attacking two on a featureless plain, with all units being the same type, defenders stationary), but the Proximal Policy Optimization algorithm was able to learn provably optimal attacking behavior, and even find qualitatively different optimal solutions for the cases of an urgent attack (highly discounted rewards) and a more cautious one (less discounting). Still, this scenario is far short of the complexity that would be required for operational use.

In the proposed presentation, we will describe our ongoing and planned efforts to investigate the ability of reinforcement learning to learn strong attacking behavior in more complex scenarios, i.e. with more units of multiple types maneuvering through heterogeneous terrain, and with an actively maneuvering opponent. Our new training simulation for the AI, while still relatively simple, supports four different unit types and five different types of terrain. Maps are hexagonal grids of any size and the number of units per side is arbitrary. The simulation supports an AI Gym standard interface and is typically trained using the Stable Baselines 3 suite of PyTorch-based reinforcement learning algorithms.

The new training simulation represents the input features of the neural network in an image like manner, permitting the use of convolutional neural networks (CNNs). The spatially invariant nature of CNN kernels allows trained policies to learn optimal attacking behaviors against a retreating adversarial force, regardless of where the units are initially placed in the simulation. This feature promotes a more dynamically trained agent and increases the likelihood of achieving optimal behaviors in highly complex scenarios.

Reinforcement Learning for Tactical Decision AI

Mindful™ software provides human-understandable competency statements in the DARPA Competency Aware Machine Learning program. MindfuL™ software models environments across ML applications compactly with hierarchical Dirichlet processes allowing it to provide environment based-competency assessments through deep learning and deep explainer models as well as competency of similar historical data.

Mindful™: Competency Aware Machine Learning

We present an ongoing investigation into the learning of the input to state relationship of a dynamical system by using nonlinear Adaptive Control Theory combined with Spiking Neural Networks (SNNs). In particular, we use a specific type of SNN named Efficient Balanced Networks (EBNs) initially proposed by Deneve, Machens et. al. that provides desirable properties such as distributed information representation, low firing rates, and high encoding precision. Neuronal spikes are fired based on a threshold that is generated by optimizing over a global cost function that penalizes output tracking error, spike frequency, and spike distribution across neurons. Our objective is to implement these algorithms on neuromorphic hardware and apply them to complex robotic control applications. Applications include online system identification, generation of oracles for policy training, adaptive model predictive control, and model-based reinforcement learning. This presentation is effectively a status update on these investigations showing results obtained to date.

Learning Dynamical Systems with Neuromorphic Efficiently Balanced Spiking Neural Networks

When learning to perform motor tasks in a simulated environment, neural networks must be allowed to explore their action space to discover new potentially viable solutions. However, in an online learning scenario with physical hardware, this exploration must be constrained by relevant safety considerations in order to avoid damage to the agent’s hardware and environment. Our aim is to address this problem by training a neural network, which we will refer to as the “safety network,” to estimate the region of attraction (ROA) of a dynamical system controlled by an “acting network.” This safety network can thereby be used to quantify the relative safety of control actions proposed by the acting network and prevent the selection of damaging actions. Here we present our preliminary development of the safety network by training a non-spiking neural network to represent the ROA of several dynamical system benchmark problems. The training of this network is predicated upon both Lyapunov theory and neural solutions to partial differential equations (PDEs). By learning to approximate the viscosity solution to a specially chosen PDE, the safety network learns to approximate a Lyapunov function whose unity level set is the boundary of the ROA. We train our safety network to solve these PDEs in a semi-supervised manner, utilizing a loss function that penalizes disagreement with the PDE’s initial and boundary conditions, as well as non-zero residual and variational terms. In future work, we intend to extend this technique to spiking neural networks to be run on neuromorphic hardware for real-time online learning.

Premium content

Downloads

Next from NAML 2021

Subgraph Isomorphisms for Security Applications

Similar lecture

Passive Versus Active: Frameworks of Active Learning for Linking Humans to Machines