LoRA (Low-Rank Adaptation) in AI
A new section for Fine-Tuning Techniques is created to hold the LoRA document, and the LLM Architecture section is de-duplicated.
A new section for Fine-Tuning Techniques is created to hold the LoRA document, and the LLM Architecture section is de-duplicated.
Explains function calling (tool use) in LLMs: how models emit structured requests to invoke external functions, the request-execute-return loop, provider support, and practical reliability notes.
Explains speculative decoding, which pairs a small draft model with a large target model to accelerate LLM inference without changing outputs.
Explains sparse Mixture-of-Experts (MoE) architecture with conditional computation, router/gate mechanisms, load balancing, and trade-offs vs. dense models.
As local LLMs improve, harnesses are learning to pair them with frontier models. A look at the four collaboration patterns already shipping in open source.
Distinguishes RLVR as training-time weight updates from inference-time agent verification loops.
Explains the four-stage modern LLM training pipeline from pre-training through verifiable-reward RL.
Explains the four-stage modern LLM training pipeline from pre-training through verifiable-reward RL.
Field guide to LLM jailbreaking attack surfaces, threat modeling, defenses, and responsible disclosure.
Explains Claude adaptive thinking, effort levels, fixed-budget deprecation, and hidden reasoning display.
Paper summary of AdapTime, an adaptive planner for temporal reasoning in LLMs.
Summarizes the six-component agent harness model: execution, tools, context, state, hooks, and evaluation.
Explains TurboQuant, a rotation-based vector quantization method for KV-cache compression and vector search.
Patterns from ARIS for reliable multi-agent research using adversarial review, audits, and persistent memory.
Explains CompactRAG, a multi-hop RAG method using offline atomic QA pairs and fixed two-call inference.
Explains graph-based memory for LLM agents, including taxonomy, GAM consolidation, and hybrid retrieval.
Explains thinking-token budget parameters, provider naming, cost-latency tradeoffs, and completion-cap interactions.
Compares prompt/KV cache TTLs, controls, pricing, scope, and strategies across major LLM providers.
Explains implicit vs explicit LLM prompt caching, prefix constraints, provider support, and when to use each.
Explains why LLM prompt caching applies to reusable input-token prefill, not sequential output decoding.