It dynamically adjusts resolution by increasing or decreasing prime numbers as "resolution knobs" — allowing it to handle discontinuities, sharp valleys, and chaotic landscapes better than naive grid search.

The repo includes Python and PyTorch-compatible versions, benchmarks against grid search, and a research paper.

Would love feedback from optimization, ML, or numerical analysis folks. Curious if anyone sees potential applications or improvements.

GitHub: https://github.com/sethuiyer/DAPS Paper: https://github.com/sethuiyer/DAPS/raw/main/paper/daps_paper....