default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteffen Dereich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Steffen Dereich, Arnulf Jentzen, Adrian Riekert:
Learning rate adaptive stochastic gradient descent optimization methods: numerical simulations for deep learning methods for partial differential equations and convergence analyses. CoRR abs/2406.14340 (2024)- [i6]Steffen Dereich, Robin Graeber, Arnulf Jentzen:
Non-convergence of Adam and other adaptive stochastic gradient descent optimization methods for non-vanishing learning rates. CoRR abs/2407.08100 (2024) - [i5]Steffen Dereich, Arnulf Jentzen:
Convergence rates for the Adam optimizer. CoRR abs/2407.21078 (2024) - 2023
- [i4]Steffen Dereich, Arnulf Jentzen, Sebastian Kassing
:
On the existence of minimizers in shallow residual ReLU neural network optimization landscapes. CoRR abs/2302.14690 (2023) - [i3]Steffen Dereich, Sebastian Kassing:
On the existence of optimal shallow feedforward networks with ReLU activation. CoRR abs/2303.03950 (2023) - 2022
- [j8]Steffen Dereich, Sebastian Kassing:
On minimal representations of shallow ReLU networks. Neural Networks 148: 121-128 (2022) - 2021
- [i2]Steffen Dereich, Sebastian Kassing:
Convergence of stochastic gradient descent schemes for Lojasiewicz-landscapes. CoRR abs/2102.09385 (2021) - [i1]Steffen Dereich, Sebastian Kassing:
On minimal representations of shallow ReLU networks. CoRR abs/2108.05643 (2021)
2010 – 2019
- 2019
- [j7]Steffen Dereich, Thomas Müller-Gronbach:
General multilevel adaptations for stochastic approximation algorithms of Robbins-Monro and Polyak-Ruppert type. Numerische Mathematik 142(2): 279-328 (2019) - 2015
- [j6]Steffen Dereich, Thomas Müller-Gronbach:
Quadrature for Self-affine Distributions on Rd. Found. Comput. Math. 15(6): 1465-1500 (2015) - [j5]Steffen Dereich, Peter Mörters:
Cycle length distributions in random permutations with diverging cycle weights. Random Struct. Algorithms 46(4): 635-650 (2015) - 2014
- [j4]Steffen Dereich, Marcel Ortgiese:
Robust Analysis of Preferential Attachment Models with Fitness. Comb. Probab. Comput. 23(3): 386-411 (2014) - [c1]Steffen Dereich, Sangmeng Li:
Multilevel Monte Carlo Implementation for SDEs Driven by Truncated Stable Processes. MCQMC 2014: 3-27
2000 – 2009
- 2009
- [j3]Frank Aurzada, Steffen Dereich:
The Coding Complexity of Lévy Processes. Found. Comput. Math. 9(3): 359-390 (2009) - [j2]Jakob Creutzig, Steffen Dereich, Thomas Müller-Gronbach, Klaus Ritter:
Infinite-Dimensional Quadrature and Approximation of Distributions. Found. Comput. Math. 9(4): 391-429 (2009) - [j1]Frank Aurzada, Steffen Dereich, Michael Scheutzow, Christian Vormoor:
High resolution quantization and entropy coding of jump processes. J. Complex. 25(2): 163-187 (2009) - 2003
- [b1]Steffen Dereich:
High resolution coding of stochastic processes and small ball probabilities. Technical University of Berlin, Germany, 2003
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-08-25 20:06 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:
