## Monday, 27 January 2014

### Creating Neural Net Training Features

In my last post I wrote about how I had successfully coded a basic walk forward neural net training regime and that I was going to then work on creating useful training features. To that end, for the past few weeks, I have been doing a lot of online searching and luckily I have come across the Comp-Engine timeseries website. On this site there is a code tab with a plethora of ways of extracting time series features for classification purposes, and what's more the code is MATLAB code, which is almost fully compatible with the Octave software I do my development in. The only drawback I can see is that some of the code references or depends on MATLAB toolboxes, which might not be freely available to non MATLAB license holders. It is my intention for the immediate future to investigate this resource more fully.

## Thursday, 9 January 2014

### Neural Net Walk Forward Octave Training Code

Following on from my last post I have now completed the basic refactoring of my existing NN Octave code to a "Walk Forward" training regime. After some simple housekeeping code to load/extract data and create inputs the basic nuts and bolts of this new, walk forward Octave code is given in the code box below.
% get the corresponding targets - map the target labels as binary vectors of 1's and 0's for the class labels
n_classes = 3 ; % 3 outputs in softmax layer
targets = eye( n_classes )( l_s_n_pos_vec, : ) ; % there are 3 labels

% get NN features for all data
[ binary_features , scaled_features ] = windowed_nn_input_features( open, high, low, close, tick ) ;

tic ;

% a uniformly distributed randomness source for seeding & reproductibility purposes
global randomness_source

% vector to hold final NN classification results
nn_classification = zeros( length(close) , 2 ) ;

ii_begin = 2000 ;
ii_end = 2500 ;

for ii = ii_begin : ii_end

% get the look back period
lookback_period = max( period(ii-2,1)+2, period(ii,1) ) ;

% extract features and targets from windowed_nn_input_features output
training_binary_features = binary_features( ii-lookback_period:ii , : ) ;
training_scaled_features = scaled_features( ii-lookback_period:ii , : ) ;
training_targets = targets( ii-lookback_period:ii , : ) ;

% set some default values for NN training
n_hid = 2.0 * ( size( training_binary_features, 2 ) + size( training_scaled_features, 2 ) ) ; % units in hidden layer
lr_rbm = 0.02 ;       % default value for learning rate for rbm training
learning_rate = 0.5 ; % default value for learning rate for back prop training
n_iterations = 500 ; % number of training iterations to perform

% get the rbm trained weights for the input layer to hidden layer for training_binary_features
rbm_w_binary = train_rbm_binary_features( training_binary_features, n_hid, lr_rbm, n_iterations ) ;

% and now get the rbm trained weights of the input layer to hidden layer for training_scaled_features
rbm_w_scaled = train_rbm_scaled_features( training_scaled_features, n_hid, lr_rbm, n_iterations ) ;

% now stack these to form the initial input layer to hidden layer weight matrix
initial_input_weights = [ rbm_w_binary ; rbm_w_scaled ] ;

% now feedforward through hidden layer to get the hidden layer output
hidden_layer_output = logistic( [ training_binary_features training_scaled_features ] * initial_input_weights ) ;

% now add the hidden layer bias unit to the above output of the hidden layer and RBM train
hidden_layer_output = [ ones( size(hidden_layer_output,1), 1 ) hidden_layer_output ] ;
initial_softmax_weights = train_rbm_output_w( hidden_layer_output, n_classes, lr_rbm, n_iterations ) ;

% now using the above rbm trained weight matrices as initial weights instead of random initialisation,
% do the backpropagation training with targets by dropping the last two sets of features for which
% there are no targets and adding in a column of ones for the input layer bias unit
% First, extract the relevant features
all_features = [ training_binary_features(1:end-2,:) training_scaled_features(1:end-2,:) ] ;
training_targets = training_targets(1:end-2,:) ;

% and do the backprop training
[ final_input_w, final_softmax_w ] = rbm_backprop_training( all_features, training_targets, initial_input_weights, initial_softmax_weights, n_hid, n_iterations, learning_rate, 0.9, false) ;

% get the NN classification of the ii-th bar for this iteration
val_1 = logistic( [ training_binary_features(end-1,:) training_scaled_features(end-1,:) ] * final_input_w ) ;
val_2 = [ 1 val_1 ] * final_softmax_w ;
class_normalizer = log_sum_exp_over_cols( val_2 ) ;
log_class_prob = val_2 - repmat( class_normalizer , [ 1 , size( val_2 , 2 ) ] ) ;
class_prob = exp( log_class_prob ) ;
[ dump , choice_1 ] = max( class_prob , [] , 2 ) ;

if ( choice_1 == 3 )
choice_1 = ff_pos_vec(ii-2) ;
end

val_1 = logistic( [ training_binary_features(end,:) training_scaled_features(end,:) ] * final_input_w ) ;
val_2 = [ 1 val_1 ] * final_softmax_w ;
class_normalizer = log_sum_exp_over_cols( val_2 ) ;
log_class_prob = val_2 - repmat( class_normalizer , [ 1 , size( val_2 , 2 ) ] ) ;
class_prob = exp( log_class_prob ) ;
[ dump , choice ] = max( class_prob , [] , 2 ) ;

