time and space complexity for reduced problems (#68)

* time and space complexity for reduced problems

* export reduced problem interfaces

* update networks

* update

Author: GiggleLiu

src/GenericTensorNetworks.jl

@@ -52,6 +52,7 @@ export Matching, is_matching
 export SetPacking, is_set_packing
 export SetCovering, is_set_covering
 export OpenPitMining, is_valid_mining, print_mining
+export ReducedProblem, target_problem, extract_result
 
 # Interfaces
 export solve, SizeMax, SizeMin, PartitionFunction, CountingAll, CountingMax, CountingMin, GraphPolynomial, SingleConfigMax, SingleConfigMin, ConfigsAll, ConfigsMax, ConfigsMin, Single

src/networks/Reduced.jl

@@ -1,3 +1,10 @@
+"""
+$TYPEDEF
+
+Graph problem that solved by reducing to another one. Interfaces are
+- [`target_problem`](@ref), get the target problem to be reduced to.
+- [`extract_result`](@ref), extract the result from the returned value of the target problem solver.
+"""
 abstract type ReducedProblem <: GraphProblem end
 
 """
@@ -17,4 +24,4 @@ function extract_result end
 # fixedvertices(r::ReducedProblem) = fixedvertices(target_problem(r))
 # labels(r::ReducedProblem) = labels(target_problem(r))
 # terms(r::ReducedProblem) = terms(target_problem(r))
-# get_weights(gp::ReducedProblem, label) = get_weights(target_problem(r))
+# get_weights(gp::ReducedProblem, label) = get_weights(target_problem(r))

src/networks/SpinGlass.jl

@@ -59,8 +59,8 @@ function extract_result(sg::SpinGlass, res::Union{Polynomial{BS,X}, LaurentPolyn
     return lres * LaurentPolynomial{BS,X}([one(eltype(res.coeffs))], -sumJ + sumh)
 end
 
-# the configurations are not changed
-for ET in [:SumProductTree, :ConfigSampler, :ConfigEnumerator, :Real]
+# the configurations are not changed, vectors are treated as configurations
+for ET in [:SumProductTree, :ConfigSampler, :ConfigEnumerator, :Real, :AbstractVector]
     @eval extract_result(sg::SpinGlass, res::T) where T <: $(ET) = res
 end
 
@@ -88,4 +88,4 @@ function spinglass_energy(g::SimpleGraph, config; J=NoWeight(), h=ZeroWeight())
         eng += s[v] * h[i]
     end
     return eng
-end
+end

src/networks/networks.jl

@@ -139,6 +139,7 @@ include("HyperSpinGlass.jl")
 
 # forward the time, space and readwrite complexity
 OMEinsum.contraction_complexity(gp::GraphProblem) = contraction_complexity(gp.code, uniformsize(gp.code, nflavor(gp)))
+OMEinsum.contraction_complexity(gp::ReducedProblem) = contraction_complexity(target_problem(gp))
 # the following two interfaces will be deprecated
 OMEinsum.timespace_complexity(gp::GraphProblem) = timespace_complexity(gp.code, uniformsize(gp.code, nflavor(gp)))
 OMEinsum.timespacereadwrite_complexity(gp::GraphProblem) = timespacereadwrite_complexity(gp.code, uniformsize(gp.code, nflavor(gp)))

test/networks/SpinGlass.jl

@@ -5,6 +5,7 @@ using GenericTensorNetworks, Test, Graphs
     J = rand(15)
     h = randn(10) .* 0.5
     gp = SpinGlass(g; h, J)
+    @test contraction_complexity(gp).sc <= 5
     M = zeros(10, 10)
     for (e,j) in zip(edges(g), J)
         M[e.src, e.dst] = j
@@ -38,4 +39,4 @@ using GenericTensorNetworks, Test, Graphs
     poly = solve(gp, GraphPolynomial())[]
     @test poly.m[] == sorted_energies[1]
     @test poly.n[] == sorted_energies[end]
-end
+end