god-graph 0.6.0-alpha

A graph-based LLM white-box optimization toolbox: topology validation, Lie group orthogonalization, tensor ring compression
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
//! Text generation utilities

use crate::tensor::DenseTensor;
use super::model::LlamaModel;

/// Generation configuration
#[derive(Debug, Clone)]
pub struct GenerationConfig {
    /// Maximum length to generate
    pub max_length: usize,
    /// Minimum length to generate
    pub min_length: usize,
    /// Temperature for sampling (higher = more random)
    pub temperature: f64,
    /// Top-k sampling (0 = disabled)
    pub top_k: usize,
    /// Top-p (nucleus) sampling (0.0 = disabled)
    pub top_p: f64,
    /// Repetition penalty
    pub repetition_penalty: f64,
    /// EOS token ID
    pub eos_token_id: Option<usize>,
    /// Pad token ID
    pub pad_token_id: Option<usize>,
    /// Do sample (if false, use greedy decoding)
    pub do_sample: bool,
    /// Number of beams for beam search (1 = disabled)
    pub num_beams: usize,
    /// Length penalty for beam search
    pub length_penalty: f64,
}

impl Default for GenerationConfig {
    fn default() -> Self {
        Self {
            max_length: 256,
            min_length: 0,
            temperature: 1.0,
            top_k: 0,
            top_p: 0.0,
            repetition_penalty: 1.0,
            eos_token_id: None,
            pad_token_id: None,
            do_sample: false,
            num_beams: 1,
            length_penalty: 1.0,
        }
    }
}

impl GenerationConfig {
    /// Create config for greedy decoding
    pub fn greedy() -> Self {
        Self {
            do_sample: false,
            ..Self::default()
        }
    }

    /// Create config for sampling
    pub fn sampling(temperature: f64) -> Self {
        Self {
            do_sample: true,
            temperature,
            ..Self::default()
        }
    }

    /// Create config for beam search
    pub fn beam_search(num_beams: usize) -> Self {
        Self {
            do_sample: false,
            num_beams,
            ..Self::default()
        }
    }

    /// Set maximum length
    pub fn with_max_length(mut self, max_length: usize) -> Self {
        self.max_length = max_length;
        self
    }

    /// Set temperature
    pub fn with_temperature(mut self, temperature: f64) -> Self {
        self.temperature = temperature;
        self
    }

    /// Set top-k
    pub fn with_top_k(mut self, top_k: usize) -> Self {
        self.top_k = top_k;
        self
    }

    /// Set top-p
    pub fn with_top_p(mut self, top_p: f64) -> Self {
        self.top_p = top_p;
        self
    }

    /// Set EOS token ID
    pub fn with_eos_token_id(mut self, eos_token_id: usize) -> Self {
        self.eos_token_id = Some(eos_token_id);
        self
    }
}

/// Text generator for LLaMA models
pub struct TextGenerator<'a> {
    /// Reference to the model
    model: &'a LlamaModel,
    /// Generation configuration
    config: GenerationConfig,
}

impl<'a> TextGenerator<'a> {
    /// Create a new text generator
    pub fn new(model: &'a LlamaModel, config: GenerationConfig) -> Self {
        Self { model, config }
    }

    /// Generate text from input prompt
    ///
    /// # Arguments
    /// * `input_ids` - Input token IDs [seq_len]
    ///
    /// # Returns
    /// Generated token IDs
    pub fn generate(&self, input_ids: &[usize]) -> Vec<usize> {
        if self.config.num_beams > 1 {
            self.generate_beam_search(input_ids)
        } else if self.config.do_sample {
            self.generate_sampling(input_ids)
        } else {
            self.generate_greedy(input_ids)
        }
    }

    /// Greedy decoding (always pick the highest probability token)
    fn generate_greedy(&self, input_ids: &[usize]) -> Vec<usize> {
        let mut current_ids = input_ids.to_vec();
        
        for _ in 0..self.config.max_length {
            // Forward pass
            let logits = self.model.forward_single(&current_ids, None);
            
            // Get logits for the last position
            let seq_len = current_ids.len();
            let last_logits = logits.get_row(seq_len - 1);
            
            // Apply temperature
            let mut probs = last_logits.clone();
            if self.config.temperature != 1.0 {
                probs = probs.scale(1.0 / self.config.temperature);
            }
            
            // Apply softmax
            probs = probs.softmax(-1);
            
            // Greedy: pick the token with highest probability
            let next_token = self.argmax(probs.data());
            
            // Check for EOS
            if Some(next_token) == self.config.eos_token_id {
                break;
            }
            
            current_ids.push(next_token);
        }
        
        current_ids
    }

