concept
active
concept:test-time-computationTest-Time Computation
The capacity to expend additional computational cycles at inference in proportion to input difficulty
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.
- Approach using extra compute at test time to double-check answers and improve reliability.
- Classic approach to adaptive test-time compute for recurrent networks, cited as precursor to looped LLMs
- Abstract iterative scheme underlying Darwinian evolution, GP, and Dennett's tower of learning.
- Can we characterize polynomial-time computation and other complexity classes in such terms?question0.758Hoping for machine-independent, geometrical characterizations of complexity classes via interaction models.
- A test of intelligence via linguistic performance; deemed insufficient for sentience assessment by Levin.
- Longstanding tradition the paper situates itself within, treating computational complexity as manifesting via physical dynamical phenomena.
- A new kind of time with past/present/future that co-originates with life, enabling memory, anticipation and learning.
- Neural circuit motif selecting the strongest input; approximated by softmax.