Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/andrewCodeDev/ZEIN
Zig-based implementation of tensors
https://github.com/andrewCodeDev/ZEIN
Last synced: 29 days ago
JSON representation
Zig-based implementation of tensors
- Host: GitHub
- URL: https://github.com/andrewCodeDev/ZEIN
- Owner: andrewCodeDev
- License: mit
- Created: 2023-06-02T03:21:43.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-10-29T02:01:40.000Z (about 1 month ago)
- Last Synced: 2024-10-29T03:16:51.284Z (about 1 month ago)
- Language: Zig
- Size: 124 KB
- Stars: 40
- Watchers: 2
- Forks: 6
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
- awesome-zig - andrewCodeDev/ZEIN - based implementation of tensors. (Machine Learning / Zigged Project)
README
# ZEIN
Zig-based implementation of general-rank tensors! [1, 64)
## Importing ZEIN
1. Fetch ZEIN:
`zig fetch --save git+https://github.com/andrewCodeDev/ZEIN#main`
2. Add the module in your `build.zig`:
```zig
const zein = b.dependency("ZEIN", .{
.target = target,
.optimize = optimize,
});exe.root_module.addImport("zein", zein.module("ZEIN"));
```
You can now add `const zein = @import("zein");` to your file.## Using Tensor Objects
Tensors can be created in the following way:
```zig
// initialize underlying tensor memory:
var data = [9]i32{ 1, 2, 3, 4, 5, 6, 7, 8, 9 };// create a rank 2, 3x3, Rowwise tensor of i32 from data:
var X = zein.Tensor(i32, 2, Rowwise).init(&data, .{ 3, 3 });const x = X.getValue(.{0, 2}); // access value 3...
```## Allocating Tensor Data
The TensorFactory offers the ability to track and free allocations:
```zig
var factory = zein.TensorFactory(f32).init(.{
.system_allocator = your_allocator, // for TensorFactory components
.tensor_allocator = your_allocator, // for TensorFactory value data
});// Begin tracking tensor allocations (default is no-tracking):
factory.tracking(.start);// Stop tracking tensor allocations (does not free tensors):
factory.tracking(.stop);// Free tracked tensor allocations (no-op if no tensors are tracked):
factory.tracking(.free);// Deinit will free the allocator and currently tracked tensors:
factory.deinit();
```````zig
// Assign a new tensor from allocator:
var Y = try factory.allocTensor(2, Rowwise, .{ 10, 10 });
``````zig
// Assign memory into existing tensor:
var X = Tensor(f32, 2, Rowwise).init(null, .{ 10, 10 });
try factory.allocToTensor(&X); // alloc 100 elements...
````## Tensor Operations
Tensor operations are are in the form of either _Free Functions_ or _Factory Functions_:
- Free Functions require operands and the destination tensor.
- Factory Functions use operands to create the destination tensor.
The operations use compile time strings as einsum notation:
```zig
// Collapse tensor values using contraction:
zein.contraction("ijk->ji", &x, &y); // free function - assign to existing memory
var y = factory.contraction("ijk->ji", &x); // factory function - allocate new memory
``````zig
// Elementary binary functions (add, multiply):
zein.add(&x, &y, &z); // free function - assign to existing memory
var x = factory.add(&x, &y); // factory function - allocate new memory
``````zig
// Transpose/permutate tensor views (does not modify underlying data).
var y = x.permutate("ijk->kji");
``````zig
// Elementary vectorized reduction functions (sum, product, min, max):
const a = zein.sum(&x);
const b = zein.product(&x);
const c = zein.max(&x);
const d = zein.min(&x);
```## Using the Zein library
The main ZEIN/Zein.zig file provides an interface for the library implementation.
## Memory Ownership and Viewership
Currently, tensor permutations only change the indexing of a tensor - they do not
invalidate underlying memory. If the user chooses to use the TensorFactory,
it will track allocations and delete them automatically when calling deinit.
V1 is only tested on single thread environments - thread safety with allocators
will be coming in a later version!## Additonal functionality coming soon.
This library is still in the beginning phases. If you want to contribute, please
contact me! This is a big job and I'll take the help!