Architecture ideas

Attention variants, state-space and recurrent cells, normalization and token-mixing schemes — each tested against the standard block it replaces.

✓✓ Beats tuned baseline 2026

PPMI-Gated BCM Sparse Graph Encoder

Replace a dense graph embedding table or end-to-end GNN encoder with a fixed-width binary SDR learned from streaming random-walk context pairs. Use PPMI to amplify informative node-context pairs and a local BCM update to learn detector columns, followed by k-winner-take-all binarization. The resulting sparse code can be used directly for node classification, link prediction, retrieval, or as input to a small downstream predictor.

Useful7/10
Difficulty5/10
Novelty7/10
Paper: Columnar-Embedder: A Biologically Inspired Cortical Architecture for Binary Sparse Distributed Graph Representations arXiv:2608.20408
✓✓ Beats tuned baseline 2026

Moment-Calibrated Verification Stopping

Replace a fixed-depth all-accept verifier cascade with a depth controller calibrated to the latent distribution of per-instance false-accept rates. The controller should stop when the predicted reliability gain from another gate is smaller than its inference cost, avoiding the severe overconfidence caused by treating correlated verdicts as independent evidence.

Useful7/10
Difficulty4/10
Novelty7/10
Paper: Partially Correlated Verifier Cascades in LLM Harnesses: Concave Log-Odds, Polynomial Reliability, and Blind-Spot Ceilings arXiv:2607.13918
✓✓ Beats tuned baseline 2026

Multiplicative Manifold Unscented Recurrent Cell

Replace the Euclidean hidden-state update of a recurrent or state-space neural network with a mixed manifold state containing a rotation component and Euclidean features. Propagate uncertainty with sigma points in tangent error coordinates, retract rotational perturbations through the exponential map, and compute the training loss from the predicted covariance. This avoids invalid rotations and captures second-order curvature effects that a first-order EKF-style recurrent cell misses at large…

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Fully Multiplicative Attitude and Orbit Determination for Deep space Navigation arXiv:2607.10072
✓✓ Beats tuned baseline 2026

Epoch-Frozen Masked Low-Rank Candidate Encoder

Add an online low-rank reconstruction layer before a recommender or ranking MLP. It estimates a latent action-feature subspace from masked candidate vectors, freezes that subspace for an epoch, reconstructs each partially observed candidate in the latent coordinates, and feeds only those coordinates to the predictor. The method is most promising when the ambient candidate dimension d is large but the effective rank m is small and missingness is not too severe.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: Stochastic Linear Bandits with Partially Observed Actions arXiv:2607.08971
✓✓ Beats tuned baseline 2026

Private spectral whitening front-end

Estimate the temporal spectrum of each sequence channel using a locally private procedure, then apply a regularized inverse-square-root spectral filter before the sequence enters attention or an SSM. The filter removes predictable low-frequency or narrow-band redundancy while avoiding unstable amplification at frequencies where the private estimate is small.

Useful6/10
Difficulty5/10
Novelty7/10
Paper: On the privacy cost for dependent Gaussian data: spectral density estimation under local differential privacy arXiv:2608.24847