Rui-Tong Tian

This minimal recurrent behavioral memory is characterized by a compatibility relation: under transitivity its classes attain the exact minimum, while the general case is an entropy minimization over closed compatible state assignments, with exact certificates on finite instances.

Credit-gated planning slashes prediction failure rates by 62%, ensuring robots make smarter decisions with less wasted imagination.