-
Notifications
You must be signed in to change notification settings - Fork 314
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
[WIP] Outer product implementation #690
Closed
Closed
Changes from all commits
Commits
Show all changes
9 commits
Select commit
Hold shift + click to select a range
8c5738d
First try for various outter product implementations
krtab 71129cb
Added allow dead code while WIP to pass CI.
krtab 26b1087
Allow beta specific clippy:type_repetition_in_bounds
krtab 3d9933e
One allocation less.
krtab 566909e
Tydied-up code a bit
krtab 6dc1a67
New API, more clear and more efficient.
krtab 551deeb
Changed to FnMut + MaybeUninit
krtab cc24d1e
Use apply_assign_into
krtab d0098f4
Change interface + fix bugs in different ndim case
krtab File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
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
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -9,9 +9,10 @@ | |
use crate::imp_prelude::*; | ||
use crate::numeric_util; | ||
|
||
use crate::{LinalgScalar, Zip}; | ||
use crate::{ErrorKind, LinalgScalar, Zip}; | ||
|
||
use std::any::TypeId; | ||
use std::mem::MaybeUninit; | ||
|
||
#[cfg(feature = "blas")] | ||
use std::cmp; | ||
|
@@ -823,3 +824,190 @@ mod blas_tests { | |
assert!(blas_column_major_2d::<f32, _>(&m)); | ||
} | ||
} | ||
|
||
#[allow(dead_code)] | ||
fn general_kron<Sa, Sb, D, F, T>( | ||
a: &ArrayBase<Sa, D>, | ||
b: &ArrayBase<Sb, D>, | ||
mut f: F, | ||
) -> Result<Array<T, D>, ErrorKind> | ||
where | ||
T: Copy, | ||
Sa: Data<Elem = T>, | ||
Sb: Data<Elem = T>, | ||
D: Dimension, | ||
F: FnMut(T, T) -> T, | ||
{ | ||
let res_ndim = std::cmp::max(a.ndim(), b.ndim()); | ||
|
||
//Creates shapes completed by 1s to have res_ndim dims for each input array, | ||
let a_shape_completed = { | ||
let a_shape_iter = a.shape().iter().cloned().chain(std::iter::repeat(1)); | ||
let mut a_shape_completed = D::zeros(res_ndim); | ||
for (a_shape_completed_elem, a_shape_completed_value) in a_shape_completed | ||
.as_array_view_mut() | ||
.iter_mut() | ||
.zip(a_shape_iter) | ||
{ | ||
*a_shape_completed_elem = a_shape_completed_value; | ||
} | ||
a_shape_completed | ||
}; | ||
|
||
let b_shape_completed = { | ||
let b_shape_iter = b.shape().iter().cloned().chain(std::iter::repeat(1)); | ||
let mut b_shape_completed = D::zeros(res_ndim); | ||
for (b_shape_completed_elem, b_shape_completed_value) in b_shape_completed | ||
.as_array_view_mut() | ||
.iter_mut() | ||
.zip(b_shape_iter) | ||
{ | ||
*b_shape_completed_elem = b_shape_completed_value; | ||
} | ||
b_shape_completed | ||
}; | ||
|
||
// Create result shape, checking that the multiplication doesn't overflow to guarantee safety below | ||
let res_dim = { | ||
let mut res_dim: D = D::zeros(res_ndim); | ||
for ((res_dim_elem, &a_shape_value), &b_shape_value) in res_dim | ||
.as_array_view_mut() | ||
.iter_mut() | ||
.zip(a_shape_completed.as_array_view()) | ||
.zip(b_shape_completed.as_array_view()) | ||
{ | ||
match a_shape_value.checked_mul(b_shape_value) { | ||
Some(n) => *res_dim_elem = n, | ||
None => return Err(ErrorKind::Overflow), | ||
} | ||
} | ||
res_dim | ||
}; | ||
|
||
// Reshape input arrays to compatible shapes | ||
let a_reshape = a.view().into_shape(a_shape_completed).unwrap(); | ||
let b_reshape = b.view().into_shape(b_shape_completed.clone()).unwrap(); | ||
|
||
//Create and fill the result array | ||
let mut res: Array<MaybeUninit<T>, D> = ArrayBase::maybe_uninit(res_dim); | ||
let res_chunks = res.exact_chunks_mut(b_shape_completed); | ||
Zip::from(res_chunks) | ||
.and(a_reshape) | ||
.apply(|res_chunk, &a_elem| { | ||
Zip::from(&b_reshape) | ||
.apply_assign_into(res_chunk, |&b_elem| MaybeUninit::new(f(a_elem, b_elem))) | ||
}); | ||
// This is safe because the exact chunks covered exactly the res | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. nice |
||
let res = unsafe { res.assume_init() }; | ||
Ok(res) | ||
} | ||
|
||
#[allow(dead_code, clippy::type_repetition_in_bounds)] | ||
fn kron<Sa, Sb, D, T>(a: &ArrayBase<Sa, D>, b: &ArrayBase<Sb, D>) -> Result<Array<T, D>, ErrorKind> | ||
where | ||
T: Copy, | ||
Sa: Data<Elem = T>, | ||
Sb: Data<Elem = T>, | ||
D: Dimension, | ||
T: crate::ScalarOperand + std::ops::Mul<Output = T>, | ||
{ | ||
general_kron(a, b, std::ops::Mul::mul) | ||
} | ||
|
||
#[cfg(test)] | ||
mod kron_test { | ||
use super::*; | ||
|
||
#[test] | ||
fn same_dim() { | ||
let a = array![ | ||
[[1, 2, 3], [4, 5, 6]], | ||
[[17, 42, 69], [0, -1, 1]], | ||
[[1337, 1, 0], [-1337, -1, 0]] | ||
]; | ||
let b = array![ | ||
[[55, 66, 77], [88, 99, 1010]], | ||
[[42, 42, 0], [1, -3, 10]], | ||
[[110, 0, 7], [523, 21, -12]] | ||
]; | ||
let res = kron(&a.view(), &b.view()).unwrap(); | ||
for a0 in 0..a.len_of(Axis(0)) { | ||
for a1 in 0..a.len_of(Axis(1)) { | ||
for a2 in 0..a.len_of(Axis(2)) { | ||
for b0 in 0..b.len_of(Axis(0)) { | ||
for b1 in 0..b.len_of(Axis(1)) { | ||
for b2 in 0..b.len_of(Axis(2)) { | ||
assert_eq!( | ||
res[[ | ||
b.shape()[0] * a0 + b0, | ||
b.shape()[1] * a1 + b1, | ||
b.shape()[2] * a2 + b2 | ||
]], | ||
a[[a0, a1, a2]] * b[[b0, b1, b2]] | ||
) | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
|
||
#[test] | ||
fn different_dim() { | ||
let a = array![ | ||
[1, 2, 3, 4, 5, 6], | ||
[17, 42, 69, 0, -1, 1], | ||
[1337, 1, 0, -1337, -1, 0] | ||
]; | ||
let b = array![ | ||
[[55, 66, 77], [88, 99, 1010]], | ||
[[42, 42, 0], [1, -3, 10]], | ||
[[110, 0, 7], [523, 21, -12]] | ||
]; | ||
let res = kron(&a.view().into_dyn(), &b.view().into_dyn()).unwrap(); | ||
for a0 in 0..a.len_of(Axis(0)) { | ||
for a1 in 0..a.len_of(Axis(1)) { | ||
for b0 in 0..b.len_of(Axis(0)) { | ||
for b1 in 0..b.len_of(Axis(1)) { | ||
for b2 in 0..b.len_of(Axis(2)) { | ||
assert_eq!( | ||
res[[b.shape()[0] * a0 + b0, b.shape()[1] * a1 + b1, b2]], | ||
a[[a0, a1]] * b[[b0, b1, b2]] | ||
) | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
|
||
#[test] | ||
fn different_dim2() { | ||
let a = array![ | ||
[1, 2, 3, 4, 5, 6], | ||
[17, 42, 69, 0, -1, 1], | ||
[1337, 1, 0, -1337, -1, 0] | ||
]; | ||
let b = array![ | ||
[[55, 66, 77], [88, 99, 1010]], | ||
[[42, 42, 0], [1, -3, 10]], | ||
[[110, 0, 7], [523, 21, -12]] | ||
]; | ||
let res = kron(&b.view().into_dyn(), &a.view().into_dyn()).unwrap(); | ||
for a0 in 0..a.len_of(Axis(0)) { | ||
for a1 in 0..a.len_of(Axis(1)) { | ||
for b0 in 0..b.len_of(Axis(0)) { | ||
for b1 in 0..b.len_of(Axis(1)) { | ||
for b2 in 0..b.len_of(Axis(2)) { | ||
assert_eq!( | ||
res[[a.shape()[0] * b0 + a0, a.shape()[1] * b1 + a1, b2]], | ||
a[[a0, a1]] * b[[b0, b1, b2]] | ||
) | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} | ||
} |
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
into_shape is unfortunately not general enough to always succeed here :( I'm sorry if I have pushed you over to this solution with into_shape. We'll need to think about what we can do, because we know the completed shape is compatible.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
What's the issue with it? The layout constraint?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It only supports c/f-contiguous arrays, unfortunately.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
The shape completed code can be much simpler I guess. Make views
av
andbv
and use.insert_axis()
until they both have the same number of axes.There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
hm no, insert_axis changes the type, that's no good :(
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
One can check if it's a dyn dimension - then convert to explicitly typed
ArrayD
and convert back toArray<_, D>
later with.into_dimensionality()
? Is that truly the best way? Not sure.