Semih Cayci

Orcid: 0000-0001-7928-0794

According to our database1, Semih Cayci authored at least 26 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fast Online Learning of Vulnerabilities for Networks With Propagating Failures.
IEEE/ACM Trans. Netw., October, 2024

Finite-Time Analysis of Entropy-Regularized Neural Natural Actor-Critic Algorithm.
Trans. Mach. Learn. Res., 2024

Finite-Time Analysis of Natural Actor-Critic for POMDPs.
SIAM J. Math. Data Sci., 2024

Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation.
SIAM J. Optim., 2024

Essentially Sharp Estimates on the Entropy Regularization Error in Discrete Discounted Markov Decision Processes.
CoRR, 2024

Recurrent Natural Policy Gradient for POMDPs.
CoRR, 2024

Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients.
CoRR, 2024

Convergence of Gradient Descent for Recurrent Neural Networks: A Nonasymptotic Analysis.
CoRR, 2024

2023
Sample Complexity and Overparameterization Bounds for Temporal-Difference Learning With Neural Network Approximation.
IEEE Trans. Autom. Control., May, 2023

Provably Robust Temporal Difference Learning for Heavy-Tailed Rewards.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Policy Mirror Ascent for Efficient and Independent Learning in Mean Field Games.
Proceedings of the International Conference on Machine Learning, 2023

2022
Learning to Control Partially Observed Systems with Finite Memory.
CoRR, 2022

A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Linear Convergence of Entropy-Regularized Natural Policy Gradient with Linear Function Approximation.
CoRR, 2021

Sample Complexity and Overparameterization Bounds for Projection-Free Neural TD Learning.
CoRR, 2021

2020
Continuous-Time Multi-Armed Bandits with Controlled Restarts.
CoRR, 2020

Group-Fair Online Allocation in Continuous Time.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Budget-Constrained Bandits over General Cost and Reward Distributions.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Optimal Learning for Dynamic Coding in Deadline-Constrained Multi-Channel Networks.
IEEE/ACM Trans. Netw., 2019

Learning to Control Renewal Processes with Bandit Feedback.
Proc. ACM Meas. Anal. Comput. Syst., 2019

Hardware-Efficient Quantized Polar Decoding with Optimized Lookup Table.
Proceedings of the 2019 24th OptoElectronics and Communications Conference (OECC) and 2019 International Conference on Photonics in Switching and Computing (PSC), 2019

Nonbinary Polar Coding for Multilevel Modulation.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2019

2017
Learning for serving deadline-constrained traffic in multi-channel wireless networks.
Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

2016
On the Multi-Channel Capacity Gains of Millimeter-Wave Communication.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2013
Lossless polar compression of g-ary sources.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Polar code construction for non-binary source alphabets.
Proceedings of the 20th Signal Processing and Communications Applications Conference, 2012


  Loading...