nn_classification( ii , 1 ) = choice ;

if ( choice == 3 )
choice = choice_1 ;
end

nn_classification( ii , 2 ) = choice ;

end % end if ii loop

toc ;

% write to file for plotting in Gnuplot
axis = (ii_begin:1:ii_end)';
output_v2 = [axis,open(ii_begin:ii_end,1),high(ii_begin:ii_end,1),low(ii_begin:ii_end,1),close(ii_begin:ii_end,1),nn_classification(ii_begin:ii_end,2),ff_pos_vec(ii_begin:ii_end,:) ] ;
dlmwrite('output_v2',output_v2)

This code is quite heavily commented, but to make things clearer here is what it does:-
1. creates a matrix of binary features and a matrix of scaled features ( in the range 0 to 1 ) by calling the C++ .oct function "windowed_nn_input_features." The binary features matrix includes the input layer bias unit
2. RBM trains separately on each of the above features matrices to get weight matrices
3. horizontally stacks the two weight matrices from step 2 to create a single, initial input layer to hidden layer weight matrix
4. matrix multiplies the input features by the combined RBM trained matrix from step 3 and feeds forward through the logistic function hidden layer to create a hidden layer output
5. adds a bias unit to the hidden layer output from step 4 and then RBM trains to get a Softmax weight matrix
6. uses the initial weight matrices from steps 3 and 5 instead of random initialisation for backpropagation training of a Feedforward neural network via the "rbm_backprop_training" function
7. uses the trained NN from step 6 to make prediction/classify the most recent candlestick bar and records this NN prediction/classification. Steps 2 to 7 are contained in a for loop which slides a moving window across the input data
8. finally writes output to file
At the moment the features I'm using are very simplistic, just for unit testing purposes. My next post will show the results of the above with a fuller set of features.

## Monday, 9 December 2013

### Preliminary Tests of Walk Forward NN Training Idea.

In my suspending work on Brownian bands post I suggested that I wanted to do some preliminary tests of the idea of training a neural net on a walk forward basis. The test I had in mind was a Monte Carlo permutation test as described in David Aronson's book  "Evidence Based Technical Analysis."  Before I go to the trouble of refactoring all my NN code I would like to be sure that, if a NN can be successfully trained in this way, the end result will have been worth the effort. With this aim in mind I used the below implementation of the MC test routine to test the above linked post's idea. The code, as usual, is Octave .oct function C++ code, but taking advantage of Octave's in-built libraries to avoid loops where possible.
DEFUN_DLD ( position_vector_permutation_test, args, nargout,
"-*- texinfo -*-\n\
@deftypefn {Function File} {} position_vector_permutation_test (@var{returns,position_vector_matrix,iters})\n\
This function takes as inputs a vector of returns, a position vector matrix the columns of which are\n\
the individual position vectors that are to be part of the test and the number of iterations for the test.\n\
If the matrix consists only of one position vector the test performed is the single position vector permuation\n\
test. If there are two or more position vectors the test performed is the data mining bias adjusted permutation\n\
test. The null hypothesis that is tested is that the position vector(s) give results that are no better than those\n\
a random ordering of equivalent net positions would give. The alternative hypothesis is that the position vector(s) give\n\
results that are better than a random ordering would give. The function returns a p-value(s) for the position vector(s)\n\
being tested. If small enough, we can reject the null hypothesis and accept the alternative hypothesis. The returned\n\
p-values are expressed as percentages, i.e 0.05 means a 5% significance value. The test statistic is the sum of returns.\n\
*IMPORTANT NOTE* Apart from basic input argument checks to avoid error messages and seg faults this function does not\n\
check that the returns vector and position vector matrix are properly alligned etc. with regard to accuracy of test results\n\
and makes no assumptions about this. It is the user's responsibility to ensure that the position vector(s) are offset to\n\
match the returns for the particular test in question.\n\
@end deftypefn" )

