Question 1: Single choice
hardAI-checkedMulti-Agent SystemsThe negative entropy is 1-strongly convex on the simplex with respect to both the and the norm. The regret bound of (optimistic) multiplicative weights involves the strong-convexity norm and its dual norm applied to the utility vectors. Which choice gives the stronger bound?