Nicolò Cesa-Bianchi

引用次数

	总计	2020 年至今
引用	35106	16338
h 指数	57	41
i10 指数	124	88

3400

1700

850

2550

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025110 76 120 130 154 158 295 368 432 494 586 778 880 998 1186 1486 1745 1857 1803 2089 2451 2919 3195 3187 3365 3347 325

开放获取的出版物数量

查看全部

38 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Claudio GentileGoogle Research, New York, USA在 google.com 的电子邮件经过验证
Gabor LugosiICREA and Universitat Pompeu Fabra在 upf.edu 的电子邮件经过验证
Peter AuerMontanuniversität Leoben在 unileoben.ac.at 的电子邮件经过验证
Yishay MansourTel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
Alex ConconiUniversity of Milan, Italy在 frog.co 的电子邮件经过验证
Yoav FreundUCSD在 ucsd.edu 的电子邮件经过验证
Ohad ShamirWeizmann Institute of Science在 weizmann.ac.il 的电子邮件经过验证
Manfred K. Warmuthvisiting Google Brain在 google.com 的电子邮件经过验证
Robert SchapireMicrosoft Research在 microsoft.com 的电子邮件经过验证
Tom CesariAssistant Professor at University of Ottawa在 uottawa.ca 的电子邮件经过验证
Samy BengioSenior Director, AI and ML Research, Apple在 apple.com 的电子邮件经过验证
Gilles StoltzCNRS / Université Paris-Saclay / HEC Paris在 hec.fr 的电子邮件经过验证
Giovanni ZappellaAWS在 amazon.com 的电子邮件经过验证
Sebastien BubeckOpenAI在 openai.com 的电子邮件经过验证
David HausslerScientific Director, UC Santa Cruz Genomics Institute, University of California, Santa Cruz在 soe.ucsc.edu 的电子邮件经过验证
Noga AlonPrinceton University and Tel Aviv University在 tau.ac.il 的电子邮件经过验证
Hanna WallachPartner Research Manager, Microsoft Research在 dirichlet.net 的电子邮件经过验证
Kristen GraumanProfessor of Computer Science, University of Texas at Austin在 cs.utexas.edu 的电子邮件经过验证
Hugo LarochelleGoogle DeepMind & Mila在 google.com 的电子邮件经过验证
Francesco OrabonaAssociate Professor, KAUST在 orabona.com 的电子邮件经过验证

关注

Nicolò Cesa-Bianchi

Professor of Computer Science, Università degli Studi di Milano and Politecnico di Milano

在 unimi.it 的电子邮件经过验证 - 首页

Machine Learning Learning Theory Online Learning Multi-Armed Bandits


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Finite-time Analysis of the Multiarmed Bandit Problem P Auer, N Cesa-Bianchi, P Fischer Machine Learning 47 (2/3), 235-256, 2002	8731	2002
Prediction, learning, and games N Cesa-Bianchi, G Lugosi Cambridge University Press, 2006	5177	2006
Regret analysis of stochastic and nonstochastic multi-armed bandit problems S Bubeck, N Cesa-Bianchi Foundations and Trends in Machine Learning 5 (1), 1-122, 2012	3287	2012
The nonstochastic multiarmed bandit problem P Auer, N Cesa-Bianchi, Y Freund, RE Schapire SIAM journal on computing 32 (1), 48-77, 2002	3237	2002
Proceedings of the 32nd international conference on neural information processing systems S Bengio, HM Wallach, H Larochelle, K Grauman, N Cesa-Bianchi Curran Associates Inc., 2018	1645*	2018
Gambling in a rigged casino: The adversarial multi-armed bandit problem P Auer, N Cesa-Bianchi, Y Freund, RE Schapire Proceedings of the 36th Annual Symposium on Foundations of Computer Science …, 1995	1225	1995
How to use expert advice N Cesa-Bianchi, Y Freund, D Haussler, DP Helmbold, RE Schapire, ... Journal of the ACM (JACM) 44 (3), 427-485, 1997	1015	1997
On the generalization ability of on-line learning algorithms N Cesa-Bianchi, A Conconi, C Gentile IEEE Transactions on Information Theory 50 (9), 2050-2057, 2004	643	2004
Scale-sensitive dimensions, uniform convergence, and learnability N Alon, S Ben-David, N Cesa-Bianchi, D Haussler Journal of the ACM (JACM) 44 (4), 615-631, 1997	619	1997
Combinatorial bandits N Cesa-Bianchi, G Lugosi Journal of Computer and System Sciences 78 (5), 1404-1422, 2012	542	2012
Incremental algorithms for hierarchical classification N Cesa-Bianchi, C Gentile, L Zaniboni Journal of Machine Learning Research 7 (2), 31-54, 2006	374	2006
Bandits with heavy tail S Bubeck, N Cesa-Bianchi, G Lugosi IEEE Transactions on Information Theory 59 (11), 7711-7717, 2013	345	2013
Adaptive and self-confident on-line learning algorithms P Auer, N Cesa-Bianchi, C Gentile Journal of Computer and System Sciences 64 (1), 48-75, 2002	343	2002
A second-order Perceptron algorithm N Cesa-Bianchi, A Conconi, C Gentile SIAM Journal on Computing 34 (3), 640-668, 2005	258	2005
Improved second-order bounds for prediction with expert advice N Cesa-Bianchi, Y Mansour, G Stoltz Machine Learning 66, 321-352, 2007	257	2007
Boltzmann exploration done right N Cesa-Bianchi, C Gentile, G Lugosi, G Neu Advances in neural information processing systems 30, 2017	243	2017
Hierarchical classification: combining bayes with SVM N Cesa-Bianchi, C Gentile, L Zaniboni Proceedings of the 23rd international conference on Machine learning, 177-184, 2006	219	2006
Worst-case quadratic loss bounds for prediction using linear functions and gradient descent N Cesa-Bianchi, PM Long, MK Warmuth IEEE Transactions on Neural Networks 7 (3), 604-619, 1996	213	1996
Linear algorithms for online multitask classification G Cavallanti, N Cesa-Bianchi, C Gentile The Journal of Machine Learning Research 11, 2901-2934, 2010	212	2010
Regret minimization for reserve prices in second-price auctions N Cesa-Bianchi, C Gentile, Y Mansour Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA13), 1190-1204, 2013	206	2013

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者