{
octave_value_list retval_list ; // the return value(s) are p value(s)
int nargin = args.length () ;

// check the input arguments
if ( nargin != 3 )
{
error ("Insufficient arguments. Inputs are a returns vector, a position vector matrix and a scalar value for iters.") ;
return retval_list ;
}

if ( args(0).length () != args(1).rows () )
{
error ("Dimensions mismatch. Length of returns vector should == No.rows of position_vector_matrix.") ;
return retval_list ;
}

if ( args(2).rows() > 1 )
{
error ("Invalid 3rd argument. This should be a scalar value for the number of permutations to perform.") ;
return retval_list ;
}

if ( args(2).length () != args(2).rows () )
{
error ("Invalid 3rd argument. This should be a scalar value for the number of permutations to perform.") ;
return retval_list ;
}

if ( error_state )
{
error ("Error state. See usage") ;
return retval_list ;
}
// end of input checking

set_warning_state ( "Octave:broadcast" , "off" ) ;

RowVector returns = args(0).row_vector_value () ; // Returns vector input
Matrix position_vector = args(1).matrix_value () ; // Positions vector input

// compute the return(s) of the candidate model(s)
Matrix model_returns ( 1 , position_vector.cols() ) ;
model_returns = returns * position_vector ; // matrix multiplication

// normalised returns multiplier
Matrix normalised_multiplier ( 1 , position_vector.cols() ) ;
normalised_multiplier.fill ( 0.0 ) ;

if ( position_vector.cols() > 1 ) // more than one position vector
{
for ( octave_idx_type ii (0) ; ii &lt; position_vector.cols() ; ii++ )
{
for ( octave_idx_type jj (0) ; jj &lt; position_vector.rows() ; jj++ )
{
normalised_multiplier( 0 , ii ) += fabs( position_vector( jj , ii ) ) ;
} // end of jj loop
normalised_multiplier( 0 , ii ) = sqrt( position_vector.rows() ) / sqrt( normalised_multiplier( 0 , ii ) ) ;
} // end of ii loop
} // end of if ( position_vector.cols() > 1 )
else // only one position vector
{
normalised_multiplier( 0 , 0 ) = 1.0 ;
}

// use this normalised_multiplier to adjust the model returns
model_returns = product( model_returns , normalised_multiplier ) ;

// Now do the Monte-Carlo replications
int temp ;
int k1 ;
int k2 ;
Matrix trial_returns ( 1 , position_vector.cols() ) ;
double max_trial_return ;
Matrix counts ( 1 , position_vector.cols() ) ;
counts.fill ( 0.0 ) ;
MTRand mtrand1 ; // Declare the Mersenne Twister Class - will seed from system time

for ( octave_idx_type ii (0) ; ii &lt; args(2).int_value() ; ii++ ) // args(2).int_value() is the no. of permutaions to perform
{
trial_returns.fill( 0.0 ) ; // set trial returns to zero

k1 = args(0).length () - 1 ; // initialise prior to shuffling the returns vector

while ( k1 > 0 ) // While at least 2 left to shuffle
{
k2 = mtrand1.randInt ( k1 ) ; // Pick an int from 0 through k1

if (k2 > k1)     // check if random vector index no. k2 is > than max vector index - should never happen
{
k2 = k1 - 1 ; // But this is cheap insurance against disaster if it does happen
}

temp = returns ( k1 ) ;           // allocate the last vector index content to temp
returns ( k1 ) = returns ( k2 ) ; // allocate random pick to the last vector index
returns ( k2 ) = temp ;           // allocate temp content to old vector index position of random pick
k1 = k1 - 1 ;                     // count down
}                                 // Shuffling is complete when this while loop exits

// Compute returns for this random shuffle
trial_returns = returns * position_vector ;

// and now normalise these returns
trial_returns = product( trial_returns , normalised_multiplier ) ;

max_trial_return = *std::max_element( &trial_returns( 0,0 ), &trial_returns( 0,trial_returns.cols() ) ) ;

for ( octave_idx_type jj (0) ; jj &lt; trial_returns.cols() ; jj++ )
{
if ( max_trial_return >= model_returns(0,jj) ) // If the best random system(s) beats the candidate system(s)
{
counts(0,jj) += 1 ; // Count it
}
}

} // end of main ii loop

// now write out the results
Matrix p_values ( 1 , position_vector.cols() ) ;
Matrix iters = args(2).matrix_value () ;
p_values = quotient( counts , iters ) ; // count divided by number of permutations

retval_list(0) = p_values ;

set_warning_state ( "Octave:broadcast" , "on" ) ;

return retval_list ; // Return the output to Octave

} // end of function

I am happy to report that the tests were passed with flying colours, although of course this shouldn't really be surprising as there is the benefit of peeking a few days into the future in the historical record.

My next task will be to implement the walk forward version of the NN, which I anticipate will take multiple weeks at a bare minimum to get satisfactorily working Octave code. More in due course.

## Friday, 6 December 2013

### Brownian Oscillator

In my previous post I said I was thinking about an oscillator based on Brownian bands and the lower pane in the video below shows said oscillator in action. The upper pane simply shows the prices with super imposed Brownian bands. The oscillator ranges between 0 and 1 and is effectively a measurement of the randomness of price movement. The calculation is very simple: for consecutive look back periods of 1 to the dominant cycle period a counter is incremented by 1 for each look back length in which price is between the Brownian bands for that look back length, and the sum of this counter is then divided by the dominant cycle period. The logic should be easily discernible from the code given in the code box below. According to this logic the higher the oscillator value the more random price movement is, and the lower the value the higher the "trendiness" of the price series. The value of the oscillator could also be interpreted as the percentage of look back periods which indicate random movement. Nb. I have changed the calculation of the bands to use absolute price differences rather than log differences - I find that this change leads to better behaved bands.

I have not done any testing of this oscillator as an indicator but I think it might have some value as a filter for a trend following system, or as a way of switching between trend following and mean reversion types of systems. The fact that the oscillator values lie in the range 0 to 1 also makes it suitable as an input to a neural net.

