Instructions to use BaseMemory/SSA-Llama-3.1-8B-Instruct with libraries, inference providers, notebooks, and local apps. Follow these links to get started.
- Libraries
- PEFT
How to use BaseMemory/SSA-Llama-3.1-8B-Instruct with PEFT:
from peft import PeftModel from transformers import AutoModelForCausalLM base_model = AutoModelForCausalLM.from_pretrained("meta-llama/Llama-3.1-8B-Instruct") model = PeftModel.from_pretrained(base_model, "BaseMemory/SSA-Llama-3.1-8B-Instruct") - Transformers
How to use BaseMemory/SSA-Llama-3.1-8B-Instruct with Transformers:
# Use a pipeline as a high-level helper from transformers import pipeline pipe = pipeline("text-generation", model="BaseMemory/SSA-Llama-3.1-8B-Instruct")# pip install -U transformers accelerate # Load model directly from transformers import AutoModel model = AutoModel.from_pretrained("BaseMemory/SSA-Llama-3.1-8B-Instruct", device_map="auto") - Notebooks
- Google Colab
- Kaggle
- Local Apps Settings
- vLLM
How to use BaseMemory/SSA-Llama-3.1-8B-Instruct with vLLM:
Install from pip and serve model
# Install vLLM from pip: pip install vllm # Start the vLLM server: vllm serve "BaseMemory/SSA-Llama-3.1-8B-Instruct" # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:8000/v1/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "BaseMemory/SSA-Llama-3.1-8B-Instruct", "prompt": "Once upon a time,", "max_tokens": 512, "temperature": 0.5 }'Use Docker
docker model run hf.co/BaseMemory/SSA-Llama-3.1-8B-Instruct
- SGLang
How to use BaseMemory/SSA-Llama-3.1-8B-Instruct with SGLang:
Install from pip and serve model
# Install SGLang from pip: pip install sglang # Start the SGLang server: python3 -m sglang.launch_server \ --model-path "BaseMemory/SSA-Llama-3.1-8B-Instruct" \ --host 0.0.0.0 \ --port 30000 # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:30000/v1/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "BaseMemory/SSA-Llama-3.1-8B-Instruct", "prompt": "Once upon a time,", "max_tokens": 512, "temperature": 0.5 }'Use Docker images
docker run --gpus all \ --shm-size 32g \ -p 30000:30000 \ -v ~/.cache/huggingface:/root/.cache/huggingface \ --env "HF_TOKEN=<secret>" \ --ipc=host \ lmsysorg/sglang:latest \ python3 -m sglang.launch_server \ --model-path "BaseMemory/SSA-Llama-3.1-8B-Instruct" \ --host 0.0.0.0 \ --port 30000 # Call the server using curl (OpenAI-compatible API): curl -X POST "http://localhost:30000/v1/completions" \ -H "Content-Type: application/json" \ --data '{ "model": "BaseMemory/SSA-Llama-3.1-8B-Instruct", "prompt": "Once upon a time,", "max_tokens": 512, "temperature": 0.5 }' - Docker Model Runner
How to use BaseMemory/SSA-Llama-3.1-8B-Instruct with Docker Model Runner:
docker model run hf.co/BaseMemory/SSA-Llama-3.1-8B-Instruct
Added model card
Browse files
README.md
CHANGED
|
@@ -6,202 +6,165 @@ tags:
|
|
| 6 |
- base_model:adapter:meta-llama/Llama-3.1-8B-Instruct
|
| 7 |
- lora
|
| 8 |
- transformers
|
|
|
|
|
|
|
|
|
|
| 9 |
---
|
| 10 |
|
| 11 |
-
#
|
| 12 |
|
| 13 |
-
|
| 14 |
|
|
|
|
| 15 |
|
|
|
|
| 16 |
|
| 17 |
-
|
| 18 |
-
|
| 19 |
-
### Model Description
|
| 20 |
-
|
| 21 |
-
<!-- Provide a longer summary of what this model is. -->
|
| 22 |
-
|
| 23 |
-
|
| 24 |
-
|
| 25 |
-
- **Developed by:** [More Information Needed]
|
| 26 |
-
- **Funded by [optional]:** [More Information Needed]
|
| 27 |
-
- **Shared by [optional]:** [More Information Needed]
|
| 28 |
-
- **Model type:** [More Information Needed]
|
| 29 |
-
- **Language(s) (NLP):** [More Information Needed]
|
| 30 |
-
- **License:** [More Information Needed]
|
| 31 |
-
- **Finetuned from model [optional]:** [More Information Needed]
|
| 32 |
-
|
| 33 |
-
### Model Sources [optional]
|
| 34 |
-
|
| 35 |
-
<!-- Provide the basic links for the model. -->
|
| 36 |
-
|
| 37 |
-
- **Repository:** [More Information Needed]
|
| 38 |
-
- **Paper [optional]:** [More Information Needed]
|
| 39 |
-
- **Demo [optional]:** [More Information Needed]
|
| 40 |
-
|
| 41 |
-
## Uses
|
| 42 |
-
|
| 43 |
-
<!-- Address questions around how the model is intended to be used, including the foreseeable users of the model and those affected by the model. -->
|
| 44 |
-
|
| 45 |
-
### Direct Use
|
| 46 |
-
|
| 47 |
-
<!-- This section is for the model use without fine-tuning or plugging into a larger ecosystem/app. -->
|
| 48 |
-
|
| 49 |
-
[More Information Needed]
|
| 50 |
-
|
| 51 |
-
### Downstream Use [optional]
|
| 52 |
-
|
| 53 |
-
<!-- This section is for the model use when fine-tuned for a task, or when plugged into a larger ecosystem/app -->
|
| 54 |
-
|
| 55 |
-
[More Information Needed]
|
| 56 |
-
|
| 57 |
-
### Out-of-Scope Use
|
| 58 |
-
|
| 59 |
-
<!-- This section addresses misuse, malicious use, and uses that the model will not work well for. -->
|
| 60 |
-
|
| 61 |
-
[More Information Needed]
|
| 62 |
-
|
| 63 |
-
## Bias, Risks, and Limitations
|
| 64 |
-
|
| 65 |
-
<!-- This section is meant to convey both technical and sociotechnical limitations. -->
|
| 66 |
-
|
| 67 |
-
[More Information Needed]
|
| 68 |
-
|
| 69 |
-
### Recommendations
|
| 70 |
-
|
| 71 |
-
<!-- This section is meant to convey recommendations with respect to the bias, risk, and technical limitations. -->
|
| 72 |
|
| 73 |
-
|
| 74 |
|
| 75 |
-
##
|
| 76 |
|
| 77 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 78 |
|
| 79 |
-
|
| 80 |
|
| 81 |
-
|
| 82 |
|
| 83 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 84 |
|
| 85 |
-
|
| 86 |
|
| 87 |
-
|
| 88 |
|
| 89 |
-
|
| 90 |
|
| 91 |
-
|
| 92 |
|
| 93 |
-
|
| 94 |
|
| 95 |
-
|
| 96 |
|
|
|
|
| 97 |
|
| 98 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 99 |
|
| 100 |
-
|
| 101 |
|
| 102 |
-
###
|
| 103 |
|
| 104 |
-
|
| 105 |
|
| 106 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 107 |
|
| 108 |
-
|
| 109 |
|
| 110 |
-
|
| 111 |
|
| 112 |
-
|
| 113 |
|
| 114 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 115 |
|
| 116 |
-
|
| 117 |
|
| 118 |
-
|
| 119 |
|
| 120 |
-
##
|
| 121 |
-
|
| 122 |
-
<!-- These are the things the evaluation is disaggregating by, e.g., subpopulations or domains. -->
|
| 123 |
-
|
| 124 |
-
[More Information Needed]
|
| 125 |
-
|
| 126 |
-
#### Metrics
|
| 127 |
-
|
| 128 |
-
<!-- These are the evaluation metrics being used, ideally with a description of why. -->
|
| 129 |
-
|
| 130 |
-
[More Information Needed]
|
| 131 |
-
|
| 132 |
-
### Results
|
| 133 |
-
|
| 134 |
-
[More Information Needed]
|
| 135 |
-
|
| 136 |
-
#### Summary
|
| 137 |
-
|
| 138 |
-
|
| 139 |
-
|
| 140 |
-
## Model Examination [optional]
|
| 141 |
-
|
| 142 |
-
<!-- Relevant interpretability work for the model goes here -->
|
| 143 |
-
|
| 144 |
-
[More Information Needed]
|
| 145 |
-
|
| 146 |
-
## Environmental Impact
|
| 147 |
-
|
| 148 |
-
<!-- Total emissions (in grams of CO2eq) and additional considerations, such as electricity usage, go here. Edit the suggested text below accordingly -->
|
| 149 |
-
|
| 150 |
-
Carbon emissions can be estimated using the [Machine Learning Impact calculator](https://mlco2.github.io/impact#compute) presented in [Lacoste et al. (2019)](https://arxiv.org/abs/1910.09700).
|
| 151 |
-
|
| 152 |
-
- **Hardware Type:** [More Information Needed]
|
| 153 |
-
- **Hours used:** [More Information Needed]
|
| 154 |
-
- **Cloud Provider:** [More Information Needed]
|
| 155 |
-
- **Compute Region:** [More Information Needed]
|
| 156 |
-
- **Carbon Emitted:** [More Information Needed]
|
| 157 |
-
|
| 158 |
-
## Technical Specifications [optional]
|
| 159 |
-
|
| 160 |
-
### Model Architecture and Objective
|
| 161 |
-
|
| 162 |
-
[More Information Needed]
|
| 163 |
-
|
| 164 |
-
### Compute Infrastructure
|
| 165 |
-
|
| 166 |
-
[More Information Needed]
|
| 167 |
-
|
| 168 |
-
#### Hardware
|
| 169 |
|
| 170 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 171 |
|
| 172 |
-
##
|
| 173 |
|
| 174 |
-
|
| 175 |
|
| 176 |
-
|
| 177 |
|
| 178 |
-
|
| 179 |
|
| 180 |
-
|
| 181 |
|
| 182 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 183 |
|
| 184 |
-
|
| 185 |
|
| 186 |
-
|
| 187 |
|
| 188 |
-
|
| 189 |
|
| 190 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
| 191 |
|
| 192 |
-
|
| 193 |
|
| 194 |
-
##
|
| 195 |
|
| 196 |
-
|
| 197 |
|
| 198 |
-
|
| 199 |
|
| 200 |
-
|
| 201 |
|
| 202 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 203 |
|
| 204 |
-
|
| 205 |
-
### Framework versions
|
| 206 |
|
| 207 |
-
|
|
|
|
|
|
|
|
|
|
|
|
| 6 |
- base_model:adapter:meta-llama/Llama-3.1-8B-Instruct
|
| 7 |
- lora
|
| 8 |
- transformers
|
| 9 |
+
license: apache-2.0
|
| 10 |
+
language:
|
| 11 |
+
- en
|
| 12 |
---
|
| 13 |
|
| 14 |
+
# SSA-Llama-3.1-8B-Instruct
|
| 15 |
|
| 16 |
+
**Llama 3.1 8B Instruct with content-adaptive sparse attention for efficient long-context inference.**
|
| 17 |
|
| 18 |
+
SSA dynamically selects relevant regions of long context instead of requiring selected attention layers to attend densely across the entire sequence.
|
| 19 |
|
| 20 |
+
The goal is simple:
|
| 21 |
|
| 22 |
+
> **Preserve long-context capability while making attention increasingly efficient as context grows.**
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 23 |
|
| 24 |
+
This repository contains the primary **SSA-Llama-3.1-8B-Instruct checkpoint** trained in the SSA research.
|
| 25 |
|
| 26 |
+
## Highlights
|
| 27 |
|
| 28 |
+
* Built on **Meta Llama 3.1 8B Instruct**
|
| 29 |
+
* Content-adaptive sparse attention
|
| 30 |
+
* Long-context retrieval evaluated from **16K to 128K**
|
| 31 |
+
* Sparse-attention operator evaluated up to **1M tokens**
|
| 32 |
+
* Strong single-fact retrieval through **64K**
|
| 33 |
+
* Increasing computational advantage as context length grows
|
| 34 |
+
* Designed for research into practical long-context LLM inference
|
| 35 |
|
| 36 |
+
## Long-Context Retrieval
|
| 37 |
|
| 38 |
+
Using the current SSA sparse-attention backend:
|
| 39 |
|
| 40 |
+
| Context | Single-Fact NLL | Multi-Fact NLL |
|
| 41 |
+
| ------: | --------------: | -------------: |
|
| 42 |
+
| 16K | 0.00001 | 0.00006 |
|
| 43 |
+
| 32K | 0.00005 | 0.00114 |
|
| 44 |
+
| 48K | 0.00026 | 0.00237 |
|
| 45 |
+
| 64K | 0.00015 | 0.06979 |
|
| 46 |
|
| 47 |
+
**First-answer-token Top-1 remained 100% across all of these diagnostic cases.**
|
| 48 |
|
| 49 |
+
Single-fact retrieval remained extremely strong through 64K. Multi-fact retrieval was also strong through 48K, with increased difficulty appearing at 64K.
|
| 50 |
|
| 51 |
+
These numbers are controlled teacher-forced retrieval diagnostics. Autoregressive Needle-in-a-Haystack results will be added separately after evaluation is complete.
|
| 52 |
|
| 53 |
+
## Why Sparse Attention?
|
| 54 |
|
| 55 |
+
Standard dense causal attention becomes increasingly expensive as context grows.
|
| 56 |
|
| 57 |
+
SSA limits the amount of historical context processed by its sparse attention layers while still selecting information based on content.
|
| 58 |
|
| 59 |
+
Conceptually:
|
| 60 |
|
| 61 |
+
```text
|
| 62 |
+
Long Context
|
| 63 |
+
↓
|
| 64 |
+
Find Relevant Historical Regions
|
| 65 |
+
↓
|
| 66 |
+
Local Context + Selected Context
|
| 67 |
+
↓
|
| 68 |
+
Sparse Attention
|
| 69 |
+
↓
|
| 70 |
+
Generation
|
| 71 |
+
```
|
| 72 |
|
| 73 |
+
For the currently evaluated configuration, the nominal semantic attention support is approximately **8,196 keys per query**.
|
| 74 |
|
| 75 |
+
### Semantic Attention Arithmetic
|
| 76 |
|
| 77 |
+
The ideal semantic QK/PV arithmetic reduction grows rapidly with context length:
|
| 78 |
|
| 79 |
+
| Context | Dense causal avg. keys/query | SSA fanout cap | Attention arithmetic reduction | QK/PV work saved |
|
| 80 |
+
| ------: | ---------------------------: | -------------: | -----------------------------: | ---------------: |
|
| 81 |
+
| 32K | 16,384 | 8,196 | **2.00×** | **50.0%** |
|
| 82 |
+
| 64K | 32,768 | 8,196 | **4.00×** | **75.0%** |
|
| 83 |
+
| 128K | 65,536 | 8,196 | **8.00×** | **87.5%** |
|
| 84 |
+
| 256K | 131,072 | 8,196 | **15.99×** | **93.75%** |
|
| 85 |
+
| 512K | 262,144 | 8,196 | **31.98×** | **96.87%** |
|
| 86 |
+
| 1M | ~500,000 | 8,196 | **61.01×** | **98.36%** |
|
| 87 |
|
| 88 |
+
These numbers represent **semantic attention arithmetic**, not total model FLOPs or end-to-end speedup.
|
| 89 |
|
| 90 |
+
## Measured Sparse-Attention Scaling
|
| 91 |
|
| 92 |
+
The custom SSA attention operator shows increasing benefit as context grows:
|
| 93 |
|
| 94 |
+
| Context | Relative operator speed |
|
| 95 |
+
| ------: | ----------------------: |
|
| 96 |
+
| 64K | ~1.0× |
|
| 97 |
+
| 128K | ~1.9× |
|
| 98 |
+
| 256K | ~3.7× |
|
| 99 |
+
| 512K | ~7.3× |
|
| 100 |
+
| 1M | **~14.2×** |
|
| 101 |
|
| 102 |
+
The important distinction is that these are **attention-operator measurements**, not end-to-end LLM speedups.
|
| 103 |
|
| 104 |
+
The results show the central systems motivation behind SSA: sparse attention becomes increasingly valuable as context length grows.
|
| 105 |
|
| 106 |
+
## Model Details
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 107 |
|
| 108 |
+
* **Model:** `onlyaady/SSA-Llama-3.1-8B-Instruct`
|
| 109 |
+
* **Base model:** `meta-llama/Llama-3.1-8B-Instruct`
|
| 110 |
+
* **Developer:** Hrudayaditya Jallu
|
| 111 |
+
* **Affiliation:** Independent research
|
| 112 |
+
* **Checkpoint:** SSA-Llama-3.1-8B-Instruct
|
| 113 |
+
* **Format:** PEFT / LoRA
|
| 114 |
+
* **Language:** English
|
| 115 |
+
* **Status:** Research release
|
| 116 |
|
| 117 |
+
## Using the Model
|
| 118 |
|
| 119 |
+
This repository currently contains the trained PEFT checkpoint.
|
| 120 |
|
| 121 |
+
SSA also relies on a custom sparse-attention runtime. Loading this adapter through a standard Transformers pipeline alone will **not reproduce the sparse-attention behavior or performance measurements above**.
|
| 122 |
|
| 123 |
+
A reproducible inference/runtime package will be released separately.
|
| 124 |
|
| 125 |
+
This checkpoint is currently intended for research in:
|
| 126 |
|
| 127 |
+
* long-context LLM inference
|
| 128 |
+
* sparse attention
|
| 129 |
+
* content-based routing
|
| 130 |
+
* retrieval
|
| 131 |
+
* efficient inference
|
| 132 |
+
* quality/compute tradeoffs
|
| 133 |
|
| 134 |
+
## Current Limitations
|
| 135 |
|
| 136 |
+
SSA is in active research.
|
| 137 |
|
| 138 |
+
A few important limitations remain:
|
| 139 |
|
| 140 |
+
* only a subset of transformer layers currently use the SSA sparse path
|
| 141 |
+
* the complete model is therefore not yet fully subquadratic
|
| 142 |
+
* multi-fact retrieval becomes more difficult at larger context lengths, the model was only trained to support 16k.
|
| 143 |
+
* 1M-token speed results are operator-level measurements
|
| 144 |
+
* additional free-generation evaluations are still in progress
|
| 145 |
|
| 146 |
+
This checkpoint should currently be treated as a **research release rather than a production replacement for standard Llama 3.1 inference**.
|
| 147 |
|
| 148 |
+
## Research
|
| 149 |
|
| 150 |
+
This model is part of my research project.
|
| 151 |
|
| 152 |
+
Manuscript in preparation.
|
| 153 |
|
| 154 |
+
## Citation
|
| 155 |
|
| 156 |
+
```bibtex
|
| 157 |
+
@misc{jallu2026ssa,
|
| 158 |
+
title = {Sub-Quadratic Sparse Attention (SSA) for Long-Context LLMs},
|
| 159 |
+
author = {Jallu, Hrudayaditya},
|
| 160 |
+
year = {2026},
|
| 161 |
+
note = {Manuscript in preparation}
|
| 162 |
+
}
|
| 163 |
+
```
|
| 164 |
|
| 165 |
+
## Framework
|
|
|
|
| 166 |
|
| 167 |
+
* PyTorch
|
| 168 |
+
* Hugging Face Transformers
|
| 169 |
+
* PEFT 0.19.1
|
| 170 |
+
* Meta Llama 3.1 8B Instruct
|