AISTATS 2027
Do Adaptive Neural Networks Learn Computational Depth or Surface Difficulty?
Main-track submission · Under review
Brandon Baek
17-page main-track manuscript · Public overview
A right answer is not always a usable exit.
My solo-authored methodological paper asks whether adaptive neural networks respond to computational depth or surface difficulty. Its central distinction is between an early prediction that happens to be correct and a stopping decision supported by the information the controller has.
Available information comes first.
An evaluator with the answer can recognize a lucky early guess. A deployable stopping controller cannot use that future knowledge. The research audits that information boundary.
A conceptual illustration, not an experimental result.
Matching observation histories require the same stopping decision, even if the eventual answers differ.
Controlled reasoning tasks
The manuscript investigates adaptive neural computation through controlled reasoning tasks. The public page explains the question and its information constraints while the full study is under review.
Prediction
What answer does the model propose?
Observation
What information has arrived so far?
Stopping
Can the controller justify ending computation now?
Submission status
Submitted to the AISTATS 2027 main track. The manuscript and detailed numerical results stay private during review; no acceptance is implied.
The concept illustration above explains the research question; it is not a published finding or a reproduction of a private paper figure.
Compute savings need an attainable stopping rule.
The broader motivation is to separate savings that look possible with hindsight from savings a model can choose in operation. This is a methodological question about evidence available at decision time, rather than another applied classification project.