The Octave .oct code
DEFUN_DLD ( brownian_oscillator, args, nargout,
"-*- texinfo -*-\n\
@deftypefn {Function File} {} brownian_oscillator (@var{price,period})\n\
This function takes price and period vector inputs and outputs a value\n\
normalised by the max look back period for the number of look back periods\n\
from 1 to max look back period inclusive for which the price is between\n\
Brownian bands.\n\
@end deftypefn" )

{
octave_value_list retval_list ;
int nargin = args.length () ;

// check the input arguments
if ( nargin != 2 )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(0).length () < 50 ) // check length of price vector input
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(1).length () != args(0).length () ) // lookback period length argument
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( error_state )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}
// end of input checking

ColumnVector price = args(0).column_vector_value () ;
ColumnVector period = args(1).column_vector_value () ;
ColumnVector abs_price_diff = args(0).column_vector_value () ;
ColumnVector osc = args(0).column_vector_value () ; osc(0) = 0.0 ;
double sum ;
double osc_sum ;
double up_bb ;
double low_bb ;
int jj ;

for ( octave_idx_type ii (1) ; ii < 50 ; ii++ ) // initialising loop
{
abs_price_diff(ii) = fabs( price(ii) - price(ii-1) ) ;
osc(ii) = 0.0 ;
}

for ( octave_idx_type ii (50) ; ii < args(0).length () ; ii++ ) // main loop
{
// initialise calculation values
sum = 0.0 ;
osc_sum = 0.0 ;
up_bb = 0.0 ;
low_bb = 0.0 ;

for ( jj = 1 ; jj < period(ii) + 1 ; jj++ ) // nested jj loop
{

abs_price_diff(ii) = fabs( price(ii) - price(ii-1) ) ;
sum += abs_price_diff(ii-jj+1) ;
up_bb = price(ii-jj) + (sum/double(jj)) * sqrt(double(jj)) ;
low_bb = price(ii-jj) - (sum/double(jj)) * sqrt(double(jj)) ;

if ( price(ii) <= up_bb && price(ii) >= low_bb )
{
osc_sum += 1.0 ;
}

} // end of nested jj loop

osc(ii) = osc_sum / period(ii) ;

} // end of main loop

retval_list(0) = osc ;

return retval_list ;

} // end of function


## Wednesday, 27 November 2013

### Brownian Bands revisited?

Further to my most recent post there have been a few anonymous comments suggesting that Brownian bands are more useful than I supposed. In response I have added a contact form to this blog ( on the right ) so these anonymous readers may contact me if they wish. I am curious to learn how they may be using Brownian bands. I might also add that I have thought of creating a new indicator ( a kind of randomness measurement oscillator ) based on the Brownian bands concept.

## Sunday, 24 November 2013

### Suspending Work on Brownian Bands

Recently I have been doing a lot of work looking at various uses of the Brownian bands but I have been unable to come up with anything unique that I feel can help me so for now I am going to discontinue this work. There may be a time in the future when I return to this, but for now the Brownian bands are going to be put on the shelf along with my other indicators.

I have also started to become disillusioned with my attempts at creating a market classifier neural net; I think it may very well be too large a project to complete satisfactorily, so I am going to try something simpler in concept at least. In large part this change of heart is due to some recent reading I have been doing, particularly this article in which I was struck by the phrase

"As an aside, the ideal "trades" formed by the turning points might make a good training set of trades for a neural network-based system. Rather than scanning a chart manually to come up with trades to feed into the neural network, the method described here could be used to automatically find the training set."

Also over on the Mechanical Forex site there is a whole series of articles on neural nets which I have found useful and have given me a new insight. I am now going to ask readers to suspend their disbelief for a few moments while I explain.

The upper pane in the video below shows the coding of such logic. The decision to go long is rendered in blue, short in red and neutral in green. The colour of the bar indicates the action to be taken at the open of the next bar. However, it might be that when a neutral signal is given there is already be a position held, in which case the existing position is held for the duration of the neutral signal. This is effectively an always in the market, stop and reverse signal, and this is shown in the lower pane of the video. To make things slightly easier to see the entry/exit action occurs at the open of a new colour bar, i.e. if the bars change from blue to red the long is exited and the short initiated at the open of the first red bar.
Even with a cursory viewing it can be seen what a great "system" this would be, and using neural nets to create such a "system" is now my ambition.

The plan is simple: roll a moving window along the price series and use the known relationships between bars and indicators within this window to train a locally optimised neural net. The purpose of the training will be to classify the bars as long entry, short entry or neutral as in the chart in the upper pane of the above video. At the hard right edge of the chart the last three bars will be unavailable to the neural net for training purposes, but the hope is that the neural net, sufficiently well trained on all data in the window immediately prior to these three bars, will have predictive ability for them. After all, in the main, market dynamics slowly evolve over a few bars rather than dramatically leap.

Before I embark on this new work there are a few optimisation tests I would like to conduct, and these tests will form the subject matter of my next few posts.

## Sunday, 17 November 2013

### Brownian Bands

