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.

△ Mechanism confirmed, baseline not beaten 2026

Tolerance-controlled adaptive low-rank layers

Replace selected dense neural-network operators by low-rank factors whose rank is selected by a randomized residual test at a user-specified tolerance. Construct candidate bases in large blocks for efficient matrix operations, then prune the block to the smallest rank that passes the residual criterion instead of treating the block size as the final rank.

Useful7/10
Difficulty5/10
Novelty6/10
Paper: Adaptive, Matrix-Free Low-Rank Approximation arXiv:2607.06758
Unverified 2026

Orientation-consistent adaptive tetrahedral neural field

Represent a 3D neural field using high-order polynomial coefficients attached to an adaptively refined tetrahedral mesh, with a small MLP predicting residual corrections from local coordinates. Refine only tetrahedra whose prediction, rendering, or PDE residual is large, and use globally ordered vertices so neighboring tetrahedra share identical face and edge coefficients without hanging-node constraint solves.

Useful6/10
Difficulty6/10
Novelty7/10
Paper: An $h$-adaptive Tetrahedral Spectral Element Method with Applications to Kohn-Sham Density Functional Theory arXiv:2608.14006
Unverified 2026

Probe-guarded adaptive low-rank layers

Replace a dense block of a large neural-network weight matrix with an adaptively constructed cross approximation, but prevent premature termination using residual checks on O(m+n) additional diagonal-like entries. Accept a rank only after the probe residual has remained below tolerance for several consecutive iterations; otherwise continue adding pivots.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Robust Hierarchical Matrix Compression of Acoustic Volume and Boundary Integral Operators arXiv:2607.19500