AI × Robots · WARMING

Is your robot’s memory just a clock?

Memory-augmented VLA policies that stamp frames by time can treat a pause like work. A Nov 10 cs.RO paper shows a brief fidget is enough to throw the memory off. Nearby: TanCRAFT tries to forecast assembly mistakes before they happen.

3 cs.RO papers on Nov 10 · v0.7.0 LeRobot

Compilers · EARLY

A complete calculus for goto and break

CFGKAT extends guarded Kleene algebra with tests to non-local control flow and proves a sound, complete axiomatization. Another paper asks how domain scientists keep performance portable when HPC hardware is shaped by AI workloads.

2611.14201 cs.PL · CFGKAT · 2611.14204 ICON microphysics

AI · WARMING

Compression tricks landing in local stacks

llama.cpp just added OCP FP8 support on CUDA. On HN, people are also passing around word of an Apple app for running local models on a Mac.

b12284 llama.cpp · 320 comments on Apple’s local-AI app

Math & Physics · EARLY

Two search communities sit down together

Operations research’s branch-and-bound and AI’s A* are cousins that rarely share a benchmark. A new math.OC paper puts both on resource-constrained project scheduling and measures the gap. Lean 4 and mathlib also tagged v4.36.0-rc2; Qiskit 2.6.2 shipped last week.

2611.14426 math.OC · cs.AI · 2.6.2 Qiskit

Adds OCP FP8 support on CUDA, including FP8 paths for GEMV.

Latest LeRobot release, with an accompanying post on the Hugging Face blog.

Patch release: safer QPY loading, QASM3 export of decomposed gate params, and a recursion-limit fix.

Point release for the 23.1 line, with packaged Linux builds and backend fixes.

Release candidate: 927 commits from 389 contributors, including new models such as Reflection Beam-1.0.

arXiv 2611.14488 · cs.RO

Is Your Robot's Memory Just a Clock? Temporal Shortcuts in Memory-Augmented VLA Policies

Memory-augmented robot policies are supposed to remember what happened in an episode. Many of them just sample frames on a clock and stamp each one with its time step. This paper shows that a brief pause or a fidget — something that changes nothing about the task — is enough to throw those memories off, because the policy has learned to treat time passing as if it were work.

Paper  ·  PDF

arXiv 2611.14201 · cs.PL

CFGKAT: A Complete Calculus for Non-Local Control Flow

Guarded Kleene algebra with tests can reason about programs with if and while, and it has a fast decision procedure. Real languages also have break and goto. CFGKAT adds that non-local control flow, and this paper gives it a sound, complete axiomatization of program equivalence — something the extra jumps made surprisingly hard.

Paper  ·  PDF

arXiv 2611.14426 · math.OC · cs.AI

Two Communities, One Problem: Branch-and-Bound vs. A* for Resource-Constrained Project Scheduling

Branch-and-bound comes from operations research; A* comes from AI. They share a search skeleton but explore the space differently, and that can change how long a solve takes. This paper lines them up on the resource-constrained project scheduling problem, spells out how their ingredients correspond, and measures where each one pulls ahead.

Paper  ·  PDF