arxiv
PublishedSeptember 30, 2026 at 4:00 AM
—neutral
Local Search with Correlated Randomness
Publisher summary· verbatim
arXiv:2607.17469v2 Announce Type: replace-cross Abstract: How much does an algorithm's running-time distribution under independent randomness reveal about its behavior when independence is no longer guaranteed? We study sources satisfying $\nu[w]\le DP[w]^s$ for every finite prefix $w$, where $P$ is
Stay posted· Newsletter
A 5-min weekly brief — top movers, price watch, story of the week.
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivPredictive Self-Supervised Learning Provably Identifies Stochastic Signals under Nuisance3harxivPixel-Level Transformers in Remote Sensing: A Canopy Height Case Study3harxivExplore, Execute, Evolve: A Skill Acquisition and Reuse Loop for Embodied Agents3harxivBoosting Adversarial Robustness and Generalization with Dictionary Structure3hThe Bubble Brief
WEEKLYRead AI insights every Tuesday — top movers, new releases, story of the week.
Originally published on arxiv ↗