Files
richard-churchman cc0a2bee21 Extensive modifications to the serialisation of Neural Network models to support Newtonsoft Json.net rather than Binary Serializer.
Included open-source Accord.net library code natively to the solution given the deprecated state of that project.  Accord.net will be supported inside Jube for own needs (such as upgrading to .Net 7+).

Accord.net libraries modified to compile to .Net 6.

Modified Accord.net libraries to better support Newtonsoft Json.net serialisation.

Included annotations in the Accord.net libraries to house important dependency statistics. Serialised json can be used independently of Jube to recall a Neural Network.

Removal of Binary Serializer totally as a precursor to the projects support of .Net 7+.

Extensive bug fixing in crucial functions of Neural Network training and recall.  While this part of the system remains in Alpha, it is substantially more fit for purpose.
2023-12-24 10:22:22 +01:00

160 lines
5.1 KiB
C#

// Accord Machine Learning Library
// The Accord.NET Framework
// http://accord-framework.net
//
// AForge Machine Learning Library
// AForge.NET framework
//
// Copyright © Andrew Kirillov, 2007-2008
// [email protected]
//
// Copyright © César Souza, 2009-2017
// cesarsouza at gmail.com
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
//
namespace Accord.MachineLearning
{
using System;
using Accord.Compat;
/// <summary>
/// Tabu search exploration policy.
/// </summary>
///
/// <remarks>The class implements simple tabu search exploration policy,
/// allowing to set certain actions as tabu for a specified amount of
/// iterations. The actual exploration and choosing from non-tabu actions
/// is done by <see cref="BasePolicy">base exploration policy</see>.</remarks>
///
/// <seealso cref="BoltzmannExploration"/>
/// <seealso cref="EpsilonGreedyExploration"/>
/// <seealso cref="RouletteWheelExploration"/>
///
[Serializable]
public class TabuSearchExploration : IExplorationPolicy
{
// total actions count
private int actions;
// list of tabu actions
private int[] tabuActions = null;
// base exploration policy
private IExplorationPolicy basePolicy;
/// <summary>
/// Base exploration policy.
/// </summary>
///
/// <remarks>Base exploration policy is the policy, which is used
/// to choose from non-tabu actions.</remarks>
///
public IExplorationPolicy BasePolicy
{
get { return basePolicy; }
set { basePolicy = value; }
}
/// <summary>
/// Initializes a new instance of the <see cref="TabuSearchExploration"/> class.
/// </summary>
///
/// <param name="actions">Total actions count.</param>
/// <param name="basePolicy">Base exploration policy.</param>
///
public TabuSearchExploration(int actions, IExplorationPolicy basePolicy)
{
this.actions = actions;
this.basePolicy = basePolicy;
// create tabu list
tabuActions = new int[actions];
}
/// <summary>
/// Choose an action.
/// </summary>
///
/// <param name="actionEstimates">Action estimates.</param>
///
/// <returns>Returns selected action.</returns>
///
/// <remarks>The method chooses an action depending on the provided estimates. The
/// estimates can be any sort of estimate, which values usefulness of the action
/// (expected summary reward, discounted reward, etc). The action is choosed from
/// non-tabu actions only.</remarks>
///
public int ChooseAction(double[] actionEstimates)
{
// get amount of non-tabu actions
int nonTabuActions = actions;
for (int i = 0; i < actions; i++)
{
if (tabuActions[i] != 0)
{
nonTabuActions--;
}
}
// allowed actions
double[] allowedActionEstimates = new double[nonTabuActions];
int[] allowedActionMap = new int[nonTabuActions];
for (int i = 0, j = 0; i < actions; i++)
{
if (tabuActions[i] == 0)
{
// allowed action
allowedActionEstimates[j] = actionEstimates[i];
allowedActionMap[j] = i;
j++;
}
else
{
// decrease tabu time of tabu action
tabuActions[i]--;
}
}
return allowedActionMap[basePolicy.ChooseAction(allowedActionEstimates)]; ;
}
/// <summary>
/// Reset tabu list.
/// </summary>
///
/// <remarks>Clears tabu list making all actions allowed.</remarks>
///
public void ResetTabuList()
{
Array.Clear(tabuActions, 0, actions);
}
/// <summary>
/// Set tabu action.
/// </summary>
///
/// <param name="action">Action to set tabu for.</param>
/// <param name="tabuTime">Tabu time in iterations.</param>
///
public void SetTabuAction(int action, int tabuTime)
{
tabuActions[action] = tabuTime;
}
}
}