A minimal 2-step LLM chain (not a full agent framework) solving one specific problem: fitting a planner + coder pipeline on a single GPU
Summary
A minimal 2-step LLM chain that implements a planner + coder pipeline, designed to fit on a single GPU without requiring a full agent framework.
Similar Articles
Agentic ESOpt: Fine-Tuning Long-Horizon LLM Agents with Minimal GPU Requirements
This paper proposes Agentic ESOpt, a method using evolution strategies to enable scalable full-parameter fine-tuning of long-horizon LLM agents with minimal GPU memory requirements.
Local LLM autocomplete + agentic coding on a single 16GB GPU + 64GB RAM
A technical guide on setting up local LLM autocomplete (Qwen2.5-Coder-7B) and agentic coding (Qwen3.6-35B-A3B) on a single 16GB GPU with 64GB+ RAM using llama.cpp, including commands and performance benchmarks.
Your LLM shouldn’t be your coding-agent workflow
Argues that LLMs should be used for reasoning within coding-agent workflows, while deterministic infrastructure handles queues, state, retries, and recovery, so the process doesn't break when usage limits hit.
MetaChain: A Fully-Automated and Zero-Code Framework for LLM Agents
MetaChain is a fully-automated, natural language-based framework that lets non-technical users create and deploy LLM agents without coding, showing strong results on the GAIA benchmark and RAG tasks.
Towards Feedback-to-Plan Decisions for Self-Evolving LLM Agents in CUDA Kernel Generation
This paper introduces CUDAnalyst, a tool for analyzing how individual feedback signals influence planning decisions in self-evolving LLM agents for CUDA kernel generation, using trajectory freezing and selective feedback injection to enable controlled attribution.