Every idea extracted from recent arXiv mathematics papers — verified and unverified. Click an idea to open its full card; badges show the empirical verdict.
Replace a time-homogeneous recurrent update by a sequence of parameterized maps f_t, and regularize late-time pairs of updates to approximately commute: applying block f_t followed by f_r should agree with applying f_r followed by f_t. This should make long-horizon predictions robust to local time-step reorderings and schedule perturbations, while proximal statistics provide a diagnostic for whether trajectories repeatedly approach one another rather than diverging permanently.
Add higher-order filtered-error states to parameter-efficient fine-tuning and constrain the highest-order state to a prescribed shrinking funnel. The resulting recursion gives an explicit bound on parameter drift and its filtered derivatives at every lower order, providing a principled alternative to a fixed quadratic proximity penalty or unconstrained momentum.
Construct a branching residual network whose active computational paths reproduce according to a fixed offspring/connectivity law, while a controller can only remove paths using an age- or depth-dependent hazard \(u(a)\). Use the resulting bound as a diagnostic and gating schedule: removal can suppress unstable activity and reduce compute, but it should not be expected to cross the reproduction-driven propagation barrier unless the network's expansion operator is also changed.
Replace penalty-based equality-constrained training with a two-timescale optimizer. A fast variable tracks the normal correction that drives constraint residuals toward zero, while the slow parameter update follows the task gradient projected onto the local constraint tangent space. This should reduce sensitivity to very large penalty weights and preserve feasibility more accurately during training.
Treat each recurrent update or inference block as a time-dependent map F_n and regularize it toward a limiting autonomous map F whose long-horizon dynamics are easier to analyze. In addition to penalizing one-step map differences, impose a quotient-consistency loss so that pairs of hidden states that are asymptotically indistinguishable under F remain indistinguishable under every time-dependent generator F_n.
Treat the learned latent transition F_theta as a homeomorphism-like operator and monitor the range of its temporal-difference operator D_theta u = u composed with F_theta minus u. If the smallest nontrivial singular values of the sampled operator collapse toward zero as trajectory length or basis size grows, the latent dynamics are entering an ill-conditioned coboundary regime. Use this signal to reduce the recurrent step size, impose contraction, or replace the transition by a periodicized…
Replace fixed graph-convolution weights with edge couplings that depend on learned node amplitudes and relative phases, following the power-grid stability construction. Add trainable positive diagonal margins that dominate aggregate phase-weighted incident coupling, then use the resulting operator in a residual or recurrent GNN layer. This creates an operating-point-aware propagation rule intended to reduce oversmoothing, exploding iterates, and sensitivity to graph degree or edge loading.
Add a spectral regularizer to a linear state-space or recurrent layer that controls the overlap between its controllable and observable state directions. The regularizer uses the paper's identity to monitor eigenvalues of (I+PQ)^{-1}, equivalently the squared canonical correlations between reachable and observable subspaces, and penalizes degenerate or overly concentrated spectra.