framework
active
framework:adaptive-computation-timeAdaptive Computation Time
Classic approach to adaptive test-time compute for recurrent networks, cited as precursor to looped LLMs
Neighborhood — ranked by edge-count
Papers (1)
paper
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- The broader goal of dynamically allocating computation based on task difficulty, enabled by probe-guided early exit
- The capacity to expend additional computational cycles at inference in proportion to input difficulty
- Paradigm of improving model outputs through more computation at inference time; VS is presented as a diversity-oriented alternative
- A new kind of time with past/present/future that co-originates with life, enabling memory, anticipation and learning.
- Process using Q, K, V to compute a heat map over K and weighted sum of V.
- Can we characterize polynomial-time computation and other complexity classes in such terms?question0.732Hoping for machine-independent, geometrical characterizations of complexity classes via interaction models.
- Organism's belief-guided action selection that instantiates generative model and maintains phenotypic states
- The puzzle that computation appears to gain information despite logical closure; resolved by relative to subsystems/observers.