| paper | d4-conf-ijcai-2020-0511 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper describes NEUR-HCI’s architecture and training procedure and reports empirical results, but contains no numbered theorem, lemma, corollary, or proposition asserting a computational result. Without a qualifying named result, there is no anchor for a continuous mirror.
fails bit a — no named computational result to mirror
No result is covered: the paper presents a learning framework and empirical comparisons but no named computational result.
This paper contains no named computational result of the required kind: it has no numbered theorem, lemma, corollary, or proposition asserting a complexity or algorithmic bound. It presents NEUR-HCI, trains it with back-propagation, and reports empirical performance and runtimes, but those are not qualifying anchors. So I can’t give a continuous mirror grounded in a named result from this paper.
The appended case identifies no named computational result to mirror, and that is the strongest objection here. The paper introduces NEUR-HCI and compares its empirical performance and runtime with other methods. It does not state a worst-case complexity result or an algorithmic guarantee for a named problem. The reported training time is an experimental observation; the cited universal approximation theorem concerns representation, not computational complexity.
A stronger candidate would replace the finite training set with a distribution over feature vectors and labels or preference pairs, then ask about optimizing expected loss over hierarchical Choquet models. That is a coherent continuous-data question, but its population is a distribution of examples, not a society of agents, and its natural concerns are statistical learning and generalization. Another candidate—learning from a continuum of stakeholders—would change the paper’s setup, which learns one decision model from preference data, into a problem about aggregating or learning across stakeholders. Either could motivate separate research, but neither mirrors a computational result this paper establishes. The negative case is strong for this paper’s mirror; it does not rule out those adjacent questions on their own merits.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.