| Publication | Date of Publication | Type |
|---|
| Corrigendum to: ``Prediction, learning, uniform convergence, and scale-sensitive dimensions | 2024-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5053192 | 2022-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090402 | 2022-07-18 | Paper |
| The Perils of Being Unhinged: On the Accuracy of Classifiers Minimizing a Noise-Robust Convex Loss | 2022-06-13 | Paper |
| Oracle lower bounds for stochastic gradient sampling algorithms | 2022-05-16 | Paper |
| Benign overfitting in linear regression | 2022-05-05 | Paper |
| Superlinear Integrality Gaps for the Minimum Majority Problem | 2022-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5159434 | 2021-10-27 | Paper |
| Gradient Descent with Identity Initialization Efficiently Learns Positive-Definite Linear Transformations by Deep Residual Networks | 2021-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4999109 | 2021-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5149248 | 2021-02-08 | Paper |
| When does gradient descent with logistic loss find interpolating two-layer networks? | 2020-12-04 | Paper |
| Failures of model-dependent generalization bounds for least-norm interpolation | 2020-10-16 | Paper |
| Finite-sample Analysis of Interpolating Linear Classifiers in the Overparameterized Regime | 2020-04-24 | Paper |
| On the Effect of the Activation Function on the Distribution of Hidden Nodes in a Deep Network | 2020-02-07 | Paper |
| New bounds on the price of bandit feedback for mistake-bounded online multiclass learning | 2020-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4645634 | 2019-01-10 | Paper |
| Surprising properties of dropout in deep networks | 2018-11-22 | Paper |
| The Power of Localization for Efficiently Learning Linear Separators with Noise | 2018-08-02 | Paper |
| Learning Sums of Independent Random Variables with Sparse Collective Support | 2018-07-18 | Paper |
| Low-weight halfspaces for sparse boolean vectors | 2017-05-16 | Paper |
| Simulating access to hidden information while learning | 2016-09-01 | Paper |
| On the Inductive Bias of Dropout | 2016-02-19 | Paper |
| The Power of Localization for Efficiently Learning Linear Separators with Noise | 2015-06-26 | Paper |
| On the Weight of Halfspaces over Hamming Balls | 2014-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2933930 | 2014-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405187 | 2014-04-01 | Paper |
| Linear classifiers are nearly optimal when hidden variables have diverse effects | 2012-05-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2880992 | 2012-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174156 | 2011-10-12 | Paper |
| Random classification noise defeats all convex potential boosters | 2010-10-07 | Paper |
| Improved bounds about on-line learning of smooth functions of a single variable | 2010-04-27 | Paper |
| Discriminative learning can succeed where generative learning fails | 2010-03-24 | Paper |
| Learning Theory and Kernel Machines | 2010-03-23 | Paper |
| Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions | 2009-10-28 | Paper |
| Using the doubling dimension to analyze the generalization of learning algorithms | 2009-07-24 | Paper |
| Learning Halfspaces with Malicious Noise | 2009-07-14 | Paper |
| An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution | 2009-04-28 | Paper |
| Editors’ Introduction | 2008-09-04 | Paper |
| Discriminative Learning Can Succeed Where Generative Learning Fails | 2007-09-14 | Paper |
| Online Multitask Learning | 2007-09-14 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Performance guarantees for hierarchical clustering | 2005-06-13 | Paper |
| Reinforcement learning with immediate rewards and linear hypotheses | 2005-02-11 | Paper |
| Efficient algorithms for learning functions with bounded variation | 2004-11-23 | Paper |
| Boosting and microarray data | 2003-08-20 | Paper |
| On the difficulty of approximately maximizing agreements. | 2003-08-19 | Paper |
| A theoretical analysis of query selection for collaborative filtering | 2003-06-25 | Paper |
| Apple tasting. | 2003-01-14 | Paper |
| On-line learning with linear loss constraints. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778540 | 2002-11-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148811 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148823 | 2002-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148824 | 2002-09-22 | Paper |
| The one-inclusion graph algorithm is near-optimal for the prediction model of learning | 2002-08-04 | Paper |
| The relaxed online maximum margin algorithm | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230374 | 2002-01-20 | Paper |
| Improved bounds on the sample complexity of learning | 2001-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526996 | 2001-02-28 | Paper |
| Prediction, learning, uniform convergence, and scale-sensitive dimensions | 2000-09-27 | Paper |
| Improved bounds about on-line learning of smooth-functions of a single variable | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4952633 | 2000-05-10 | Paper |
| The complexity of learning according to two models of a drifting environment | 2000-03-16 | Paper |
| Structural results about on-line learning models with and without queries | 2000-01-17 | Paper |
| Approximating hyper-rectangles: Learning and pseudorandom sets | 1999-02-21 | Paper |
| On the complexity of learning from drifting distributions | 1998-05-25 | Paper |
| PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples | 1998-04-02 | Paper |
| On-line learning of smooth functions of a single variable | 1997-02-28 | Paper |
| Fat-shattering and the learnability of real-valued functions | 1996-11-26 | Paper |
| A generalization of Sauer's lemma | 1996-02-11 | Paper |
| On the complexity of function learning | 1995-10-29 | Paper |
| Composite geometric concepts and polynomial predictability | 1995-10-03 | Paper |
| Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions | 1995-06-08 | Paper |
| On-line learning of linear functions | 1995-04-20 | Paper |
| Halfspace learning, linear programming, and nonmalicious distributions | 1994-11-03 | Paper |
| Tracking drifting concepts by minimizing disagreements | 1994-03-03 | Paper |
