Doctor of Philosophy, The Ohio State University, 2020, Electrical and Computer Engineering
With the rapid advances in device technology and computational resources, the performance of communication and computing systems achieved a massive breakthrough recently. Proportional to these improvements, new services developed on these systems require substantially higher resource consumption, such as energy and time. Consequently, optimal control of these systems under stringent resource constraints has become prevalent. Furthermore, as a result of uncertainty and data scarcity in these systems, learning methods with online exploration are particularly required for optimal performance. In this dissertation, we investigate optimal stochastic control of communication and computing systems from a learning theory perspective, and develop data-efficient and robust learning algorithms.
Toward this goal, we start by studying adaptive rate selection in multi-channel wireless networks for serving randomly arriving traffic with deadline constraints. Here, the controller might increase the communication rate for expedited transmission, but this comes at the expense of increased operational costs (e.g., energy consumption). Taking the packet deadlines, channel statistics and operational costs into account, we characterize the optimal transmission rate, and propose a learning algorithm that uses bandit feedback and converges to the optimal transmission rate with order-optimal regret in the absence of any prior statistical knowledge.
Next, we focus on budget-constrained bandit problem in a stochastic setting. In many fundamental applications, such as adaptive routing and task scheduling, each decision depletes a random and potentially heavy-tailed cost (e.g., completion time or energy) from a common budget, and yields a random reward at the end. The cost and reward are unknown at the time of a decision, and received by bandit feedback upon completion. The controller aims to maximize the expected total reward under the budget constraints. For this bandit problem, we prop (open full item for complete abstract)
Committee: Atilla Eryilmaz (Advisor); Ness B. Shroff (Committee Member); Abhishek Gupta (Committee Member); Yu Su (Committee Member)
Subjects: Computer Engineering; Computer Science; Electrical Engineering