| Publication | Date of Publication | Type |
|---|
Regret minimization for reserve prices in second-price auctions
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Delay and cooperation in nonstochastic bandits | 2019-05-02 | Paper |
Delay and cooperation in nonstochastic bandits
(available as arXiv preprint) | 2019-05-02 | Paper |
| On similarity prediction and pairwise clustering | 2019-02-06 | Paper |
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
SIAM Journal on Computing | 2017-12-08 | Paper |
Regret Minimization for Reserve Prices in Second-Price Auctions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
| Random spanning trees and the prediction of weighted graphs | 2014-12-08 | Paper |
Random spanning trees and the prediction of weighted graphs
(available as arXiv preprint) | 2014-12-08 | Paper |
| scientific article; zbMATH DE number 6378144 (Why is no real title available?) | 2014-12-08 | Paper |
scientific article; zbMATH DE number 6378144 (Why is no real title available?)
(available as arXiv preprint) | 2014-12-08 | Paper |
| Selective sampling and active learning from single and multiple teachers | 2014-04-01 | Paper |
Multiclass classification with bandit feedback using adaptive regularization
Machine Learning | 2013-03-28 | Paper |
Linear algorithms for online multitask classification
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
Learning noisy linear classifiers via adaptive and selective sampling
Machine Learning | 2012-05-08 | Paper |
| scientific article; zbMATH DE number 5957363 (Why is no real title available?) | 2011-10-12 | Paper |
| Incremental algorithms for hierarchical classification | 2011-10-12 | Paper |
Predicting the labels of an unknown graph via adaptive exploration
Theoretical Computer Science | 2011-04-14 | Paper |
Learning probabilistic linear-threshold classifiers via selective sampling.
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Learning unknown graphs
Lecture Notes in Computer Science | 2009-12-01 | Paper |
Tracking the best hyperplane with a simple budget perceptron
Machine Learning | 2009-03-31 | Paper |
Improved Risk Tail Bounds for On-Line Algorithms
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
On the Generalization Ability of On-Line Learning Algorithms
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Tracking the Best Hyperplane with a Simple Budget Perceptron
Learning Theory | 2007-09-14 | Paper |
A Second-Order Perceptron Algorithm
SIAM Journal on Computing | 2005-09-16 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
The robustness of the \(p\)-norm algorithms
Machine Learning | 2005-01-19 | Paper |
| scientific article; zbMATH DE number 2089358 (Why is no real title available?) | 2004-08-12 | Paper |
Improved lower bounds for learning from noisy examples: An information-theoretic approach
Information and Computation | 2003-01-14 | Paper |
Adaptive and self-confident on-line learning algorithms
Journal of Computer and System Sciences | 2002-07-04 | Paper |
10.1162/15324430260185600
CrossRef Listing of Deleted DOIs | 2002-01-01 | Paper |
\(P\)-sufficient statistics for PAC learning \(k\)-term-DNF formulas through enumeration
Theoretical Computer Science | 2000-06-04 | Paper |
Sample size lower bounds in PAC learning by Algorithmic Complexity Theory
Theoretical Computer Science | 1999-01-12 | Paper |