    /// Sampling-based generation
    fn generate_sampling(&self, input_ids: &[usize]) -> Vec<usize> {
        let mut current_ids = input_ids.to_vec();
        let mut rng = rand::thread_rng();
        
        for _ in 0..self.config.max_length {
            // Forward pass
            let logits = self.model.forward_single(&current_ids, None);
            
            // Get logits for the last position
            let seq_len = current_ids.len();
            let last_logits = logits.get_row(seq_len - 1);
            
            // Apply temperature
            let mut probs = last_logits.clone();
            if self.config.temperature != 1.0 {
                probs = probs.scale(1.0 / self.config.temperature);
            }
            
            // Apply softmax
            probs = probs.softmax(-1);
            
            // Apply top-k filtering
            if self.config.top_k > 0 {
                probs = self.top_k_filtering(&probs, self.config.top_k);
            }
            
            // Apply top-p (nucleus) filtering
            if self.config.top_p > 0.0 {
                probs = self.top_p_filtering(&probs, self.config.top_p);
            }
            
            // Sample from the distribution
            let next_token = self.sample_from_probs(probs.data(), &mut rng);
            
            // Check for EOS
            if Some(next_token) == self.config.eos_token_id {
                break;
            }
            
            current_ids.push(next_token);
        }
        
        current_ids
    }

    /// Beam search generation
    fn generate_beam_search(&self, input_ids: &[usize]) -> Vec<usize> {
        // Simplified beam search implementation
        // A full implementation would track multiple hypotheses
        
        let mut beams: Vec<(Vec<usize>, f64)> = vec![(input_ids.to_vec(), 0.0)];
        
        for _ in 0..self.config.max_length {
            let mut candidates: Vec<(Vec<usize>, f64)> = Vec::new();
            
            for (beam_ids, beam_score) in &beams {
                // Forward pass
                let logits = self.model.forward_single(beam_ids, None);
                
                // Get logits for the last position
                let seq_len = beam_ids.len();
                let last_logits = logits.get_row(seq_len - 1);
                
                // Get top-k candidates
                let top_indices = self.topk_indices(last_logits.data(), self.config.num_beams);
                
                for &next_token in &top_indices {
                    let mut new_beam = beam_ids.clone();
                    new_beam.push(next_token);
                    
                    // Update score (log probability)
                    let token_prob = last_logits.data()[next_token];
                    let new_score = beam_score + token_prob.ln();
                    
                    candidates.push((new_beam, new_score));
                }
            }

            // Keep top-k beams
            candidates.sort_by(|a, b| b.1.partial_cmp(&a.1).unwrap_or(std::cmp::Ordering::Equal));
            beams = candidates.into_iter().take(self.config.num_beams).collect();

            // Check if all beams reached EOS
            if beams.iter().all(|(ids, _)| {
                ids.last() == self.config.eos_token_id.as_ref()
            }) {
                break;
            }
        }

        // Return the best beam
        beams.into_iter()
            .max_by(|a, b| a.1.partial_cmp(&b.1).unwrap_or(std::cmp::Ordering::Equal))
            .map(|(ids, _)| ids)
            .unwrap_or_else(|| input_ids.to_vec())
    }

    /// Argmax: find index of maximum value
    fn argmax(&self, data: &[f64]) -> usize {
        data.iter()
            .enumerate()
            .max_by(|(_, a), (_, b)| a.partial_cmp(b).unwrap_or(std::cmp::Ordering::Equal))
            .map(|(i, _)| i)
            .unwrap_or(0)
    }

