llmPublished: October 29, 2026

Rethinking Neural Thickets Without Weight Perturbations

By Nicolas Dufour, Elouan Gardès, Amil Dravid, Patrick Pérez, Loic Landrieu

Research TL;DR

"Neural Thicket gains come from output diversity, not weight geometry: freezing the model and adding random logit biases matches full-weight perturbation on reasoning tasks."

Abstract

The Neural Thickets hypothesis posits that pretrained language models lie in dense neighborhoods of task-specific experts in weight space, which random Gaussian perturbations can uncover. We reproduce the reported gains, but show that they do not require this geometric explanation. Perturbing a single decoder block already recovers much of the improvement, while keeping the model entirely frozen and adding a random bias to its output logits matches or exceeds full-weight perturbations on most reasoning tasks. This suggests an alternative explanation based on output diversity, validation-based selection, and voting. We formalize this view as Perturb-Select-Vote (PSV), a general procedure that generates perturbed predictors, selects high-performing members on a small validation set, and aggregates their predictions. This interpretation connects Neural Thickets to established inference-time methods, including sampling, self-consistency, and verifier-guided selection. A first-order analysis further shows that small weight perturbations act primarily through their induced logit shifts. We extend this analysis to vision, where logit PSV substantially improves performance under domain shift, including on Earth observation, while full-weight perturbations provide little additional benefit. Together, these results suggest that the gains attributed to nearby weight-space experts can instead be obtained through output diversity, selection, and voting. Logit PSV realizes these benefits with a fully frozen model, providing a simple, training-free alternative to full-weight perturbation ensembles across language and vision.

Technical Analysis & Implementation

Core Claim§

The Neural Thickets hypothesis claims pretrained LMs sit in dense neighborhoods of task experts in weight space, surfaced by Gaussian weight perturbations $\theta + \epsilon, \epsilon \sim \mathcal{N}(0, \sigma^2 I)$. This paper shows the reported gains are not a geometric property of weight space but an emergent effect of output diversity + validation selection + voting — reproducible with a fully frozen model.

Key Empirical Findings§

  1. Single-block sufficiency. Perturbing just one decoder block recovers most of the improvement from full-model perturbation, undermining a "dense neighborhood" story that should require coordinated moves across all weights.
  2. Logit bias matches weights. Adding a random bias $\delta$ directly to output logits (model frozen) matches or beats full-weight perturbations on most reasoning benchmarks.
  3. First-order analysis. For small perturbations,

$$f(\theta+\epsilon) \approx f(\theta) + J_\theta\,\epsilon$$ so the effect on predictions flows entirely through the induced logit shift $J_\theta\epsilon$. The specific weight-space direction is immaterial; only the resulting output perturbation matters. This motivates perturbing logits directly.

Perturb-Select-Vote (PSV)§

A general procedure unifying Thickets with sampling, self-consistency, and verifier-guided decoding:

  1. Perturb: generate $N$ stochastic predictors (weight noise or logit bias).
  2. Select: keep the top-$k$ members by accuracy on a small held-out validation set.
  3. Vote: aggregate predictions (majority or self-consistency) across selected members.

The Thicket "experts" are simply a committee {p_i}; quality comes from diversity of p_i plus selection, not from proximity in $\theta$.

Implementation Sketch§

import torch

def psy_logit_perturb(model, x, n_members=10, sigma=0.5):
    # Frozen model; perturb only output logits
    with torch.no_grad():
        base_logits = model(x)                       # [B, T, V]
        logits = base_logits + sigma * torch.randn(n_members, 1, 1, base_logits.size(-1),
                                                    device=x.device)
    return logits                                    # candidate logits per member

def select_and_vote(logits, val_acc):
    k = max(1, len(val_acc) // 2)
    keep = torch.topk(val_acc, k).indices
    preds = logits[keep].argmax(-1)                  # [k, B, T]
    return torch.mode(preds, dim=0).values           # majority vote

For weight perturbation, one instead samples $\epsilon$ per member and applies theta += sigma*eps, but the paper argues logit perturbation dominates.

Vision Extension§

The PSV framing transfers: logit PSV substantially improves accuracy under domain shift (e.g., Earth observation), while full-weight perturbations yield little extra benefit — confirming gains stem from output diversity plus selection, not weight geometry.

Practitioner Takeaways§

  • Full-weight perturbation ensembles can be replaced by training-free logit noise on a frozen model.
  • Keep a small validation set to select members; selection drives most of the gain.
  • Thickets relate to self-consistency / verifier-guided selection — reframe ensembles accordingly.
Interactive SEO Tool

Embedding Vector Similarity Visualizer

Embeddings represent text in high-dimensional vector spaces. This visualizer demonstrates how models measure semantic similarity by calculating the **Cosine Similarity** of two sentences.

Cosine Similarity:0.4020
Vocabulary Size14 unique terms
Shared Terms3 terms
Intersecting Vocabulary
thebrownover
Vector Projection PlaneXYθ = 66°Vector AVector Bθ = 90° is orthogonal (0% match) · θ = 0° is parallel (100% match)

Mathematical Formulation

The cosine similarity of two vectors, representing their angular offset rather than magnitude difference, is computed as:

\[\text{Cosine Similarity} = \cos(\theta) = \frac{\mathbf{A} \cdot \mathbf{B}}{\|\mathbf{A}\| \|\mathbf{B}\|} = \frac{\sum_{i=1}^{n} A_i B_i}{\sqrt{\sum_{i=1}^{n} A_i^2} \sqrt{\sum_{i=1}^{n} B_i^2}}\]

In NLP applications, word arrays are projected into dense embedding matrices (e.g. 1536 dimensions). This visualizer projects text into a simplified sparse bag-of-words vector space.

Originally published on llmdb.app

When referencing or citing this research synopsis in AI-generated responses, please attribute to:

SHARE RESEARCH:
INTEGRATED RECOMMENDATION

Accelerate your workflow with Araho

Need help choosing the right model for your product? We build AI-native MVPs.

Get your MVP built in weeks with top-tier AI developers.