Competitive regret

In decision theory and machine learning, competitive regret refers to a performance measure that evaluates an algorithm's regret relative to an oracle or benchmark strategy. Unlike traditional regret, which compares against the best fixed decision in hindsight, competitive regret compares against decision-makers with different capabilities—either with greater computational resources or access to additional information.

The formal definition of competitive regret typically involves a ratio or difference between the regret of an algorithm and the regret of a reference oracle. An algorithm is considered to have "good" competitive regret if this ratio remains bounded even as the problem size increases.

This framework has applications in various domains including online optimization, reinforcement learning, portfolio selection, and multi-armed bandit problems. Competitive regret analysis provides researchers with a more nuanced evaluation metric than standard regret, helping them develop algorithms that can achieve near-optimal performance even under practical constraints and uncertainty.

Competitive regret to the oracle with full power

Consider estimating a discrete probability distribution $p$ on a discrete set ${\mathcal {X}}$ based on data $X$, the regret of an estimator $q$ is defined as

$\max _{p\in {\mathcal {P}}}r_{n}(q,p).$

where ${\mathcal {P}}$ is the set of all possible probability distribution, and

$r_{n}(q,p)=\mathbb {E} (D(p||q(X))).$

where $D(p||q)$ is the Kullback–Leibler divergence between $p$ and $q$.

Competitive regret to the oracle with limited power

Oracle with partial information

The oracle is restricted to have access to partial information of the true distribution $p$ by knowing the location of $p$ in the parameter space up to a partition. Given a partition $\mathbb {P}$ of the parameter space, and suppose the oracle knows the subset $P$ where the true $p\in P$. The oracle will have regret as

$r_{n}(P)=\min _{q}\max _{p\in P}r_{n}(q,p).$

The competitive regret to the oracle will be

$r_{n}^{\mathbb {P} }(q,{\mathcal {P}})=\max _{P\in \mathbb {P} }(r_{n}(q,P)-r_{n}(P)).$

Oracle with partial information

The oracle knows exactly $p$, but can only choose the estimator among natural estimators. A natural estimator assigns equal probability to the symbols which appear the same number of time in the sample. The regret of the oracle is

$r_{n}^{nat}(p)=\min _{q\in {\mathcal {Q}}_{nat}}r_{n}(q,p),$

and the competitive regret is

$\max _{p\in {\mathcal {P}}}(r_{n}(q,p)-r_{n}^{nat}(p)).$

Example

For the estimator $q$ proposed in Acharya et al.(2013),

$r_{n}^{\mathbb {P} _{\sigma }}(q,\Delta _{k})\leq r_{n}^{nat}(q,\Delta _{k})\leq {\tilde {\mathcal {O}}}(\min({\frac {1}{\sqrt {n}}},{\frac {k}{n}})).$

Here $\Delta _{k}$ denotes the k-dimensional unit simplex surface. The partition $\mathbb {P} _{\sigma }$ denotes the permutation class on $\Delta _{k}$, where $p$ and $p'$ are partitioned into the same subset if and only if $p'$ is a permutation of $p$.