Research ideas

Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.

✓✓ Beats tuned baseline 2026

Certified overrelaxed Hopfield attention

Replace the standard unit-step modern Hopfield retrieval update with a relaxed step using theta greater than 1, while restricting theta to the theoretically safe interval (0,2). The relaxed map has the same fixed points as ordinary attention and provably decreases the Hopfield energy, so it can move farther toward an attractor per iteration without changing the retrieval objective.

Useful8/10
Difficulty3/10
Novelty6/10
Paper: Basin-Preserving Discretizations of Modern Hopfield Retrieval Dynamics: Energy Cells, Dissipation, and the Attention Limit arXiv:2608.21304
✓✓ Beats tuned baseline 2026

Persistent Relational Memory

Give every possible pairwise relation its own recurrent latent state, stored in a dictionary keyed by stable node identities, instead of discarding the state whenever the edge is absent from the current graph. At each timestep, active edges retrieve their old state, update it with the current pair features and neighborhood messages, and write it back after message passing. This should improve predictions in dynamic graphs with intermittent interactions and reduce the burden on node states to…

Useful7/10
Difficulty5/10
Novelty6/10
Paper: TRACE: Spatiotemporal Contact Memory Graph Network Simulator for Granular Dynamics arXiv:2609.02991