default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaron Sanders
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i8]Thomas van Vuren, Thomas Cronk, Jaron Sanders:
Estimating the number of clusters of a Block Markov Chain. CoRR abs/2407.18287 (2024)- 2023
- [c5]Gianluca Kosmella, Jaron Sanders
, Bin Shi, Ripalta Stabile:
Higher-Accuracy Photonic Neural Networks via Duplication Schemes for Noise Reduction. PSC 2023: 1-4 - [i7]Gianluca Kosmella, Ripalta Stabile, Jaron Sanders:
Noise-Resilient Designs for Optical Neural Networks. CoRR abs/2308.06182 (2023) - [i6]Céline Comte, Matthieu Jonckheere, Jaron Sanders, Albert Senen-Cerda:
Score-Aware Policy-Gradient Methods and Performance Guarantees using Local Lyapunov Conditions: Applications to Product-Form Stochastic Networks and Queueing Systems. CoRR abs/2312.02804 (2023) - 2022
- [j5]Oxana A. Manita, Mark A. Peletier, Jacobus W. Portegies, Jaron Sanders, Albert Senen-Cerda:
Universal Approximation in Dropout Neural Networks. J. Mach. Learn. Res. 23: 19:1-19:46 (2022) - [j4]Albert Senen-Cerda, Jaron Sanders:
Asymptotic Convergence Rate of Dropout on Shallow Linear Neural Networks. Proc. ACM Meas. Anal. Comput. Syst. 6(2): 32:1-32:53 (2022) - [c4]Albert Senen-Cerda, Jaron Sanders:
Asymptotic Convergence Rate of Dropout on Shallow Linear Neural Networks. SIGMETRICS (Abstracts) 2022: 105-106 - [i5]Alexander Van Werde, Albert Senen-Cerda, Gianluca Kosmella, Jaron Sanders:
Detection and Evaluation of Clusters within Sequential Data. CoRR abs/2210.01679 (2022) - 2021
- [c3]Long Ma, Jaron Sanders:
Markov Chains and Hitting Times for Error Accumulation in Quantum Circuits. VALUETOOLS 2021: 36-55 - 2020
- [i4]Albert Senen-Cerda, Jaron Sanders:
Almost Sure Convergence of Dropout Algorithms for Neural Networks. CoRR abs/2002.02247 (2020) - [i3]Albert Senen-Cerda, Jaron Sanders:
Asymptotic convergence rate of Dropout on shallow linear neural networks. CoRR abs/2012.01978 (2020) - [i2]Oxana A. Manita, Mark A. Peletier, Jacobus W. Portegies, Jaron Sanders, Albert Senen-Cerda:
Universal Approximation in Dropout Neural Networks. CoRR abs/2012.10351 (2020)
2010 – 2019
- 2017
- [i1]Jaron Sanders, Alexandre Proutière, Se-Young Yun:
Clustering in Block Markov Chains. CoRR abs/1712.09232 (2017) - 2016
- [j3]Jaron Sanders, Sem C. Borst, A. J. E. M. Janssen, J. S. H. van Leeuwaarden:
Optimality gaps in asymptotic dimensioning of many-server systems. Oper. Res. Lett. 44(3): 359-365 (2016) - [j2]Jaron Sanders, Sem C. Borst, Johan S. H. van Leeuwaarden:
Online Network Optimization Using Product-Form Markov Processes. IEEE Trans. Autom. Control. 61(7): 1838-1853 (2016) - 2013
- [j1]A. J. E. M. Janssen, J. S. H. van Leeuwaarden, Jaron Sanders:
Scaled control in the QED regime. Perform. Evaluation 70(10): 750-769 (2013) - 2012
- [c2]Jaron Sanders, Sem C. Borst, Johan van Leeuwaarden:
Achievable performance in product-form networks. Allerton Conference 2012: 928-935 - [c1]Jaron Sanders, Sem C. Borst, Johan van Leeuwaarden:
Online optimization of product-form networks. VALUETOOLS 2012: 21-30
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-07 21:22 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:
