default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSemih Cayci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Semih Cayci
, Niao He, R. Srikant:
Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation. SIAM J. Optim. 34(3): 2729-2755 (2024)- [j6]Semih Cayci, Niao He, R. Srikant:
Finite-Time Analysis of Natural Actor-Critic for POMDPs. SIAM J. Math. Data Sci. 6(4): 869-896 (2024) - [j5]Semih Cayci, Niao He, R. Srikant:
Finite-Time Analysis of Entropy-Regularized Neural Natural Actor-Critic Algorithm. Trans. Mach. Learn. Res. 2024 (2024) - [j4]Yilin Zheng, Semih Cayci, Atilla Eryilmaz:
Fast Online Learning of Vulnerabilities for Networks With Propagating Failures. IEEE/ACM Trans. Netw. 32(5): 4025-4039 (2024) - [i15]Semih Cayci, Atilla Eryilmaz:
Convergence of Gradient Descent for Recurrent Neural Networks: A Nonasymptotic Analysis. CoRR abs/2402.12241 (2024) - [i14]Johannes Müller, Semih Cayci, Guido Montúfar:
Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients. CoRR abs/2403.19448 (2024) - [i13]Semih Cayci, Atilla Eryilmaz:
Recurrent Natural Policy Gradient for POMDPs. CoRR abs/2405.18221 (2024) - [i12]Johannes Müller, Semih Cayci:
Essentially Sharp Estimates on the Entropy Regularization Error in Discrete Discounted Markov Decision Processes. CoRR abs/2406.04163 (2024) - 2023
- [j3]Semih Cayci, Siddhartha Satpathi, Niao He, R. Srikant:
Sample Complexity and Overparameterization Bounds for Temporal-Difference Learning With Neural Network Approximation. IEEE Trans. Autom. Control. 68(5): 2891-2905 (2023) - [c12]Batuhan Yardim, Semih Cayci, Matthieu Geist, Niao He:
Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Games. ICML 2023: 39722-39754 - [c11]Semih Cayci, Atilla Eryilmaz:
Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards. NeurIPS 2023 - [i11]Semih Cayci, Atilla Eryilmaz:
Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards. CoRR abs/2306.11455 (2023) - 2022
- [c10]Semih Cayci, Yilin Zheng, Atilla Eryilmaz:
A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback. AAAI 2022: 3716-3723 - [i10]Semih Cayci, Niao He, R. Srikant:
Learning to Control Partially Observed Systems with Finite Memory. CoRR abs/2202.09753 (2022) - [i9]Semih Cayci, Niao He, R. Srikant:
Finite-Time Analysis of Entropy-Regularized Neural Natural Actor-Critic Algorithm. CoRR abs/2206.00833 (2022) - [i8]Batuhan Yardim, Semih Cayci, Matthieu Geist, Niao He:
Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Games. CoRR abs/2212.14449 (2022) - 2021
- [i7]Semih Cayci, Siddhartha Satpathi, Niao He, R. Srikant:
Sample Complexity and Overparameterization Bounds for Projection-Free Neural TD Learning. CoRR abs/2103.01391 (2021) - [i6]Semih Cayci, Niao He, R. Srikant:
Linear Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation. CoRR abs/2106.04096 (2021) - [i5]Semih Cayci, Yilin Zheng, Atilla Eryilmaz:
A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback. CoRR abs/2106.05165 (2021) - 2020
- [c9]Semih Cayci, Atilla Eryilmaz, R. Srikant:
Budget-Constrained Bandits over General Cost and Reward Distributions. AISTATS 2020: 4388-4398 - [c8]Semih Cayci, Swati Gupta, Atilla Eryilmaz:
Group-Fair Online Allocation in Continuous Time. NeurIPS 2020 - [i4]Semih Cayci, Atilla Eryilmaz, R. Srikant:
Budget-Constrained Bandits over General Cost and Reward Distributions. CoRR abs/2003.00365 (2020) - [i3]Semih Cayci, Swati Gupta, Atilla Eryilmaz:
Group-Fair Online Allocation in Continuous Time. CoRR abs/2006.06852 (2020) - [i2]Semih Cayci, Atilla Eryilmaz, R. Srikant:
Continuous-Time Multi-Armed Bandits with Controlled Restarts. CoRR abs/2007.00081 (2020)
2010 – 2019
- 2019
- [j2]Semih Cayci, Atilla Eryilmaz, R. Srikant:
Learning to Control Renewal Processes with Bandit Feedback. Proc. ACM Meas. Anal. Comput. Syst. 3(2): 43:1-43:32 (2019) - [j1]Semih Cayci, Atilla Eryilmaz:
Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks. IEEE/ACM Trans. Netw. 27(3): 1043-1054 (2019) - [c7]Semih Cayci, Toshiaki Koike-Akino, Ye Wang:
Nonbinary Polar Coding for Multilevel Modulation. OFC 2019: 1-3 - [c6]Toshiaki Koike-Akino, Ye Wang, Semih Cayci, David S. Millar, Keisuke Kojima, Kieran Parsons:
Hardware-Efficient Quantized Polar Decoding with Optimized Lookup Table. OECC/PSC 2019: 1-3 - [c5]Semih Cayci, Atilla Eryilmaz, Rayadurgam Srikant:
Learning to Control Renewal Processes with Bandit Feedback. SIGMETRICS (Abstracts) 2019: 41-42 - 2018
- [i1]Semih Cayci, Atilla Eryilmaz:
Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks. CoRR abs/1811.10829 (2018) - 2017
- [c4]Semih Cayci, Atilla Eryilmaz:
Learning for serving deadline-constrained traffic in multi-channel wireless networks. WiOpt 2017: 1-8 - 2016
- [c3]Semih Cayci, Atilla Eryilmaz:
On the Multi-Channel Capacity Gains of Millimeter-Wave Communication. GLOBECOM 2016: 1-6 - 2013
- [c2]Semih Cayci, Orhan Arikan:
Lossless polar compression of g-ary sources. ISIT 2013: 1132-1136 - 2012
- [c1]Semih Cayci, Orhan Arikan, Erdal Arikan:
Polar code construction for non-binary source alphabets. SIU 2012: 1-4
Coauthor Index
aka: Rayadurgam Srikant
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-31 21:07 CET 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:
