| Publication | Date of Publication | Type |
|---|
| Adversarial bandits with knapsacks | 2024-06-06 | Paper |
| Contextual Search in the Presence of Adversarial Corruptions | 2024-03-12 | Paper |
| Contextual search in the presence of irrational agents | 2023-11-14 | Paper |
| Error Adaptive Classifier Boosting (EACB): Leveraging Data-Driven Training Towards Hardware Resilience for Signal Inference | 2021-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617612 | 2019-02-06 | Paper |
| Convergence and Consistency of Regularized Boosting With Weakly Dependent Observations | 2017-06-08 | Paper |
| On the learnability of discrete distributions | 2016-09-01 | Paper |
| Explaining AdaBoost | 2015-07-20 | Paper |
| Efficient learning of typical finite automata from random walks | 2015-05-07 | Paper |
| How to use expert advice | 2015-05-07 | Paper |
| The Rate of Convergence of AdaBoost | 2014-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405255 | 2014-04-01 | Paper |
| Boosting. Foundations and algorithms. | 2012-06-26 | Paper |
| Margin-based ranking and an equivalence between AdaBoost and RankBoost | 2012-04-17 | Paper |
| Maximum entropy density estimation with generalized regularization and an application to species distribution modeling | 2011-10-12 | Paper |
| The dynamics of adaboost: cyclic behavior and convergence of margins | 2011-10-12 | Paper |
| Learning with continuous experts using drifting games | 2010-07-07 | Paper |
| On reoptimizing multi-class classifiers | 2009-03-31 | Paper |
| Learning sparse multivariate polynomials over a field with queries and counterexamples. | 2008-12-21 | Paper |
| Learning with Continuous Experts Using Drifting Games | 2008-10-14 | Paper |
| The boosting approach to machine learning: an overview | 2008-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5447534 | 2008-03-20 | Paper |
| Analysis of boosting algorithms using the smooth margin function | 2008-02-26 | Paper |
| Maximum Entropy Distribution Estimation with Generalized Regularization | 2007-09-14 | Paper |
| On the worst-case analysis of temporal-difference learning algorithms | 2006-06-29 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| 10.1162/1532443041827916 | 2004-11-05 | Paper |
| Discussion on boosting papers. | 2004-11-05 | Paper |
| Generalization bounds for averaged classifiers | 2004-09-15 | Paper |
| On‐Line Portfolio Selection Using Multiplicative Updates | 2003-02-02 | Paper |
| The Nonstochastic Multiarmed Bandit Problem | 2003-01-05 | Paper |
| Reducing multiclass to binary: A unifying approach for margin classifiers | 2002-08-05 | Paper |
| Drifting games | 2002-07-22 | Paper |
| Logistic regression, AdaBoost and Bregman distances | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526998 | 2001-02-28 | Paper |
| Large margin classification using the perceptron algorithm | 2000-09-05 | Paper |
| BoosTexter: A boosting-based system for text categorization | 2000-08-28 | Paper |
| Toward efficient agnostic learning | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252717 | 2000-04-26 | Paper |
| Improved boosting algorithms using confidence-rated predictions | 2000-03-16 | Paper |
| Adaptive game playing using multiplicative weights | 2000-02-01 | Paper |
| Boosting the margin: a new explanation for the effectiveness of voting methods | 1999-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4243442 | 1999-05-18 | Paper |
| Efficient learning of typical finite automata from random walks | 1998-06-02 | Paper |
| How to use expert advice | 1998-02-17 | Paper |
| A decision-theoretic generalization of on-line learning and an application to boosting | 1998-02-16 | Paper |
| On the worst-case analysis of temporal-difference learning algorithms | 1996-04-21 | Paper |
| Efficient distribution-free learning of probabilistic concepts | 1995-10-09 | Paper |
| Diversity-based inference of finite automata | 1995-09-10 | Paper |
| On the sample complexity of weak learning | 1995-07-10 | Paper |
| Bounds on the sample complexity of Bayesian learning using information theory and the VC dimension | 1994-03-03 | Paper |
| Learning probabilistic read-once formulas on product distributions | 1994-02-17 | Paper |
| Learning Binary Relations and Total Orders | 1993-12-20 | Paper |
| Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions | 1993-10-10 | Paper |
| Inference of finite automata using homing sequences | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013554 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013558 | 1992-09-27 | Paper |
| Lexicographic Optimization: Algorithms and Stability | N/A | Paper |
