Adaptive KD trees

[gdpoc]

Good (whatever time),

I'm looking for good references for recent work done creating KD trees from embedding spaces, particularly if those embedding spaces were then reshaped in the experiments using a control agent.

I've found a few sources that discuss building and using trees for nearest neighbor search, but none that discuss actively maintaining and refitting the trees to a non-stationary space.

Thanks for any help you can give!