Introduces task-oriented randomization for black-box stability with theoretical guarantees, stability-exploration trade-off analysis, and extension to top-k ranking motivated by LLMs.
arXiv preprint arXiv:2506.02257 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Stabilizing black-box algorithms through task-oriented randomization
Introduces task-oriented randomization for black-box stability with theoretical guarantees, stability-exploration trade-off analysis, and extension to top-k ranking motivated by LLMs.