List of Publications by Claudio Gentile

Transcription

1 List of Publications by Claudio Gentile Claudio Gentile DiSTA, University of Insubria, Italy November 6, 2013 Abstract Contains the list of publications by Claudio Gentile, in reverse chronological order. Workshops are excluded from this list. References [1] N. Cesa-Bianchi, C. Gentile, F. Vitale, G. Zappella (2013). Random spanning trees and the prediction of weighted graphs. JOURNAL OF MA- CHINE LEARNING RESEARCH, vol. 14, p , ISSN: [2] N. Alon, N. Cesa-Bianchi, C. Gentile, Y. Mansour (2013). From Bandits to Experts: A Tale of Domination and Independence. In Proc. of the 27th conference on Neural Information processing Systems (NIPS 2013). MIT PRESS, [3] N. Cesa-Bianchi, C. Gentile, G. Zappella (2013). A gang of Bandits. In Proc. of the 27th conference on Neural Information processing Systems (NIPS 2013). MIT PRESS, 2013 [4] C. Gentile, M. Herbster, S. Pasteris (2013). Online Similarity Prediction of Networked Data from Known and Unknown Graphs. In Conference on Learning Theory. vol. 30, p , JMLR Workshop and Conference Proceedings, MIT Press, [5] E. Gofer, N. Cesa-Bianchi, C. Gentile, Y. Mansour (2013). Regret Minimization for Branching Experts. In Conference on Learning Theory. vol. 30, p , JMLR Workshop and Conference Proceedings, MIT Press, [6] Dekel O, Gentile C, Sridharan K (2012). Selective sampling and active learning from single and multiple teachers. JOURNAL OF MACHINE LEARNING RESEARCH, vol. 13, p , ISSN:

2 [7] Cesa-Bianchi N, Gentile C, Vitale F, Zappella G (2012). A linear time active learning algorithm for link classification. In Advances in Neural Information Processing Systems 25, [8] Gentile C, Orabona F. (2012). On multilabel classification and ranking with partial feedback. In Advances in Neural Information Processing Systems 25, [9] Cesa-Bianchi N, Gentile C, Vitale F, Zappella G (2012). A Correlation clustering approach to link classification in signed networks. In Proceedings of the 25th Annual Conference on Learning Theory. Edinburgh, Scotland, June 25-27, 2012, vol. 23, p , JMLR Workshop and Conference Proceedings. Vol 23: Colt [10] Orabona F, Cesa-Bianchi N, Gentile C (2012). Beyond logarithmic bounds in online learning. In Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics. La Palma, Canary Islands, April 21-23, 2012, vol. 22, p , JMLR Workshop and Conference Proceedings Volume 22: AISTATS [11] Crammer K, Gentile C (2012). Multiclass classification with bandit feedback using adaptive regularization. MACHINE LEARNING, vol. 90, p., ISSN: , doi: /s [12] Cesa-Bianchi N, Gentile C, Mansour Y (2012). Regret minimization for reserve prices in second-price auctions. In Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013). New Orleans, Louisiana, USA, January 6-8, 2013, SIAM. [13] Cavallanti G., Cesa-Bianchi N, Gentile C. (2011). Learning Noisy Linear Classifiers via Adaptive and Selective Sampling. MACHINE LEARNING, vol. 83, p , ISSN: [14] Cesa-Bianchi N, Gentile C, Vitale F, Zappella G (2011). See the tree through the lines: the Shazoo algorithm. In Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems Granada (Spain), December 12-15, 2011, vol. 24, p , New York:Curran Associates, Inc. [15] Crammer K, Gentile C (2011). Multiclass classification with bandit feedback using adaptive regularization. In Proceedings of the 28th International Conference on Machine Learning (ICML-11). Bellevue, Washington, USA, June 28th - July 2nd, 2011, p , New York:ACM. [16] Cesa-Bianchi N, Gentile C, Vitale F (2011). Predicting the labels of an unknown graph via adaptive exploration. THEORETICAL COMPUTER SCIENCE, vol. 412, p (special issue on ALT 2009), ISSN:

