❌

Normal view

Text Watermarking in Python: Catch Whoever Copies Your Writing

6 September 2026 at 14:00

AI companies quietly watermark billions of words a day. Here’s how to apply the same three families of techniques to your own writingβ€”and what real experiments reveal about which watermarks survive copy-paste, editing, and paraphrasing.

The post Text Watermarking in Python: Catch Whoever Copies Your Writing appeared first on Towards Data Science.

Disaggregation Is a Thousand-GPU Problem

4 September 2026 at 14:00

Three conditions that must hold before splitting prefill from decode pays off, and why chunked prefill is the right default below that threshold.

The post Disaggregation Is a Thousand-GPU Problem appeared first on Towards Data Science.

A RAG That Says β€œNot in This Document” Has to Show Four Kinds of Evidence

2 September 2026 at 14:00

Enterprise Document Intelligence [Vol.1 #B3] - A confident wrong answer is a bug. A bare β€œno answer” with no justification is almost as bad. Each of the four bricks has one piece of evidence to show

The post A RAG That Says β€œNot in This Document” Has to Show Four Kinds of Evidence appeared first on Towards Data Science.

Received β€” 31 August 2026 ⏭ Towards Data Science

FAQ as RAG: When You Get to Design the Corpus

31 August 2026 at 14:00

Enterprise Document Intelligence [Vol.1 #B2] - The FAQ inverts every brick of the standard RAG pipeline. Parsing is trivial, retrieval doubles as a cache, and few-shot prompting becomes a retrieval problem too

The post FAQ as RAG: When You Get to Design the Corpus appeared first on Towards Data Science.

Why RAG Complexity Should Be Earned

31 August 2026 at 12:30

A framework for building RAG pipelines that introduces complexity in response to observed failure modes, from lexical and hybrid search to reranking and agentic information seeking

The post Why RAG Complexity Should Be Earned appeared first on Towards Data Science.

Received β€” 30 August 2026 ⏭ Towards Data Science

Noisy Text in RAG: Typos, OCR, and the Gap Classical Spell-Check Leaves

30 August 2026 at 13:00

Enterprise Document Intelligence [Vol.1 #B1] - Three sources of one problem. User typos, fast-typing transcription noise, OCR character errors. Classical spell-check handles one of them. Embeddings carry the rest

The post Noisy Text in RAG: Typos, OCR, and the Gap Classical Spell-Check Leaves appeared first on Towards Data Science.

Received β€” 29 August 2026 ⏭ Towards Data Science

RAG Is Not the Whole Toolkit: The NLP Techniques Real Problems Still Need

29 August 2026 at 13:00

Enterprise Document Intelligence [Vol.1 #B00] - Retrieval answers one kind of question. Classifying a request, matching free text to a reference list, reading a table, cleaning OCR noise: each has a cheaper method that works, and the engineering is knowing which one to reach for

The post RAG Is Not the Whole Toolkit: The NLP Techniques Real Problems Still Need appeared first on Towards Data Science.

Received β€” 25 August 2026 ⏭ Towards Data Science

Can an LLM Forget the Right Things?

24 August 2026 at 12:20

A hand-written CUDA inference runtime for Vision-Language-Action robots that decides what to remember, what to forget, and when it's simply too late to think.

The post Can an LLM Forget the Right Things? appeared first on Towards Data Science.

Received β€” 24 August 2026 ⏭ Towards Data Science

Can an LLM Forget the Right Things?

24 August 2026 at 15:00

Most LLM inference runtimes have no idea a physical deadline exists. This one refuses admission rather than miss a 33ms robot control cycle, evicts KV cache by meaning instead of age, and is written entirely in hand-written CUDA β€” no cuBLAS, no libtorch.

The post Can an LLM Forget the Right Things? appeared first on Towards Data Science.

Speculative Decoding on CPUs: Nearly 4x Faster Token Generation with DFlash

24 August 2026 at 13:30

Speculative decoding can turn underused CPU compute into faster token generation, without changing the model's output. In our vLLM tests, DFlash delivered 3.92x the autoregressive throughput with Qwen3.5-9B on Intel Xeon 6 at concurrency 1. We break down where the speedup comes from, explain the acceptance metrics, and show what determines whether speculation pays off.

The post Speculative Decoding on CPUs: Nearly 4x Faster Token Generation with DFlash appeared first on Towards Data Science.

Received β€” 20 August 2026 ⏭ Towards Data Science
Received β€” 19 August 2026 ⏭ Towards Data Science

Kimi K3’s 1M Token Context Window vs. RAG: Cost, Latency and Answer Quality

19 August 2026 at 16:30

A controlled comparison of a top-5 RAG pipeline and a full 127,000 token prompt on the same 12 questions, same system prompt and same model. Graded blind on correctness, completeness and grounding.

The post Kimi K3’s 1M Token Context Window vs. RAG: Cost, Latency and Answer Quality appeared first on Towards Data Science.

Received β€” 18 August 2026 ⏭ Towards Data Science
Received β€” 15 August 2026 ⏭ Towards Data Science
❌