On Bayes methods for on-line Boolean prediction
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Machine Learning - Special issue on context sensitivity and concept drift
Minimax regret under log loss for general classes of experts
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Linear relations between square-loss and Kolmogorov complexity
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Derandomizing Stochastic Prediction Strategies
Machine Learning - Special issue: computational learning theory, COLT '97
Probability theory for the Brier game
Theoretical Computer Science
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Theoretical Computer Science
Information and Computation
General linear relations between different types of predictive complexity
Theoretical Computer Science
Suboptimal measures of predictive complexity for absolute loss function
Information and Computation
Theoretical Computer Science
Worst-Case Bounds for the Logarithmic Loss of Predictors
Machine Learning
On complexity of easy predictable sequences
Information and Computation
Potential-Based Algorithms in On-Line Prediction and Game Theory
Machine Learning
Genral Linear Relations among Different Types of Predictive Complexity
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Non-linear Inequalities between Predictive and Kolmogorov Complexities
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Loss Functions, Complexities, and the Legendre Transformation
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
On the Absence of Predictive Complexity for Some Games
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Potential-Based Algorithms in Online Prediction and Game Theory
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Discrete Prediction Games with Arbitrary Feedback and Loss
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Predictive Complexity and Information
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Mixability and the Existence of Weak Complexities
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Adaptive Strategies and Regret Minimization in Arbitrarily Varying Markov Environments
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Predicting a binary sequence almost as well as the optimal biased coin
Information and Computation
The empirical Bayes envelope and regret minimization in competitive Markov decision processes
Mathematics of Operations Research
Tracking a small set of experts by mixing past posteriors
The Journal of Machine Learning Research
Loss functions, complexities, and the legendre transformation
Theoretical Computer Science - Special issue: Algorithmic learning theory
Predictive complexity and information
Journal of Computer and System Sciences - Special issue on COLT 2002
Journal of Computer and System Sciences - Special issue on COLT 2002
Using additive expert ensembles to cope with concept drift
ICML '05 Proceedings of the 22nd international conference on Machine learning
Combining expert advice in reactive environments
Journal of the ACM (JACM)
A lower bound on compression of unknown alphabets
Theoretical Computer Science
Improved second-order bounds for prediction with expert advice
Machine Learning
Regret to the best vs. regret to the average
Machine Learning
Complexity of combinatorial market makers
Proceedings of the 9th ACM conference on Electronic commerce
Prediction with expert advice for the Brier game
Proceedings of the 25th international conference on Machine learning
Online Regression Competitive with Changing Predictors
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Supermartingales in Prediction with Expert Advice
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
The weak aggregating algorithm and weak mixability
Journal of Computer and System Sciences
Predictions with Confidence in Applications
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
IEEE Transactions on Signal Processing
Prediction With Expert Advice For The Brier Game
The Journal of Machine Learning Research
Expert mixture methods for adaptive channel equalization
ICANN/ICONIP'03 Proceedings of the 2003 joint international conference on Artificial neural networks and neural information processing
Regret to the best vs. regret to the average
COLT'07 Proceedings of the 20th annual conference on Learning theory
Supermartingales in prediction with expert advice
Theoretical Computer Science
Prediction with expert evaluators' advice
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Steady-state MSE performance analysis of mixture approaches to adaptive filtering
IEEE Transactions on Signal Processing
Sharp dichotomies for regret minimization in metric spaces
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Prediction with expert advice under discounted loss
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Online multiple kernel learning: algorithms and mistake bounds
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Combining initial segments of lists
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Online allocation with risk information
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
A randomized online learning algorithm for better variance control
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Aggregating strategy for online auctions
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
The weak aggregating algorithm and weak mixability
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Improved second-order bounds for prediction with expert advice
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Optimum follow the leader algorithm
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Learning with stochastic inputs and adversarial outputs
Journal of Computer and System Sciences
Adaptive mixture methods based on Bregman divergences
Digital Signal Processing
A closer look at adaptive regret
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Predictive complexity and generalized entropy rate of stationary ergodic processes
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Online Multiple Kernel Classification
Machine Learning
Theoretical Computer Science
An identity for kernel ridge regression
Theoretical Computer Science
Online learning with multiple kernels: A review
Neural Computation
A survey on concept drift adaptation
ACM Computing Surveys (CSUR)
Combining initial segments of lists
Theoretical Computer Science
| Hi-index | 0.02 |