Completed Computing & AI Education & Skills

Learning from Each Other: Neural Networks and Finite Automata

In plain English

AI plain-English summary

Two communities of machine-learning researchers barely talk to each other, and this project aims to force a conversation between them. The problem is a deep divide in artificial intelligence. On one side are neural networks—the flexible, powerful systems behind tools like ChatGPT. On the other are finite automata—rigid, logical machines that are easy to interpret but hard to build. Each has strengths the other lacks, but researchers in each field rarely collaborate. This project will create a network of scientists to bridge that gap, both by getting humans to share ideas and by making the algorithms themselves learn from each other. If it succeeds, the payoff is twofold. First, finite automata could help explain how neural networks reason—making AI more transparent and trustworthy, which matters for medical diagnostics, legal decisions, and safety-critical systems. Second, neural networks could speed up the slowest step in learning finite automata, a task with industrial applications in software verification and hardware design. This is fundamental science with a clear practical edge: better, more explainable AI that people can actually rely on.

View original technical description
The academic objective of this project is to explore how two well-known machine learning paradigms - finite automata and neural networks - can improve, explain and learn from each other. These two types of machine learning serve very different purposes and are developed in almost non-interacting communities. At the human level, this project aims to develop a network of researchers who can create flows of knowledge between these communities. This network will also investigate how these two types of machine learning can learn from each other at the algorithmic level. The title "Learning from each other" thus refers both to humans and algorithms. This project will initially consist of two tracks. The first will use finite automata to improve our understanding of neural networks. AI should be explainable, and this means understanding how neural networks solve complex problems by decomposing them into smaller ones whose solution is easier to interpret. Finite automata provide the perfect set of problems to investigate this question as they can be combined in logical ways to form arbitrarily complex problems. By systematically comparing how neural networks solve individual problems with how they solve combinations of problems we should uncover mechanisms of compositional reasoning in neural networks. The second track will use neural networks to improve the state-of-the-art algorithm for learning finite automata. This task has many industrial applications but faces a computational bottleneck consisting of generating certain counterexamples. We will train specialist neural networks called Large Language Models to generate counterexamples to solve this problem.

View the original record at the funder ↗

Researchers

Alexandra Silva (EPMC Awardee)

Related Research

Grants with similar aims, by meaning.

Verifying AI systems by extracting automata via learning
Natural Language Parsing using Cell Assemblies: computational linguistics with attractor nets
How do biological neural networks learn to predict their environment?
A New Generation of Trainable Machines for Multi-Task Learning
General-Purpose Learning Algorithms for Spiking Neural Networks

Original classification

Networking Grants

Plain English summaries and category classifications on this site are generated by AI and may not perfectly reflect the original research.