######################################################################
-def conv_chain(input_size, output_size, depth, cond):
- if depth == 0:
+def conv_chain(input_size, output_size, remain_depth, cond):
+ if remain_depth == 0:
if input_size == output_size:
return [ [ ] ]
else:
r = [ ]
for kernel_size in range(1, input_size + 1):
for stride in range(1, input_size):
- if cond(depth, kernel_size, stride):
+ if cond(remain_depth, kernel_size, stride):
n = (input_size - kernel_size) // stride + 1
if n >= output_size and (n - 1) * stride + kernel_size == input_size:
- q = conv_chain(n, output_size, depth - 1, cond)
+ q = conv_chain(n, output_size, remain_depth - 1, cond)
r += [ [ (kernel_size, stride) ] + u for u in q ]
return r
c = conv_chain(
input_size = 64, output_size = 8,
- depth = 5,
+ remain_depth = 5,
# We want kernels smaller than 4, strides smaller than the
# kernels, and strides of 1 except in the two last layers
cond = lambda d, k, s: k <= 4 and s <= k and (s == 1 or d <= 2)