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
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
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
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
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
Regularize a neural representation so that no one-dimensional projection places too much probability mass inside a narrow interval. This transfers the paper's uniform tube estimate into an anti-collapse constraint, making representations robust to adversarial directions and preventing hidden features from becoming effectively low-dimensional.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a dense directional feature map with a finite stable-zonotope layer: a small set of large random vectors creates a hyperplane arrangement over the input sphere, while a cheaper small-jump residual gives continuous features inside each cell. The layer exposes an explicit compute-versus-resolution knob through the jump cutoff and can be used either as an embedding before an MLP or as a lightweight router for mixture-of-experts blocks.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace the single backpropagated subgradient of a piecewise-smooth network loss by a minimum-norm convex combination of gradients evaluated at nearby parameter perturbations. Shrink the perturbation radius geometrically and restart the schedule when the sampled Goldstein direction becomes small, following the paper's INGD motivation.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Construct a neural mixing layer only from Brauer generators for the orthogonal group: identity, pairwise swaps, and pairwise contractions with the Euclidean metric. This gives an exactly O(2)-equivariant alternative to unconstrained tensor mixing, with trainable coefficients but fixed symmetry-preserving basis maps.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a naively evaluated mixture of power-law experts with a Newton-envelope layer that computes all monomial magnitudes in log-space and subtracts their maximum before exponentiation. The layer exposes both a stabilized mixture value and soft dominance weights, allowing a downstream MLP to adapt to whichever scaling regime is active without overflow or hand-designed regime splits.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace a conventional momentum update by a damped second-order trajectory with a configuration-dependent dense kinetic metric. Evolve two phase-space copies using symmetric split orderings, project both copies exactly back to their averaged physical state, and apply exact friction half-steps so momentum decay remains stable at large step sizes.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Use the scaled-boundary radial coordinate to control collocation density near a known point singularity or sharp source located at the scaling center. Instead of sampling \(\rho\) uniformly, choose a transformed or Gauss-Jacobi radial rule whose weights analytically cancel the geometric factor \(\rho^{d-1}\), reducing gradient variance and resolving singular fields with fewer points.
Useful6/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace random interior collocation points in domain-integrated neural losses with deterministic points generated by scaling oriented boundary patches toward an interior center. The resulting quadrature exactly integrates low-degree polynomial integrands on affine polytopes and gives a mesh-free, geometry-aware loss for PINNs and neural fields.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
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
Unverified
2026
Represent adaptive computation or MoE routing as a continuous latent trajectory that crosses convex mode walls, with a Minkowski norm defining computational speed. At a wall, choose the outgoing latent velocity by the same constrained variational rule as billiard reflection, and use the local path-length certificate to detect or prevent pathological accumulation of infinitely many routing events in finite depth.
Useful6/10
Difficulty7/10
Novelty8/10
Unverified
2026
Add a neural feature, adapter, or expert block only through the component of its outputs that is orthogonal to the span of all previously installed blocks. Quotient coefficient directions that produce nearly identical outputs with an SVD or pseudoinverse, so the new block contributes intrinsic representational dimensions instead of duplicating old features. The expected benefit is a smaller effective architecture and better-conditioned block expansion.
Useful6/10
Difficulty5/10
Novelty6/10
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
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
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
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
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
Unverified
2026
Represent the predicted solution as $u_{\theta}(x)={\rm d}_{\Omega}(x)^s v_{\theta}(x)$, where $v_{\theta}$ is an unconstrained neural network and ${\rm d}_{\Omega}$ is the distance to the boundary. This builds the fractional Dirichlet boundary layer into the architecture and leaves the network to learn the smoother quotient $u/{\rm d}_{\Omega}^{s}$, which the paper proves extends Hölder-continuously to the boundary when the reaction has sufficient integrability.
Useful6/10
Difficulty4/10
Novelty6/10
Unverified
2026
Build a sparse expert cascade whose router uses empirical progress, uncertainty, and compute cost to construct an efficient frontier of experts. Instead of always choosing the expert with the largest immediate gain per FLOP, route different confidence states through an ordered sequence of frontier experts, allowing cheap high-variance experts early and safer or more cost-effective experts near the final decision.
Useful6/10
Difficulty5/10
Novelty6/10