Skip to content

2 papers 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.

Preprint Aug 2026

Multinomial Subset Routing with Sum-Max Rewards and Operational Constraints

OMD-Approachability is proposed, which combines online mirror descent with Blackwell's approachability to optimize MSR under two-sided operational constraints, and is evaluated on a real-world crowdsourcing dataset.

Quan Zhou, Yiyan Huang · 0 citations
#machine learning Preprint Aug 2026

Coverage-Maximizing Multinomial Subset Routing under Operational Constraints

We introduce Multinomial Subset Routing (MSR), a new online routing framework over $K$ experts in which the learner keeps a multinomial routing policy instead of a deterministic subset of experts. At each round, the learner samples $M$ experts i.i.d. from the multinomial policy, and the resulting set of distinct sample...

Quan Zhou, Yiyan Huang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.