For the past few weeks I have been working on the idea presented in my earlier modelling prices using brownian motion post and below is a video of what I have come up with, which I'm calling Brownian Bands. The video shows these bands on the EURUSD forex pair with look back lengths of 1 to 10 bars inclusive, then 15 to 50 in increments of 5, then 50, 100 and 200 and finally 50, 100 and 200 on the whole time series. Each look back length band is the average of all bands from 1 up to and including the look back length band - the details of the implementation can be seen in the code boxes below. The blue band is the upper band, the red is the lower and the green is the mid point of the two.

Non-embedded view.

This following chart shows an adaptive look back length implementation, the look back length being determined by a period vector input to the function, which in this case is the dominant cycle period.
These adaptive Brownian bands can be compared with the equivalent adaptive Bollinger bands shown in this next chart.
For my intended purpose of separating out returns into distribution bins the Brownian bands seem to be superior. There are 3 distinct bins: above the upper band, below the lower band and between the bands, whereas with the Bollinger bands the vast majority of returns would be lumped into just one bin - between the bands. Of course the Brownian bands could be used to create a system indicator just as Bollinger bands can be, and if any readers test this idea I would be intrigued to hear of your results. However, should you choose to do this there is a major caveat you should be aware of. The calculation of the Brownian bands is based on the natural log of actual price, which means you should be very wary of test results on any back adjusted price series such as futures and adjusted stock prices. In fact I would go as far to say that the code given below should not be used as is on such price series. It is for this reason that I have been using forex price series in my own tests so far, but I will surely get around to adjusting the given code in due course.

Now for the code. This first code box shows a hard-coded, unrolled loop version for look back lengths up to and including 25 for the benefit of a reader who requested a clearer exposition of the method than was given in my earlier post, which was vectorised Octave code. All the code below is C++ as used in Octave .oct files.
DEFUN_DLD ( brownian_bands_25, args, nargout,
"-*- texinfo -*-\n\
@deftypefn {Function File} {} brownian_bands_25 (@var{price,period})\n\
This function takes a price vector input and a value for the tick\n\
size of the instrument and outputs upper and lower bands based on\n\
the concept of Brownian motion. The bands are the average of look\n\
back periods of 1 to 25 bars inclusive of the relevant calculations.\n\
@end deftypefn" )

{
octave_value_list retval_list ;
int nargin = args.length () ;

// check the input arguments
if ( nargin != 2 )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(0).length () < 21 )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(1).length () != 1 )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( error_state )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}
// end of input checking

ColumnVector price = args(0).column_vector_value () ;
double tick_size = args(1).double_value() ;
ColumnVector abs_log_price_diff = args(0).column_vector_value () ;
ColumnVector upper_band = args(0).column_vector_value () ;
ColumnVector lower_band = args(0).column_vector_value () ;
ColumnVector mid_band = args(0).column_vector_value () ;
double sum ;

double up_1 ;
double low_1 ;

double up_2 ;
double low_2 ;
double sqrt_2 = sqrt(2.0) ; // pre-calculated for speed optimisation

double up_3 ;
double low_3 ;
double sqrt_3 = sqrt(3.0) ; // pre-calculated for speed optimisation

double up_4 ;
double low_4 ;
double sqrt_4 = sqrt(4.0) ; // pre-calculated for speed optimisation

double up_5 ;
double low_5 ;
double sqrt_5 = sqrt(5.0) ; // pre-calculated for speed optimisation

double up_6 ;
double low_6 ;
double sqrt_6 = sqrt(6.0) ; // pre-calculated for speed optimisation

double up_7 ;
double low_7 ;
double sqrt_7 = sqrt(7.0) ; // pre-calculated for speed optimisation

double up_8 ;
double low_8 ;
double sqrt_8 = sqrt(8.0) ; // pre-calculated for speed optimisation

double up_9 ;
double low_9 ;
double sqrt_9 = sqrt(9.0) ; // pre-calculated for speed optimisation

double up_10 ;
double low_10 ;
double sqrt_10 = sqrt(10.0) ; // pre-calculated for speed optimisation

double up_11 ;
double low_11 ;
double sqrt_11 = sqrt(11.0) ; // pre-calculated for speed optimisation

double up_12 ;
double low_12 ;
double sqrt_12 = sqrt(12.0) ; // pre-calculated for speed optimisation

double up_13 ;
double low_13 ;
double sqrt_13 = sqrt(13.0) ; // pre-calculated for speed optimisation

double up_14 ;
double low_14 ;
double sqrt_14 = sqrt(14.0) ; // pre-calculated for speed optimisation

double up_15 ;
double low_15 ;
double sqrt_15 = sqrt(15.0) ; // pre-calculated for speed optimisation

double up_16 ;
double low_16 ;
double sqrt_16 = sqrt(16.0) ; // pre-calculated for speed optimisation

double up_17 ;
double low_17 ;
double sqrt_17 = sqrt(17.0) ; // pre-calculated for speed optimisation

double up_18 ;
double low_18 ;
double sqrt_18 = sqrt(18.0) ; // pre-calculated for speed optimisation

