Muhammad Nasir

Muhammad Nasir

Auto-generated profile, based on publicly available information

Muhammad Nasir

Nof1, New York, USA

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
12 April 2023
Verified
Conference Paper
Open access
GTGraham Todd
Graham Todd
SESam Earle
Sam Earle
MNMuhammad Umair Nasir
Muhammad Umair Nasir
MGMichael Cerny Green
Michael Cerny Green
JTJulian Togelius
Julian Togelius
Large Language Models (LLMs) are powerful tools, capable of leveraging their training on natural language to write stories, generate code, and answer questions. But can they generate functional video game levels? Game levels, with their complex functional constraints and spatial relationships in more than one dimension, are very different from the kinds of data an LLM typically sees during training. Datasets of game levels are also hard to come by, potentially taxing the abilities of these data-hungry models. We investigate the use of LLMs to generate levels for the game Sokoban, finding that LLMs are indeed capable of doing so, and that their performance scales dramatically with dataset size. We also perform preliminary experiments on controlling LLM level generators and discuss promising areas for future work.

14 July 2024
Verified
Conference Paper
Open access
MNMuhammad Umair Nasir
Muhammad Umair Nasir
SESam Earle
Sam Earle
JTJulian Togelius
Julian Togelius
SJSteven James
Steven James
CCChristopher Cleghorn
Christopher Cleghorn
Large language models (LLMs) have emerged as powerful tools capable of accomplishing a broad spectrum of tasks. Their abilities span numerous areas, and one area where they have made a significant impact is in the domain of code generation. Here, we propose using the coding abilities of LLMs to introduce meaningful variations to code defining neural networks. Meanwhile, Quality-Diversity (QD) algorithms are known to discover diverse and robust solutions. By merging the code-generating abilities of LLMs with the diversity and robustness of QD solutions, we introduce LLMatic, a Neural Architecture Search (NAS) algorithm. While LLMs struggle to conduct NAS directly through prompts, LLMatic uses a procedural approach, leveraging QD for prompts and network architecture to create diverse and high-performing networks. We test LLMatic on the CIFAR-10 and NAS-bench-201 benchmarks, demonstrating that it can produce competitive networks while evaluating just 2, 000 candidates, even without prior knowledge of the benchmark domain or exposure to any previous top-performing models for the benchmark. The open-sourced code is available at https://github.com/umair-nasir14/LLMatic.

15 July 2023
Verified
Conference Paper
Open access
MNMuhammad Nasir
Muhammad Nasir
MBMichael Beukman
Michael Beukman
SJSteven James
Steven James
CCChristopher Cleghorn
Christopher Cleghorn
We tackle the problem of open-ended learning by introducing a method that simultaneously evolves agents while also evolving increasingly challenging environments. Unlike previous open-ended approaches that optimize agents using a fixed neural network topology, we hypothesize that generalization can be improved by allowing agents' controllers to become more complex as they encounter more difficult environments. Our method, Augmentative Topology EPOET (ATEP), extends the Enhanced Paired Open-Ended Trailblazer (EPOET) algorithm by allowing agents to evolve their own neural network structures over time, adding complexity and capacity as necessary. Our empirical results demonstrate that ATEP produces general agents capable of solving more environments than fixed-topology baselines. We also investigate mechanisms for transferring agents between environments and find that a species-based approach further improves the performance and generalization of agents.

21 July 2023 in IEEE Transactions on Games
Verified
Journal Article
Closed access
MBMichael Beukman
Michael Beukman
MFManuel Fokam
Manuel Fokam
MKMarcel Kruger
Marcel Kruger
GAGuy Axelrod
Guy Axelrod
MNMuhammad Nasir
Muhammad Nasir
SJSteven James
Steven James
Procedural content generation (PCG) is a growing field, with numerous applications in the video game industry and great potential to help create better games at a fraction of the cost of manual creation. However, much of the work in PCG is focused on generating relatively straightforward levels in simple games, as it is challenging to design an optimisable objective function for complex settings. This limits the applicability of PCG to more complex and modern titles, hindering its adoption in industry. Our work aims to address this limitation by introducing a compositional level generation method that recursively composes simple low-level generators to construct large and complex creations. This approach allows for easily-optimisable objectives and the ability to design a complex structure in an interpretable way by referencing lower-level components. We empirically demonstrate that our method outperforms a non-compositional baseline by more accurately satisfying a designer's functional requirements in several tasks. Finally, we provide a qualitative showcase (in Minecraft) illustrating the large and complex, but still coherent, structures that were generated using simple base generators.

13 July 2026
Verified
Conference Paper
Open access
MSMatthew Siper
Matthew Siper
MNMuhammad Nasir
Muhammad Nasir
AKAhmed Khalifa
Ahmed Khalifa
LSLisa Soros
Lisa Soros
JAJuyan Azhang
Juyan Azhang
JTJulian Togelius
Julian Togelius
Genetic Programming yields highly interpretable programs, but naïve syntactic mutations can induce large and unpredictable behavioral shifts. Still, evolution shines when small changes indeed result in incremental movements on smooth fitness landscapes. We exploit this potential in the context of automated financial trading, approaching the problem of locality by treating it as an operator design problem. To this end, we learn a continuous program space where latent distance has behaviorally semantic meaning, then design mutation operators that exploit this structure without changing the evolutionary optimizer. Under identical (μ + λ) evolution strategies and fixed evaluation budgets across five tradable assets, the learned mutation operator discovers strong strategies using an order of magnitude fewer evaluations and achieves the most profitable out-of-sample Sharpe ratio. Although isotropic mutation occasionally attains higher peak performance, geometry-compiled mutation yields faster, more reliable progress, demonstrating that semantically-aligned mutation can substantially improve search efficiency without modifying the underlying evolutionary algorithm.

10 July 2026
Verified
Conference Paper
Open access
MNMuhammad Nasir
Muhammad Nasir
YLYuchen Li
Yuchen Li
SJSteven James
Steven James
JTJulian Togelius
Julian Togelius
We present Mortar, a system for autonomously evolving game mechanics for automatic game design. Game mechanics define the rules and interactions that govern gameplay, and designing them manually is a time-consuming and expert-driven process. Mortar combines a quality-diversity algorithm with a large language model to explore a diverse set of mechanics, which are evaluated by synthesising complete games that incorporate both evolved mechanics and those drawn from an archive. The mechanics are evaluated by composing complete games through a tree search procedure, where the resulting games are evaluated by their ability to preserve a skill-based ordering over players—that is, whether stronger players consistently outperform weaker ones. We assess the mechanics based on their contribution towards the skill-based ordering score in the game. We demonstrate that Mortar produces games that appear diverse and playable, and mechanics that contribute more towards the skill-based ordering score in the game. We perform ablation studies to assess the role of each system component and a user study to evaluate the games based on human feedback.