There seems something wrong in the implement (group_index).

[duducheng]

Hi Tom,

I read carefully your code, since I want to implement a network very similar to CWRNN. Your code is really clear, thanks!

However, I found it seems that you didn't correctly implement CWRNN, there is a "little" bug. If you take the hidden_W variable value, for instance I take num_hidden=4, periods = [1, 2], and print the hidden_W change, I got:

...
[[  1.19209290e-07  -1.71363354e-05   0.00000000e+00   0.00000000e+00]
 [  0.00000000e+00  -4.02897596e-04   0.00000000e+00   0.00000000e+00]
 [  0.00000000e+00   0.00000000e+00   0.00000000e+00   0.00000000e+00]
 [  0.00000000e+00   0.00000000e+00   0.00000000e+00   0.00000000e+00]]
...

that's to say your code just use 2 units of hidden_W. I think you forget to set the group_size of each period.

I think it's better to use tf.where rather than group_index, the group_index may cause lots of problem. Check https://github.com/braingineer/ikelos/blob/master/ikelos/layers/cwrnn.py, or later I will give a tensorflow implement.

[dzhu622911]

I also read the Thesis and this code carefully, and found the same question with above, the group_index seems not take effect, the expected effect maybe group_index * group_size? which group_size = self.config.num_hidden / len(self.config.periods)

[dzhu622911]

here is modified code with group_index * group_size

