David H. Lee

David H. Lee

Auto-generated profile, based on publicly available information

David H. Lee

University of Southern California, Los Angeles, United States of America

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 July 2023
Verified
Conference Paper
Open access
BTBryon Tjanaka
Bryon Tjanaka
MFMatthew C Fontaine
Matthew C Fontaine
DLDavid H Lee
David H Lee
YZYulun Zhang
Yulun Zhang
NBNivedit Reddy Balam
Nivedit Reddy Balam
SNStefanos Nikolaidis
Stefanos Nikolaidis
Recent years have seen a rise in the popularity of quality diversity (QD) optimization, a branch of optimization that seeks to find a collection of diverse, high-performing solutions to a given problem. To grow further, we believe the QD community faces two challenges: developing a framework to represent the field's growing array of algorithms, and implementing that framework in software that supports a range of researchers and practitioners. To address these challenges, we have developed pyribs, a library built on a highly modular conceptual QD framework. By replacing components in the conceptual framework, and hence in pyribs, users can compose algorithms from across the QD literature; equally important, they can identify unexplored algorithm variations. Furthermore, pyribs makes this framework simple, flexible, and accessible, with a user-friendly API supported by extensive documentation and tutorials. This paper overviews the creation of pyribs, focusing on the conceptual framework that it implements and the design principles that have guided the library's development. Pyribs is available at https://pyribs.org

7 September 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
BTBryon Tjanaka
Bryon Tjanaka
MFMatthew C. Fontaine
Matthew C. Fontaine
DLDavid H. Lee
David H. Lee
AKAniruddha Kalkar
Aniruddha Kalkar
SNStefanos Nikolaidis
Stefanos Nikolaidis
Pre-training a diverse set of neural network controllers in simulation has enabled robots to adapt online to damage in robot locomotion tasks. However, finding diverse, high-performing controllers requires expensive network training and extensive tuning of a large number of hyperparameters. On the other hand, Covariance Matrix Adaptation MAP-Annealing (CMA-MAE), an evolution strategies (ES)-based quality diversity algorithm, does not have these limitations and has achieved state-of-the-art performance on standard QD benchmarks. However, CMA-MAE cannot scale to modern neural network controllers due to its quadratic complexity. We leverage efficient approximation methods in ES to propose three new CMA-MAE variants that scale to high dimensions. Our experiments show that the variants outperform ES-based baselines in benchmark robotic locomotion tasks, while being comparable with or exceeding state-of-the-art deep reinforcement learning-based quality diversity algorithms.

12 February 2025
Verified
Conference Paper
Open access
DLDavid H. Lee
David H. Lee
APAditya Prasad
Aditya Prasad
RVRamiro Deo-Campo Vuong
Ramiro Deo-Campo Vuong
TWTianyu Wang
Tianyu Wang
EHEric Han
Eric Han
DKDavid Kempe
David Kempe
Dynamic programming (DP) is a fundamental and powerful algorithmic paradigm taught in most undergraduate (and many graduate) algorithms classes. DP problems are challenging for many computer science students because they require identifying unique problem structures and a refined understanding of recursion. In this paper, we present dpvis, a Python library that helps students understand DP through a frame-by-frame animation of dynamic programs. dpvis can easily generate animations of dynamic programs with as little as two lines of modifications compared to a standard Python implementation. For each frame, dpvis highlight the cells that have been read from and written to during an iteration. Moreover, dpvis allows users to test their understanding by prompting them with questions about the next operation performed by the algorithm. We deployed dpvis as a learning tool in an undergraduate algorithms class, and report on the results of a survey. The survey results suggest that dpvis is especially helpful for visualizing the recursive structure of DP. Although some students struggled with the installation of the tool (which has been simplified since the reported deployment), essentially all other students found the tool to be useful for understanding dynamic programs. dpvis is available at https://github.com/itsdawei/dpvis.

14 July 2024
Verified
Conference Paper
Open access
DLDavid H. Lee
David H. Lee
APAnishalakshmi Palaparthi
Anishalakshmi Palaparthi
MFMatthew C. Fontaine
Matthew C. Fontaine
BTBryon Tjanaka
Bryon Tjanaka
SNStefanos Nikolaidis
Stefanos Nikolaidis
Diversity optimization seeks to discover a set of solutions that elicit diverse features. Prior work has proposed Novelty Search (NS), which, given a current set of solutions, seeks to expand the set by finding points in areas of low density in the feature space. However, to estimate density, NS relies on a heuristic that considers the k-nearest neighbors of the search point in the feature space, which yields a weaker stability guarantee. We propose Density Descent Search (DDS), an algorithm that explores the feature space via CMA-ES on a continuous density estimate of the feature space that also provides a stronger stability guarantee. We experiment with DDS and two density estimation methods: kernel density estimation (KDE) and continuous normalizing flow (CNF). On several standard diversity optimization benchmarks, DDS outperforms NS, the recently proposed MAP-Annealing algorithm, and other state-of-the-art baselines. Additionally, we prove that DDS with KDE provides stronger stability guarantees than NS, making it more suitable for adaptive optimizers. Furthermore, we prove that NS is a special case of DDS that descends a KDE of the feature space.