Levi Lelis

Orcid: 0000-0003-3560-9345

Affiliations:
  • University of Alberta, Canada


According to our database1, Levi Lelis authored at least 74 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Synthesizing Libraries of Programs with Auxiliary Functions.
Trans. Mach. Learn. Res., 2024

Unveiling Options with Neural Decomposition.
CoRR, 2024

Curriculum Generation for Learning Guiding Functions in State-Space Search Algorithms.
Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Searching for Programmatic Policies in Semantic Spaces.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Reclaiming the Source of Programmatic Policies: Programmatic versus Latent Spaces.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Unveiling Options with Neural Network Decomposition.
Proceedings of the Twelfth International Conference on Learning Representations, 2024

Program Synthesis with Best-First Bottom-Up Search (Abstract Reprint).
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Program Synthesis with Best-First Bottom-Up Search.
J. Artif. Intell. Res., 2023

Assessing the Interpretability of Programmatic Policies with Large Language Models.
CoRR, 2023

Synthesizing Programmatic Policies with Actor-Critic Algorithms and ReLU Networks.
CoRR, 2023

Levin Tree Search with Context Models.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Choosing Well Your Opponents: How to Guide the Synthesis of Programmatic Strategies.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Can You Improve My Code? Optimizing Programs with Local Search.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Show Me the Way! Bilevel Search for Synthesizing Programmatic Strategies.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Asymmetric Action Abstractions for Planning in Real-Time Strategy Games.
J. Artif. Intell. Res., 2022

Portability and Explainability of Synthesized Formula-based Heuristics.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Learning Curricula for Humans: An Empirical Study with Puzzles from The Witness.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Controlling Perceived Emotion in Symbolic Music Generation with Monte Carlo Tree Search.
Proceedings of the Eighteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2022

What Can We Learn Even from the Weakest? Learning Sketches for Programmatic Strategies.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Teaching People by Justifying Tree Search Decisions: An Empirical Study in Curling.
J. Artif. Intell. Res., 2021

Fast Synthesis of Algebraic Heuristic Functions for Video-game Pathfinding.
Proceedings of the 2021 IEEE Conference on Games (CoG), 2021

Birds in Boots: Learning to Play Angry Birds with Policy-Guided Search.
Proceedings of the Seventeenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021

Policy-Guided Heuristic Search with Guarantees.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Improving the Performance-Compatibility Tradeoff with Personalized Objective Functions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Programmatic Strategies for Real-Time Strategy Games.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Personalization in Human-AI Teams: Improving the Compatibility-Accuracy Tradeoff.
CoRR, 2020

Marginal Utility for Planning in Continuous or Large Discrete Action Spaces.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Planning Algorithms for Zero-Sum Games with Exponential Action Spaces: A Unifying Perspective.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Enhancing resource availability in vehicular fog computing through smart inter-domain handover.
Proceedings of the IEEE Global Communications Conference, 2020

Computer-Generated Music for Tabletop Role-Playing Games.
Proceedings of the Sixteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2020

2019
Strategy Generation for Multiunit Real-Time Games via Voting.
IEEE Trans. Games, 2019

Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees.
CoRR, 2019

Iterative Budgeted Exponential Search.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Procedural Generation of Initial States of Sokoban.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Be Inaccurate but Don't Be Indecisive: How Error Distribution Can Affect User Experience.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

Evolving Action Abstractions for Real-Time Planning in Extensive-Form Games.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Procedural Generation of Game Maps With Human-in-the-Loop Algorithms.
IEEE Trans. Games, 2018

The First microRTS Artificial Intelligence Competition.
AI Mag., 2018

Single-Agent Policy Tree Search With Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Action Abstractions for Combinatorial Multi-Armed Bandit Tree Search.
Proceedings of the Fourteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2018

Nested-Greedy Search for Adversarial Real-Time Games.
Proceedings of the Fourteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2018

Asymmetric Action Abstractions for Multi-Unit Control in Adversarial Real-Time Games.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Stratified Strategy Selection for Unit Control in Real-Time Strategy Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Creating Complementary Pattern Databases.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Understanding mario: an evaluation of design metrics for platformers.
Proceedings of the International Conference on the Foundations of Digital Games, 2017

Bardo: Emotion-Based Music Recommendation for Tabletop Role-Playing Games.
Proceedings of the Thirteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-17), 2017

2016
Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces.
Artif. Intell., 2016

Searching with a Corrupted Heuristic.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Heuristic Subset Selection in Classical Planning.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Learning to Speed Up Evolutionary Content Generation in Physics-Based Puzzle Games.
Proceedings of the 28th IEEE International Conference on Tools with Artificial Intelligence, 2016

A Computational Model Based on Symmetry for Generating Visually Pleasing Maps of Platform Games.
Proceedings of the Twelfth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2016

What's Hot in Heuristic Search.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Feature Selection as State-Space Search: An Empirical Study in Clustering Problems.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Caching in Context-Minimal OR Spaces.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Stratified Sampling for Even Workload Partitioning Applied to IDA* and Delaunay Algorithms.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Human computation for procedural content generation in platform games.
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

Stratified sampling for even workload partitioning applied to single source shortest path algorithm.
Proceedings of 25th Annual International Conference on Computer Science and Software Engineering, 2015

An Empirical Evaluation of Evaluation Metrics of Procedurally Generated Mario Levels.
Proceedings of the Eleventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2015

2014
Predicting optimal solution cost with conditional probabilities - Predicting optimal solution cost.
Ann. Math. Artif. Intell., 2014

Estimating Search Tree Size with Duplicate Detection.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.
Proceedings of the Principles and Practice of Constraint Programming, 2014

2013
Predicting the size of IDA*'s search tree.
Artif. Intell., 2013

Active Stratified Sampling with Clustering-Based Type Systems for Predicting the Search Tree Size of Problems with Real-Valued Heuristics.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Predicting the Size of Depth-First Branch and Bound Search Trees.
Proceedings of the IJCAI 2013, 2013

Stratified tree search: a novel suboptimal heuristic search algorithm.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Are We There Yet? - Estimating Search Progress.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling (Abstract).
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Learning Heuristic Functions Faster by Using Predicted Solution Costs.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Predicting Optimal Solution Cost with Bidirectional Stratified Sampling.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Fast and Accurate Predictions of IDA*'s Performance.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Improved Prediction of IDA*'s Performance via Epsilon-Truncation.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Predicting Solution Cost with Conditional Probabilities.
Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Time Complexity of Iterative-Deepening A*: The Informativeness Pathology (Abstract).
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2009
Semi-supervised Density-Based Clustering.
Proceedings of the ICDM 2009, 2009


  Loading...