Author

Ian D'Ambrosio

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

#machine learning Preprint Aug 2026

A Constant-Competitive Algorithm for Dynamic Mixture-of-Experts Serving

It is proved that the randomized primal competitive ratio is in fact Theta(1) for arbitrary numbers of experts and the upper bound reduces reciprocal-max service costs to chasing positive bodies with covering row sparsity two.

Ian D'Ambrosio · 0 citations