| Publication | Date of Publication | Type |
|---|
Bilateral Trade: A Regret Minimization Perspective
Mathematics of Operations Research | 2024-03-05 | Paper |
| Finding Stable Matchings in PhD Markets with Consistent Preferences and Cooperative Partners | 2021-02-23 | Paper |
| Two-Sided Matching Markets in the ELLIS 2020 PhD Program | 2021-01-28 | Paper |
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 |
| Bandit regret scaling with the effective loss range | 2019-02-06 | Paper |
Bandit regret scaling with the effective loss range
(available as arXiv preprint) | 2019-02-06 | Paper |
Confidence decision trees via online and active learning for streaming data
Journal of Artificial Intelligence Research | 2018-01-12 | Paper |
Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
SIAM Journal on Computing | 2017-12-08 | Paper |
Online Learning of Noisy Data
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Bandits With Heavy Tail
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
PAC-Bayesian Inequalities for Martingales
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Regret Minimization for Reserve Prices in Second-Price Auctions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A generalized online mirror descent with applications to classification and regression
Machine Learning | 2015-09-04 | Paper |
Efficient transductive online learning via randomized rounding
Empirical Inference | 2015-07-20 | Paper |
How to use expert advice
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | 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 |
Regret analysis of stochastic and nonstochastic multi-armed bandit problems
Foundations and Trends® in Machine Learning | 2014-02-03 | Paper |
| Efficient learning with partially observed attributes | 2014-02-03 | Paper |
Combinatorial bandits
Journal of Computer and System Sciences | 2012-08-17 | Paper |
Synergy of multi-label hierarchical ensembles, data fusion, and cost-sensitive methods for gene functional inference
Machine Learning | 2012-07-31 | 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 |
Minimizing Regret With Label Efficient Prediction
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Regret Minimization Under Partial Monitoring
Mathematics of Operations Research | 2008-05-27 | Paper |
Improved second-order bounds for prediction with expert advice
Machine Learning | 2007-09-20 | Paper |
Applications of regularized least squares to pattern classification
Theoretical Computer Science | 2007-09-18 | Paper |
Tracking the Best Hyperplane with a Simple Budget Perceptron
Learning Theory | 2007-09-14 | Paper |
A distributed voting scheme to maximize preferences
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
A distributed voting scheme to maximize preferences
RAIRO - Theoretical Informatics and Applications | 2007-04-10 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
| Prediction, Learning, and Games | 2006-05-30 | Paper |
A Second-Order Perceptron Algorithm
SIAM Journal on Computing | 2005-09-16 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
Sample-efficient strategies for learning in the presence of noise
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2089358 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2077162 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1966600 (Why is no real title available?) | 2003-08-18 | Paper |
Potential-based algorithms in on-line prediction and game theory
Machine Learning | 2003-06-25 | Paper |
The Nonstochastic Multiarmed Bandit Problem
SIAM Journal on Computing | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1804097 (Why is no real title available?) | 2002-09-22 | Paper |
Worst-case bounds for the logarithmic loss of predictors
Machine Learning | 2002-07-22 | Paper |
Adaptive and self-confident on-line learning algorithms
Journal of Computer and System Sciences | 2002-07-04 | Paper |
Finite-time analysis of the multiarmed bandit problem
Machine Learning | 2002-04-11 | Paper |
On prediction of individual sequences
The Annals of Statistics | 2001-06-05 | Paper |
| scientific article; zbMATH DE number 1306865 (Why is no real title available?) | 2000-04-26 | Paper |
Analysis of two gradient-based algorithms for on-line regression
Journal of Computer and System Sciences | 2000-03-19 | Paper |
On-line learning with malicious noise and the closure algorithm
Annals of Mathematics and Artificial Intelligence | 1999-03-23 | Paper |
| scientific article; zbMATH DE number 1256729 (Why is no real title available?) | 1999-03-01 | Paper |
On Bayes methods for on-line Boolean prediction
Algorithmica | 1998-11-11 | Paper |
A graph-theoretic generalization of the Sauer-Shelah lemma
Discrete Applied Mathematics | 1998-09-27 | Paper |
How to use expert advice
Journal of the ACM | 1998-02-17 | Paper |
Scale-sensitive dimensions, uniform convergence, and learnability
Journal of the ACM | 1998-02-17 | Paper |
Efficient learning with equivalence queries of conjunctions of modulo functions
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 790976 (Why is no real title available?) | 1996-05-05 | Paper |
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
Journal of Computer and System Sciences | 1995-06-08 | Paper |
Bounds on approximate steepest descent for likelihood maximization in exponential families
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
