(1) The paper presents an extensive set of experiments across tabular classification, vision models, recurrent architectures, language modeling, and synthetic tasks. While this demonstrates the applicability of PSNeuron to different architectures, the experimental breadth comes at the expense of a systematic understanding of when and why PSNeuron is effective. Many experiments are conducted under relatively narrow architectural or training settings, making it difficult to isolate the factors responsible for the observed improvements.
Although the paper includes several controlled comparisons, the results remain fragmented across different tasks and configurations. A more focused analysis within a smaller number of representative settings would provide stronger evidence for the effectiveness of the proposed architecture.
(2) A key contribution is the explicit control of interaction order. However, the paper provides limited systematic analysis of how different values of (K) affect performance on real-world tasks. Although synthetic recovery and masking experiments are included, controlled comparisons across interaction orders would better demonstrate their practical benefits.
(3) PSNeuron combines multiple components, including grouped slots, shared factor banks, higher-order interactions, and order-wise calibration. While some ablations are provided, their individual contributions to performance remain unclear. More systematic comparisons against existing polynomial and higher-order interaction models would help establish the architectural advantages of PSNeuron.
(4) While the paper demonstrates the benefits of multiplicative interactions through comparisons with additive baselines, it lacks a systematic comparison with existing architectures that explicitly model higher-order feature interactions. Such comparisons would help clarify whether the observed improvements stem from modeling higher-order interactions in general or from the specific architectural design proposed in this work. Including these baselines would provide stronger evidence of the proposed method's advantages over existing approaches.
Response to Reviewer sC8v
Thank you for emphasizing that the paper must explain its problem and terminology without assuming familiarity with this subfield. We rewrote the abstract and introduction to state the problem first, then explain PSNeuron through a worked example before formal notation (revised Sec. 1, pp. 1–2; Sec. 3, p. 3; Fig. 1, p. 4).
PSNeuron learns weighted linear summaries of fixed groups of input features, called slots. Given three summaries a,b,c, one channel computes ab+ac+bc and another abc. A learned coefficient weights each channel, and a linear readout maps multiple sets of summaries to the output. Both channels reuse the summary weights, and either order can be masked after training without altering the other learned parameters. The worked example and Figure 1 now show how the calculation proceeds (Sec. 3, pp. 3–4). Reusing weights is expected to help when useful orders need common feature directions and can limit the model when they need different ones.
The original submission included two examples of where this construction helps. In a recurrent DeltaNet model on MQAR, a task requiring recall of values paired with queried keys, PSNeuron improves mean recall by 44.08 percentage points over an additive twin and 37.38 over a conditional GELU control. Both controls receive the same input information at nearly equal parameter budgets; the two differences survive Holm correction across 20 fresh seeds. Results vary: eight PSNeuron seeds reach at least 90% recall and six stay below 50% (Sec. 5.1; Table 58, p. 83). This does not imply reliable success on every seed or general superiority over every alternative. Narrow K=2 heads on frozen DINOv3 image features also outperform equal-size additive heads in 69/75 paired seed comparisons, with a reversal at larger widths (Sec. 5.1; Tables 53, 55).
On three tabular datasets, a common K=4 configuration removes 34.7–51.7% of selected dense reference models' trainable parameters while mean accuracy remains within 0.44 percentage points. This is a saving relative to those references, not an established improvement over the dense accuracy–size frontier (Sec. 5.2). Conversely, in the transformer attention-output MQAR setting, an identity carrier alone nearly solves the task; we explicitly state that this placement provides no evidence of a product advantage (Sec. 5.4).
"Structured interactions" previously meant products taking one summary from each participating group, and "dense capacity" referred to the weights in the dense layer being replaced. The revised paper avoids these unexplained phrases and describes the products and parameter counts directly.
Representability means suitable weights exist to compute a target. Recovery measures whether training reaches a stated fit threshold; it does not require finding the exact constructed weights. Functional use is evaluated by switching an order off and measuring the effect on predictions. For controlled targets, order-six recovery succeeds in all 120 runs per setting with maximum order six or seven, while order-eight recovery succeeds in only 25% despite sufficient capacity. Masks then indicate which orders learned models use (Sec. 5.3; Table 23).
We hope these revisions clarify the problem, mechanism, and limits of the evidence, and would appreciate your reassessment in light of the revised manuscript.