Unverified
2026
Add calibrated multiplicative noise to a binary energy-based model, Hopfield network, or discrete recurrent attractor system so that its effective coupling follows a chosen distance from the collective critical point. Unlike ordinary temperature annealing, the controller distinguishes microscopic channel noise from Gibbs or sampling noise and predicts when ordered attractors should disappear through a measurable susceptibility peak.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace a finite-dimensional latent prior for fields or trajectories with a continuous flow acting on function coefficients in a separable Hilbert space. A Gaussian reference with an explicit covariance spectrum is transformed by a learned vector field, so the model can represent smooth, non-isotropic function distributions while sharing parameters across discretization resolutions.
Useful6/10
Difficulty6/10
Novelty6/10
Unverified
2026
Train multiple neural-network parameter particles with a deterministic Stein interaction plus Langevin noise instead of using independent SGD or SGLD chains. The Stein term repels nearby particles while moving the ensemble toward high target probability, and the Langevin term supplies diffusion that improves exploration and prevents particle collapse.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Use coordinate hit-and-run rather than isotropic Gaussian random walks to generate latent negatives or augmentation trajectories inside a convex latent domain K. At each step, select one coordinate and resample the entire feasible chord along that coordinate; the paper's l0-isoperimetric theorem predicts that sets of non-negligible mass cannot be separated by severe coordinate-only bottlenecks when K is well-conditioned relative to an unconditional body Q.
Useful6/10
Difficulty5/10
Novelty6/10
Unverified
2026
Attach an exact structural uncertainty report to any best-of-N evaluation: after measuring reliability only for budgets n = 1,...,m, report that deployment reliability at budget N is unresolved by at least B_{m,N}. Use this width to select the smallest audit budget that makes a claimed reliability gap meaningful, or reject model comparisons whose validation budget lies below the square-root-of-N threshold.
Useful6/10
Difficulty3/10
Novelty8/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
Run Metropolis-Hastings directly on neural architectures modulo permutations of structurally exchangeable hidden units, channels, or experts rather than treating every labelled representation as a distinct architecture. Correct the proposal ratio using representation-orbit sizes, so architectures with many internal symmetries receive the intended posterior mass.
Useful6/10
Difficulty6/10
Novelty5/10
Unverified
2026
Reparameterize all Bayesian neural-network weights by a bounded latent vector in the unit ball and use a simple ball-constrained MCMC kernel instead of unconstrained HMC or random-walk sampling. A radial diffeomorphism expands points near the ball boundary into arbitrarily large weights, preserving heavy-tailed posterior mass while preventing the sampler from numerically wandering through an unbounded parameter space.
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Generate augmentation parameters from a binary digital net with matrix or linear scrambling instead of independently sampled uniforms or fully Owen-scrambled points. The construction should cover the augmentation hypercube while avoiding the severe local clustering predicted for random and locally independent scrambling, giving each training window a more uniform set of transformation strengths.
Useful6/10
Difficulty4/10
Novelty7/10
Unverified
2026
Replace slow primal-coordinate Gibbs sampling of a graph-structured Gaussian latent feature field with Gibbs sampling in the Fourier-dual factor graph. Use the primal convergence formula to determine when dual sampling is worthwhile, and map dual samples back to neural features through the graph incidence operator.
Useful6/10
Difficulty7/10
Novelty7/10
Unverified
2026
Replace stepwise gradient evaluation in a Bouncy Particle sampler over neural-network parameters with deterministic windows. At the start of each window, compute one gradient and use smoothness to upper-bound the event intensity along the ballistic trajectory; candidate events are generated analytically from the integrated envelope and accepted using a gradient evaluation only at candidate locations. This gives an exact sampler under a certified global smoothness bound and a controllable…
Useful6/10
Difficulty6/10
Novelty7/10
Unverified
2026
Equip an autoregressive model with a hard constraint that generated token ranks cannot contain a nondecreasing subsequence of length k. Maintain a patience-sorting-style state representing the smallest ending token rank achievable by subsequences of lengths 1 through k-1, mask tokens that would create a length-k subsequence, and optionally sample uniformly among valid continuations using exact suffix counts. This provides a mathematically controlled data-augmentation or decoding regime for…
Useful6/10
Difficulty5/10
Novelty7/10
Unverified
2026
Replace Langevin or random-walk sampling for a strongly log-concave neural subproblem with randomized Hamiltonian trajectories. Each iteration draws a fresh Gaussian velocity, integrates position and velocity for a random triangular or exponential duration, and discards the terminal velocity before the next refresh. The target is a regularized posterior over a convex neural-network head, where the paper's accelerated dependence on the strong-convexity parameter is applicable.
Useful6/10
Difficulty5/10
Novelty5/10
Unverified
2026
Replace a fixed discrete augmentation distribution over a finite symmetry group by a continuous-time random walk driven by learnable symmetric Poisson jump rates. Use the resulting transformed-example distribution as a symmetry regularizer, with an even ℓ^{2m} distance to uniformity whose behavior is guaranteed to improve monotonically as the symmetric rates increase for the group families covered by the paper.
Useful5/10
Difficulty5/10
Novelty7/10
Unverified
2026
Put a gradient-Gibbs prior on differences between connected neural parameters rather than on individual parameters, and evolve the parameters with Langevin steps generated from randomly selected strictly convex component energies. The aggregate regularizer may be non-convex, but every sampled component has controlled curvature and outward drift, providing a practical stability mechanism for noisy training.
Useful5/10
Difficulty5/10
Novelty6/10
Unverified
2026
Replace rejection sampling or short biased random walks inside a convex latent constraint set with hit-and-run. At each step, choose a uniformly random direction and sample uniformly along the entire chord through the current point; the paper's mixing result predicts that a chain initialized by a crude approximate sampler becomes close to uniform with only logarithmic dependence on initialization bias and target error.
Useful5/10
Difficulty5/10
Novelty7/10
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
Replace MAP scoring of discrete latent configurations by comparison of the total energy-model mass assigned to each candidate class. Estimate each class partition function with annealed importance sampling driven by identical random seeds, then return a prediction only when a paired bootstrap confidence interval certifies that its log-partition score exceeds every competitor.
Useful5/10
Difficulty6/10
Novelty6/10
Unverified
2026
Add a learned stochastic pair-interaction layer to a particle graph neural network, with a conditional normalizing flow generating the post-interaction relative state. Parameterize the update in center-of-mass and invariant relative coordinates so every sampled interaction preserves pair momentum and kinetic energy exactly. The flow learns the transition law directly from observed scattering or trajectory data, replacing repeated numerical collision solves or unconstrained message-passing…
Useful5/10
Difficulty6/10
Novelty6/10