Creative Applications: Writing, Poetry, and Narrative AI
Explains how language models power creative writing, poetry generation, storytelling, and the ethical questions of authorship and originality in generative AI.
405 items · Page 5 of 9
Create a free account to keep your reading organized, join thoughtful discussions, and get more from every chapter.
Free to join · Takes less than a minute
Why
I created this space so readers can learn together, ask questions, and make sense of difficult ideas.

Explains how language models power creative writing, poetry generation, storytelling, and the ethical questions of authorship and originality in generative AI.
Covers GPU memory hierarchy, CUDA cores, Tensor Core throughput, and how to read GPU specs to optimize training workloads and debug performance bottlenecks.
Explains how Activation-aware Weight Quantization protects salient weights to compress LLMs. Topics include the algorithm, scaling factors.
Explains how adversarial prompts bypass LLM safety training, covering roleplay attacks, GCG gradient-based suffixes, PAIR automation.
Interpret sparse autoencoder features through activation patterns, automated naming, monosemanticity measurement, and causal feature circuit analysis.
Explains how GPTQ optimizes weight quantization using Hessian-based error compensation to compress LLMs to 4 bits while maintaining near-FP16 accuracy.
Explains how LLMs are trained on synthetic data, from Self-Instruct and Evol-Instruct to quality verification, diversity control, and knowledge distillation.
Construct effective pretraining data recipes by setting domain proportions, applying quality weighting, running proxy experiments.
Detect and remove personal information from LLM training data with regex, named entity recognition, and hybrid privacy pipelines.
Explains how toxicity classifiers work, how to calibrate thresholds for pretraining data.
Filter low-quality text from web corpora using heuristic rules, perplexity scoring, and classifier-based methods with tunable thresholds.
Explains how MinHash compresses documents into compact signatures that estimate Jaccard similarity, enabling near-duplicate detection.
Explains how language identification works in NLP pipelines. Topics include n-gram models, FastText LID, code-switching, confidence thresholds.
Extract clean text from HTML and PDFs for LLM training data. Topics include boilerplate removal, text density algorithms, Trafilatura.
Covers KV cache compression techniques including eviction strategies, attention sinks, the H2O algorithm, and INT8 quantization for efficient LLM inference.
Explains how web crawlers discover and download internet content at scale, covering Common Crawl architecture, robots.txt compliance, politeness policies.
Benchmark scores can mislead when test data leaks, metrics saturate, or systems game proxies. Covers contamination, brittleness, Goodhart's Law, and mitigation.
Explains how PagedAttention uses virtual memory paging to eliminate KV cache fragmentation, enabling 5x better memory utilization in LLM serving systems.
Build rigorous NLP benchmarks: task definition, dataset collection, annotation guidelines, inter-annotator agreement, contamination detection.
Calculate KV cache memory requirements for transformer models. Topics include batch size, context length, GQA optimization, and GPU deployment planning.
Covers backtesting frameworks to validate trading strategies. Avoid look-ahead bias, measure risk-adjusted returns.
Explains how multimodal AI powers document understanding, medical imaging diagnostics, video analysis, and complex reasoning tasks across real-world domains.
Examines cryptocurrency market structure, quantitative strategies for extreme volatility, and risk management in 24/7 decentralized trading.
Covers diffusion models from the DDPM objective to latent diffusion, classifier-free guidance, image editing techniques, ControlNet, and FID evaluation metrics.
Covers four core image understanding tasks: visual question answering, image captioning, visual grounding, and scene understanding.
Why attention weights fail as explanations, how manipulation studies expose their limits, and what gradient-based methods offer as more faithful alternatives.
Build safe autonomous agents using action constraints, sandboxing, real-time monitoring, prompt injection defenses, and human-in-the-loop intervention patterns.
Explains how multi-agent AI systems coordinate through topologies, communication protocols, role assignment.
Implement Direct Preference Optimization in PyTorch. Topics include preference data formatting, loss computation, training loops.
Explains how LLM agents plan, decompose tasks, execute multi-step goals, and recover from failures using architectures like ReWOO, Tree-of-Thought.
Explains HFT strategies, including cross-market arbitrage, latency exploitation, electronic market making, and the systems behind microsecond trading.
Explains how KL divergence prevents reward hacking in RLHF by keeping policies close to reference models.
Covers time-series and cross-sectional momentum strategies. Implement moving average crossovers, breakout systems, and CTA approaches with Python code.
Covers Black's model for pricing interest rate options. Value caps, floors, and swaptions with Python implementations and risk measures.
Explains how prefix tuning adapts transformers by prepending learnable virtual tokens to attention keys and values. A parameter-efficient fine-tuning method.
Covers Heath-Jarrow-Morton framework and LIBOR Market Model for pricing caps, floors, and swaptions. Implement forward rate dynamics in Python.
Covers finite difference methods for option pricing. Topics include explicit, implicit, and Crank-Nicolson schemes to solve the Black-Scholes PDE numerically.
Implement LoRA adapters in PyTorch from scratch. Build modules, inject into transformers, merge weights, and use HuggingFace PEFT for production.
Covers Monte Carlo simulation for derivative pricing. Topics include risk-neutral valuation, path-dependent options like Asian and barrier options.
Covers binomial tree option pricing with the Cox-Ross-Rubinstein model. Price American and European options using backward induction and risk-neutral valuation.
Compute implied volatility using Newton-Raphson and bisection methods. Examines volatility smile, skew patterns, and the VIX index with Python code.
Covers the Black-Scholes formula for European options with Python implementation. Topics include derivation, the Greeks, put-call parity.
Explains how expert networks power Mixture of Experts models. Examines FFN-based experts, capacity factors, expert counts, and transformer placement strategies.
Explains how sparse models decouple capacity from compute using conditional computation and mixture of experts to achieve efficient scaling.
Covers financial data handling with pandas, NumPy, and Numba. Topics include time series operations, return calculations, and visualization for quant finance.
Covers root-finding, interpolation, and numerical integration for finance. Compute implied volatility, build yield curves, and price derivatives.
Covers structured outputs introduced in language models during 2024. Explains how structured outputs enable reliable data extraction.
Covers advanced parameter-efficient fine-tuning methods introduced in 2024, including AdaLoRA, DoRA, VeRA, and other innovations.
Create a free account to keep your reading organized, join thoughtful discussions, and get more from every chapter.
Free to join · Takes less than a minute
Why
I created this space so readers can learn together, ask questions, and make sense of difficult ideas.