`import numpy as np import tensorflow as tf

class ClockworkRNN(object):

'''
A Clockwork RNN - Koutnik et al. 2014 [arXiv, https://arxiv.org/abs/1402.3511]
The Clockwork RNN (CW-RNN), in which the hidden layer is partitioned into separate modules,
each processing inputs at its own temporal granularity, making computations only at its prescribed clock rate.
Rather than making the standard RNN models more complex, CW-RNN reduces the number of RNN parameters,
improves the performance significantly in the tasks tested, and speeds up the network evaluation
'''


def __init__(self, config):

    self.config = config

    # Check if the number of groups (periods) in the hidden layer
    # is compatible with the total number of units in the layer. Note that
    # this is not a requirement in the paper; there the extra neurons are
    # divided over the higher frequency groups.
    assert self.config.num_hidden % len(self.config.periods) == 0

    #add by daniel
    **self.group_size = self.config.num_hidden / len(self.config.periods)**

    # Global training step
    self.global_step = tf.Variable(0, name='global_step', trainable=False)

    # Initialize placeholders
    self.inputs  = tf.placeholder(
        dtype=tf.float32,
        shape=[None, self.config.num_steps, self.config.num_input],
        name="inputs")

    self.targets = tf.placeholder(
        dtype=tf.float32,
        shape=[None, self.config.num_output],
        name="targets")

    # Build the complete model
    self._build_model()

    # Initialize the optimizer with gradient clipping
    self._init_optimizer()

    # Operations for creating summaries
    self._build_summary_ops()


def _build_model(self):

    # Weight and bias initializers
    initializer_weights = tf.contrib.layers.variance_scaling_initializer()
    initializer_bias    = tf.constant_initializer(0.0)

    # Activation functions of the hidden and output state
    activation_hidden = tf.tanh
    activation_output = tf.nn.relu

    # Split into list of tensors, one for each timestep
    x_list = [tf.squeeze(x, axis=[1])
              for x in tf.split(
                axis=1, num_or_size_splits=self.config.num_steps,
                value=self.inputs, name="inputs_list")]

    # Periods of each group: 1,2,4, ..., 256 (in the case num_periods=9)
    self.clockwork_periods = self.config.periods

    # Mask for matrix W_I to make sure it's upper triangular
    self.clockwork_mask = tf.constant(np.triu(np.ones([self.config.num_hidden, self.config.num_hidden])), dtype=tf.float32, name="mask")

    with tf.variable_scope("input"):
        self.input_W = tf.get_variable("W", shape=[self.config.num_input, self.config.num_hidden], initializer=initializer_weights)    # W_I
        self.input_b = tf.get_variable("b", shape=[self.config.num_hidden], initializer=initializer_bias)                              # b_I

    with tf.variable_scope("hidden"):
        self.hidden_W = tf.get_variable("W", shape=[self.config.num_hidden, self.config.num_hidden], initializer=initializer_weights)  # W_H
        self.hidden_W = tf.multiply(self.hidden_W, self.clockwork_mask)  # => upper triangular matrix                                  # W_H
        self.hidden_b = tf.get_variable("b", shape=[self.config.num_hidden], initializer=initializer_bias)                             # b_H

    with tf.variable_scope("output"):
        self.output_W = tf.get_variable("W", shape=[self.config.num_hidden, self.config.num_output], initializer=initializer_weights)  # W_O
        self.output_b = tf.get_variable("b", shape=[self.config.num_output], initializer=initializer_bias)                             # b_O

    with tf.variable_scope("clockwork_cell") as scope:

        # Initialize the hidden state of the cell to zero (this is y_{t_1})
        self.state = tf.get_variable("state", shape=[self.config.batch_size, self.config.num_hidden], initializer=tf.zeros_initializer(), trainable=False)

        for time_step in range(self.config.num_steps):

            # Only initialize variables in the first step
            if time_step > 0: scope.reuse_variables()

            # Find the groups of the hidden layer that are active
            group_index = 0
            for i in range(len(self.clockwork_periods)):
                # Check if (t MOD T_i == 0)
                if time_step % self.clockwork_periods[i] == 0:
                    group_index = i+1  # note the +1

            #add by daniel zhu
            **group_index = self.group_size * group_index**

            # Compute (W_I*x_t + b_I)
            WI_x = tf.matmul(x_list[time_step], tf.slice(self.input_W, [0, 0], [-1, group_index]))
            WI_x = tf.nn.bias_add(WI_x, tf.slice(self.input_b, [0], [group_index]), name="WI_x")

            # Compute (W_H*y_{t-1} + b_H), note the multiplication of the clockwork mask (upper triangular matrix)
            self.hidden_W = tf.multiply(self.hidden_W, self.clockwork_mask)
            WH_y = tf.matmul(self.state, tf.slice(self.hidden_W, [0, 0], [-1, group_index]))
            WH_y = tf.nn.bias_add(WH_y, tf.slice(self.hidden_b, [0], [group_index]), name="WH_y")

            # Compute y_t = (...) and update the cell state
            y_update = tf.add(WH_y, WI_x, name="state_update")
            y_update = activation_hidden(y_update)

            # Copy the updates to the cell state
            self.state = tf.concat(
                axis=1, values=[y_update, tf.slice(self.state, [0, group_index], [-1,-1])])

        # Save the final hidden state
        self.final_state = self.state

        # Compute the output, y = f(W_O*y_t + b_O)
        self.predictions = tf.matmul(self.final_state, self.output_W)
        self.predictions = tf.nn.bias_add(self.predictions, self.output_b)
        #self.predictions = activation_output(self.predictions, name="output")

        # Compute the loss
        self.error = tf.reduce_sum(tf.square(self.targets - self.predictions), axis=1)
        self.loss  = tf.reduce_mean(self.error, name="loss")


def _init_optimizer(self):

    # Learning rate decay, note that is self.learning_rate_decay == 1.0,
    # the decay schedule is disabled, i.e. learning rate is constant.
    self.learning_rate = tf.train.exponential_decay(
        self.config.learning_rate,
        self.global_step,
        self.config.learning_rate_step,
        self.config.learning_rate_decay,
        staircase=True
    )
    self.learning_rate = tf.maximum(self.learning_rate, self.config.learning_rate_min)
    tf.summary.scalar("learning_rate", self.learning_rate)

    # Definition of the optimizer and computing gradients operation
    if self.config.optimizer == 'adam':
        # Adam optimizer
        self.optimizer = tf.train.AdamOptimizer(learning_rate=self.learning_rate)
    elif self.config.optimizer == 'rmsprop':
        # RMSProper optimizer
        self.optimizer = tf.train.RMSPropOptimizer(learning_rate=self.learning_rate)
    elif self.config.optimizer == 'adagrad':
        # AdaGrad optimizer
        self.optimizer = tf.train.AdagradOptimizer(learning_rate=self.learning_rate)
    else:
        raise ValueError("Unknown optimizer specified")

    # Compute the gradients for each variable
    self.grads_and_vars = self.optimizer.compute_gradients(self.loss)

    # Optionally perform gradient clipping by max-norm
    if self.config.max_norm_gradient > 0:
        # Perform gradient clipping by the global norm
        grads, variables = zip(*self.grads_and_vars)
        grads_clipped, _ = tf.clip_by_global_norm(
            grads, clip_norm=self.config.max_norm_gradient)

        # Apply the gradients after clipping them
        self.train_op = self.optimizer.apply_gradients(
            zip(grads_clipped, variables),
            global_step=self.global_step
        )

    else:
        # Unclipped gradients
        self.train_op = self.optimizer.apply_gradients(
            self.grads_and_vars,
            global_step=self.global_step
        )

    # Keep track of gradient values and their sparsity
    grad_summaries = []
    for g, v in self.grads_and_vars:
        if g is not None:
            grad_hist_summary = tf.summary.histogram("gradients/{}/hist".format(v.name), g)
            sparsity_summary  = tf.summary.scalar("gradients/{}/sparsity".format(v.name), tf.nn.zero_fraction(g))
            grad_summaries.append(grad_hist_summary)
            grad_summaries.append(sparsity_summary)
    self.gradient_summaries_merged = tf.summary.merge(grad_summaries)


def _build_summary_ops(self):

    # Training summaries
    training_summaries = [
        tf.summary.scalar("train/loss", self.loss),
        tf.summary.scalar("train/learning_rate", self.learning_rate),
    ]

    # Combine the training summaries with the gradient summaries
    self.train_summary_op = tf.summary.merge(
        [training_summaries, self.gradient_summaries_merged])`

