arXiv:2608.16947v2 Announce Type: replace-cross
Abstract: Dynamic Mixture-of-Experts Serving allocates k replica GPUs among m experts as workloads change. At each round, the online algorithm sees the...
By Ian D'Ambrosio (Nth Research Collective)
arXiv:2608. 12134v1 Announce Type: cross Abstract: We study nonnegative submodular maximization subject to a general matroid when the offline algorithm is given an arbitrary controlled value oracle.
By Vaneet Aggarwal
arXiv:2608. 01616v1 Announce Type: new Abstract: Competitive analysis is central to the study of online algorithms, but upper bounds are often highly problem-specific.
By Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla
arXiv:2609.10529v1 Announce Type: cross
Abstract: We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and...
By P. M. Aronow, Nathan Kallus, Patrick Lopatto
arXiv:2608.12134v2 Announce Type: replace-cross
Abstract: We study nonnegative submodular maximization on $n$ elements subject to a general matroid of rank $k$, when the offline algorithm is given an...
By Vaneet Aggarwal
We prove the gap-entropy conjecture for fixed-confidence best-arm identification with independent unit-variance Gaussian arms, means in $[0,1]$, and a unique optimal arm. For each suboptimal arm $i$,...