<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T21:04:04Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/23102" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/23102</identifier><datestamp>2026-06-14T07:00:31Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9934</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">HU, HONGDA</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-04-29T15:07:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2026-04-29T15:07:30Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026-04-29</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2026-04-27</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10012/23102</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">The classical multi-armed bandit problem involves a learner and a collection of arms with
unknown reward distributions. At each round, the learner selects an arm and receives new
information. The learner faces a tradeoff between exploiting the current information and
exploring all arms. The traditional objective in the literature is to maximize the expected
cumulative reward over all rounds. Such an objective does not involve a risk-reward trade-
off, which is fundamental in many areas of application. Building on the mean–variance
formulation of Sani et al. (2012), I first extend the classical multi-armed bandit problem
to a mean–variance setting. I relax assumptions of independent arms and bounded re-
wards and instead allow for sub-Gaussian reward distributions. Within this framework,
I introduce the Risk-Aware Lower Confidence Bound algorithm and study its theoretical
properties. Moving beyond mean–variance criteria, I then develop the Expected Shortfall
Lower Confidence Bound algorithm for bandits evaluated under Expected Shortfall, estab-
lishing new concentration bounds for empirical Value at Risk and Expected Shortfall and
deriving regret guarantees for both light- and heavy-tailed reward distributions. Building
on this analysis, I next propose the Range Value at Risk Lower Confidence Bound algo-
rithm, which relies on a novel uniform concentration argument for order statistics inspired
by Boucheron and Thomas (2012), and I extend the regret analysis to general continuous
reward distributions with non-decreasing hazard rates. Finally, I introduce the Spectral
Risk Measure Lower Confidence Bound algorithm, providing a unified treatment of a broad
class of spectral risk measures that encompasses both Expected Shortfall and Range Value
at Risk as special cases. Numerical experiments on synthetic and real financial datasets
demonstrate that the proposed algorithms achieve favourable risk–reward tradeoffs and
consistently outperform existing risk-aware bandit methods across a variety of distribu-
tional structures.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject">multiarmed</dim:field>
   <dim:field mdschema="dc" element="subject">regret analysis</dim:field>
   <dim:field mdschema="dc" element="subject">risk aware</dim:field>
   <dim:field mdschema="dc" element="subject">online learning</dim:field>
   <dim:field mdschema="dc" element="title">Multi-Armed Bandits with Risk-Aware Performance Measures</dim:field>
   <dim:field mdschema="dc" element="type">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department">Statistics and Actuarial Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline">Actuarial Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Schied, Alexander</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Ghossoub, Mario</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Charpentier, Arthur</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>