_index.org

operation

Last edited: August 8, 2025

This is object dependent.

Operation Linebacker

Last edited: August 8, 2025

Richard Nixon bombs Vietnam for 13 days to beat the VietCong into submission after the Vietnam War.

operator

Last edited: August 8, 2025

A Linear Map from a vector space to itself is called an operator.

\(\mathcal{L}(V) = \mathcal{L}(V,V)\), which is the set of all operators on \(V\).

constituents

requirements

  • \(T\) is, by the constraints above, an operator

additional information

injectivity is surjectivity in finite-dimensional operators

Suppose \(V\) is finite-dimensional and \(T \in \mathcal{L}(V)\), then, the following statements are equivalent:

  1. \(T\) is invertable
  2. \(T\) is injective
  3. \(T\) is surjective

THIS IS NOT TRUE IN infinite-demensional vector space OPERATORS! (for instance, backwards shift in \(\mathbb{F}^{\infty}\) is surjective but not injective.)

opsin

Last edited: August 8, 2025

An opsin is a photo-receptor protein (sensitive to light) that is sensitive to light

Optimal Exploration Policy

Last edited: August 8, 2025

Suppose we have offline statistic regarding wins and losses of each slot machine as our state:

\begin{equation} w_1, l_{1}, \dots, w_{n}, l_{n} \end{equation}

What if we want to create a policy that maximises exploration?

We construct a value function:

\begin{equation} U^{*}([w_1, l_{1}, \dots, w_{n}, l_{n}]) = \max_{a} Q^{*}([w_1, l_{1}, \dots, w_{n}, l_{n}], a) \end{equation}

our policy is the greedy policy:

\begin{equation} U^{*}([w_1, l_{1}, \dots, w_{n}, l_{n}]) = \arg\max_{a} Q^{*}([w_1, l_{1}, \dots, w_{n}, l_{n}], a) \end{equation}