default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimo Klock
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Massimo Fornasier, Timo Klock, Konstantin Riedl:
Consensus-Based Optimization Methods Converge Globally. SIAM J. Optim. 34(3): 2973-3004 (2024)- 2021
- [j1]Alexander Cloninger, Timo Klock
:
A deep network construction that adapts to intrinsic dimensionality beyond the domain. Neural Networks 141: 404-419 (2021)
Conference and Workshop Papers
- 2022
- [c2]Massimo Fornasier, Timo Klock, Konstantin Riedl:
Convergence of Anisotropic Consensus-Based Optimization in Mean-Field Law. EvoApplications 2022: 738-754 - 2021
- [c1]Joe Kileel, Timo Klock, João M. Pereira:
Landscape analysis of an improved power method for tensor decomposition. NeurIPS 2021: 6253-6265
Informal and Other Publications
- 2023
- [i11]Konstantin Riedl, Timo Klock, Carina Geldhauser, Massimo Fornasier:
Gradient is All You Need? CoRR abs/2306.09778 (2023) - 2022
- [i10]Stefan C. Schonsheck, Scott Mahan, Timo Klock, Alexander Cloninger, Rongjie Lai:
Semi-Supervised Manifold Learning with Complexity Decoupled Chart Autoencoders. CoRR abs/2208.10570 (2022) - [i9]Massimo Fornasier, Timo Klock, Marco Mondelli, Michael Rauchensteiner:
Finite Sample Identification of Wide Shallow Neural Networks with Biases. CoRR abs/2211.04589 (2022) - 2021
- [i8]Christian Fiedler, Massimo Fornasier, Timo Klock, Michael Rauchensteiner:
Stable Recovery of Entangled Weights: Towards Robust Identification of Deep Neural Networks from Minimal Samples. CoRR abs/2101.07150 (2021) - [i7]Massimo Fornasier, Timo Klock, Konstantin Riedl:
Consensus-based optimization methods converge globally in mean-field law. CoRR abs/2103.15130 (2021) - [i6]Joe Kileel, Timo Klock, João M. Pereira:
Landscape analysis of an improved power method for tensor decomposition. CoRR abs/2110.15821 (2021) - [i5]Massimo Fornasier, Timo Klock, Konstantin Riedl:
Convergence of Anisotropic Consensus-Based Optimization in Mean-Field Law. CoRR abs/2111.08136 (2021) - 2020
- [i4]Alexander Cloninger, Timo Klock:
ReLU nets adapt to intrinsic dimensionality beyond the target domain. CoRR abs/2008.02545 (2020) - 2019
- [i3]Zeljko Kereta, Timo Klock, Valeriya Naumova:
Nonlinear generalization of the single index model. CoRR abs/1902.09024 (2019) - [i2]Massimo Fornasier, Timo Klock, Michael Rauchensteiner:
Robust and Resource Efficient Identification of Two Hidden Layer Neural Networks. CoRR abs/1907.00485 (2019) - 2017
- [i1]Markus Grasmair, Timo Klock, Valeriya Naumova:
Adaptive multi-penalty regularization based on a generalized Lasso path. CoRR abs/1710.03971 (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-09-21 01:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
