- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SupHDC, which combines several inputs using random permutation and sign keys, applies one shared random feature encoder, and produces separate predictions with slot specific prototype classifiers. It adapts these classifiers to mixed inputs and individually recomputes predictions with small score margins. A kernel analysis explains how predictions can survive interference without recovering each input's encoded vector. Experiments on ten classification datasets and a Raspberry Pi report inference savings with an accuracy tradeoff against Plain HDC at the same representation dimension.
Critical strengths
SupHDC offers a simple way to share the expensive projection in HDC while keeping the encoder fixed. The kernel analysis usefully separates common score scaling from distortion that changes the ordering of class scores, and explains why exact recovery of each encoded input is unnecessary.
The experiments use five paired seeds across ten datasets and include ablations of adaptation and fallback. Table 2 also tests actual runtime against batched Plain HDC on the same query blocks, reporting 2.01x speedup with a 2.26 percentage point mean accuracy loss at K=4 with fallback.
Critical weaknesses
The practical advantage over simply reducing the representation dimension remains unclear. Averaging the supplied full precision summaries gives Plain HDC at D=2,000 an accuracy of 84.37%, compared with 81.71% for D=10,000 SupHDC at K=4 with adaptation and fallback. The smaller Plain model has higher mean accuracy on all ten datasets. Its analytical speedup relative to Plain at D=10,000 is 5x, compared with 2.08x for SupHDC; these are cost estimates, not measured hardware speedups. The reported savings at fixed D are valid, but retaining a large D needs a demonstrated benefit. The supplement includes a robustness experiment script, but I could not find its results.
The diagnostic in Figure 4 needs clarification. Eq.6 uses a query dependent kernel scaling factor, and Eq.12 normalizes the residual by the scaled clean scores. The supplied run_interference_grid.py instead fits one global scaling factor and divides by the magnitude of the unscaled clean scores. This difference matters when scaling is small. The script may be an intermediate step, but the supplied materials do not establish how its output becomes the quantity plotted in Figure 4, limiting the empirical support for the proposed explanation.
Questions for authors
Do the existing results from the supplied robustness experiment show a benefit of retaining D=10,000 over lower-D Plain models that offsets the accuracy and cost comparison above?
Which scaling factor and normalization were used for Figure 4? Was there additional analysis after the supplied interference script to obtain Eq.12?
We thank the reviewer for the encouraging review. We provide point-by-point clarifications below:
W1. Practical advantage over reducing the representation dimension.
SupHDC provides additional computational savings even after reducing D. Please see the following comparison across ten datasets and five seeds:
Starting from the reviewer’s suggested D=2,000 baseline, SupHDC reduces analytical computation by a further 27.84%, with similar mean accuracy. This demonstrates that superposition can complement dimension reduction and supports selecting D and K jointly.
We will add those direct comparisons and clarify the practical operating points.
W2. Figure 4 scaling and normalization.
Our figure 4 does include the scale normalization: the plotting notebook applies
R_int = epsilon_rel_l2 / rhoafter the supplied interference script.We also added diagnostics using the theoretical scale directly. At D=10,000 before adaptation, relative distortion is 0.057 at K=2 and 0.103 at K=4. Thus, the superposed scores remain close to the theoretically scaled clean scores, while sharing an encoding across more inputs increases interference. This supports the proposed explanation without fitting the scale to the observed scores. Small distortion can still change predictions with narrow class margins.
Q1. Do the robustness results demonstrate a benefit from retaining D=10,000?
Yes, at moderate superposition: HAR and ISOLET show that high-D SupHDC can preserve robust accuracy while reducing computation relative to high-D Plain HDC.
With 40% random-phase corruption of encoded coordinates, averaged over five model seeds and three corruption realizations:
SupHDC exceeds Plain D=2,000 by 1.78 pp on HAR and 1.41 pp on ISOLET, with improvements in all five model seeds. It also exceeds Plain D=5,000 and D=10,000, while requiring 28.81% and 25.94% less analytical computation than Plain D=10,000, respectively. The mean accuracy advantage on these two datasets persists across all tested nonzero corruption levels.
These results demonstrate useful operating points where retaining the larger representation with moderate superposition provides robust accuracy that the tested lower-D Plain models do not match. Lower-D Plain remains cheaper, so the benefit is an accuracy–cost tradeoff.
Q2. Which scaling factor and normalization were used for Figure 4? Was there additional analysis?
Yes. Figure 4(b,c) uses the same clean prototypes on both sides, before adaptation. For each (dataset, D, K, seed) configuration, the interference script fits one global least-squares scale across the collected score entries:
ρ=⟨s,s⟩/∣s∣22.
The plotting notebook then applies:
raw["R_int"] = raw["epsilon_rel_l2"] / raw["rho"].replace(0, np.nan)Thus, the plotted quantity includes the additional scale normalization, which is appropriate for this analysis.