Travelled to:1 × Canada
1 × Israel
5 × USA
Collaborated with:C.Gentile F.Orabona P.Fischer S.Shalev-Shwartz O.Shamir L.Zaniboni F.Vitale G.Zappella E.Dichterman H.Simon Y.Freund D.P.Helmbold D.Haussler R.E.Schapire M.K.Warmuth
Talks about:bound (3) classif (2) select (2) sampl (2) learn (2) algorithm (1) multiarm (1) hierarch (1) attribut (1) theoret (1)
Person: Nicolò Cesa-Bianchi
DBLP: Cesa-Bianchi:Nicol=ograve=
Contributed to:
20112010200920061998
19961993Wrote 8 papers:
- ICML-2011-OrabonaC #algorithm
- Better Algorithms for Selective Sampling (FO, NCB), pp. 433–440.
- ICML-2010-Cesa-BianchiGVZ #graph #predict #random
- Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.
- ICML-2010-Cesa-BianchiSS #learning #performance
- Efficient Learning with Partially Observed Attributes (NCB, SSS, OS), pp. 183–190.
- ICML-2009-Cesa-BianchiGO #bound #classification #robust
- Robust bounds for classification via selective sampling (NCB, CG, FO), pp. 121–128.
- ICML-2006-Cesa-BianchiGZ #classification
- Hierarchical classification: combining Bayes with SVM (NCB, CG, LZ), pp. 177–184.
- ICML-1998-Cesa-BianchiF #bound #finite #multi #problem
- Finite-Time Regret Bounds for the Multiarmed Bandit Problem (NCB, PF), pp. 100–108.
- STOC-1996-Cesa-BianchiDFS #bound #learning
- Noise-Tolerant Learning Near the Information-Theoretic Bound (NCB, ED, PF, HUS), pp. 141–150.
- STOC-1993-Cesa-BianchiFHHSW #how
- How to use expert advice (NCB, YF, DPH, DH, RES, MKW), pp. 382–391.