Crates.io | deep_core |
lib.rs | deep_core |
version | 0.1.1 |
source | src |
created_at | 2018-12-16 19:22:09.470298 |
updated_at | 2018-12-16 19:55:42.258045 |
description | deep prototype |
homepage | |
repository | https://github.com/tglanz/deep |
max_upload_size | |
id | 102188 |
size | 21,181 |
See which {some-example} exists in the ~/examples directory (file names) and the run
cargo run --example {some-example}
Graph traversal and visitation patterns
Forward compute engine
Backward compute engine
A simple training using a graph that both forward and the backward engines can resolve
LeNet implementation and training
The serialization below is made by the default Debug rust formatter, the format is not what important here and it is subject to change in the future. The which, and what data, is the important thing here.
Graph {
id: 0,
nodes: [
InputNode {
id: 0,
tensor_descriptor: TensorDescriptor {
tensor_id: 0,
shape: Some(
Shape {
dimensions: [
3
]
}
)
}
},
ParameterNode {
id: 1,
tensor_descriptor: TensorDescriptor {
tensor_id: 1,
shape: Some(
Shape {
dimensions: [
3,
3
]
}
)
}
},
ParameterNode {
id: 2,
tensor_descriptor: TensorDescriptor {
tensor_id: 2,
shape: Some(
Shape {
dimensions: [
3
]
}
)
}
},
OperationNode {
id: 1,
operation: Dot
},
OperationNode {
id: 2,
operation: Add
},
OperationNode {
id: 3,
operation: LeakyRelu(
0.57
)
}
],
edges: [
OperandEdge {
id: 0,
connection: (
0,
1
),
operand: 0
},
OperandEdge {
id: 1,
connection: (
1,
1
),
operand: 1
},
OperandEdge {
id: 2,
connection: (
1,
2
),
operand: 0
},
OperandEdge {
id: 3,
connection: (
2,
2
),
operand: 0
},
OperandEdge {
id: 4,
connection: (
2,
3
),
operand: 0
}
]
}