double up_19 ;
double low_19 ;
double sqrt_19 = sqrt(19.0) ; // pre-calculated for speed optimisation

double up_20 ;
double low_20 ;
double sqrt_20 = sqrt(20.0) ; // pre-calculated for speed optimisation

double up_21 ;
double low_21 ;
double sqrt_21 = sqrt(21.0) ; // pre-calculated for speed optimisation

double up_22 ;
double low_22 ;
double sqrt_22 = sqrt(22.0) ; // pre-calculated for speed optimisation

double up_23 ;
double low_23 ;
double sqrt_23 = sqrt(23.0) ; // pre-calculated for speed optimisation

double up_24 ;
double low_24 ;
double sqrt_24 = sqrt(24.0) ; // pre-calculated for speed optimisation

double up_25 ;
double low_25 ;
double sqrt_25 = sqrt(25.0) ; // pre-calculated for speed optimisation

for ( octave_idx_type ii (1) ; ii < 25 ; ii++ ) // initialising loop
{
abs_log_price_diff(ii) = fabs( log( price(ii) ) - log( price(ii-1) ) ) ;
}

for ( octave_idx_type ii (25) ; ii < args(0).length () ; ii++ ) // main loop
{

abs_log_price_diff(ii) = fabs( log( price(ii) ) - log( price(ii-1) ) ) ;

sum = abs_log_price_diff(ii) ;
up_1 = exp( log( price(ii-1) ) + sum ) ;
low_1 = exp( log( price(ii-1) ) - sum ) ;

sum += abs_log_price_diff(ii-1) ;
up_2 = exp( log( price(ii-2) ) + (sum/2.0) * sqrt_2 ) ;
low_2 = exp( log( price(ii-2) ) - (sum/2.0) * sqrt_2 ) ;

sum += abs_log_price_diff(ii-2) ;
up_3 = exp( log( price(ii-3) ) + (sum/3.0) * sqrt_3 ) ;
low_3 = exp( log( price(ii-3) ) - (sum/3.0) * sqrt_3 ) ;

sum += abs_log_price_diff(ii-3) ;
up_4 = exp( log( price(ii-4) ) + (sum/4.0) * sqrt_4 ) ;
low_4 = exp( log( price(ii-4) ) - (sum/4.0) * sqrt_4 ) ;

sum += abs_log_price_diff(ii-4) ;
up_5 = exp( log( price(ii-5) ) + (sum/5.0) * sqrt_5 ) ;
low_5 = exp( log( price(ii-5) ) - (sum/5.0) * sqrt_5 ) ;

sum += abs_log_price_diff(ii-5) ;
up_6 = exp( log( price(ii-6) ) + (sum/6.0) * sqrt_6 ) ;
low_6 = exp( log( price(ii-6) ) - (sum/6.0) * sqrt_6 ) ;

sum += abs_log_price_diff(ii-6) ;
up_7 = exp( log( price(ii-7) ) + (sum/7.0) * sqrt_7 ) ;
low_7 = exp( log( price(ii-7) ) - (sum/7.0) * sqrt_7 ) ;

sum += abs_log_price_diff(ii-7) ;
up_8 = exp( log( price(ii-8) ) + (sum/8.0) * sqrt_8 ) ;
low_8 = exp( log( price(ii-8) ) - (sum/8.0) * sqrt_8 ) ;

sum += abs_log_price_diff(ii-8) ;
up_9 = exp( log( price(ii-9) ) + (sum/9.0) * sqrt_9 ) ;
low_9 = exp( log( price(ii-9) ) - (sum/9.0) * sqrt_9 ) ;

sum += abs_log_price_diff(ii-9) ;
up_10 = exp( log( price(ii-10) ) + (sum/10.0) * sqrt_10 ) ;
low_10 = exp( log( price(ii-10) ) - (sum/10.0) * sqrt_10 ) ;

sum += abs_log_price_diff(ii-10) ;
up_11 = exp( log( price(ii-11) ) + (sum/11.0) * sqrt_11 ) ;
low_11 = exp( log( price(ii-11) ) - (sum/11.0) * sqrt_11 ) ;

sum += abs_log_price_diff(ii-11) ;
up_12 = exp( log( price(ii-12) ) + (sum/12.0) * sqrt_12 ) ;
low_12 = exp( log( price(ii-12) ) - (sum/12.0) * sqrt_12 ) ;

sum += abs_log_price_diff(ii-12) ;
up_13 = exp( log( price(ii-13) ) + (sum/13.0) * sqrt_13 ) ;
low_13 = exp( log( price(ii-13) ) - (sum/13.0) * sqrt_13 ) ;

sum += abs_log_price_diff(ii-13) ;
up_14 = exp( log( price(ii-14) ) + (sum/14.0) * sqrt_14 ) ;
low_14 = exp( log( price(ii-14) ) - (sum/14.0) * sqrt_14 ) ;

sum += abs_log_price_diff(ii-14) ;
up_15 = exp( log( price(ii-15) ) + (sum/15.0) * sqrt_15 ) ;
low_15 = exp( log( price(ii-15) ) - (sum/15.0) * sqrt_15 ) ;

sum += abs_log_price_diff(ii-15) ;
up_16 = exp( log( price(ii-16) ) + (sum/16.0) * sqrt_16 ) ;
low_16 = exp( log( price(ii-16) ) - (sum/16.0) * sqrt_16 ) ;

sum += abs_log_price_diff(ii-16) ;
up_17 = exp( log( price(ii-17) ) + (sum/17.0) * sqrt_17 ) ;
low_17 = exp( log( price(ii-17) ) - (sum/17.0) * sqrt_17 ) ;

sum += abs_log_price_diff(ii-17) ;
up_18 = exp( log( price(ii-18) ) + (sum/18.0) * sqrt_18 ) ;
low_18 = exp( log( price(ii-18) ) - (sum/18.0) * sqrt_18 ) ;

sum += abs_log_price_diff(ii-18) ;
up_19 = exp( log( price(ii-19) ) + (sum/19.0) * sqrt_19 ) ;
low_19 = exp( log( price(ii-19) ) - (sum/19.0) * sqrt_19 ) ;

sum += abs_log_price_diff(ii-19) ;
up_20 = exp( log( price(ii-20) ) + (sum/20.0) * sqrt_20 ) ;
low_20 = exp( log( price(ii-20) ) - (sum/20.0) * sqrt_20 ) ;

sum += abs_log_price_diff(ii-20) ;
up_21 = exp( log( price(ii-21) ) + (sum/21.0) * sqrt_21 ) ;
low_21 = exp( log( price(ii-21) ) - (sum/21.0) * sqrt_21 ) ;

sum += abs_log_price_diff(ii-21) ;
up_22 = exp( log( price(ii-22) ) + (sum/22.0) * sqrt_22 ) ;
low_22 = exp( log( price(ii-22) ) - (sum/22.0) * sqrt_22 ) ;

sum += abs_log_price_diff(ii-22) ;
up_23 = exp( log( price(ii-23) ) + (sum/23.0) * sqrt_23 ) ;
low_23 = exp( log( price(ii-23) ) - (sum/23.0) * sqrt_23 ) ;

sum += abs_log_price_diff(ii-23) ;
up_24 = exp( log( price(ii-24) ) + (sum/24.0) * sqrt_24 ) ;
low_24 = exp( log( price(ii-24) ) - (sum/24.0) * sqrt_24 ) ;

sum += abs_log_price_diff(ii-24) ;
up_25 = exp( log( price(ii-25) ) + (sum/25.0) * sqrt_25 ) ;
low_25 = exp( log( price(ii-25) ) - (sum/25.0) * sqrt_25 ) ;

upper_band(ii) = (up_1+up_2+up_3+up_4+up_5+up_6+up_7+up_8+up_9+up_10+up_11+up_12+up_13+up_14+up_15+up_16+up_17+up_18+up_19+up_20+up_21+up_22+up_23+up_24+up_25)/25.0 ;
lower_band(ii) = (low_1+low_2+low_3+low_4+low_5+low_6+low_7+low_8+low_9+low_10+low_11+low_12+low_13+low_14+low_15+low_16+low_17+low_18+low_19+low_20+low_21+low_22+low_23+up_24+low_25)/25.0 ;

// round the upper_band up to the nearest tick
upper_band(ii) = ceil( upper_band(ii)/tick_size ) * tick_size ;

// round the lower_band down to the nearest tick
lower_band(ii) = floor( lower_band(ii)/tick_size ) * tick_size ;

mid_band(ii) = ( upper_band(ii) + lower_band(ii) ) / 2.0 ;

} // end of main loop

