| Publication | Date of Publication | Type |
|---|
Corrigendum to: ``Prediction, learning, uniform convergence, and scale-sensitive dimensions
Journal of Computer and System Sciences | 2024-01-04 | Paper |
scientific article; zbMATH DE number 7626719 (Why is no real title available?)
| 2022-12-06 | Paper |
Density estimation for shift-invariant multidimensional distributions
| 2022-07-18 | Paper |
The Perils of Being Unhinged: On the Accuracy of Classifiers Minimizing a Noise-Robust Convex Loss
Neural Computation | 2022-06-13 | Paper |
Oracle lower bounds for stochastic gradient sampling algorithms
Bernoulli | 2022-05-16 | Paper |
Benign overfitting in linear regression
Proceedings of the National Academy of Sciences | 2022-05-05 | Paper |
Superlinear Integrality Gaps for the Minimum Majority Problem
SIAM Journal on Discrete Mathematics | 2022-01-07 | Paper |
scientific article; zbMATH DE number 7415102 (Why is no real title available?)
| 2021-10-27 | Paper |
Gradient descent with identity initialization efficiently learns positive-definite linear transformations by deep residual networks
Neural Computation | 2021-10-01 | Paper |
scientific article; zbMATH DE number 7370646 (Why is no real title available?)
| 2021-07-09 | Paper |
scientific article; zbMATH DE number 7307484 (Why is no real title available?)
| 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
Neural Computation | 2020-02-07 | Paper |
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning
Theoretical Computer Science | 2020-01-29 | Paper |
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning
| 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
Journal of the ACM | 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
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | 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 |
On the inductive bias of dropout
Journal of Machine Learning Research (JMLR) | 2016-02-19 | Paper |
The power of localization for efficiently learning linear separators with noise
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On the Weight of Halfspaces over Hamming Balls
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
scientific article; zbMATH DE number 6378047 (Why is no real title available?)
| 2014-12-08 | Paper |
scientific article; zbMATH DE number 6276178 (Why is no real title available?)
| 2014-04-01 | Paper |
Linear classifiers are nearly optimal when hidden variables have diverse effects
Machine Learning | 2012-05-23 | Paper |
Learning halfspaces with malicious noise
Journal of Machine Learning Research (JMLR) | 2012-04-17 | Paper |
scientific article; zbMATH DE number 5957493 (Why is no real title available?)
| 2011-10-12 | Paper |
Random classification noise defeats all convex potential boosters
Machine Learning | 2010-10-07 | Paper |
Improved bounds about on-line learning of smooth functions of a single variable
Lecture Notes in Computer Science | 2010-04-27 | Paper |
Discriminative learning can succeed where generative learning fails
Information Processing Letters | 2010-03-24 | Paper |
Learning Theory and Kernel Machines
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Baum’s Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
Using the doubling dimension to analyze the generalization of learning algorithms
Journal of Computer and System Sciences | 2009-07-24 | Paper |
Learning Halfspaces with Malicious Noise
Automata, Languages and Programming | 2009-07-14 | Paper |
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
Information Processing Letters | 2009-04-28 | Paper |
Editors’ Introduction
Lecture Notes in Computer Science | 2008-09-04 | Paper |
Online Multitask Learning
Learning Theory | 2007-09-14 | Paper |
Discriminative Learning Can Succeed Where Generative Learning Fails
Learning Theory | 2007-09-14 | Paper |
Learning Theory
Lecture Notes in Computer Science | 2006-06-22 | Paper |
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences | 2005-06-13 | Paper |
Reinforcement learning with immediate rewards and linear hypotheses
Algorithmica | 2005-02-11 | Paper |
Efficient algorithms for learning functions with bounded variation
Information and Computation | 2004-11-23 | Paper |
Boosting and microarray data
Machine Learning | 2003-08-20 | Paper |
On the difficulty of approximately maximizing agreements.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
A theoretical analysis of query selection for collaborative filtering
Machine Learning | 2003-06-25 | Paper |
Apple tasting.
Information and Computation | 2003-01-14 | Paper |
On-line learning with linear loss constraints.
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1830719 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1804121 (Why is no real title available?)
| 2002-09-22 | Paper |
scientific article; zbMATH DE number 1804109 (Why is no real title available?)
| 2002-09-22 | Paper |
scientific article; zbMATH DE number 1804122 (Why is no real title available?)
| 2002-09-22 | Paper |
The one-inclusion graph algorithm is near-optimal for the prediction model of learning
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
The relaxed online maximum margin algorithm
Machine Learning | 2002-04-11 | Paper |
scientific article; zbMATH DE number 1256687 (Why is no real title available?)
| 2002-01-20 | Paper |
Improved bounds on the sample complexity of learning
Journal of Computer and System Sciences | 2001-09-09 | Paper |
scientific article; zbMATH DE number 1559547 (Why is no real title available?)
| 2001-02-28 | Paper |
Prediction, learning, uniform convergence, and scale-sensitive dimensions
Journal of Computer and System Sciences | 2000-09-27 | Paper |
Improved bounds about on-line learning of smooth-functions of a single variable
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1445318 (Why is no real title available?)
| 2000-05-10 | Paper |
The complexity of learning according to two models of a drifting environment
Machine Learning | 2000-03-16 | Paper |
Structural results about on-line learning models with and without queries
Machine Learning | 2000-01-17 | Paper |
Approximating hyper-rectangles: Learning and pseudorandom sets
Journal of Computer and System Sciences | 1999-02-21 | Paper |
On the complexity of learning from drifting distributions
Information and Computation | 1998-05-25 | Paper |
PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples
Machine Learning | 1998-04-02 | Paper |
On-line learning of smooth functions of a single variable
Theoretical Computer Science | 1997-02-28 | Paper |
Fat-shattering and the learnability of real-valued functions
Journal of Computer and System Sciences | 1996-11-26 | Paper |
A generalization of Sauer's lemma
Journal of Combinatorial Theory. Series A | 1996-02-11 | Paper |
On the complexity of function learning
Machine Learning | 1995-10-29 | Paper |
Composite geometric concepts and polynomial predictability
Information and Computation | 1995-10-03 | Paper |
Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
Journal of Computer and System Sciences | 1995-06-08 | Paper |
On-line learning of linear functions
Computational Complexity | 1995-04-20 | Paper |
Halfspace learning, linear programming, and nonmalicious distributions
Information Processing Letters | 1994-11-03 | Paper |
Tracking drifting concepts by minimizing disagreements
Machine Learning | 1994-03-03 | Paper |
