Anishalakshmi Palaparthi

Anishalakshmi Palaparthi

Auto-generated profile, based on publicly available information

Anishalakshmi Palaparthi

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

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
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.