Nicolò Cesa-Bianchi

From MaRDI portal
Person:207978

Available identifiers

zbMath Open cesa-bianchi.nicoloDBLPc/NicoloCesaBianchiWikidataQ7030465 ScholiaQ7030465MaRDI QIDQ207978

List of research outcomes





PublicationDate of PublicationType
Bilateral Trade: A Regret Minimization Perspective2024-03-05Paper
Finding Stable Matchings in PhD Markets with Consistent Preferences and Cooperative Partners2021-02-23Paper
Two-Sided Matching Markets in the ELLIS 2020 PhD Program2021-01-28Paper
Regret Minimization for Reserve Prices in Second-Price Auctions2019-05-15Paper
https://portal.mardi4nfdi.de/entity/Q46330262019-05-02Paper
https://portal.mardi4nfdi.de/entity/Q46175992019-02-06Paper
Confidence Decision Trees via Online and Active Learning for Streaming Data2018-01-12Paper
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback2017-12-08Paper
Online Learning of Noisy Data2017-07-12Paper
Bandits With Heavy Tail2017-06-08Paper
PAC-Bayesian Inequalities for Martingales2017-06-08Paper
Regret Minimization for Reserve Prices in Second-Price Auctions2017-04-28Paper
A generalized online mirror descent with applications to classification and regression2015-09-04Paper
Efficient Transductive Online Learning via Randomized Rounding2015-07-20Paper
How to use expert advice2015-05-07Paper
https://portal.mardi4nfdi.de/entity/Q29338392014-12-08Paper
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems2014-02-03Paper
https://portal.mardi4nfdi.de/entity/Q53967122014-02-03Paper
Combinatorial bandits2012-08-17Paper
Synergy of multi-label hierarchical ensembles, data fusion, and cost-sensitive methods for gene functional inference2012-07-31Paper
Linear algorithms for online multitask classification2012-07-13Paper
Learning noisy linear classifiers via adaptive and selective sampling2012-05-08Paper
https://portal.mardi4nfdi.de/entity/Q30933882011-10-12Paper
https://portal.mardi4nfdi.de/entity/Q30933362011-10-12Paper
Predicting the labels of an unknown graph via adaptive exploration2011-04-14Paper
Learning Theory and Kernel Machines2010-03-23Paper
Learning Unknown Graphs2009-12-01Paper
Tracking the best hyperplane with a simple budget perceptron2009-03-31Paper
Improved Risk Tail Bounds for On-Line Algorithms2009-02-24Paper
On the Generalization Ability of On-Line Learning Algorithms2008-12-21Paper
Minimizing Regret With Label Efficient Prediction2008-12-21Paper
Regret Minimization Under Partial Monitoring2008-05-27Paper
Improved second-order bounds for prediction with expert advice2007-09-20Paper
Applications of regularized least squares to pattern classification2007-09-18Paper
Tracking the Best Hyperplane with a Simple Budget Perceptron2007-09-14Paper
A distributed voting scheme to maximize preferences2007-04-10Paper
Learning Theory2006-06-22Paper
Prediction, Learning, and Games2006-05-30Paper
A Second-Order Perceptron Algorithm2005-09-16Paper
Algorithmic Learning Theory2005-08-18Paper
Learning Theory2005-06-13Paper
Learning Theory2005-06-13Paper
Sample-efficient strategies for learning in the presence of noise2005-01-25Paper
https://portal.mardi4nfdi.de/entity/Q30467002004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44705552004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44207342003-08-18Paper
Potential-based algorithms in on-line prediction and game theory2003-06-25Paper
The Nonstochastic Multiarmed Bandit Problem2003-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31487992002-09-22Paper
Worst-case bounds for the logarithmic loss of predictors2002-07-22Paper
Adaptive and self-confident on-line learning algorithms2002-07-04Paper
Finite-time analysis of the multiarmed bandit problem2002-04-11Paper
On prediction of individual sequences2001-06-05Paper
https://portal.mardi4nfdi.de/entity/Q42527172000-04-26Paper
Analysis of two gradient-based algorithms for on-line regression2000-03-19Paper
On-line learning with malicious noise and the closure algorithm1999-03-23Paper
https://portal.mardi4nfdi.de/entity/Q42284641999-03-01Paper
On Bayes methods for on-line Boolean prediction1998-11-11Paper
A graph-theoretic generalization of the Sauer-Shelah lemma1998-09-27Paper
How to use expert advice1998-02-17Paper
Scale-sensitive dimensions, uniform convergence, and learnability1998-02-17Paper
Efficient learning with equivalence queries of conjunctions of modulo functions1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48446531996-05-05Paper
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions1995-06-08Paper
Bounds on approximate steepest descent for likelihood maximization in exponential families1995-03-01Paper

Research outcomes over time

This page was built for person: Nicolò Cesa-Bianchi