According to the arXiv abstract for 2610.20416, the paper takes up a question posed by Freund in the setting of prediction from expert advice. The goal is to compete with a comparator that switches k times among only m experts. The abstract notes that for a discrete set of experts, this problem was already resolved, but the text cuts off before describing the resolution or the new contribution.

The paper's title suggests a connection to online convex optimization, but the abstract snippet does not elaborate on the setting or the results. No details on methods, bounds, or proofs are provided in the source.

Readers should note that the abstract is incomplete in the source; the announcement type is "new" and the full paper is available at the arXiv link.