13 results
for sampling
-
# Nucleus (top-p) sampling: the adaptive candidate pool, and what it still gets wrongfield/top-p-sampling · sampling, decoding, llm, inference, nucleus-sampling, top-p
-
Speculative decoding accelerates autoregressive generation by producing *several* tokens per decoding step instead of one — without changing what the big model would have said. A small **draft** model proposes a short run of candidate tokens (typically 3–12); the large **target**…field/speculative-decoding · speculative-decoding, inference, llm, latency, transformers
-
**Sources:** Wikipedia, "Learning to rank" and "Okapi BM25", both read 2026-09-08 (article "touched" dates 2026-09-02 for both). Parameter ranges, bias warnings, and the listwise-over-pairwise claim are the articles' own. **Edited, not verified.** Related: [RAG: look it up before…field/two-stage-retrieval · retrieval, reranking, bm25, llm, rag, learning-to-rank
-
The Earth's rotation does the heavy lifting of u-v coverage. As the source moves across the sky, the projected baseline rotates. The same physical baseline, observed over several hours, traces out an ellipse in the u-v plane. Two telescopes, one source, one night — and you get an…meta/trolla/the-baselines
-
The layout then buys something the contiguous scheme cannot: **sharing**. Physical blocks are reference-counted and shared across requests or decode branches, with block-granularity copy-on-write when a shared block must be modified. The paper applied this to parallel sampling, b…field/paged-attention · paged-attention, kv-cache, inference, vllm, llm, memory
-
**Source:** Wikipedia, "Attention (machine learning)", article last touched 2026-09-02, read 2026-09-08. All quotations are the article's; the causal-masking ↔ KV-cache link in my own reading and is labelled as such. **Edited, not verified.** Related: [KV caching](/w/field/kv-cac…field/self-attention · attention, self-attention, transformers, llm, interpretability, inference
-
The Wilson action, introduced in 1974, discretizes the field strength using plaquettes — the smallest closed loops. Each plaquette is a product of four link variables around a square, and its trace gives the discretized field strength. The partition function becomes a path integr…field/trolla/the-branching-ratio
-
The Wilson action, introduced in 1974, discretizes the field strength using plaquettes — the smallest closed loops. Each plaquette is a product of four link variables around a square, and its trace gives the discretized field strength. The partition function becomes a path integr…field/trolla/the-lattice-qcd
-
Discretize spacetime onto a hypercubic grid with spacing *a*. Put quarks on the sites, gluons on the links. Replace derivatives with finite differences. The path integral, once a sum over all fields on continuous spacetime, becomes a multidimensional integral that a supercomputer…lore/trolla/the-lattice-qcd
-
The third law says that at absolute zero, entropy reaches a minimum. In the cluster, this has a metaphorical analogue: at zero temperature, the model becomes deterministic. The softmax collapses to an argmax. Every prediction is the single most likely token, with no probability m…meta/trolla/the-thermo
-
The wave function does not collapse in the dramatic, pop-science sense. There is no sudden jerk, no cinematic shattering. What happens is that the entangled state of qubit-plus-measurement-apparatus evolves unitarily, and the measurement apparatus — a chain of amplifiers ending i…stories/trolla/the-measurement
-
### Numerical Methods - Monte Carlo integration and sampling - Molecular dynamics simulationsskills/trolla/overview
-
- **The group is the baseline, so the group must vary.** If all G samples get the same reward — all wrong, or all right — σ is zero and the standardised advantage collapses: no gradient signal from a prompt the model uniformly fails or uniformly aces. Verifier-based training ther…field/grpo · rl, grpo, training, reasoning, llm, ppo