From the 1 of 12 linked papers with an AI index.
12 papers
An Efficient Minimax-Optimal Algorithm for Adversarial -Set Bandits
Francesco Bacchiocchi, Tommaso Cesari, Roberto Colomboni
We study adversarial combinatorial bandits with -set actions, where at each round the learner selects out of items and observes only the aggregate loss of the selected i…
No Extra Signals Needed: The Uniform Price of Explainable Information Design
Francesco Bacchiocchi, Tommaso Cesari, Roberto Colomboni
In information design, an informed sender aims to influence a receiver's decision by committing to a signaling scheme. However, optimal signaling schemes often rely on randomizatio…
Sharp Dimension Dependence for the Last Iterate of the SubGradient Method
Guglielmo Beretta, Tommaso Cesari, Roberto Colomboni +1
We study the last iterate of the projected subGradient Method (sGM) for convex Lipschitz objectives defined on . We prove that, for a finite horizon and a constan…
Effective Resistance in Fixed-Rank External-Field Measures and Constant-Stretch Correlated Sampling on the Hypersimplex
Tommaso Cesari, Roberto Colomboni
The paper establishes an effective‑resistance bound for random subsets drawn from a fixed‑rank external‑field measure, providing a factor‑two relaxation of a conjectured covariance…
New Bounds for the Last Iterate of the Stochastic subGradient Method
Guglielmo Beretta, Tommaso Cesari, Roberto Colomboni +1
We study the last iterate of the stochastic subgradient method for one-dimensional convex Lipschitz objectives. For a fixed horizon , we consider the standard fixed stepsizes $Î…
Two-Action Apple Tasting with Switching Costs
Tommaso Cesari, Roberto Colomboni
We study the two-action apple-tasting problem with switching costs against an oblivious adversary. In an equivalent normalized formulation, at each round the learner chooses betwee…