retval_list(2) = mid_band ;
retval_list(1) = lower_band ;
retval_list(0) = upper_band ;

return retval_list ;

} // end of function

This next code box contains code for an adjustable look back length, the length being a user input to the function. This code wraps the above unrolled loop into a nested loop.
DEFUN_DLD ( brownian_bands_adjustable, args, nargout,
"-*- texinfo -*-\n\
@deftypefn {Function File} {} brownian_bands_adjustable (@var{price,lookback,tick_size})\n\
This function takes a price vector input, a value for the lookback\n\
length and a value for the tick size of the instrument and outputs\n\
upper and lower bands based on the concept of Brownian motion. The bands\n\
are the average of lookback period bands from 1 to lookback length.\n\
@end deftypefn" )

{
octave_value_list retval_list ;
int nargin = args.length () ;

// check the input arguments
if ( nargin != 3 )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(1).length () != 1 ) // lookback length argument
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

double lookback = args(1).double_value() ;

if ( args(0).length () < lookback ) // check length of price vector input
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(2).length () != 1 ) // tick size
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( error_state )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}
// end of input checking

ColumnVector price = args(0).column_vector_value () ;
double tick_size = args(2).double_value() ;
ColumnVector abs_log_price_diff = args(0).column_vector_value () ;
ColumnVector upper_band = args(0).column_vector_value () ;
ColumnVector lower_band = args(0).column_vector_value () ;
ColumnVector mid_band = args(0).column_vector_value () ;
double sum ;
double up_bb ;
double low_bb ;
int jj ;

