The day in conversation for 2026-10-12
discussion
Transcript
The discussion: Dev: So I’m still reeling from the ARC paper, Rosa. That reasoning recipe approach fundamentally changes the bottleneck, right? It suggests we don't need millions of examples just to unlock complex spatial reasoning in foundation models if we give them the right trace structure. Rosa: I agree on that being huge for zero-shot capability. But what bothers me is the black box nature of those recipes. How do you actually verify that a specific reasoning trace translates into a robust, general capability rather than just overfitting to the training set's inherent structure? It feels like we’re trading explicit training data for an implicit architectural dependency, and I worry about reliability outside the controlled environment. Taro: That brings up the planning stuff—PlanWAM and SDPAD. If we can achieve state-of-the-art planning accuracy using spike-driven, end-to-end pipelines that are significantly more energy efficient, that’s a practical win for real robot deployment, not just academic curiosity. The efficiency gain alone makes the complexity of the representation worth it. Dev: Exactly! It shifts the paradigm from training massive models to designing smarter inference engines. But I wonder if PlanWAM's shaping mechanism
More episodes
- 2607.11041-PAKE: Learning Whole-Body Loco-Manipulation with Partial Kinematic Embeddings
- 2607.15982-Learning Where it Matters: Autonomous Data Collection and Offline Reinforcement Learning for Local Contact-Rich Manipulation
- 2608.16335-Readiness Barrier Functions: Forward-Invariant Control Authority for Overactuated Multirotor Allocation
- 2608.19085-DA-WAM: Decision-Aligned Future Latents for Driving World Models
- 2609.00539-Exploring Nonlinear Body Oscillations for Natural Quadruped Gaits
- 2406.04203-Explicit Steady-State Approximations for Parallel Server Systems with Heterogeneous Servers
- 2410.07594-Design and Characterization of High Efficiency Single-stage Electromagnetic Coil Guns
- 2411.10805-General-Sum Markov Games with Borel Spaces: Existence of Approximate Nash Equilibria via Finite Model Approximations under Setwise or Weak Continuity
- 2502.07065-Active Inference via Incentive Design: Eliciting Divergent Behaviors under Partial Observability
- 2508.19933-Combined Stochastic and Robust Optimization for Electric Autonomous Mobility-on-Demand with Nested Benders Decomposition