niplav @niplav@schelling.pt

@TetraspaceGrouping ill go full patent troll on the jokes you extract from me ☔

One more: https://kaarelh.github.io/

• PCS and all c∈C have minimum graph edit distance of i. (Proof sketch: There is a graph for which all acyclic tournaments with the same (minimal) graph-edit distance don't contain a specific subgraph). Graph in picture, the minimal edit distance is 3, the non-preserved consistent subgraph is a2→a4. This extends to arbitrarily big consistent subgraphs (replace all edges with acyclic tournaments with n nodes).

I should do more forecasting again

Sending this to deletionist admins every day until they stop

I got first linked to on gwern.net 🎈

After discovering that this would be a pain to port over I won't do it.

They figured out they wouldn't be able to create alignment in time and therefore chose noble civilizational decline in hopes of future civilizations picking up the task

🤔

Wait. Hangon. The second name…it feels…familiar………

[1]: https://arbital.com/p/transparent_newcombs_problem/

cops

ok new plan we find this student and extract his realityfluid

very good

from https://twitter.com/doxometrist/status/1634308402473058305

i might_{2\%} be able to fix her

i am losing my mind

yes louise incorrigible indeed

We have both, RLHF+fine-tuning *and* RHLF+fine-tuning!