default search action
Johannes Schmidt-Hieber
Person information
- affiliation: University of Twente, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Gabriel Clara, Sophie Langer, Johannes Schmidt-Hieber:
Dropout Regularization Versus l2-Penalization in the Linear Model. J. Mach. Learn. Res. 25: 204:1-204:48 (2024) - [i12]Jiaqi Li, Johannes Schmidt-Hieber, Wei Biao Wu:
Asymptotics of Stochastic Gradient Descent with Dropout Regularization in Linear Models. CoRR abs/2409.07434 (2024) - 2023
- [j4]Gianluca Finocchio, Johannes Schmidt-Hieber:
Posterior Contraction for Deep Gaussian Process Priors. J. Mach. Learn. Res. 24: 66:1-66:49 (2023) - [j3]Masaaki Imaizumi, Johannes Schmidt-Hieber:
On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization. IEEE Trans. Inf. Theory 69(2): 1203-1223 (2023) - [i11]Johannes Schmidt-Hieber:
Interpreting learning in biological neural networks as zero-order optimization method. CoRR abs/2301.11777 (2023) - [i10]Alexis Derumigny, Johannes Schmidt-Hieber:
Codivergences and information matrices. CoRR abs/2303.08122 (2023) - [i9]Thijs Bos, Johannes Schmidt-Hieber:
Convergence guarantees for forward gradient descent in the linear regression model. CoRR abs/2309.15001 (2023) - [i8]Johannes Schmidt-Hieber, Wouter M. Koolen:
Hebbian learning inspired estimation of the linear regression parameters from queries. CoRR abs/2311.03483 (2023) - 2022
- [c1]Matteo Giordano, Kolyan Ray, Johannes Schmidt-Hieber:
On the inability of Gaussian process regression to optimally learn compositional functions. NeurIPS 2022 - [i7]Masaaki Imaizumi, Johannes Schmidt-Hieber:
On generalization bounds for deep networks based on loss surface implicit regularization. CoRR abs/2201.04545 (2022) - [i6]Matteo Giordano, Kolyan Ray, Johannes Schmidt-Hieber:
On the inability of Gaussian process regression to optimally learn compositional functions. CoRR abs/2205.07764 (2022) - 2021
- [j2]Johannes Schmidt-Hieber:
The Kolmogorov-Arnold representation theorem revisited. Neural Networks 137: 119-126 (2021) - [i5]Thijs Bos, Johannes Schmidt-Hieber:
Convergence rates of deep ReLU networks for multiclass classification. CoRR abs/2108.00969 (2021) - 2020
- [i4]Johannes Schmidt-Hieber:
The Kolmogorov-Arnold representation theorem revisited. CoRR abs/2007.15884 (2020)
2010 – 2019
- 2019
- [j1]Konstantin Eckle, Johannes Schmidt-Hieber:
A comparison of deep networks with ReLU activation function and linear spline-type methods. Neural Networks 110: 232-242 (2019) - [i3]Johannes Schmidt-Hieber:
Deep ReLU network approximation of functions on a manifold. CoRR abs/1908.00695 (2019) - 2018
- [i2]Konstantin Eckle, Johannes Schmidt-Hieber:
A comparison of deep networks with ReLU activation function and linear spline-type methods. CoRR abs/1804.02253 (2018) - 2017
- [i1]Johannes Schmidt-Hieber:
Nonparametric regression using deep neural networks with ReLU activation function. CoRR abs/1708.06633 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint