EPrints submitted by Nicolò Cesa-Bianchi

Number of EPrints submitted by this user: 34

Regret bounds for hierarchical classification with linear-threshold functions
Nicolò Cesa-Bianchi, Alex Conconi and Claudio Gentile
In: COLT 2004, 1-4 Jul 2004, Banff, Canada.

Incremental algorithms for hierarchical classification
Nicolò Cesa-Bianchi, Claudio Gentile, Andrea Tironi and Luca Zaniboni
In: NIPS 2004, 13-18 Dec. 2004, Vancouver, Canada.

Regret minimization under partial monitoring
Nicolò Cesa-Bianchi, Gábor Lugosi and Gilles Stoltz
Submitted 2004.

Improved risk tail bounds for on-line algorithms
Nicolò Cesa-Bianchi and Claudio Gentile
In: NIPS 2005, 5-8 Dec 2005, Vancouver, Canada.

A second-order Perceptron algorithm
Nicolò Cesa-Bianchi, Alex Conconi and Claudio Gentile
SIAM Journal on Computing Volume 34, Number 3, pp. 640-668, 2005.

Incremental algorithms for hierarchical classification
Nicolò Cesa-Bianchi, Claudio Gentile and Luca Zaniboni
Journal of Machine Learning Research Volume 7, pp. 31-54, 2006.

Prediction, Learning, and Games
Nicolò Cesa-Bianchi and Gábor Lugosi
(2006) Cambridge University Press , New York, USA . ISBN 0521841089

Regret minimization under partial monitoring
Nicolò Cesa-Bianchi, Gábor Lugosi and Gilles Stoltz
Mathematics of Operations Research Volume 31, Number 3, pp. 562-580, 2006.

Tracking the Best Hyperplane with a Simple Budget Perceptron
Nicolò Cesa-Bianchi and Claudio Gentile
In: 19th Annual Conference on Learning Theory, 22-25 Jun 2006, Pittsburgh, USA.

Hierarchical Classification: Combining Bayes with SVM
Nicolò Cesa-Bianchi, Claudio Gentile and Luca Zaniboni
In: 23rd International Conference on Machine Learning, 25-29 Jun 2006, Pittsburgh, USA.

Tracking the Best Hyperplane with a Simple Budget Perceptron
Giovanni Cavallanti, Nicolò Cesa-Bianchi and Claudio Gentile
Machine Learning Volume 69, Number 2/3, pp. 143-167, 2006.

Improved risk tail bounds for on-line algorithms
Nicolò Cesa-Bianchi and Claudio Gentile
IEEE Transactions on Information Theory Volume 54, Number 1, pp. 386-390, 2008.

Applications of regularized least squares to classification problems
Nicolò Cesa-Bianchi
Theoretical Computer Science Volume 382, Number 3, pp. 221-231, 2007.

Linear algorithms for online multitask classification
Giovanni Cavallanti, Nicolò Cesa-Bianchi and Claudio Gentile
In: 21st Annual Conference on Learning Theory (COLT 2008), July, 2008, Helsinki, Finland.

Linear classification and selective sampling under low noise conditions
Giovanni Cavallanti, Nicolò Cesa-Bianchi and Claudio Gentile
In: Advances in Neural Information Processing Systems 22 (NIPS 2008), Vancouver, Canada(2009).

Combinatorial Bandits
Nicolò Cesa-Bianchi and Gábor Lugosi
In: Proceedings of the 22nd Annual Conference on Learning Theory, Montreal, Canada(2009).

Fast and optimal prediction on a labeled tree
Nicolò Cesa-Bianchi, Claudio Gentile and Fabio Vitale
In: Proceedings of the 22nd Annual Conference on Learning Theory, Montreal, Canada(2009).

Learning unknown graphs
Nicolò Cesa-Bianchi, Claudio Gentile and Fabio Vitale
In: The 20th International Conference on Algorithmic Learning Theory, Porto, Portugal(2009).

Robust Bounds for Classification via Selective Sampling
Nicolò Cesa-Bianchi, Claudio Gentile and Francesco Orabona
In: Proceedings of the 26th International Conference on Machine Learning, Montreal, Canada(2009).

Random spanning trees and the prediction of weighted graphs
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio Vitale and Giovanni Zappella
In: ICML 2010, Haifa, Israel(2010).

Predicting the labels of an unknown graph via adaptive exploration
Nicolò Cesa-Bianchi, Claudio Gentile and Fabio Vitale
Theoretical Computer Science Volume 412, Number 19, pp. 1791-1804, 2011.

Linear algorithms for online multitask classification
Giovanni Cavallanti, Nicolò Cesa-Bianchi and Claudio Gentile
Journal of Machine Learning Research Volume 11, pp. 2597-2630, 2010.

See the tree through the lines: the Shazoo algorithm
Fabio Vitale, Nicolò Cesa-Bianchi, Claudio Gentile and Giovanni Zappella
In: NIPS 2011(2012).

Efficient online learning via randomized rounding
Nicolò Cesa-Bianchi and Ohad Shamir
In: NIPS 2011(2012).

Better algorithms for selective sampling
Francesco Orabona and Nicolò Cesa-Bianchi
In: ICML 2011(2011).

Quantity makes quality: learning with partial views
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz and Ohad Shamir
In: AAAI 2011 (Nectar Program)(2011).

Online learning of noisy data with kernels
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz and Ohad Shamir
IEEE Transactions on Information Theory Volume 57, Number 12, pp. 7907-7931, 2011.

Efficient learning with partially observed attributes
Nicolò Cesa-Bianchi, Shai Shalev-Shwartz and Ohad Shamir
Journal of Machine Learning Research Volume 12, pp. 2857-2878, 2011.

Learning noisy linear classifiers via adaptive and selective sampling
Giovanni Cavallanti, Nicolò Cesa-Bianchi and Claudio Gentile
Machine Learning Volume 83, pp. 71-102, 2011.

Mirror Descent meets Fixed Share (and feels no regret)
Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi and Gilles Stoltz
In: 26th Conference on Neural Information Processing Systems (NIPS 2012)(2013).

Regret minimization for reserve prices in second-price auctions
Nicolò Cesa-Bianchi, Claudio Gentile and Yishay Mansour
In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA13)(2013).

Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Sébastien Bubeck and Nicolò Cesa-Bianchi
Foundations and Trends in Machine Learning Volume 5, Number 1, pp. 1-122, 2012.

Towards minimax policies for online linear optimization with bandit feedback
Sébastien Bubeck, Nicolò Cesa-Bianchi and Sham Kakade
In: Proceedings of the 25th Annual Conference on Learning Theory (COLT)(2012).

PAC-Bayes-Bernstein inequality for martingales and its application to multiarmed bandits
Yevgeny Seldin, Nicolò Cesa-Bianchi, Peter Auer, Francois Laviolette and John Shawe-Taylor
In: Proceedings of the Workshop on On-line Trading of Exploration and Exploitation 2(2012).