for ( octave_idx_type ii (1) ; ii < lookback ; ii++ ) // initialising loop
{
abs_log_price_diff(ii) = fabs( log( price(ii) ) - log( price(ii-1) ) ) ;
}

for ( octave_idx_type ii (lookback) ; ii < args(0).length () ; ii++ ) // main loop
{
// initialise calculation values
sum = 0.0 ;
up_bb = 0.0 ;
low_bb = 0.0 ;

for ( jj = 1 ; jj < lookback + 1 ; jj++ ) // nested jj loop
{

abs_log_price_diff(ii) = fabs( log( price(ii) ) - log( price(ii-1) ) ) ;
sum += abs_log_price_diff(ii-jj+1) ;
up_bb += exp( log( price(ii-jj) ) + (sum/double(jj)) * sqrt(double(jj)) ) ;
low_bb += exp( log( price(ii-jj) ) - (sum/double(jj)) * sqrt(double(jj)) ) ;

} // end of nested jj loop

upper_band(ii) = up_bb / lookback ;
lower_band(ii) = low_bb / lookback ;

// round the upper_band up to the nearest tick
upper_band(ii) = ceil( upper_band(ii)/tick_size ) * tick_size ;

// round the lower_band down to the nearest tick
lower_band(ii) = floor( lower_band(ii)/tick_size ) * tick_size ;

mid_band(ii) = ( upper_band(ii) + lower_band(ii) ) / 2.0 ;

} // end of main loop

retval_list(2) = mid_band ;
retval_list(1) = lower_band ;
retval_list(0) = upper_band ;

return retval_list ;

} // end of function

Finally, this code is the adaptive look back version where the length of the look back is contained in a vector which is also a user input.
DEFUN_DLD ( brownian_bands_adaptive, args, nargout,
"-*- texinfo -*-\n\
@deftypefn {Function File} {} brownian_bands_adaptive (@var{price,period,tick_size})\n\
This function takes price and period vector inputs & a value for the tick\n\
size of the instrument and outputs upper and lower bands based on\n\
the concept of Brownian motion. The bands are adaptive averages of look\n\
back lengths of 1 to period bars inclusive.\n\
@end deftypefn" )

{
octave_value_list retval_list ;
int nargin = args.length () ;

// check the input arguments
if ( nargin != 3 )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(0).length () < 50 ) // check length of price vector input
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(1).length () != args(0).length () ) // lookback period length argument
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( args(2).length () != 1 ) // tick size
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}

if ( error_state )
{
error ( "Invalid arguments. Type help to see usage." ) ;
return retval_list ;
}
// end of input checking

ColumnVector price = args(0).column_vector_value () ;
ColumnVector period = args(1).column_vector_value () ;
double tick_size = args(2).double_value() ;
ColumnVector abs_log_price_diff = args(0).column_vector_value () ;
ColumnVector upper_band = args(0).column_vector_value () ;
ColumnVector lower_band = args(0).column_vector_value () ;
ColumnVector mid_band = args(0).column_vector_value () ;
double sum ;
double up_bb ;
double low_bb ;
int jj ;

for ( octave_idx_type ii (1) ; ii < 50 ; ii++ ) // initialising loop
{
abs_log_price_diff(ii) = fabs( log( price(ii) ) - log( price(ii-1) ) ) ;
}

for ( octave_idx_type ii (50) ; ii < args(0).length () ; ii++ ) // main loop
{
// initialise calculation values
sum = 0.0 ;
up_bb = 0.0 ;
low_bb = 0.0 ;

for ( jj = 1 ; jj < period(ii) + 1 ; jj++ ) // nested jj loop
{

abs_log_price_diff(ii) = fabs( log( price(ii) ) - log( price(ii-1) ) ) ;
sum += abs_log_price_diff(ii-jj+1) ;
up_bb += exp( log( price(ii-jj) ) + (sum/double(jj)) * sqrt(double(jj)) ) ;
low_bb += exp( log( price(ii-jj) ) - (sum/double(jj)) * sqrt(double(jj)) ) ;

} // end of nested jj loop

upper_band(ii) = up_bb / period(ii) ;
lower_band(ii) = low_bb / period(ii) ;

// round the upper_band up to the nearest tick
upper_band(ii) = ceil( upper_band(ii)/tick_size ) * tick_size ;

// round the lower_band down to the nearest tick
lower_band(ii) = floor( lower_band(ii)/tick_size ) * tick_size ;

mid_band(ii) = ( upper_band(ii) + lower_band(ii) ) / 2.0 ;

} // end of main loop

retval_list(2) = mid_band ;
retval_list(1) = lower_band ;
retval_list(0) = upper_band ;

return retval_list ;

} // end of function
Due to formatting issues on Blogger none of the code boxes contain the required header statements, which should be:-

#include octave/oct.h
#include octave/dColVector.h
#include math.h

with the customary < before "octave" and "math" and > after ".h"