Unverified
2026
Represent each trainable parameter block as a global scale multiplied by a normalized shape, and evolve the shape through a projected Hamiltonian optimizer. The optimizer is designed so that normalized weights can approach a stable central configuration while auxiliary momenta retain phase-space volume that prevents ordinary Hamiltonian dynamics from having a full-space attractor.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Construct an orthogonally equivariant residual map on symmetric feature matrices whose update is strongly monotone by adding the identity to a monotone isotropic tensor function. This provides a stability-controlled matrix block and a route to well-behaved inverse or fixed-point inference, rather than relying only on unconstrained residual weights.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Replace an unconstrained matrix nonlinearity on small symmetric feature blocks with the isotropic spectral lift of a permutation-equivariant monotone map on eigenvalues. The layer remains orthogonally equivariant, while the paper's equivalence transfers a scalar inner-product monotonicity certificate from eigenvalue space to the full matrix space.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a differentiable penalty to flow-matching batches that penalizes violations of the N-cyclic monotonicity inequalities implied by the minibatch OT reflow limit. The regularizer can either refine approximate Sinkhorn assignments or train the velocity field to preserve locally non-crossing endpoint geometry, providing a cheap alternative when exact assignment is too expensive.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace a Euclidean low-rank latent decoder with a geodesic factor decoder on a Riemannian manifold. A learned location α provides the component center, a small set of tangent loading vectors V captures anisotropic variation, and latent coefficients z generate curved manifold-valued features through the exponential map. Multiple such decoders can form a mixture-of-geodesic-experts layer for multimodal representations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the network-space inverse inequality to choose derivative order, collocation resolution, and feature separation jointly instead of enforcing arbitrarily high-order residuals on an under-resolved network. This creates an anti-aliasing rule: a network whose parameters are separated by \(\underline h\) cannot represent high Sobolev frequencies without a factor \(\underline h^{-(r-s)}\), so derivative penalties above the resolvable order should be disabled or accompanied by refinement.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained spatial gate or interpolation kernel by a compactly supported function whose translates under a lattice exactly sum to one. Impose zero products between translates under a second lattice, so active gates do not collide; thresholding a positive superlevel set then provides a nonzero separation margin and predictable sparse computation.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Compute a compact multiscale interaction signature between colored point clouds and append it to a point-cloud or multimodal neural network as a learned interaction token. The signature captures separated, overlapping, and higher-order enclosing configurations while remaining invariant to rigid transformations.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the paper's linearized Beltrami equation as a custom Jacobian-vector product or implicit backward rule for a differentiable deformation solver. Instead of differentiating through an ill-conditioned solve naively, solve a normalized linearized equation whose source is scaled by the coefficient derivative; the derivative-to-ellipticity cancellation keeps sensitivity bounded even when the learned warp approaches extreme distortion.
Useful6/10
Difficulty8/10
Novelty8/10
Unverified
2026
Add a spectral fractional energy-gap regularizer to hidden features defined on a graph, image grid, or token interaction graph. The penalty is large when a channel has sign changes that create high-frequency fractional energy, while preserving the feature magnitude after applying elementwise absolute-value truncation.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace an unconstrained learnable distance-bias function in a graph neural network or distance-aware attention layer by a Bernstein approximation of a positive-definite circular kernel. The resulting kernel is a degree-n polynomial in normalized distance while preserving positive semidefiniteness of every finite Gram matrix on the circle, preventing training from producing an invalid covariance-like similarity structure.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Attach a differentiable local safety-risk estimate to a neural network by treating the scalar violation margin as a half-space after first-order linearization. Under a Gaussian perturbation model, the estimated probability of crossing the violation boundary is a single normal-CDF evaluation rather than thousands of random perturbation trials. Penalize this risk during training or use it to trigger abstention at inference, while tracking an empirical bound on the fraction of perturbations that…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace Euclidean projection onto a smooth convex parameter constraint by a local tangent-halfspace linear minimization step. The method is particularly suitable for convex softmax heads or low-dimensional adapter parameters constrained to an ellipsoid, where projections require matrix solves or expensive nonlinear routines but membership and boundary-normal queries are cheap.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace unconstrained predicted pairwise similarities with a correlation matrix whose diagonal is exactly one and whose spectrum is explicitly prevented from entering the nearly singular regime typical of high-dimensional elliptope samples. Add a soft spectral barrier during training and use a PSD-safe factorization at inference, so the model can represent dense correlations without relying on an unstable nearest-correlation-matrix repair.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace exhaustive optimization of N binary gates by the geometrically admissible sign patterns induced by projections onto a common direction. For two-dimensional gate vectors, enumerate angular cells exactly; for higher-dimensional vectors, sample directions and evaluate only the induced configurations.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a Euclidean position-plus-rotation recurrent state with an SE(3)-valued latent pose and predict six-dimensional algebra increments rather than directly regressing a rotation matrix or Euler angles. Jointly propagate a pose covariance and penalize Gaussian chance-constraint violations, so the model learns both a nominal trajectory and feedback-like uncertainty contraction.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Insert a recurrent layer that repeatedly replaces a three-by-three feature affinity matrix by the Pearson correlations of its rows. Unlike an unconstrained recurrent affinity update, the state remains a valid correlation matrix, becomes rank at most two after one step, and in dimension three converges globally to one of seven fixed points. Use the converged patterned fixed point as a differentiable or stop-gradient clustering/relational embedding, while monitoring rank and kernel-coordinate…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Represent a neural-network weight tensor by rank-one terms whose mode factors are selected from shared orthonormal bases, and impose the same basis alignment across tensor flattenings. During or after training, retain the largest coefficients to obtain a structured truncation analogous to truncated SVD. This should produce better-conditioned tensorized layers than unconstrained CP factors while preserving a directly controllable accuracy/compute tradeoff.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Construct a 2D recurrent or residual neural lattice with slowly varying local couplings, while parameterizing those couplings so that an anisotropy invariant remains constant across all spatial and depth locations. The network obtains controlled local propagation velocities rather than arbitrary inhomogeneous amplification, enabling depth-dependent receptive fields while preserving near-critical signal propagation.
Useful6/10
Difficulty6/10
Novelty8/10
Unverified
2026
Build a recurrent ReLU module that evaluates a binary refinement cascade using a fixed-dimensional state and shared cell weights. Replace hard binary digit selection with two overlapping circle coordinates; switch between their affine state updates only at points where the two candidate updates agree, so the switch is an exact continuous piecewise-linear ReLU operation rather than a multiplicative gate.
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Warp each observed shape and its interior scalar fields into a fixed reference domain using a learned diffeomorphism, then process the resulting canonical SDF with a CNN or 3D encoder. The representation should be insensitive to translation, rotation, reflection, scale, and re-parameterization when the correspondence module is constrained to absorb those transformations rather than shape changes.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a transformation-invariant global shape loss based on the interpoint-distance distribution or its Riesz-energy transform to a network that predicts polygon vertices or masks. Matching this signature forces the prediction to reproduce global side-length and angle structure even when local vertex correspondence is ambiguous, while random translations, rotations, and reflections require no alignment preprocessing. The uniqueness guarantee applies to generic polygonal domains, so this should be…
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Represent prototypes or attention keys by points p_i on the unit sphere and regularize their configuration with a Green-potential log-partition objective inspired by the TPMS branch-point formulation. The objective penalizes configurations whose positive and negative Gibbs-weighted potentials are concentrated in different regions, providing a smoother alternative to pairwise repulsion or uniformity losses.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Project each FFN residual update onto the tangent space of the current token residual direction before adding it to the stream. This preserves the component that changes representation direction while suppressing norm-only motion, which may reduce residual-norm drift and aggregation-induced representation collapse.
Useful6/10
Difficulty4/10
Novelty6/10