| Publication | Date of Publication | Type |
|---|
Learning nested differences in the presence of malicious noise
Lecture Notes in Computer Science | 2023-12-08 | Paper |
The bin covering with delivery problem, extended investigations for the online case
CEJOR. Central European Journal of Operations Research | 2023-06-22 | Paper |
A new heuristic and an exact approach for a production planning problem
CEJOR. Central European Journal of Operations Research | 2021-11-24 | Paper |
PAC-Bayesian Inequalities for Martingales
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Simulating access to hidden information while learning
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Regret bounds for restless Markov bandits
Theoretical Computer Science | 2014-10-31 | Paper |
A learning rule for very simple universal approximators consisting of a single layer of perceptrons
Neural Networks | 2013-01-17 | Paper |
Regret Bounds for Restless Markov Bandits
Lecture Notes in Computer Science | 2012-10-16 | Paper |
Near-optimal regret bounds for reinforcement learning
Journal of Machine Learning Research (JMLR) | 2012-07-13 | Paper |
UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem
Periodica Mathematica Hungarica | 2011-12-19 | Paper |
Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Models for Autonomously Motivated Exploration in Reinforcement Learning
Lecture Notes in Computer Science | 2011-10-19 | Paper |
Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Machine Learning: ECML 2004
Lecture Notes in Computer Science | 2008-03-14 | Paper |
Improved Rates for the Stochastic Continuum-Armed Bandit Problem
Learning Theory | 2008-01-03 | Paper |
A new PAC bound for intersection-closed concept classes
Machine Learning | 2007-09-20 | 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 | 2005-06-13 | Paper |
10.1162/153244303321897663
CrossRef Listing of Deleted DOIs | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2077162 (Why is no real title available?) | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 1928603 (Why is no real title available?) | 2003-06-16 | Paper |
The Nonstochastic Multiarmed Bandit Problem
SIAM Journal on Computing | 2003-01-05 | 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 |
| scientific article; zbMATH DE number 1559547 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1306865 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1306864 (Why is no real title available?) | 2000-04-26 | Paper |
Structural results about on-line learning models with and without queries
Machine Learning | 2000-01-17 | Paper |
| scientific article; zbMATH DE number 1346493 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1346495 (Why is no real title available?) | 1999-10-04 | Paper |
Tracking the best disjunction
Machine Learning | 1999-05-18 | Paper |
On-line learning with malicious noise and the closure algorithm
Annals of Mathematics and Artificial Intelligence | 1999-03-23 | Paper |
Approximating hyper-rectangles: Learning and pseudorandom sets
Journal of Computer and System Sciences | 1999-02-21 | Paper |
The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
Artificial Intelligence | 1998-08-13 | Paper |
Learning nested differences in the presence of malicious noise
Theoretical Computer Science | 1998-07-22 | Paper |
| scientific article; zbMATH DE number 878344 (Why is no real title available?) | 1997-02-17 | Paper |
Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives
Neural Computation | 1996-09-23 | Paper |
The number of points of an empirical or Poisson process covered by unions of sets
Journal of Multivariate Analysis | 1996-06-16 | Paper |
On the complexity of function learning
Machine Learning | 1995-10-29 | Paper |
On the number of points of a homogeneous Poisson process
Journal of Multivariate Analysis | 1994-10-10 | Paper |
Some limit theorems for the homogeneous Poisson process
Statistics & Probability Letters | 1992-06-27 | Paper |
| scientific article; zbMATH DE number 4188914 (Why is no real title available?) | 1990-01-01 | Paper |
The circle homogeneously covered by random walk on \({\mathbb{Z}}^ 2\)
Statistics & Probability Letters | 1990-01-01 | Paper |
