Created
January 15, 2016 03:59
-
-
Save tedsta/e4eb527268f7a859931b to your computer and use it in GitHub Desktop.
Matrix multiplication operation in deelearn-rs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
pub struct MatMul { | |
a_t: ClMatrix<f32>, | |
b_t: ClMatrix<f32>, | |
} | |
impl MatMul { | |
pub fn new(ctx: &matrix::Context, a_shape: (u64, u64), b_shape: (u64, u64)) -> Self { | |
MatMul { | |
a_t: ClMatrix::new(ctx, a_shape.1 as usize, a_shape.0 as usize, ClMatrixMode::Mut), | |
b_t: ClMatrix::new(ctx, b_shape.1 as usize, b_shape.0 as usize, ClMatrixMode::Mut), | |
} | |
} | |
} | |
impl Operation for MatMul { | |
fn forward(&mut self, ctx: &matrix::Context, v: &mut VarStore, n: &mut Node) { | |
let a = &v.get(n.inputs[0]); | |
let b = &v.get(n.inputs[1]); | |
let c = &mut v.get_mut(n.outputs[0]); | |
a.dot(ctx, b, c); // c = a*b | |
} | |
fn backward(&mut self, ctx: &matrix::Context, v: &mut VarStore, n: &mut Node) { | |
let a = &v.get(n.inputs[0]); | |
let b = &v.get(n.inputs[1]); | |
let a_d = &mut v.get_mut(n.in_grad[0]); | |
let b_d = &mut v.get_mut(n.in_grad[1]); | |
let g = &v.get(n.out_grad[0].gradient()); | |
// Derivative with respect to first input | |
// a_d = g*b_t | |
b.transpose(ctx, &mut self.b_t); | |
g.dot(ctx, &self.b_t, a_d); | |
// Derivative with respect to second input | |
// b_d = a_t*g | |
a.transpose(ctx, &mut self.a_t); | |
self.a_t.dot(ctx, g, b_d); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment