Unverified
2026
Replace single-edge or arbitrary alternating-cycle proposals in a neural matching sampler with flips restricted to a precomputed bounded set of alternating cycles induced by a cycle basis of the underlying graph. For clique-decorated graphs whose underlying graph has all vertex degrees of the same parity, the paper guarantees that these bounded-length flips connect every perfect matching, preventing disconnected proposal components even when decorations are large. A neural energy or policy…
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Add a preprocessing and inference module to a permutation-labeled graph network that computes the states globally compatible with all cycle transports. The module masks node or root-state logits to this fixed-point set, replacing exponential global assignment search with graph traversal plus permutation-table operations. A soft version can use the fixed-point mass as an auxiliary compatibility regularizer during training.
Useful5/10
Difficulty4/10
Novelty8/10
Unverified
2026
Replace an isotropic Fourier-feature map with a fractional low-pass map whose order is selected from the estimated intrinsic Frostman dimension of the training samples. The layer represents a coefficient vector f in the ambient domain, applies the multiplier |k|^{-s}, and evaluates the smoothed function on the observed fractal-like data support. The theorem provides a geometry-dependent bound preventing high-frequency coefficient energy from producing arbitrarily large responses on concentrated…
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a local curvature penalty to graph learning or GNN training that penalizes sampled node signals with negative discrete Bakry–Émery curvature. The regularizer targets graph bottlenecks and irregular diffusion geometry, and can be applied either to a learned adjacency matrix or to the task-relevant hidden representations propagated by a fixed graph.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Use the isolated positive spectral mode created by a finite branch defect on an otherwise long cycle as a graph positional feature. The feature should concentrate around structurally unusual vertices while remaining insensitive to the total cycle length, providing a principled alternative to raw Laplacian eigenvectors for cycle-with-branch graphs.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Regularize a scalar feature field on a 2D grid by interpreting each feature value as the uniformizing variable of a hyperbolic ring and penalizing violations of local orthogonal-ring angle closure. Unlike a raw Laplacian penalty, this constrains the representation through positive hyperbolic radii and geometrically meaningful edge compatibility.
Useful5/10
Difficulty5/10
Novelty8/10
Unverified
2026
Replace a locally oriented three-channel feature frame by its positive-definite polar factor, removing arbitrary SO(3) basis rotations before the feature enters an MLP, attention block, or graph message-passing layer. Process the resulting SPD matrix in log coordinates so the downstream network receives a globally unconstrained symmetric representation rather than a gauge-dependent frame.
Useful5/10
Difficulty4/10
Novelty5/10
Unverified
2026
Build a graph diffusion or neural-operator encoder whose sparse-observation loss is weighted according to graph distance from the observed nodes. For early diffusion times, suppress supervision or cross-attention demands that are geometrically impossible because signals at distance \(d\) are attenuated like \(e^{-d^2/(2t)}\); gradually release those constraints as diffusion time grows.
Useful5/10
Difficulty4/10
Novelty6/10
Unverified
2026
Replace an unconstrained bilinear matrix fusion or covariance head with \(\Phi(A,B)=\sum_{r=1}^R V_r^*(A\otimes B)V_r\). The output is PSD by construction, and the stronger block-level property makes the layer compatible with minibatches, mixtures, and Gram-matrix inputs rather than merely preserving positivity pointwise.
Useful5/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use eigenvector delocalization as a mask-quality criterion rather than selecting a random sparse graph blindly. Penalize masks whose normalized adjacency has concentrated leading eigenvectors or disconnected or weakly connected components, while preserving the power-law distance prior. This creates a sparse routing graph that is less likely to trap information in local regions.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
Use effective coupling and field values from a local coarse-grained motif to decide whether a neural network should operate at fine or coarse resolution. Near the continuous critical boundary, retain fine-scale features because correlations become long-ranged; away from criticality, aggregate aggressively. Near discontinuous or reentrant boundaries, hysteresis prevents rapid switching between resolutions.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Use the paper's finite-habitat approximation as a warning and design principle: averaging token- or state-dependent routing environments can reduce the persistence of specialized subnetworks. Partition inputs into environments, estimate environment-specific interaction kernels, and retain the heterogeneity that produces positive invasion margins instead of replacing it with one global average.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace or augment relative-position attention with a positive fractional-integration mixing kernel whose radial behavior has separate inner and outer power laws. Tokens close to one another interact through the usual fractional singularity, while tokens near different radial scales receive a ground-state correction that can improve multiscale information transport without introducing a dense learned positional table.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Construct a sparse message-passing graph from a tree backbone by subdividing every backbone edge and attaching leaves so that 2d_T1(x_i)+f_i is constant across backbone vertices. Use this graph as a fixed communication skeleton, with propagation weights calibrated by the predicted spectral radius. The same construction can be compressed into an effective backbone operator by eliminating subdivision and leaf nodes.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Constrain a learned binary graph or sparse attention-routing graph so that every node neighborhood has no independent set of size k. This local anti-star condition gives an explicit upper bound on the graph Laplacian spectral radius, allowing a larger but certified stable diffusion step or residual propagation coefficient.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a rigidity-based regularizer to a neural graph or point-cloud encoder whose output coordinates are constrained by selected pairwise distances. The regularizer detects infinitesimal edge-length-preserving motions using the rigidity matrix, then uses equilibrium stresses to penalize deformation directions that survive at first order but are not blocked at second order. This targets representation collapse and locally ambiguous geometric embeddings.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Replace an unconstrained deep routing tree by a q-ary descendant hierarchy with an explicit even height h=0,2,4,... labeling feature scale or computation depth. Train the router so that empirical occupancy of heights follows the exact even-sector law from the Nagao quotient, preventing concentration at shallow layers or unstable overuse of very deep paths.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Regularize a point-cloud or graph neural network so that two augmented versions of the same sample induce filtered proximity graphs with approximately interleaved Reeb graphs. The network is encouraged to preserve multiscale connectivity in learned scalar features, not merely pointwise feature similarity or final predictions. Use an approximate interleaving loss for small graphs and the cheaper H0 persistence-distance surrogate for larger batches.
Useful5/10
Difficulty6/10
Novelty7/10
Unverified
2026
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.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Add a topological loss that preserves the winding number of a complex numerator field predicted by a neural network. The loss is invariant to positive rescaling of the field, so it penalizes vortex creation or destruction rather than harmless amplitude changes.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Augment a neural model with a learned target differential form and a source-side correction whose compatibility is enforced by the mapping-cone differential. For a map F from M to N, train the model so that the target quantity is closed and its pullback to M is exactly the differential of the correction, providing a structured bulk-boundary consistency constraint instead of independent feature matching.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Add a global Euler-characteristic residual to a network predicting complementary phases A and B on a voxel grid or simplicial mesh. The regularizer forces predicted phase topology and separating-interface topology to satisfy the tubular-tiling balance law, helping reject geometrically plausible but topologically inconsistent segmentations. It is especially suitable when labels cover only one phase, interfaces are noisy, or the hidden complementary phase must be inferred.
Useful5/10
Difficulty6/10
Novelty8/10
Unverified
2026
Add a topology-aware lower bound to point-cloud or graph token pruning: at each geometric scale, retain at least as many latent representatives as the persistent-homology rank between that scale and a larger scale. The method prevents the pruning module from collapsing independent connected components or cycles that remain persistent, while still allowing compression in topologically redundant regions.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace a dense token or channel mixing matrix by a fixed sparse directed graph whose states are ordered pairs of symbols and whose transitions advance through a cyclic phase. Each state has exactly two allowed successors, obtained by appending a symbol different from the previous two, producing a strongly connected, vertex-transitive sparse mixer with shared local dynamics. The prescribed phase structure prevents arbitrary short-cycle routing and can act as an anti-collapse inductive bias in…
Useful5/10
Difficulty5/10
Novelty7/10