Lisa B. Soros

Lisa B. Soros

Auto-generated profile, based on publicly available information

Lisa B. Soros

Nof1, New York, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 April 2023 in IEEE Transactions on Games
Verified
Journal Article
Closed access
RGRoberto Gallotta
Roberto Gallotta
KAKai Arulkumaran
Kai Arulkumaran
LSL. B. Soros
L. B. Soros
In mixed-initiative co-creation tasks, wherein a human and a machine jointly create items, it is important to provide multiple relevant suggestions to the designer. Quality-diversity algorithms are commonly used for this purpose, as they can provide diverse suggestions that represent salient areas of the solution space, showcasing designs with high fitness and wide variety. Because generated suggestions drive the search process, it is important that they provide inspiration, but also stay aligned with the designer's intentions. Additionally, often many interactions with the system are required before the designer is content with a solution. In this work, we tackle these challenges with an interactive constrained MAP-Elites system that leverages emitters to learn the preferences of the designer and then use them in automated steps. By learning preferences, the generated designs remain aligned with the designer's intent, and by applying automatic steps, we generate more solutions per user interaction, giving a larger number of choices to the designer and thereby speeding up the search. We propose a general framework for preference-learning emitters (PLEs) and apply it to a procedural content generation task in the video game Space Engineers. We built an interactive application for our algorithm and performed a user study with players.

1 January 2022
Verified
Conference Paper
Open access
PDF file
AFAndrea Ferigo
Andrea Ferigo
LSL. B. Soros
L. B. Soros
Eric MedvetEric Medvet
Eric Medvet
Giovanni IaccaGiovanni Iacca
Giovanni Iacca
The concept of evolvability, that is the capacity to produce heritable and adaptive phenotypic variation, is crucial in the current understanding of evolution. However, while its meaning is intuitive, there is no consensus on how to quantitatively measure it. As a consequence, in evolutionary robotics, it is hard to evaluate the interplay between evolvability and fitness and its dependency on key factors like the evolutionary algorithm (EA) or the representation of the individuals. Here, we propose to use MAP-Elites, a well-established Quality Diversity EA, as a support structure for measuring evolvability and for highlighting its interplay with fitness. We map the solutions generated during the evolutionary process to a MAP-Elites-like grid and then visualize their fitness and evolvability as maps. This procedures does not affect the EA execution and can hence be applied to any EA: it only requires to have two descriptors for the solutions that can be used to meaningfully characterize them. We apply this general methodology to the case of Voxel-based Soft Robots (VSR), a kind of modular robots with a body composed of uniform elements whose volume is individually varied by the robot brain. Namely, we optimize the robots for the task of locomotion using evolutionary computation. We consider four representations, i.e., ways of transforming a genotype into a robot, two for the brain only and two for both body and brain of the VSR, and two EAs (MAP-Elites and a simple evolutionary strategy) and examine the evolvability and fitness maps. The experiments suggest that our methodology permits us to discover interesting patterns in the maps: fitness maps appear to depend more on the representation of the solution, whereas evolvability maps appear to depend more on the EA. As an aside, we find that MAP-Elites is particularly effective in the simultaneous evolution of the body and the brain of Voxel-based Soft Robots.

14 February 2022 in IEEE Transactions on Games
Verified
Journal Article
Closed access
ADAaron Dharna
Aaron Dharna
AHAmy K. Hoover
Amy K. Hoover
JTJulian Togelius
Julian Togelius
LSLisa B. Soros
Lisa B. Soros
PINSKY is a system for open-ended learning through neuroevolution in game-based domains. It builds on the Paired Open-Ended Trailblazer (POET) system, which originally explored learning and environment generation for bipedal walkers, and adapts it to games in the General Video Game AI (GVGAI) system. Previous work showed that by co-evolving levels and neural network policies, levels could be found for which successful policies could not be created via optimization alone. Studied in the realm of Artificial Life as a potentially open-ended alternative to gradient-based fitness, minimal criteria (MC)-based selection helps foster diversity in evolutionary populations. The main question addressed by this paper is how the open-ended learning actually works, focusing in particular on the role of transfer of policies from one evolutionary branch ("species") to another. We analyze the dynamics of the system through creating phylogenetic trees, analyzing evolutionary trajectories of policies, and temporally breaking down transfers according to species type. Furthermore, we analyze the impact of the minimal criterion on generated level diversity and inter-species transfer. The most insightful finding is that inter-species transfer, while rare, is crucial to the system's success.

1 October 2020 in Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment
Verified
Journal Article
Open access
PDF file
MCMegan Charity
Megan Charity
DRDipika Rajesh
Dipika Rajesh
RORachel Ombok
Rachel Ombok
LSL. B. Soros
L. B. Soros
This paper proposes environment design in the life simulation game The Sims as a novel platform and challenge for testing divergent search algorithms. In this domain, which includes a minimal viability criterion, the goal is to furnish a house with objects that satisfy the physical needs of a simulated agent. Importantly, the large number of objects available to the player (whether human or automated) affords a wide variety of solutions to the underlying design problem. Empirical studies in a novel open source simulator called SimSim investigate the ability of novelty-based evolutionary algorithms to effectively generate viable environment designs.