    /// Top-k indices
    fn topk_indices(&self, data: &[f64], k: usize) -> Vec<usize> {
        let mut indexed: Vec<(usize, &f64)> = data.iter().enumerate().collect();
        indexed.sort_by(|(_, a), (_, b)| b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal));
        indexed.into_iter().take(k).map(|(i, _)| i).collect()
    }

    /// Top-k filtering: zero out probabilities outside top-k
    fn top_k_filtering(&self, probs: &DenseTensor, k: usize) -> DenseTensor {
        let data = probs.data();
        let top_indices = self.topk_indices(data, k);
        let threshold = top_indices.iter()
            .map(|&i| data[i])
            .min_by(|a, b| a.partial_cmp(b).unwrap_or(std::cmp::Ordering::Equal))
            .unwrap_or(0.0);

        let mut filtered = probs.clone();
        for (i, &prob) in data.iter().enumerate() {
            if prob < threshold {
                filtered.data_mut()[i] = 0.0;
            }
        }

        // Re-normalize
        let sum: f64 = filtered.data().iter().sum();
        if sum > 0.0 {
            filtered = filtered.scale(1.0 / sum);
        }

        filtered
    }

    /// Top-p (nucleus) filtering: keep smallest set of tokens with cumulative prob >= p
    fn top_p_filtering(&self, probs: &DenseTensor, p: f64) -> DenseTensor {
        let data = probs.data();
        let mut indexed: Vec<(usize, &f64)> = data.iter().enumerate().collect();
        indexed.sort_by(|(_, a), (_, b)| b.partial_cmp(a).unwrap_or(std::cmp::Ordering::Equal));
        
        let mut cumulative_prob = 0.0;
        let mut cutoff_index = indexed.len();
        
        for (i, (_, &prob)) in indexed.iter().enumerate() {
            cumulative_prob += prob;
            if cumulative_prob >= p {
                cutoff_index = i + 1;
                break;
            }
        }
        
        let threshold = indexed.into_iter()
            .take(cutoff_index)
            .map(|(_, &prob)| prob)
            .min_by(|a, b| a.partial_cmp(b).unwrap_or(std::cmp::Ordering::Equal))
            .unwrap_or(0.0);
        
        let mut filtered = probs.clone();
        for (i, &prob) in data.iter().enumerate() {
            if prob < threshold {
                filtered.data_mut()[i] = 0.0;
            }
        }
        
        // Re-normalize
        let sum: f64 = filtered.data().iter().sum();
        if sum > 0.0 {
            filtered = filtered.scale(1.0 / sum);
        }
        
        filtered
    }

    /// Sample from probability distribution
    fn sample_from_probs(&self, probs: &[f64], rng: &mut impl rand::Rng) -> usize {
        let r: f64 = rng.gen();
        let mut cumulative = 0.0;
        
        for (i, &prob) in probs.iter().enumerate() {
            cumulative += prob;
            if r < cumulative {
                return i;
            }
        }
        
        probs.len() - 1
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_generation_config() {
        let config = GenerationConfig::default();
        assert_eq!(config.max_length, 256);
        assert_eq!(config.temperature, 1.0);
        assert!(!config.do_sample);
        
        let greedy = GenerationConfig::greedy();
        assert!(!greedy.do_sample);
        
        let sampling = GenerationConfig::sampling(0.8);
        assert!(sampling.do_sample);
        assert_eq!(sampling.temperature, 0.8);
    }

    #[test]
    fn test_argmax() {
        let model = create_test_model();
        let generator = TextGenerator::new(
            &model,
            GenerationConfig::default(),
        );

        let data = vec![0.1, 0.3, 0.5, 0.2, 0.4];
        assert_eq!(generator.argmax(&data), 2);
    }

    #[test]
    fn test_topk_indices() {
        let model = create_test_model();
        let generator = TextGenerator::new(
            &model,
            GenerationConfig::default(),
        );

        let data = vec![0.1, 0.5, 0.3, 0.9, 0.2];
        let top2 = generator.topk_indices(&data, 2);
        assert_eq!(top2, vec![3, 1]);
    }
}

#[cfg(test)]
fn create_test_model() -> LlamaModel {
    use super::model::LlamaModel;
    use super::layers::{MultiHeadAttention, FeedForward, RMSNorm};
    use super::loader::LlamaConfig;
    use crate::tensor::DenseTensor;

    let config = LlamaConfig::llama_7b();
    let embed_tokens = DenseTensor::ones(vec![config.vocab_size, config.hidden_size]);

    let hidden_dim = config.hidden_size;
    let num_heads = config.num_attention_heads;

    let w_q = DenseTensor::ones(vec![hidden_dim, hidden_dim]);
    let w_k = DenseTensor::ones(vec![hidden_dim, hidden_dim]);
    let w_v = DenseTensor::ones(vec![hidden_dim, hidden_dim]);
    let w_o = DenseTensor::ones(vec![hidden_dim, hidden_dim]);
    let self_attn = MultiHeadAttention::standard(w_q, w_k, w_v, w_o, num_heads);

    let gate_proj = DenseTensor::ones(vec![hidden_dim, config.intermediate_size]);
    let up_proj = DenseTensor::ones(vec![hidden_dim, config.intermediate_size]);
    let down_proj = DenseTensor::ones(vec![config.intermediate_size, hidden_dim]);
    let mlp = FeedForward::swiglu(gate_proj, up_proj, down_proj);

    let input_layernorm = RMSNorm::default(hidden_dim);
    let post_attention_layernorm = RMSNorm::default(hidden_dim);

    let layer = super::model::LlamaDecoderLayer::new(
        self_attn, mlp, input_layernorm, post_attention_layernorm
    );

    let layers = vec![layer; 2]; // Use 2 layers for testing
    let norm = RMSNorm::default(hidden_dim);

    LlamaModel::new(config, embed_tokens, layers, norm, None)
}