FDT is underspecified: graph-building needs hard computational logical counterfactuals
jessi_cata · x · 2026-11-07
Follow-up from jessicata on the FDT demonstration: technically FDT is underspecified — the paper doesn't define how to build its causal graph, and building a sensible graph requires "computational logical counterfactuals," which are hard. Still, intuitive graphs for the almost-twin prisoner's dilemma result in mutual defection.
More from Research
- baselabs unpacks OPSD post-training research: hinted-teacher bias hurts long-horizon learning — JoshPurtell · 2026-11-07
- s³ paper: cooperative multi-agent RL post-training beats best-of-N by up to 166% — StellaLisy · 2026-11-07
- Rough VIX Model Cuts Option Pricing MSE by 13% in Volatility Research Paper — chaumian · 2026-11-07
- Stanford EduNLP lab hiring Applied Research Lead for AI teaching tools — sebgehr · 2026-11-07
- NeurIPS Quest: a pixel-art map to navigate 672 posters across sessions and topics — shangbinfeng · 2026-11-07
- NYT: OpenAI breakthrough challenges the Exponential Time Hypothesis, shaking a CS tenet — fortnow · 2026-11-07