Tagged articles
top-k
10 articles · Page 1 of 1

Qborfy AIJun 16, 2026 · Artificial Intelligence
This guide explains how temperature, top_p, top_k, and min_p control LLM output, compares their effects, warns against common pitfalls, and provides concrete configuration recommendations and step‑by‑step tuning workflows for tasks such as code generation, QA, dialogue, translation, and creative writing.
LLMmin_pparameter tuning
0 likes · 22 min read

The article explains how logits are transformed into probabilities via softmax and how generation parameters such as temperature, top‑k, top‑p, frequency‑penalty, presence‑penalty, and max_tokens intervene in the logits‑to‑sampling pipeline, detailing their mechanisms, common misconceptions, and practical limitations.
LLMfrequency_penaltygeneration parameters
0 likes · 15 min read

This article explains how LLMs generate tokens via probability distributions, details three sampling strategies — temperature, top-k, and top-p — with concrete DeepSeek API examples, outlines four methods for structured output, and discusses why hallucination is an inherent feature of probabilistic generation rather than a bug.
DeepSeekHallucinationLLM
0 likes · 8 min read

The article explains how sampling parameters—Temperature, Top‑k, and Top‑p—shape the output of large language models, comparing greedy and beam search, illustrating probability changes with concrete examples, and offering practical guidance on adjusting these settings for different tasks.
Greedy SearchLLMbeam search
0 likes · 9 min read

This article explains how the key LLM parameters—Temperature, Top‑K, Top‑P, and MaxOutputTokens—affect randomness, creativity, candidate selection, and output length, and provides practical guidance on tuning them for different AI text generation tasks.
AI GenerationLLMParameters
0 likes · 7 min read

This article explains how to efficiently find the k most frequent elements in an integer array using a bucket‑sort based algorithm that runs in linear O(n) time, detailing problem constraints, conventional O(n log n) approaches, the optimized method, Go implementation, complexity analysis, and test results.
Algorithmbucket sorttime complexity
0 likes · 7 min read


政采云技术Sep 19, 2023 · Big Data
This article explains core concepts and practical solutions for handling massive datasets that cannot fit into memory, covering batch processing, distributed sorting, bitmap indexing, hash‑based lookups, top‑K extraction, and deduplication techniques with code examples and multi‑machine strategies.
big databitmap-indexingdeduplication
0 likes · 18 min read

The article explains how generative models use deterministic methods like greedy and beam search and stochastic techniques such as top‑k, top‑p, contrastive search and sampling, describing their mechanisms, temperature control, repetition penalties, and practical trade‑offs for balancing fluency, diversity and coherence.
AIbeam searchcontrastive search
0 likes · 9 min read

This article reviews recent advances in applying reinforcement learning to recommendation systems, explains the fundamental RL concepts, discusses the specific challenges such as large action spaces, bias, and long‑term reward modeling, and summarizes two influential YouTube papers along with practical insights and future directions.
Off-PolicyReinforcement LearningUser Modeling
0 likes · 13 min read

This article explores practical algorithms for sorting, de‑duplicating, and extracting top‑K records from massive data sets, covering bitmap techniques, external sorting, hash‑based counting, min‑heap selection, divide‑and‑conquer, Bloom filters, and distributed processing strategies.
BitmapHashbig data
0 likes · 10 min read
