Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions test/tensor_range_test_m.f90
Original file line number Diff line number Diff line change
Expand Up @@ -65,7 +65,7 @@ function write_then_read_tensor_range() result(test_passes)

function map_to_from_training_range() result(test_passes)
logical test_passes
real, parameter :: tolerance = 1.E-08
real, parameter :: tolerance = 1.E-07

associate(tensor_range => tensor_range_t(layer="output", minima=[-4., 0., 1., -1.], maxima=[0., 2., 5., 1.]))
associate(tensor => tensor_t([-2., 0., 5., 0.]))
Expand All @@ -76,4 +76,4 @@ function map_to_from_training_range() result(test_passes)
end associate
end function

end module tensor_range_test_m
end module tensor_range_test_m
Original file line number Diff line number Diff line change
Expand Up @@ -281,9 +281,15 @@ function xor_gate_with_random_weights() result(test_passes)
type(trainable_engine_t) trainable_engine
real(rkind), parameter :: tolerance = 1.E-02_rkind
real(rkind), allocatable :: harvest(:,:,:)
#ifndef __INTEL_COMPILER
integer, parameter :: num_inputs=2, mini_batch_size = 1, num_iterations=500000
!! Depending on where in the random-number sequence the weights start, this test can pass for lower
!! numbers of iterations, e.g., 400000. Using more iterations gives more robust convergence.
#else
integer, parameter :: num_inputs=2, mini_batch_size = 1, num_iterations=52219
!! Reducing num_iterations yields a less robust test, but increasing num_iterations causes this
!! test to crash when compiled with the Intel ifx compiler.
#endif
integer batch, iter

allocate(harvest(num_inputs, mini_batch_size, num_iterations))
Expand Down