The following pages link to Nicolò Cesa-Bianchi (Q207978):
Displaying 50 items.
- Learning noisy linear classifiers via adaptive and selective sampling (Q413852) (← links)
- Synergy of multi-label hierarchical ensembles, data fusion, and cost-sensitive methods for gene functional inference (Q439045) (← links)
- Combinatorial bandits (Q439986) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- Tracking the best hyperplane with a simple budget perceptron (Q1009215) (← links)
- A graph-theoretic generalization of the Sauer-Shelah lemma (Q1265742) (← links)
- On Bayes methods for on-line Boolean prediction (Q1271199) (← links)
- On-line learning with malicious noise and the closure algorithm (Q1273754) (← links)
- Efficient learning with equivalence queries of conjunctions of modulo functions (Q1350223) (← links)
- Potential-based algorithms in on-line prediction and game theory (Q1394787) (← links)
- On prediction of individual sequences (Q1583891) (← links)
- Adaptive and self-confident on-line learning algorithms (Q1604218) (← links)
- Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions (Q1892207) (← links)
- Analysis of two gradient-based algorithms for on-line regression (Q1970199) (← links)
- Applications of regularized least squares to pattern classification (Q2381579) (← links)
- Improved second-order bounds for prediction with expert advice (Q2384131) (← links)
- Predicting the labels of an unknown graph via adaptive exploration (Q2431427) (← links)
- Linear algorithms for online multitask classification (Q2896169) (← links)
- (Q2933839) (← links)
- Regret Minimization for Reserve Prices in Second-Price Auctions (Q2978838) (← links)
- PAC-Bayesian Inequalities for Martingales (Q2989669) (← links)
- (Q3046700) (← links)
- (Q3093336) (← links)
- (Q3093388) (← links)
- (Q3148799) (← links)
- Sample-efficient strategies for learning in the presence of noise (Q3158555) (← links)
- A distributed voting scheme to maximize preferences (Q3431448) (← links)
- On the Generalization Ability of On-Line Learning Algorithms (Q3546662) (← links)
- Minimizing Regret With Label Efficient Prediction (Q3546663) (← links)
- Improved Risk Tail Bounds for On-Line Algorithms (Q3604417) (← links)
- Learning Unknown Graphs (Q3648746) (← links)
- (Q4228464) (← links)
- (Q4252717) (← links)
- Bounds on approximate steepest descent for likelihood maximization in exponential families (Q4324185) (← links)
- How to use expert advice (Q4376978) (← links)
- Scale-sensitive dimensions, uniform convergence, and learnability (Q4377590) (← links)
- (Q4420734) (← links)
- (Q4470555) (← links)
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback (Q4596721) (← links)
- Confidence Decision Trees via Online and Active Learning for Streaming Data (Q4600729) (← links)
- (Q4617599) (← links)
- (Q4633026) (← links)
- Learning Theory (Q4680917) (← links)
- Learning Theory (Q4680918) (← links)
- The Nonstochastic Multiarmed Bandit Problem (Q4785631) (← links)
- (Q4844653) (← links)
- How to use expert advice (Q5248507) (← links)
- Efficient Transductive Online Learning via Randomized Rounding (Q5264100) (← links)
- Online Learning of Noisy Data (Q5272209) (← links)
- Learning Theory and Kernel Machines (Q5305864) (← links)
