| 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/Q5867280 | 2022-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091718 | 2022-07-27 | Paper |
| Oracle lower bounds for stochastic gradient sampling algorithms | 2022-05-16 | Paper |
| Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity | 2022-05-16 | Paper |
| Benign overfitting in linear regression | 2022-05-05 | Paper |
| Optimal and instance-dependent guarantees for Markovian linear stochastic approximation | 2021-12-23 | 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 |
| Is there an analog of Nesterov acceleration for gradient-based MCMC? | 2021-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4998932 | 2021-07-09 | 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 |
| Derivative-Free Methods for Policy Optimization: Guarantees for Linear Quadratic Systems | 2020-10-05 | Paper |
| Sampling for Bayesian Mixture Models: MCMC with Polynomial-Time Mixing | 2019-12-11 | Paper |
| A Diffusion Process Perspective on Posterior Contraction Rates for Parameters | 2019-09-03 | Paper |
| High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm | 2019-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5381117 | 2019-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4617601 | 2019-02-06 | Paper |
| Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction | 2018-06-27 | Paper |
| Sharp convergence rates for Langevin dynamics in the nonconvex setting | 2018-05-04 | Paper |
| Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization | 2017-07-12 | Paper |
| Hit-and-Run for Sampling and Planning in Non-Convex Spaces | 2016-10-19 | Paper |
| Bounding Embeddings of VC Classes into Maximum Classes | 2016-05-13 | Paper |
| \(\ell _{1}\)-regularized linear regression: persistence and oracle inequalities | 2013-01-14 | Paper |
| Margin-adaptive model selection in statistical learning | 2012-09-19 | Paper |
| Randomized Smoothing for Stochastic Optimization | 2012-09-12 | Paper |
| Comment | 2012-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096171 | 2011-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3096172 | 2011-11-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3093234 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174098 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174109 | 2011-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3174158 | 2011-10-12 | Paper |
| On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer | 2011-03-31 | Paper |
| A Regularization Approach to Metrical Task Systems | 2010-10-01 | Paper |
| Corrigendum to ``Shifting: One-inclusion mistake bounds and sample compression | 2010-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3394764 | 2009-09-08 | Paper |
| FAST RATES FOR ESTIMATION ERROR AND ORACLE INEQUALITIES FOR MODEL SELECTION | 2009-06-11 | Paper |
| Correction to "The Importance of Convexity in Learning With Squared Loss" [Sep 98 1974-1980] | 2009-02-24 | Paper |
| Shifting: one-inclusion mistake bounds and sample compression | 2009-01-09 | Paper |
| Bounded Parameter Markov Decision Processes with Average Reward Criterion | 2008-01-03 | Paper |
| Multitask Learning with Expert Advice | 2008-01-03 | Paper |
| Convexity, Classification, and Risk Bounds | 2007-08-20 | Paper |
| Empirical minimization | 2006-06-26 | Paper |
| Learning Theory | 2006-06-22 | Paper |
| Local Rademacher complexities | 2006-01-16 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Learning Theory | 2005-06-13 | Paper |
| Discussion on boosting papers. | 2004-11-05 | Paper |
| 10.1162/153244303321897690 | 2004-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046694 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413265 | 2003-07-17 | Paper |
| Generalization error of combined classifiers. | 2003-05-14 | Paper |
| Exploiting random walks for learning | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533362 | 2002-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533363 | 2002-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3148808 | 2002-09-22 | Paper |
| Covering numbers for support vector machines | 2002-08-04 | Paper |
| Hardness results for neural network approximation problems | 2002-07-15 | Paper |
| Estimation and approximation bounds for gradient-based reinforcement learning | 2002-07-04 | Paper |
| Model selection and error estimation | 2002-04-11 | Paper |
| Direct iterative tuning via spectral analysis | 2002-01-08 | Paper |
| An inequality for uniform deviations of sample averages from their means | 2001-12-12 | Paper |
| Improved generalization through explicit optimization of margins | 2001-02-05 | Paper |
| Learning changing concepts by exploiting the structure of change | 2001-01-16 | Paper |
| Prediction, learning, uniform convergence, and scale-sensitive dimensions | 2000-09-27 | Paper |
| Function Learning from Interpolation | 2000-09-04 | Paper |
| Neural Network Learning | 2000-05-09 | Paper |
| The minimax distortion redundancy in empirical quantizer design | 1999-11-21 | Paper |
| Structural risk minimization over data-dependent hierarchies | 1999-11-21 | Paper |
| The importance of convexity in learning with squared loss | 1999-11-21 | Paper |
| Boosting the margin: a new explanation for the effectiveness of voting methods | 1999-11-09 | Paper |
| The complexity of model classes, and smoothing noisy data | 1999-01-12 | Paper |
| Optimal controller properties from closed-loop experiments | 1998-10-27 | Paper |
| The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network | 1998-08-02 | Paper |
| Covering numbers for real-valued function classes | 1998-03-22 | Paper |
| Valid Generalisation from Approximate Interpolation | 1997-07-07 | Paper |
| Efficient agnostic learning of neural networks with bounded fan-in | 1997-06-12 | Paper |
| Fat-shattering and the learnability of real-valued functions | 1996-11-26 | Paper |
