Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line learning with linear loss constraints
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Worst-case quadratic loss bounds for a generalization of the Widrow-Hoff rule
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Learning binary relations using weighted majority voting
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
An optimal-control application of two paradigms of on-line learning
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Approximate methods for sequential decision making using expert advice
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Simulating access to hidden information while learning
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A game of prediction with expert advice
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Predicting nearly as well as the best pruning of a decision tree
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
A dynamic disk spin-down technique for mobile computing
MobiCom '96 Proceedings of the 2nd annual international conference on Mobile computing and networking
Predicting a binary sequence almost as well as the optimal biased coin
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
On Bayes methods for on-line Boolean prediction
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Game theory, on-line prediction and boosting
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
Context-sensitive learning methods for text categorization
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
Predicting Nearly As Well As the Best Pruning of a Decision Tree
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Journal of the ACM (JACM)
Using and combining predictors that specialize
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Derandomizing stochastic prediction strategies
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
An efficient extension to mixture techniques for prediction and decision trees
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Analysis of two gradient-based algorithms for on-line regression
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
General convergence results for linear discriminant updates
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Some label efficient learning results
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Distributed cooperative Bayesian learning strategies
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
Universal portfolios with and without transaction costs
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
On sequential prediction of individual sequences relative to a set of experts
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Minimax relative loss analysis for sequential prediction algorithms using parametric hypotheses
COLT' 98 Proceedings of the eleventh annual conference on Computational learning theory
Machine Learning - Special issue on context sensitivity and concept drift
Context-sensitive learning methods for text categorization
ACM Transactions on Information Systems (TOIS)
The robustness of the p-norm algorithms
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Minimax regret under log loss for general classes of experts
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
On prediction of individual sequences relative to a set of experts in the presence of noise
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Regret bounds for prediction problems
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
Individual sequence prediction—upper bounds and application for complexity
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Initializing RBF-networks with small subsets of training examples
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Universal Portfolios With and Without Transaction Costs
Machine Learning - Special issue: computational learning theory, COLT '97
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
General Convergence Results for Linear Discriminant Updates
Machine Learning
Worst-Case Bounds for the Logarithmic Loss of Predictors
Machine Learning
On complexity of easy predictable sequences
Information and Computation
Predicting nearly as well as the best pruning of a planar decision graph
Theoretical Computer Science
Potential-Based Algorithms in On-Line Prediction and Game Theory
Machine Learning
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Structured Weight-Based Prediction Algorithms
ALT '98 Proceedings of the 9th International Conference on Algorithmic Learning Theory
Predicting Nearly as well as the best Pruning of a Planar Decision Graph
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Extended Stochastic Complexity and Minimax Relative Loss Analysis
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
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
On the Absence of Predictive Complexity for Some Games
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Tracking a Small Set of Experts by Mixing Past Posteriors
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational 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
Learning Additive Models Online with Fast Evaluating Kernels
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
A Second-Order Perceptron Algorithm
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
Predicting a binary sequence almost as well as the optimal biased coin
Information and Computation
Tracking the best linear predictor
The Journal of Machine Learning Research
Tracking a small set of experts by mixing past posteriors
The Journal of Machine Learning Research
The Robustness of the p-Norm Algorithms
Machine Learning
Path kernels and multiplicative updates
The Journal of Machine Learning Research
Loss functions, complexities, and the legendre transformation
Theoretical Computer Science - Special issue: Algorithmic learning theory
How to Better Use Expert Advice
Machine Learning
On-line prediction with kernels and the complexity approximation principle
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Predictive complexity and information
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
Can machine learning be secure?
ASIACCS '06 Proceedings of the 2006 ACM Symposium on Information, computer and communications security
Regret Minimization Under Partial Monitoring
Mathematics of Operations Research
Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition
The Journal of Machine Learning Research
Real-time ranking with concept drift using expert advice
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
A reduction technique for nearest-neighbor classification: Small groups of examples
Intelligent Data Analysis
Improving the aggregating algorithm for regression
AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Nonstochastic bandits: Countable decision set, unbounded costs and reactive environments
Theoretical Computer Science
Prediction with expert advice for the Brier game
Proceedings of the 25th international conference on Machine learning
Consistency of discrete Bayesian learning
Theoretical Computer Science
Online Regression Competitive with Changing Predictors
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
A Method for Evaluation of Compromise in Multiple Criteria Problems
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
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
Boosting expert ensembles for rapid concept recall
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
On-line learning with linear loss constraints
Information and Computation
Discrete denoising with shifts
IEEE Transactions on Information Theory
Learning Permutations with Exponential Weights
The Journal of Machine Learning Research
Prediction With Expert Advice For The Brier Game
The Journal of Machine Learning Research
The Journal of Machine Learning Research
Aggregation by exponential weighting and sharp oracle inequalities
COLT'07 Proceedings of the 20th annual conference on Learning theory
Suboptimality of penalized empirical risk minimization in classification
COLT'07 Proceedings of the 20th annual conference on Learning theory
Competing with stationary prediction strategies
COLT'07 Proceedings of the 20th annual conference on Learning theory
Universal randomized switching
IEEE Transactions on Signal Processing
Supermartingales in prediction with expert advice
Theoretical Computer Science
The follow perturbed leader algorithm protected from unbounded one-step losses
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
Prediction with expert advice under discounted loss
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Online Learning in Case of Unbounded Losses Using Follow the Perturbed Leader Algorithm
The Journal of Machine Learning Research
Ensembles and multiple classifiers: a game-theoretic view
MCS'11 Proceedings of the 10th international conference on Multiple classifier systems
Re-adapting the regularization of weights for non-stationary regression
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Relative loss bounds for on-line density estimation with the exponential family of distributions
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Hannan consistency in on-line learning in case of unbounded losses under partial monitoring
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
The missing consistency theorem for bayesian learning: stochastic model selection
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Defensive prediction with expert advice
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Optimal oracle inequality for aggregation of classifiers under low noise condition
COLT'06 Proceedings of the 19th annual conference on Learning Theory
A randomized online learning algorithm for better variance control
COLT'06 Proceedings of the 19th annual conference on Learning Theory
The shortest path problem under partial monitoring
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Continuous experts and the binning algorithm
COLT'06 Proceedings of the 19th annual conference on Learning Theory
On-Line regression competitive with reproducing kernel hilbert spaces
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Data dependent concentration bounds for sequential prediction algorithms
COLT'05 Proceedings of the 18th annual conference on Learning Theory
The weak aggregating algorithm and weak mixability
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Tracking the best of many experts
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Online Learning and Online Convex Optimization
Foundations and Trends® in Machine Learning
Sensor fusion: from dependence analysis via matroid bases to online synthesis
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Sparse regression learning by aggregation and Langevin Monte-Carlo
Journal of Computer and System Sciences
Mixability is bayes risk curvature relative to log loss
The Journal of Machine Learning Research
The safe bayesian: learning the learning rate via the mixability gap
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
Weighted last-step min-max algorithm with improved sub-logarithmic regret
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
A closer look at adaptive regret
ALT'12 Proceedings of the 23rd international conference on Algorithmic Learning Theory
An identity for kernel ridge regression
Theoretical Computer Science
Online portfolio selection: A survey
ACM Computing Surveys (CSUR)
Hi-index | 0.08 |