| Publication | Date of Publication | Type |
|---|
| Learning nested differences in the presence of malicious noise | 2023-12-08 | Paper |
| The bin covering with delivery problem, extended investigations for the online case | 2023-06-22 | Paper |
| A new heuristic and an exact approach for a production planning problem | 2021-11-24 | Paper |
| PAC-Bayesian Inequalities for Martingales | 2017-06-08 | Paper |
| Simulating access to hidden information while learning | 2016-09-01 | Paper |
| Regret bounds for restless Markov bandits | 2014-10-31 | Paper |
| A learning rule for very simple universal approximators consisting of a single layer of perceptrons | 2013-01-17 | Paper |
| Regret Bounds for Restless Markov Bandits | 2012-10-16 | Paper |
| Near-optimal regret bounds for reinforcement learning | 2012-07-13 | Paper |
| UCB revisited: improved regret bounds for the stochastic multi-armed bandit problem | 2011-12-19 | Paper |
| Upper-Confidence-Bound Algorithms for Active Learning in Multi-armed Bandits | 2011-10-19 | Paper |
| Models for Autonomously Motivated Exploration in Reinforcement Learning | 2011-10-19 | Paper |
| Hannan Consistency in On-Line Learning in Case of Unbounded Losses Under Partial Monitoring | 2008-09-04 | Paper |
| Machine Learning: ECML 2004 | 2008-03-14 | Paper |
| Improved Rates for the Stochastic Continuum-Armed Bandit Problem | 2008-01-03 | Paper |
| A new PAC bound for intersection-closed concept classes | 2007-09-20 | Paper |
| A distributed voting scheme to maximize preferences | 2007-04-10 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| 10.1162/153244303321897663 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470555 | 2004-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4706445 | 2003-06-16 | Paper |
| The Nonstochastic Multiarmed Bandit Problem | 2003-01-05 | Paper |
| Adaptive and self-confident on-line learning algorithms | 2002-07-04 | Paper |
| Finite-time analysis of the multiarmed bandit problem | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526996 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252717 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252716 | 2000-04-26 | Paper |
| Structural results about on-line learning models with and without queries | 2000-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266516 | 1999-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266518 | 1999-10-04 | Paper |
| Tracking the best disjunction | 1999-05-18 | Paper |
| On-line learning with malicious noise and the closure algorithm | 1999-03-23 | Paper |
| Approximating hyper-rectangles: Learning and pseudorandom sets | 1999-02-21 | Paper |
| The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant | 1998-08-13 | Paper |
| Learning nested differences in the presence of malicious noise | 1998-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4877607 | 1997-02-17 | Paper |
| Degree of Approximation Results for Feedforward Networks Approximating Unknown Mappings and Their Derivatives | 1996-09-23 | Paper |
| The number of points of an empirical or Poisson process covered by unions of sets | 1996-06-16 | Paper |
| On the complexity of function learning | 1995-10-29 | Paper |
| On the number of points of a homogeneous Poisson process | 1994-10-10 | Paper |
| Some limit theorems for the homogeneous Poisson process | 1992-06-27 | Paper |
| The circle homogeneously covered by random walk on \({\mathbb{Z}}^ 2\) | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753307 | 1990-01-01 | Paper |
