MONET represents tasks as graph nodes and uses neighbor-based crossover plus per-task mutation to transfer knowledge, matching or exceeding MAP-Elites performance on four large-scale simulation domains.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 2
method 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Lumbermark detects clusters by iteratively chopping large limbs off a mutual reachability MST, yielding partitions of user-specified sizes as a robust alternative to HDBSCAN.
SkipDisk is a disk-memory hybrid ANN search that achieves 63-85% of HNSW latency at 10-20% memory footprint via dedicated pivots for tighter lower bounds, three-level pruning, and decoupled async I/O.
citing papers explorer
-
Multi-Task Optimization over Networks of Tasks
MONET represents tasks as graph nodes and uses neighbor-based crossover plus per-task mutation to transfer knowledge, matching or exceeding MAP-Elites performance on four large-scale simulation domains.
-
Lumbermark: Resistant Clustering by Chopping Up Mutual Reachability Minimum Spanning Trees
Lumbermark detects clusters by iteratively chopping large limbs off a mutual reachability MST, yielding partitions of user-specified sizes as a robust alternative to HDBSCAN.
-
Low-Latency Out-of-Core ANN Search in High-Dimensional Space
SkipDisk is a disk-memory hybrid ANN search that achieves 63-85% of HNSW latency at 10-20% memory footprint via dedicated pivots for tighter lower bounds, three-level pruning, and decoupled async I/O.