[tomrunia]

Hi! Sorry I have not been able to respond earlier. Feel free to make a pull request so I can merge your code into the repository. Thank you!

[dzhu622911]

@tomrunia , my friend zhlicen already upload the code, please review. and i found another question, will submit another issue.

[duducheng]

this issue appear to be alive after one year... my implementation (based on this repo) is available for reference (together with Temporal Kernel RNN). Caution this is also one-year-ago code, I tested it in my time series data successfully, but may be incompatible for the latest version of tf.

[jeffd75]

Sorry guys I posted something too fast this morning.

It seems to me that this implementation with

for i in range(len(self.clockwork_periods)): if time_step % self.clockwork_periods[i] == 0: group_index = i+1

is dependent upon the fact that periods are exponents of 2 : 1, 2, 4.. 2^k This implies that if there is an i such that period t%(2^i)=0 then also t%(2^j)=0 for all j, 0<=j<=i. Implementing CWRNN with periods equal to prime numbers : 1,2,3,5,7,11.. might be more efficient (as it spreads the burden of time gaps more evenly) and this code won't work in such circumstances.

[jeffd75]

Something else, in this implementation,

1. the mask is for a upper-triangular matrix of weights, whereas Wh should be only block-upper triangular. @duducheng's implementation of the mask is correct :

mask= np.zeros((self.n_hidden, self.n_hidden), np.float32) period = np.zeros(self.n_hidden) for i, t in enumerate(self.periods): mask[i * group_size:(i + 1) * group_size, i * group_size:] = 1 period[i * group_size:(i + 1) * group_size] = t clockwork_mask = tf.constant( mask, dtype=tf.float32, name='clockword_mask')

Regarding @duducheng's code , his loop over the time sequence (which is built so as to work without the above-mentioned assumption regarding the choice of 2^k for the sequence of periods) makes a lot of useless calculations.

for time_step in range(self.n_steps): wI_x = tf.matmul(self.X[:, time_step, :], input_weights) wH_y = tf.matmul(state, state_weights) current_state = tf.tanh(wH_y + wI_x + biases) # Note: this implement will not speed up (over SRN) current_state = tf.where( tf.equal(tf.mod(time_step, clockwork_period), 0), tf.transpose(current_state), tf.transpose(state)) state = tf.transpose(current_state)

I will try to improve this soon.

3. in this implementation, I don't understand the need for 2 biases (input and hidden), which end up being simply added in the process and indeed in @duducheng's implementation there is only one (per cell)

[jeffd75]

Here is the bit of code I mentioned yesterday, which makes the model flexible in order to use any periods and not necessarily exponents of 2 and is computationally more efficient :

(EVERYTHING inside the " if time_step % self.clockwork_periods[i] == 0:" condition) group_index_debut = self.group_size * i group_index_fin = group_index_debut+self.group_size # Compute (W_Ix_t) WI_x = tf.matmul(x_list[time_step], tf.slice(self.input_W, [0, group_index_debut], [-1, self.group_size])) # Compute (W_Hy_{t-1} + b_H) WH_y = tf.matmul(self.state, tf.slice(self.hidden_W, [0, group_index_debut], [-1, self.group_size])) WH_y = tf.nn.bias_add(WH_y, tf.slice(self.hidden_b, [group_index_debut], [self.group_size]), name="WH_y") # Compute y_t = (...) and update the cell state y_update = tf.add(WH_y, WI_x, name="state_update") y_update = activation_hidden(y_update) # Copy the updates to the cell state y_update = tf.concat(axis=1, values=[tf.slice(self.state, [0, 0], [-1,group_index_debut]),y_update]) self.state = tf.concat(axis=1, values=[y_update, tf.slice(self.state, [0, group_index_fin], [-1,-1])])