10 July 2026
Verified
Conference Paper
Open access
MSMatthew Siper
Matthew Siper
AKAhmed Khalifa
Ahmed Khalifa
LSLisa Soros
Lisa Soros
MNMuhammad Nasir
Muhammad Nasir
JAJuyan Azhang
Juyan Azhang
JTJulian Togelius
Julian Togelius

1 January 2021 in Artificial Life
Verified
Journal Article
Closed access
JBJoshua Bongard
Joshua Bongard
JLJuniper Lovato
Juniper Lovato
LHLaurent Hébert-Dufresne
Laurent Hébert-Dufresne
RDRadhakrishna Dasari
Radhakrishna Dasari
LSLisa Soros
Lisa Soros
This special issue highlights key selections from the 2020 Conference on Artificial Life, which is the primary international meeting organized yearly by the International Society for Artificial Life (www.alife.org). The conference themes broadly address the synthesis and simulation of living systems, welcoming scientific research that either deepens our understanding of life as we know it or broadens our conception of life as it could be (Langton, 1989).The 2020 conference, hosted by the University of Vermont and the Vermont Complex Systems Center, was originally intended to be held in Montréal, Québec, Canada. However, the global COVID-19 pandemic forced this event, like many others, to be held online. In truth, this challenge afforded a unique opportunity to hold a truly global conference, with 390 registered attendees from around the world.Of 183 submissions, 75 articles (41%) were accepted for full presentations at the conference and published in the proceedings (Bongard et al., 2020). An additional 11 submissions were presented as lighting talks and 24 as posters and were also included in the proceedings.Reflecting the highly interdisciplinary nature of the field, the topics covered in this special issue include evolutionary dynamics, artificial chemistry, agent-based modelling, game theory, genetic programming, neuroevolution, embodiment, and complex systems research: Ghouri, Barnes, and Lewis present a minimal version of the classic river crossing task, isolating the core task of building a bridge in a grid world for the purpose of increasing explainability of the original problem. Results with the minimal environment are consistent with results from the original version, highlighting the utility of the minimal environment for experiments on explainable evolutionary intelligence.Grove, Timbrell, Jolley, Polack, and Borg demonstrate that the mathematical color of noise in an environment has a significant impact on dynamics in evolving populations. In particular, their results call into question whether commonly employed Gaussian or white noise models should be the default.Lexicase selection in genetic programming is an alternative to traditional parent selection. Helmuth and Spector conduct an extensive benchmarking of a variant called down-sampled lexicase selection, showing that it outperforms standard selection, and investigate hypotheses about why it performs so well.Howison, Hugues, and Iida explore how morphology can be used to control and program interactions with the environment in their study of V-shaped falling papers. They also show how Bayesian optimization can be used to design functional constructs of nonliving materials in the real world.Hudcová and Mikolov provide a framework for classifying cellular automata complexity based on transients, which are parts of automata trajectories observed before entering into a loop. In particular, the presented classification is based on the asymptotic growth of the average transient length with increasing grid size. This framework is intended to aid the identification of interesting phenomena in evolving systems.Krellner and Han study the evolution of cooperation among agents playing a donation game. In particular, this work introduces a novel approach to information sharing to solve the problem of private information.Kruszewski and Mikolov develop an artificial chemistry based on combinatory logic, showing that complex structures emerge over time from a simple dynamical system. This work explicitly addresses the origins of open-ended evolution, which is a longstanding pursuit for the field of Artificial Life (and science in general).Miller re-envisions the artificial neuron model to better reflect natural evolution and development processes. Using this model, evolved programs can construct artificial neural networks that can be broken down into smaller networks that each solve distinct tasks.The 2020 conference theme “New frontiers in AI: What can ALife offer AI?” asked the community to consider how the unbridled and sometimes unconventional creativity of Artificial Life research might inspire innovation in mainstream Artificial Intelligence. In fact, the two fields share a deeply intertwined history, as some of the greatest pioneers in early Artificial Intelligence work also (or first) pursued what would now be called Artificial Life. As an example, Shannon (1940), often referred to as the father of information theory, wrote his doctoral dissertation An Algebra for Theoretical Genetics 16 years before he helped found the field of Artificial Intelligence at the Dartmouth Conference.At the same time, the Artificial Life community continues in its own myriad pursuits, recapitulating and reinventing nature often with computational tools, as evidenced by the works contained in this volume. Evolution on Earth gave rise to natural intelligence, and so evolution in silico (a mainstay of Artificial Life research) similarly bears the potential for creating Artificial Intelligence open-endedly; such is the foundational assumption of research on open-ended evolution. What ALife can offer AI is, among other things, an invitation to question what about life and intelligence might transcend substrates and, in doing so, to discover how what is might inspire what will be.