Unverified
2026
Replace an unconstrained latent-to-data map in a small generative model with a learned Brenier map T equal to the gradient of a convex potential, transporting a Gaussian latent distribution toward a density proportional to exp(-B) times the Gaussian density. Constrain B to be globally L-Lipschitz and use the resulting dimension-free Jacobian ceiling as an adaptive stability target. This should reduce pathological local expansion without requiring B itself to be convex or its Hessian to be…
Useful6/10
Difficulty7/10
Novelty6/10
Unverified
2026
Use the paper's non-expansive spectral projection as a constraint-preserving optimizer step for trainable SPD matrices, including Mahalanobis metrics, covariance heads, graph kernels, and quantum density operators. After an SGD or AdamW proposal, symmetrize the matrix and clip every eigenvalue into \([\alpha,\beta]\).
Useful6/10
Difficulty4/10
Novelty5/10
Unverified
2026
Add a nonnegative regret term for applying an action selected under a stale evaluator to the current evaluator. In a neural classifier, the action can be a prediction, routing decision, augmentation choice, or robust logit correction, while the evaluator is a vector of uncertainty or distribution-shift weights. The penalty is zero when the stale action remains optimal under the new evaluator and increases only when evaluator drift causes a value loss.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Propagate uncertain inputs or parameter perturbations through a neural network with zonotopes, and choose the reduction rule after each layer using short lookahead that predicts downstream certified-bound error. Candidate reducers can include largest-generator retention, box conversion, and norm-based merging; unlike a fixed policy, the chosen rule depends on the current generator geometry and remaining network depth. The goal is tighter robustness bounds at the same generator budget, or the…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Build a recurrent or state-space model with latent coordinates split into tangent variables that carry the modeled dynamics and transverse variables that contract toward a learned invariant manifold. Penalize violations of invariance and enforce a spectral gap between tangent and transverse Jacobian dynamics, preserving useful noncontracting behavior while suppressing off-manifold drift during long rollouts.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace a Gaussian regression likelihood with a chart-pulled exponential-family head. The network predicts a natural parameter eta, while each target y is mapped to a bounded probability coordinate u=G(y). Because the sufficient statistic T(u) is bounded, extreme targets cannot create arbitrarily large parameter gradients. The chart determines the tail class, while eta controls the distribution in probability space.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Normalize a learned symplectic recurrent transition using the paper's explicit positive-definite factor instead of projecting the entire matrix onto an orthogonal group. Retain the compact unitary dynamics as the stable transport component and separately damp only the noncompact factor, providing a tunable stability mechanism that preserves symplectic structure.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Replace dense aggregation over patches, points, or graph neighbors with a state-dependent positive quadrature rule. A latent encoder produces the current manifold coordinate z, a small controller chooses a subset of entities, and a convex redistribution step assigns nonnegative weights so that the subset preserves the full aggregation on a learned feature basis. The method is especially suitable for neural operators and vision attention where many spatial entities are redundant along the data…
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a consistency loss for a neural model processing irregularly sampled functions or sequences, comparing its latent covariance representation before and after a time-coordinate warp. The target discrepancy should be near zero for affine transformations but should grow with the normalized curvature, bandwidth, and local sparsity of a nonlinear warp.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace ordinary nearest-neighbor or softmax codebook assignment with a capacity-constrained Laguerre assignment whose cells have prescribed masses. Optimize the codebook using the semi-discrete quadratic Wasserstein energy, whose gradient moves every site toward the barycenter of its balanced cell. This directly prevents prototype collapse and gives explicit control over expert or codeword utilization.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Replace a recurrent, SSM, or residual linear operator W by an exact affine image of a contractive matrix sigma. The resulting W lies in a prescribed matrix ball and, for the positive-real choice of parameters, satisfies a sector inequality such as W+W^* >= 0. This gives an anisotropic, learnable alternative to plain spectral normalization: the allowable operator set is convex and its center and left/right radii can encode known directional scales.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace an unconstrained positive higher-order gating function by a factorially normalized homogeneous polynomial whose coefficients are trained toward the Lorentzian Hessian signature. This gives multiplicative routing or attention interactions a controlled curvature pattern instead of allowing arbitrary unstable higher-order amplification.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace unconstrained momentum updates for selected neural-network parameter blocks by damped second-order motion on a unit sphere. The update learns directions while preserving the block norm exactly, and includes the centripetal term required for a valid acceleration constrained to the sphere rather than merely projecting gradients after an unconstrained step.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace isotropic neighbor aggregation in a graph or point-cloud neural network with a local anisotropic diffusion operator determined by empirical first and second moments of each neighborhood. Subtract the first-moment drift before aggregation, and use the normalized second-moment tensor to mix feature derivatives along the locally supported directions.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace independent per-sensor temporal encoders with a shared two-dimensional transform whose temporal and spatial phase channels remain algebraically distinguishable. Train a neural residual detector and localization head on the transformed coefficients, forcing perturbations with the same temporal signature but different positions to differ primarily in their spatial phase.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Parameterize a scalar or vector implicit neural field on each spatial cell with Bernstein polynomials and constrain its coefficients instead of sampling many points to enforce output bounds. The Bernstein convex-hull property gives a deterministic pointwise bound everywhere in the cell, making the method useful for neural fields representing densities, concentrations, masks, or material parameters.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Use the discrepancy between a learned potential and its long-time backward Lax–Oleinik evolution to identify dynamically critical states. Persistent near-contact points are candidates for the Aubry set and can guide adaptive collocation, while states with large gaps can receive fewer training samples.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace a standard recurrent or neural-CDE Euler transition with a second-order rough transition that receives both first-order increments of the input path and learned second-order branched increments. Unlike a geometric signature block, the second-order coefficients are independent learned maps rather than being forced to equal derivatives or shuffle-symmetric combinations of first-order vector fields, allowing the model to represent order-sensitive and non-geometric interactions in irregular…
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace dense attention weights with a compactly supported anisotropic bump derived from the obstacle solution, using one learnable ellipsoid per attention head or feature group. Tokens outside the learned ellipsoid receive exactly zero weight, while tokens inside receive smoothly decaying weights according to a fractional exponent. The learned positive-definite matrix represents orientation, scale, and correlations between feature dimensions.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Insert a projection-space mixer that combines several fixed or learned directions using reciprocal correlations with the current feature, then normalize the result. The exact construction has a universal beta law for its squared input-output cosine, so it can create controlled angular diversity while remaining deterministic and independent of the chosen direction dictionary.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Treat the empirical hidden-state distribution of a recurrent or state-space model as a Wasserstein-space state and estimate the linearized pushforward operator on perturbation vector fields. Penalize tangent modes whose estimated transfer gains exceed one, while retaining near-unit fixed modes that represent robust invariant distributional structure.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained hidden-to-hidden interaction in an MLP or transformer feed-forward block by two gauge-related branches. Split channels with an orthogonal involution Θ, constrain the learned interaction K to anticommute with Θ, and use opposite signs of K in paired branches. This creates a testable inductive bias in which the learned interaction only transfers information between the two channel subspaces.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Parameterize an orthogonal or semi-orthogonal neural weight matrix directly on the Stiefel manifold and update it with a Cayley retraction instead of unconstrained SGD plus a penalty or QR projection. The update preserves orthogonality exactly, is second-order accurate for the appropriate metric, and avoids the cubic QR factorization at every optimizer step.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace the recurrent transition or state-space mixer with a reversible transport followed by complementary relaxation of symmetric and antisymmetric feature components. The construction preserves a weighted energy and damps both parity sectors, giving bounded long-horizon powers without requiring the learned transition matrix itself to be symmetric. A numerical-range ellipse can be used as a cheap training-time certificate against transient growth.
Useful6/10
Difficulty5/10
Novelty5/10