Spaces:
Sleeping
Sleeping
| title: Adaptive Cache Manager | |
| emoji: 🧠 | |
| colorFrom: blue | |
| colorTo: indigo | |
| sdk: docker | |
| pinned: false | |
| tags: | |
| - openenv | |
| - reinforcement-learning | |
| - agents | |
| # 🧠 Adaptive Cache Manager (OpenEnv) | |
| An OpenEnv-compliant reinforcement learning and agentic AI environment that simulates a high-performance operating system memory manager. | |
| Instead of relying on static, heuristic-based algorithms like LRU (Least Recently Used) or LFU (Least Frequently Used), this environment challenges frontier AI agents to dynamically learn and execute optimal cache eviction policies against complex, shifting workloads. | |
| ## 🌍 Real-World Utility & Motivation | |
| Every modern operating system, database management system (DBMS), and CDN relies heavily on cache efficiency. A 1% increase in cache hit rates can save massive amounts of compute, bandwidth, and energy. | |
| However, standard algorithms fail when traffic patterns change abruptly or fall into sequential loops. This environment isolates that specific, high-value DevOps/DBA problem. It moves away from "toy" text-parsing tasks and provides a pure, mathematically grounded testbed for reasoning models and RL agents to prove their algorithmic optimization capabilities. | |
| --- | |
| ## 🛠 Environment Design: Spaces & Rewards | |
| The environment strictly implements the OpenEnv API via typed Pydantic models and exposes standard `POST /reset` and `POST /step` web endpoints via FastAPI. | |
| ### Observation Space | |
| The agent receives a lightweight, numerical snapshot of the memory system at the exact moment a cache miss occurs. | |
| * `incoming_request` (int): The ID of the data item currently requested by the system. | |
| * `cache_state` (List[int]): The current items residing in the cache slots (-1 indicates an empty slot). | |
| * `idle_times` (List[int]): The number of timesteps since each specific cache slot was last accessed. | |
| ### Action Space | |
| The agent must decide which slot to free up. | |
| * `evict_index` (int): A discrete integer (0 to capacity-1) representing the index of the cache slot to overwrite. | |
| ### Reward Function | |
| The environment provides a dense, step-by-step reward signal directly correlated to system performance: | |
| * **`+1.0`** for every Cache Hit. | |
| * **`-1.0`** for a Cache Miss (forcing the agent to step in and evict). | |
| --- | |
| ## 🏆 Tasks & Difficulty Progression | |
| The environment features three programmatic workloads (tasks) designed to challenge agents with distinctly different access patterns. The **Grader** for all tasks deterministically calculates the final **Hit Rate (0.0 to 1.0)**. | |
| 1. **`cache-zipfian-easy` (Easy)** | |
| * **Workload:** A Zipfian (power-law) distribution simulating standard web traffic. A few items are requested constantly; a long tail is requested rarely. | |
| * **Goal:** Outperform random eviction by pinning the most frequently requested items. | |
| 2. **`cache-sequential-medium` (Medium)** | |
| * **Workload:** A looping sequential scan (e.g., requesting items 1 through 12 in a loop for a cache of size 10). | |
| * **Goal:** Standard LRU algorithms achieve a **0% hit rate** here. The agent must break static logic and learn to pin a subset of the sequence to guarantee hits. | |
| 3. **`cache-shifting-hard` (Hard)** | |
| * **Workload:** Abruptly shifting working sets. The first half heavily favors one block of data; the second half abruptly shifts entirely to a different block. | |
| * **Goal:** Requires rapid, aggressive adaptation to flush obsolete items. Often acts as a stumbling block for zero-shot LLMs, requiring true RL or deep reasoning. | |
| --- | |
| ## 📊 Baseline Comparisons | |
| To demonstrate the necessity of intelligent eviction policies, this environment provides benchmark scores comparing traditional operating system algorithms against various iterations of an LLM agent (Llama-3 8B) and custom-trained Reinforcement Learning models. The table below displays the final **Hit Rate (0.0 to 1.0)**. | |
| | Task (Workload) | Random | LRU | LFU | LLM (Zero-Shot) | LLM (Memory, No CoT) | LLM (Memory + CoT) | PPO Agent (100k steps) | PPO Agent (1M steps) | | |
| | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | :--- | | |
| | **Easy (Zipfian)** | 0.64 | 0.18 | 0.44 | 0.67 | 0.43 | 0.53 | 0.38 | **0.75** | | |
| | **Medium (Sequential)** | 0.35 | 0.00 | 0.08 | 0.16 | 0.06 | 0.29 | 0.51 | **0.67** | | |
| | **Hard (Shifting)** | 0.35 | 0.04 | 0.13 | 0.12 | 0.08 | 0.16 | 0.34 | **0.47** | | |
| *Note: While Random Eviction occasionally scores artificially high through pure statistical variance, it is non-deterministic and mathematically unsafe for production systems.* | |
| **Key Insights for Researchers:** | |
| * **The Sequential Trap (LRU Failure):** As proven by the Medium task, standard LRU algorithms achieve a mathematical **0.00 hit rate** when faced with sequence loops larger than the cache size. | |
| * **The Danger of Context Overload:** When the LLM was initially given a 15-step memory window without a reasoning space (`Memory, No CoT`), its performance *dropped* across all tasks. The model became overwhelmed by the dense history block, blinding it to immediate cache states. | |
| * **The Power of Chain-of-Thought (CoT):** By forcing the agent to output a JSON `"reasoning"` string prior to selecting an eviction index, the model gained the computational processing space needed to analyze its own memory. This single architectural change nearly quintupled its performance on the Medium task (0.06 → 0.29) and doubled its performance on the Hard task (0.08 → 0.16), proving the agent successfully learned to "pin" items to break loops and proactively flush obsolete data during phase shifts. | |
| * **The Parameter Bottleneck:** While the 8B parameter model successfully proves the agentic memory architecture works, the absolute scores indicate that smaller models struggle to flawlessly execute complex heuristics like Belady's MIN. This environment sets a rigorous, ready-made benchmark for Reinforcement Learning models and 70B+ reasoning models to conquer. | |
| * **RL Dominance on Edge Cases:** The Proximal Policy Optimization (PPO) agent mathematically crushed the edge cases. Without needing prompting architecture, it found the near-optimal policy for the Medium loop (**0.51**) and gracefully handled the Hard phase shift (**0.34**), vastly outperforming both standard OS algorithms and the 8B LLM. | |
| * **The "Blank Slate" Tax:** Interestingly, the pre-trained LLM outperformed the 100k RL agent on the Easy (Zipfian) task. Because PPO starts with randomized weights, 100,000 training steps were insufficient to master complex power-law probability distributions from scratch. The LLM's vast pre-training granted it a "common sense" advantage for recognizing standard frequency patterns. | |
| * **The Convergence of 1 Million Steps (RL Mastery):** When PPO training was scaled to 1,000,000 steps, the "Blank Slate" tax was completely overcome. The agent flawlessly mapped the long-tail probabilities of the Easy task (**0.75**), nearly perfected the mathematical pinning strategy for the Medium sequence (**0.67**), and adapted to the Hard phase shift with surgical precision (**0.47**). This establishes the definitive ceiling and target benchmark for future Generative AI reasoning models in this environment. | |
| --- | |
| ## 🚀 Setup & Execution | |
| ### 1. Local Setup (Modern `uv` package manager) | |
| This project uses modern Python packaging via `pyproject.toml` and `uv.lock`. | |
| ```bash | |
| # Install the ultra-fast uv package manager | |
| pip install uv | |
| # Create virtual environment and install dependencies | |
| uv venv | |
| source .venv/bin/activate # On Windows use: .venv\Scripts\activate | |
| uv sync | |
| ``` | |
| **Environment Variables:** | |
| Create a file named exactly `.env` in the root directory. This is required for the LLM baseline script to run locally without hardcoding keys. | |
| ```bash | |
| # .env | |
| HF_TOKEN="your-api-key-here" | |
| ``` | |
| ### 2. The Benchmark Suite | |
| This environment comes with a full suite of testing scripts so you can replicate the benchmarks and observe the agents in real-time. | |
| #### A. Traditional OS Baselines | |
| Test how standard deterministic algorithms perform against the three workloads. This script requires no API keys and runs instantly. | |
| ```bash | |
| # Runs Random, LRU, and LFU algorithms across Easy, Medium, and Hard tasks | |
| python classic_baselines.py | |
| ``` | |
| #### B. LLM Inference Agent (The Grader Target) | |
| Test the generative AI agent. This script uses the strict `[START]`, `[STEP]`, and `[END]` STDOUT formatting required by the OpenEnv automated grader. It utilizes the Chain-of-Thought (CoT) and Agentic Memory architecture. | |
| ```bash | |
| # Evaluates the LLM Agent across all 3 tasks (Requires HF_TOKEN in .env) | |
| python inference.py | |
| ``` | |
| #### C. Reinforcement Learning (PPO Agent) | |
| Train and evaluate a local Proximal Policy Optimization (PPO) neural network. This allows you to compare generative AI reasoning against pure mathematical machine learning. | |
| ```bash | |
| # 1. Train the models from scratch | |
| python train_ppo.py | |
| # 2. Visually watch a trained agent play the game in your terminal with a diagnostic test | |
| python watch_ppo.py | |
| ``` | |
| ### 3. Docker & Hugging Face Deployment | |
| This environment is fully containerized, web-server enabled (FastAPI/Uvicorn), and designed for multi-mode deployment as a Hugging Face Space. | |
| ```bash | |
| # Build the image locally | |
| docker build -t adaptive-cache-env . | |
| # Run the container locally (boots the FastAPI server on port 7860) | |
| docker run -p 7860:7860 adaptive-cache-env | |
| ``` | |
| --- | |
| ## 📂 Project Structure | |
| ```text | |
| adaptive-cache-env/ | |
| ├── 1Mtrained/ # Final 1-Million step PPO model weights | |
| ├── 100Ktrained/ # Initial 100k step PPO model weights | |
| ├── adaptive_cache/ | |
| │ ├── __init__.py | |
| │ ├── env.py # OpenEnv wrapper and Pydantic models | |
| │ ├── simulator.py # Core OS-level array and memory simulation | |
| │ └── workloads.py # Deterministic task generators (Zipfian, Sequential, etc.) | |
| ├── server/ | |
| │ └── app.py # FastAPI web server and OpenEnv POST endpoints | |
| ├── .env # Local environment variables (Git-ignored) | |
| ├── .gitignore # Standard repository exclusions | |
| ├── classic_baselines.py # Script testing traditional OS algorithms (LRU, LFU) | |
| ├── Dockerfile # Container configuration pointing to server.app | |
| ├── inference.py # Compliant LLM agent inference script (Grader Target) | |
| ├── journey.md # Detailed engineering, architecture, and development log | |
| ├── openenv.yaml # OpenEnv task and metadata specifications | |
| ├── pyproject.toml # Modern build system & OpenEnv core dependencies | |
| ├── README.md # Project documentation | |
| ├── requirements.txt # Legacy dependency tracking | |
| ├── rl_wrapper.py # Gymnasium wrapper bridging OpenEnv to Stable-Baselines3 | |
| ├── test_env.py # Deterministic grader bounds validation | |
| ├── train_ppo.py # Script to train the local RL neural networks | |
| ├── uv.lock # Strict dependency lockfile | |
| └── watch_ppo.py # Script to visually evaluate trained RL agents | |
| ``` |