2 papers
cs.LG2026
Near-Optimal Sample Complexity for Recursive Entropic Risk Reinforcement Learning with a Generative Model
Amirparsa Bahrami, Oliver Mortensen, Mohammad Sadegh Talebi
In this paper, we study the sample complexities of value and policy learning in finite discounted Markov decision processes (MDPs) under recursive entropic risk preferences with ri…
cs.NI2026
Delay and Throughput Analysis of Computation Offloading in Mobile Edge Computing: A Queueing Network Approach
Amirparsa Bahrami, Farid Ashtiani
Mobile edge computing (MEC) enables mobile devices to offload computation to nearby edge servers and to the cloud in order to reduce end-to-end delay for applications such as AR/VR…