KaTeX render test

1 min read
Updated
Suggest editHistoryTalk
RawGraph

Last edited

Fact-checked

In review queue

Sources

2 citations

Revision

v1 · 289 words

Fact-checks are independent of edits: a reviewer re-verifies the article against its sources and stamps the date. How we verify

Temporary internal test page for math rendering. It will be deleted after verification.

Display math

The Bellman optimality equation for the state-value function:[1]

V(s)=maxasP(ss,a)[R(s,a,s)+γV(s)]V^*(s) = \max_a \sum_{s'} P(s' \mid s, a)\left[R(s, a, s') + \gamma V^*(s')\right]

The action-value form:

Q(s,a)=sP(ss,a)[R(s,a,s)+γmaxaQ(s,a)]Q^*(s,a) = \sum_{s'} P(s' \mid s, a)\left[R(s, a, s') + \gamma \max_{a'} Q^*(s', a')\right]

The discounted return:

Gt=Rt+1+γRt+2+γ2Rt+3+=k=0γkRt+k+1G_t = R_{t+1} + \gamma R_{t+2} + \gamma^2 R_{t+3} + \cdots = \sum_{k=0}^{\infty} \gamma^k R_{t+k+1}

A deliberately wide equation to test horizontal scrolling on narrow screens:

Attention(Q,K,V)=softmax ⁣(QKdk)VL(θ)=E(x,y)D[t=1Tlogpθ(yty<t,x)]+λθ22\mathrm{Attention}(Q, K, V) = \mathrm{softmax}\!\left(\frac{QK^\top}{\sqrt{d_k}}\right)V \qquad \mathcal{L}(\theta) = -\mathbb{E}_{(x,y)\sim\mathcal{D}}\left[\sum_{t=1}^{T} \log p_\theta(y_t \mid y_{<t}, x)\right] + \lambda \lVert \theta \rVert_2^2

Inline math

The discount factor γ[0,1)\gamma \in [0, 1) controls how much the agent values future rewards, and the policy πθ(as)\pi_\theta(a \mid s) is parameterized by θ\theta. TD error is δt=rt+1+γV(st+1)V(st)\delta_t = r_{t+1} + \gamma V(s_{t+1}) - V(s_t) inside a sentence.[2]

Things that must NOT become math

OpenAI raised $6 billion in one round and later $250 million in another; Anthropic raised $8 billion from Amazon. A single $ sign stays text.

Inline code with dollars: price = "$$100" and echo $$PATH.

# Code fence: dollars stay literal
cost = "$$not math$$"
total = price * 2  # $50
MetricFormula
MCCTPTNFPFN(TP+FP)(TP+FN)(TN+FP)(TN+FN)\frac{TP \cdot TN - FP \cdot FN}{\sqrt{(TP+FP)(TP+FN)(TN+FP)(TN+FN)}}
AccuracyTP+TNTP+TN+FP+FN\frac{TP + TN}{TP + TN + FP + FN}

Citation marker near math: the value Vπ(s)V^\pi(s) was introduced earlier.[1] See reinforcement learning.

References

  1. Sutton, R. S., & Barto, A. G. (2018). Reinforcement Learning: An Introduction (2nd ed.). MIT Press. http://incompleteideas.net/book/the-book-2nd.html
  2. Bellman, R. (1957). Dynamic Programming. Princeton University Press.

Improve this article

Add missing citations, update stale details, or suggest a clearer explanation. Every suggestion is reviewed for sourcing before it goes live.

Suggest edit