关注
Tom Cesari
Tom Cesari
其他姓名Tommaso Renato Cesari, Tommaso R. Cesari, Tommaso Cesari
Assistant Professor at University of Ottawa
在 uottawa.ca 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Nonstochastic Bandits with Composite Anonymous Feedback
N Cesa-Bianchi, T Cesari, R Colomboni, C Gentile, Y Mansour
Journal of Machine Learning Research 23 (277), 1-24, 2022
52*2022
Cooperative online learning: Keeping your neighbors updated
N Cesa-Bianchi, T Cesari, C Monteleoni
Algorithmic Learning Theory, 234-250, 2020
362020
Dynamic pricing with finitely many unknown valuations
N Cesa-Bianchi, T Cesari, V Perchet
Algorithmic Learning Theory, 247-273, 2019
342019
A Regret Analysis of Bilateral Trade
N Cesa-Bianchi, T Cesari, R Colomboni, F Fusco, S Leonardi
Proceedings of the 22nd ACM Conference on Economics and Computation (EC '21), 2021
232021
Bilateral trade: A regret minimization perspective
N Cesa-Bianchi, T Cesari, R Colomboni, F Fusco, S Leonardi
Mathematics of Operations Research 49 (1), 171-203, 2024
202024
A nearest neighbor characterization of Lebesgue points in metric measure spaces
TR Cesari, R Colomboni
Mathematical Statistics and Learning 3 (1), 71-112, 2021
132021
An Efficient Algorithm for Cooperative Semi-Bandits
R Della Vecchia, T Cesari
Algorithmic Learning Theory, 529-552, 2021
132021
Repeated Bilateral Trade Against a Smoothed Adversary
N Cesa-Bianchi, TR Cesari, R Colomboni, F Fusco, S Leonardi
The Thirty Sixth Annual Conference on Learning Theory, 1095-1130, 2023
112023
Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization
C Bouttier, T Cesari, M Ducoffe, S Gerchinovitz
arXiv preprint arXiv:2002.02390, 2020
112020
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates
F Bachoc, T Cesari, S Gerchinovitz
Advances in Neural Information Processing Systems 34 (NeurIPS), 2021
102021
The sample complexity of level set approximation
F Bachoc, T Cesari, S Gerchinovitz
International Conference on Artificial Intelligence and Statistics, 424-432, 2021
72021
The role of transparency in repeated first-price auctions with unknown valuations
N Cesa-Bianchi, T Cesari, R Colomboni, F Fusco, S Leonardi
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 225-236, 2024
62024
An Online Learning Theory of Brokerage
N Bolić, T Cesari, R Colomboni
Proceedings of the 2024 International Conference on Autonomous Agents and …, 2024
62024
ROI Maximization in Stochastic Online Decision-Making
N Cesa-Bianchi, T Cesari, Y Mansour, V Perchet
Advances in Neural Information Processing Systems 34 (NeurIPS), 2021
6*2021
On the minimax regret for online learning with feedback graphs
K Eldowa, E Esposito, T Cesari, N Cesa-Bianchi
Advances in Neural Information Processing Systems 36, 2024
52024
Regret Analysis of Bilateral Trade with a Smoothed Adversary
N Cesa-Bianchi, T Cesari, R Colomboni, F Fusco, S Leonardi
42024
Cooperative Online Learning with Feedback Graphs
N Cesa-Bianchi, T Cesari, R Della Vecchia
Transactions on Machine Learning Research, 2024
32024
Learning the Stackelberg Equilibrium in a Newsvendor Game
N Cesa-Bianchi, T Cesari, T Osogami, M Scarsini, S Wasserkrug
Proceedings of the 2023 International Conference on Autonomous Agents and …, 2023
3*2023
Regret Analysis of Dyadic Search
F Bachoc, T Cesari, R Colomboni, A Paudice
arXiv preprint arXiv:2209.00885, 2022
32022
A Near-Optimal Algorithm for Univariate Zeroth-Order Budget Convex Optimization
F Bachoc, T Cesari, R Colomboni, A Paudice
arXiv preprint arXiv:2208.06720, 2022
32022
系统目前无法执行此操作，请稍后再试。
文章 1–20