SEP 4, 2026 · PREPRINT
Dimension-Adaptive Batched Lipschitz Narrowing Without Knowing the Zooming Dimension
arXiv
This is a theoretical computer science preprint presenting an algorithmic improvement without empirical validation, experimental results, or clinical application.
Insufficient InformationYasong Feng
Reported
Regret boundÕd(T^(dz+1)/(dz+2))
Batch complexityOd(log log T)
Optimal batch complexity when dz…Θd(log log T)