|
1 | 1 | @testset "LineGraph" begin |
2 | 2 | # connected |
3 | | - network = SimpleTensorNetwork([ |
4 | | - Tensor(rand(2, 2), (:i, :m)), |
5 | | - Tensor(rand(2, 2, 2), (:i, :j, :p)), |
6 | | - Tensor(rand(2, 2, 2), (:n, :j, :k)), |
7 | | - Tensor(rand(2, 2, 2), (:p, :k, :l)), |
8 | | - Tensor(rand(2, 2, 2), (:m, :n, :o)), |
9 | | - Tensor(rand(2, 2), (:o, :l)), |
10 | | - ]) |
11 | | - |
12 | | - path1 = einexpr(network; optimizer = Greedy()) |
13 | | - path2 = einexpr(network; optimizer = LineGraph()) |
14 | | - @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
15 | | - @test contract(network; path = path1) ≈ contract(network; path = path2) |
16 | | - |
17 | | - path1 = einexpr(network; optimizer = Greedy(), outputs = [:i, :p]) |
18 | | - path2 = einexpr(network; optimizer = LineGraph(), outputs = [:i, :p]) |
19 | | - @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
20 | | - @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 3 | + @testset let network = SizedEinExpr( |
| 4 | + EinExpr( |
| 5 | + Symbol[], |
| 6 | + [ |
| 7 | + EinExpr([:i, :m]) |
| 8 | + EinExpr([:i, :j, :p]) |
| 9 | + EinExpr([:n, :j, :k]) |
| 10 | + EinExpr([:p, :k, :l]) |
| 11 | + EinExpr([:m, :n, :o]) |
| 12 | + EinExpr([:o, :l]) |
| 13 | + ], |
| 14 | + ), |
| 15 | + Dict(:i => 2, :j => 2, :k => 2, :l => 2, :m => 2, :n => 2, :o => 2, :p => 2), |
| 16 | + ) |
| 17 | + path1 = einexpr(Greedy(), network) |
| 18 | + path2 = einexpr(LineGraph(), network) |
| 19 | + @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
| 20 | + |
| 21 | + # TODO numerical test disabled due to circular dependency |
| 22 | + # @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 23 | + end |
| 24 | + |
| 25 | + @testset let network = SizedEinExpr( |
| 26 | + EinExpr( |
| 27 | + Symbol[:i, :p], |
| 28 | + [ |
| 29 | + EinExpr([:i, :m]) |
| 30 | + EinExpr([:i, :j, :p]) |
| 31 | + EinExpr([:n, :j, :k]) |
| 32 | + EinExpr([:p, :k, :l]) |
| 33 | + EinExpr([:m, :n, :o]) |
| 34 | + EinExpr([:o, :l]) |
| 35 | + ], |
| 36 | + ), |
| 37 | + Dict(:i => 2, :j => 2, :k => 2, :l => 2, :m => 2, :n => 2, :o => 2, :p => 2), |
| 38 | + ) |
| 39 | + path1 = einexpr(Greedy(), network) |
| 40 | + path2 = einexpr(LineGraph(), network) |
| 41 | + @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
| 42 | + |
| 43 | + # TODO numerical test disabled due to circular dependency |
| 44 | + # @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 45 | + end |
21 | 46 |
|
22 | 47 | # disconnected |
23 | | - network = TensorNetwork([ |
24 | | - Tensor(rand(2, 2), (:i, :j)), |
25 | | - Tensor(rand(2, 2), (:i, :j)), |
26 | | - Tensor(rand(2, 2, 2), (:k, :l, :m)), |
27 | | - Tensor(rand(2, 2, 2), (:k, :l, :m)), |
28 | | - ]) |
29 | | - |
30 | | - path1 = einexpr(network; optimizer = Greedy()) |
31 | | - path2 = einexpr(network; optimizer = LineGraph()) |
32 | | - @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
33 | | - @test contract(network; path = path1) ≈ contract(network; path = path2) |
34 | | - |
35 | | - path1 = einexpr(network; optimizer = Greedy(), outputs = [:i]) |
36 | | - path2 = einexpr(network; optimizer = LineGraph(), outputs = [:i]) |
37 | | - @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
38 | | - @test contract(network; path = path1) ≈ contract(network; path = path2) |
39 | | - |
40 | | - path1 = einexpr(network; optimizer = Greedy(), outputs = [:i, :k]) |
41 | | - path2 = einexpr(network; optimizer = LineGraph(), outputs = [:i, :k]) |
42 | | - @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
43 | | - @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 48 | + @testset let network = SizedEinExpr( |
| 49 | + EinExpr(Symbol[], [EinExpr([:i, :j]), EinExpr([:i, :j]), EinExpr([:k, :l, :m]), EinExpr([:k, :l, :m])]), |
| 50 | + Dict(:i => 2, :j => 2, :k => 2, :l => 2, :m => 2), |
| 51 | + ) |
| 52 | + path1 = einexpr(network; optimizer = Greedy()) |
| 53 | + path2 = einexpr(network; optimizer = LineGraph()) |
| 54 | + @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
| 55 | + |
| 56 | + # TODO numerical test disabled due to circular dependency |
| 57 | + # @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 58 | + end |
| 59 | + |
| 60 | + @testset let network = SizedEinExpr( |
| 61 | + EinExpr(Symbol[:i], [EinExpr([:i, :j]), EinExpr([:i, :j]), EinExpr([:k, :l, :m]), EinExpr([:k, :l, :m])]), |
| 62 | + Dict(:i => 2, :j => 2, :k => 2, :l => 2, :m => 2), |
| 63 | + ) |
| 64 | + path1 = einexpr(Greedy(), network) |
| 65 | + path2 = einexpr(LineGraph(), network) |
| 66 | + @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
| 67 | + end |
| 68 | + |
| 69 | + # TODO numerical test disabled due to circular dependency |
| 70 | + # @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 71 | + |
| 72 | + @testset let network = SizedEinExpr( |
| 73 | + EinExpr( |
| 74 | + Symbol[:i, :k], |
| 75 | + [EinExpr([:i, :j]), EinExpr([:i, :j]), EinExpr([:k, :l, :m]), EinExpr([:k, :l, :m])], |
| 76 | + ), |
| 77 | + Dict(:i => 2, :j => 2, :k => 2, :l => 2, :m => 2), |
| 78 | + ) |
| 79 | + path1 = einexpr(Greedy(), network) |
| 80 | + path2 = einexpr(LineGraph(), network) |
| 81 | + @test mapreduce(flops, +, Branches(path1)) >= mapreduce(flops, +, Branches(path2)) - 10 |
| 82 | + |
| 83 | + # TODO numerical test disabled due to circular dependency |
| 84 | + # @test contract(network; path = path1) ≈ contract(network; path = path2) |
| 85 | + end |
44 | 86 | end |
0 commit comments