| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7561527 (Why is no real title available?)
| 2022-07-21 | Paper |
Unlabeled sample compression schemes and corner peelings for ample and maximum classes
Journal of Computer and System Sciences | 2022-04-04 | Paper |
Mistake bounds on the noise-free multi-armed bandit game
Information and Computation | 2019-12-18 | Paper |
Reverse iterative volume sampling for linear regression
| 2018-11-21 | Paper |
Learning rotations with little regret
Machine Learning | 2018-01-12 | Paper |
The p-norm generalization of the LMS algorithm for adaptive filtering
IEEE Transactions on Signal Processing | 2017-10-30 | Paper |
Online PCA with optimal regret
Journal of Machine Learning Research (JMLR) | 2016-11-22 | Paper |
Labeled compression schemes for extremal classes
Lecture Notes in Computer Science | 2016-11-09 | Paper |
Noise free multi-armed bandit game
Language and Automata Theory and Applications | 2016-04-13 | Paper |
How to use expert advice
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Kernelization of matrix updates, when and how?
Theoretical Computer Science | 2014-10-31 | Paper |
Combining initial segments of lists
Theoretical Computer Science | 2014-01-13 | Paper |
Online PCA with optimal regrets
Lecture Notes in Computer Science | 2013-11-06 | Paper |
Kernelization of matrix updates, when and how?
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Online variance minimization
Machine Learning | 2012-05-23 | Paper |
Learning permutations with exponential weights
Journal of Machine Learning Research (JMLR) | 2012-04-17 | Paper |
Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension
| 2011-11-08 | Paper |
Combining initial segments of lists
Lecture Notes in Computer Science | 2011-10-19 | Paper |
scientific article; zbMATH DE number 5957285 (Why is no real title available?)
| 2011-10-12 | Paper |
Efficient margin maximizing with boosting
| 2011-10-12 | Paper |
Unlabeled compression schemes for maximum classes
| 2011-10-12 | Paper |
Bayesian generalized probability calculus for density matrices
Machine Learning | 2010-10-07 | Paper |
Entropy Regularized LPBoost
Lecture Notes in Computer Science | 2008-10-14 | Paper |
Learning Permutations with Exponential Weights
Learning Theory | 2008-01-03 | Paper |
When Is There a Free Matrix Lunch?
Learning Theory | 2008-01-03 | Paper |
Online Variance Minimization
Learning Theory | 2007-09-14 | Paper |
Continuous Experts and the Binning Algorithm
Learning Theory | 2007-09-14 | Paper |
Can Entropic Regularization Be Replaced by Squared Euclidean Distance Plus Additional Linear Constraints
Learning Theory | 2007-09-14 | Paper |
On the worst-case analysis of temporal-difference learning algorithms
Machine Learning | 2006-06-29 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2005-06-13 | Paper |
10.1162/153244303321897654
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
10.1162/1532443041424328
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
scientific article; zbMATH DE number 2089372 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2089355 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2080456 (Why is no real title available?)
| 2004-08-04 | Paper |
Relative loss bounds for temporal-difference learning
Machine Learning | 2003-08-06 | Paper |
Predicting nearly as well as the best pruning of a planar decision graph.
Theoretical Computer Science | 2003-01-21 | Paper |
scientific article; zbMATH DE number 1804096 (Why is no real title available?)
| 2002-09-22 | Paper |
Relative loss bounds for on-line density estimation with the exponential family of distributions
Machine Learning | 2002-07-22 | Paper |
Direct and indirect algorithms for on-line learning of disjunctions
Theoretical Computer Science | 2002-07-15 | Paper |
Relative expected instantaneous loss bounds
Journal of Computer and System Sciences | 2002-07-04 | Paper |
Relative loss bounds for multidimensional regression problems
Machine Learning | 2002-04-11 | Paper |
Tracking the best linear predictor
Journal of Machine Learning Research (JMLR) | 2002-04-03 | Paper |
scientific article; zbMATH DE number 1263196 (Why is no real title available?)
| 2001-11-19 | Paper |
scientific article; zbMATH DE number 1559549 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1453050 (Why is no real title available?)
| 2000-05-25 | Paper |
scientific article; zbMATH DE number 1306864 (Why is no real title available?)
| 2000-04-26 | Paper |
Sequential prediction of individual sequences under general loss functions
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Tracking the best disjunction
Machine Learning | 1999-05-18 | Paper |
Tracking the best expert
Machine Learning | 1999-01-17 | Paper |
The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
Artificial Intelligence | 1998-08-13 | Paper |
Efficient learning with virtual threshold gates
Information and Computation | 1998-04-26 | Paper |
How to use expert advice
Journal of the ACM | 1998-02-17 | Paper |
Exponentiated gradient versus gradient descent for linear predictors
Information and Computation | 1997-10-19 | Paper |
scientific article; zbMATH DE number 940825 (Why is no real title available?)
| 1996-12-04 | Paper |
On weak learning
Journal of Computer and System Sciences | 1996-04-29 | Paper |
On the worst-case analysis of temporal-difference learning algorithms
Machine Learning | 1996-04-21 | Paper |
Learning binary relations using weighted majority voting
Machine Learning | 1995-10-29 | Paper |
Composite geometric concepts and polynomial predictability
Information and Computation | 1995-10-03 | Paper |
On-line learning of linear functions
Computational Complexity | 1995-04-20 | Paper |
Bounds on approximate steepest descent for likelihood maximization in exponential families
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Predicting \(\{ 0,1\}\)-functions on randomly drawn points
Information and Computation | 1995-02-16 | Paper |
The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
Information and Computation | 1994-02-22 | Paper |
The weighted majority algorithm
Information and Computation | 1994-01-01 | Paper |
Gap Theorems for Distributed Computation
SIAM Journal on Computing | 1993-05-17 | Paper |
The minimum consistent DFA problem cannot be approximated within any polynomial
Journal of the ACM | 1993-05-16 | Paper |
On the computational complexity of approximating distributions by probabilistic automata
Machine Learning | 1993-04-01 | Paper |
scientific article; zbMATH DE number 67638 (Why is no real title available?)
| 1992-09-27 | Paper |
Equivalence of models for polynomial learnability
Information and Computation | 1992-06-28 | Paper |
scientific article; zbMATH DE number 17531 (Why is no real title available?)
| 1992-06-26 | Paper |
The \((n^ 2-1)\)-puzzle and related relocation problems
Journal of Symbolic Computation | 1990-01-01 | Paper |
Prediction-preserving reducibility
Journal of Computer and System Sciences | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4135722 (Why is no real title available?)
| 1990-01-01 | Paper |
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM | 1989-01-01 | Paper |
A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
SIAM Journal on Computing | 1989-01-01 | Paper |
Scattered versus context-sensitive rewriting
Acta Informatica | 1989-01-01 | Paper |
Parallel approximation algorithms for bin packing
Information and Computation | 1989-01-01 | Paper |
Computing on an anonymous ring
Journal of the ACM | 1988-01-01 | Paper |
Occam's razor
Information Processing Letters | 1987-01-01 | Paper |
Membership for growing context-sensitive grammars is polynomial
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Manipulating derivation forests by scheduling techniques
Theoretical Computer Science | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3958759 (Why is no real title available?)
| 1986-01-01 | Paper |
Applications of scheduling theory to formal language theory
Theoretical Computer Science | 1985-01-01 | Paper |
Profile Scheduling of Opposing Forests and Level Orders
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
Scheduling Flat Graphs
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3900151 (Why is no real title available?)
| 1985-01-01 | Paper |
On the complexity of iterated shuffle
Journal of Computer and System Sciences | 1984-01-01 | Paper |
Scheduling precedence graphs of bounded height
Journal of Algorithms | 1984-01-01 | Paper |
