\begin{equation} x^{2}y’’ + xy’ + (x^{2}-n^{2})y = 0 \end{equation}

this function is very useful, they have no well defined elementary result.

best-action worst-state is a lower bound for alpha vectors:

\begin{equation} r_{baws} = \max_{a} \sum_{k=1}^{\infty} \gamma^{k-1} \min_{s}R(s,a) \end{equation}

The alpha vector corresponding to this system would be the same \(r_{baws}\) at each slot.

which should give us the highest possible reward possible given we always pick the most optimal actions while being stuck in the worst state

Background

recall AlphaZero

1. Selection (UCB 1, or DTW, etc.)
2. Expansion (generate possible belief notes)
3. Simulation (if its a brand new node, Rollout, etc.)
4. Backpropegation (backpropegate your values up)

Key Idea

Remove the need for heuristics for MCTS—removing inductive bias

Approach

We keep the ol’ neural network:

\begin{equation} f_{\theta}(b_{t}) = (p_{t}, v_{t}) \end{equation}

Policy Evaluation

Do \(n\) episodes of MCTS, then use cross entropy to improve \(f\)

Ground truth policy

Action Selection

Uses Double Progressive Widening

There is no polynomial time algorithm \(A\) such that for all 3CNF \(\varphi\), \(A\qty(\varphi)\) accepts if and only if \(\varphi\) is satisfiable.

How do we relax this?

1. we can say “for most” 3CNF formulas, which means that we have to name a distribution
2. we can say to satisfy “most” \(\varphi\), meaning we can satisfy most clauses of \(\varphi\)
3. allow more than poly-time (SoTA is at \(1.34\dots^{n}\)).

PCP Theorem

• ⟸
• ⟵
• 101
• 102
• 103
• 104
• 105
• ⟶
• ⟹