3 [17] Cavallanti G., Cesa-Bianchi N., Gentile C. (2010). Linear algorithms for online multitask classification. JOURNAL OF MACHINE LEARNING RE- SEARCH, vol. 11, p , ISSN: [18] Dekel O, Gentile C, Sridharan K (2010). Robust Selective Sampling from Single and Multiple Teachers. In Proceedings of the 23rd Conference on Learning Theory. Haifa, Israel, June 27th- 29th, 2010, p , NEW YORK:Omnipress. [19] Cesa-Bianchi N, Gentile C, Vitale F, Zappella G (2010). Active learning on trees and graphs. In Proceedings of the 23rd Conference on Learning Theory. Haifa, Israel, June 27th- 29th, 2010, p , NEW YORK:Omnipress. [20] Cesa-Bianchi N, Gentile C, Vitale F, Zappella G (2010). Random spanning trees and the prediction of weighted graphs. In Proceedings of the 27th International Conference on Machine Learning (ICML-10). Haifa, Israel, June 21st - 24th, 2010, p , NEW YORK:Omnipress. [21] Cesa-Bianchi N, Gentile C, Vitale F (2009). Learning unknown graphs. In Algorithmic Learning Theory, 20th International Conference. Porto (Portugal), October 3-5, 2009, p , SPRINGER. [22] Cesa-Bianchi N, Gentile C, Vitale F (2009). Fast and optimal prediction of a labeled tree. In 22nd Annual Conference on Learning Theory (Colt 2009). Montreal, Canada, June 18th - 21st, [23] Cesa-Bianchi N, Gentile C, Orabona F (2009). Robust bounds for classification via selective sampling. In Proceedings of the 26th International Conference on Machine Learning. Montreal, Canada, June 14th- 18th, 2009, p , NEW YORK:Omnipress. [24] CESA-BIANCHI N, C. GENTILE (2008). Improved risk tail bounds for online algorithms. IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 54/1, p , ISSN: [25] V. DEL BIANCO, C. GENTILE, L. LAVAZZA (2008). An Evaluation of Function Point Counting Based on Measurement-Oriented Models. In: Giuseppe Visaggio, Maria Teresa Baldassarre, Steve Linkman, Mark Turner. Evaluation and Assessment in Software Engineering EASE 2008, Bari, Giugno Bari, Giugno 2008, vol. pubblicato on-line ( p. 1-10, British Computer Society. [26] Bshouty N., Gentile C. (Eds.) (2008). Machine Learning, special issue on Colt Di -. BERLIN, HEIDELBERG, NEW YORK:SPRINGER. [27] Cavallanti G, Cesa-Bianchi N, Gentile C (2008). Linear classification and selective sampling under low noise conditions. In Proceedings of the Twenty- Second Annual Conference on Neural Information Processing Systems. Vancouver, British Columbia, Canada, December 8th-11th, 2008, p , New York:Curran Associates, Inc. 3

4 [28] Cavallanti G, Cesa-Bianchi N, Gentile C (2008). Linear algorithms for online multitask classification. In Proceedings of the 21st Annual Conference on Learning Theory - COLT Helsinki, Finland, July 9-12, 2008, p , NEW YORK:Omnipress. [29] Bshouty N., Gentile C. (Eds.) (2007). 20th Conference on Learning Theory. Di -. BERLIN, HEIDELBERG, NEW YORK:SPRINGER, ISBN: [30] Brotto C, Gentile C, Vitale F (2007). On higher-order Perceptron algorithms. In Proceedings of the 21st conference on Neural Information processing Systems (NIPS 2007). Vancouver, British Columbia, Canada, December 3-6, 2007, New York:Curran Associates, Inc. [31] Cavallanti G, Cesa-Bianchi N, Gentile C (2007). Tracking the best hyperplane with a simple budget perceptron. MACHINE LEARNING, vol. 69 (2-3), p (special issue on COLT 2006), ISSN: [32] CESA-BIANCHI N, GENTILE C., L. ZANIBONI (2006). Worst-Case Analysis of Selective sampling for linear-threshold algorithms. JOURNAL OF MACHINE LEARNING RESEARCH, vol. 7, p , ISSN: [33] CESA-BIANCHI, GENTILE C., L. ZANIBONI (2006). Incremental algorithms for hierarchical classification. JOURNAL OF MACHINE LEARN- ING RESEARCH, vol. 7, p , ISSN: [34] Cesa-Bianchi N, Gentile C, Zaniboni L (2006). Hierarchical classification: combining Bayes with SVM. In Machine Learning, Proceedings of the Twenty-Third International Conference (ICML 2006). Pittsburgh, Pennsylvania, USA,, June 25-29, 2006, p , ACM. [35] Cavallanti G, Cesa-Bianchi N, Gentile C (2006). Tracking the best hyperplane with a simple budget perceptron. In Learning Theory: 19th Annual Conference on Learning Theory, COLT Pittsburgh, PA, USA, June 22-25, 2006, p , SPRINGER. [36] CESA-BIANCHI N, CONCONI A, GENTILE C (2005). A second-order perceptron algorithm. SIAM JOURNAL ON COMPUTING, vol. 34, p , ISSN: , doi: /S [37] Cesa-Bianch N, Gentile C (2005). Improved risk tail bounds for on-line algorithms. In Advances in Neural Information Processing Systems 18 (Nips 2005). Vancouver, British Columbia, Canada, December 5-8, [38] Cesa-Bianchi N, Conconi A, Gentile C (2004). On the generalization ability of on-line learning algorithms. IEEE TRANSACTIONS ON IN- FORMATION THEORY, vol. 50, p , ISSN: , doi: /TIT

5 [39] Cesa-Bianchi N, Gentile C, Zaniboni L (2004). Incremental algorithms for hierarchical classification. In Advances in Neural Information Processing Systems 17 (Nips 2004). Vancouver, British Columbia, Canada, December 13-18, [40] Cesa-Bianchi N, Gentile C, Zaniboni L (2004). Worst-case analysis of selective sampling for linear-threshold algorithms. In Advances in Neural Information Processing Systems 17 (Nips 2004). Vancouver, British Columbia, Canada, December 13-18, [41] Cesa-Bianchi N, Conconi A, Gentile C (2004). Regret bounds for hierarchical classification with linear-threshold functions. In Learning Theory,17th Annual Conference on Learning Theory, COLT 2004, Lecture Notes in Computer Science. Banff, Canada, July 1-4, 2004, vol. 3120, p , SPRINGER. [42] GENTILE C (2003). The robustness of the p-norm algorithms. MACHINE LEARNING, vol. 53, p , ISSN: [43] Gentile C. (Eds.) (2003). Machine Learning, special issue on Colt Di -. DORDRECHT:Kluwer Academic Press. [44] Gentile C (2003). Fast feature selection from microarray expression data via multiplicative large margin algorithms. In Advances in Neural Information Processing Systems 16 (Nips 2003). Vancouver, British Columbia, Canada, December 8-13, 2003, MIT Press. [45] Cesa-Bianchi N, Conconi A, Gentile C (2003). Learning probabilistic linearthreshold classifiers via selective sampling. In: Computational Learning Theory and Kernel Machines, 16th Annual Conference on Computational Learning Theory and 7th Kernel Workshop, COLT/Kernel Washington, DC, USA, August 24-27, 2003, p , SPRINGER. [46] Cesa-Bianchi N, Conconi A, Gentile C (2002). Margin-based algorithms for information filtering. In Advances in Neural Information Processing Systems 15 (Nips 2002). Vancouver, British Columbia, Canada, December 9-14, 2002, p , MIT Press. [47] Cancedda N, Goutte C, Renders J M, Cesa-Bianchi N, Conconi A, Li Y, Shawe-Taylor J, Vinokourov A, Graepel T, Gentile C (2002). Kernel methods for document filtering. In: The Eleventh Text Retrieval Conference (TREC 2002). Gaithersburg, Maryland, USA, November 19-22, [48] Cesa-Bianchi N, Conconi A, Gentile C (2002). A second-order Perceptron algorithm. In Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Lecture Notes in Computer Science. Sydney, Australia, July 8-10, 2002, vol. 2375, p , SPRINGER. 5

6 [49] Auer P, Cesa-Bianchi N, Gentile C (2002). Adaptive and self-confident on-line learning algorithms. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 64/1, p (special issue on COLT 2000), ISSN: [50] GENTILE C. (2001). A new approximate maximal margin clasification algorithm. JOURNAL OF MACHINE LEARNING RESEARCH, p , ISSN: [51] GENTILE C., D. HELMBOLD (2001). Improved lower bounds for learning from noisy examples: an information-theoretic approach. INFORMATION AND COMPUTATION, p , ISSN: [52] Cesa-Bianchi N, Conconi A, Gentile C (2001). On the generalization ability of on-line learning algorithms. In Advances in Neural Information Processing Systems 14 (Nips 2001). Vancouver, British Columbia, Canada, December 3-8, 2001, p , MIT Press. [53] B. APOLLONI, GENTILE C. (2000). P-sufficient statistics for PAC learning k-term-dnf formulas through enumeration. THEORETICAL COM- PUTER SCIENCE, p. 1-37, ISSN: [54] Gentile C (2000). A new approximate maximal margin clasification algorithm. In Advances in Neural Information Processing Systems 13 (Nips 2000). Denver, CO, USA, November 28-30, 2000, p , MIT Press. [55] Auer P, Gentile C (2000). Adaptive and self-confident on-line learning algorithms. In Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000). Palo Alto, California, USA, June 28 - July 1, 2000, p , Morgan Kaufmann. [56] Gentile C, Littlestone N (1999). The robustness of the p-norm algorithms. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, COLT Santa Cruz, CA, USA, July 7-9, 1999, p. 1-11, ACM. [57] B. APOLLONI, C. GENTILE (1998). Sample size lower bounds in PAC learning by algorithmic complexity theory. THEORETICAL COMPUTER SCIENCE, ISSN: [58] Gentile C, Helmbold D (1998). Improved lower bounds for learning from noisy examples: an information-theoretic approach. In Proceedings of the Eleventh Annual Conference on Computational Learning Theory, COLT Madison, Wisconsin, USA, July 24-26, 1998, p , ACM. [59] Gentile C, Warmuth M (1998). Linear hinge loss and average margin. In Advances in Neural Information Processing Systems 11 (Nips 1998). Denver, Colorado, USA, November 30 - December 5, 1998, p , MIT Press. 6