· ·
AlphaDogfight is an algorithm designed by the authors to efficiently search large combinatorial spaces and it can be used for any kind of search. It is an extension of A* and it works well for discrete optimization problems.
Usage
import pandas as pd
import numpy as np
import theano.tensor as tt
import matplotlib.pyplot as plt
import math
# Create a simple model
X = np.array([1.0, 2.0, 4.0, 6.0, 8.0, 12.0])
theta = np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0])
# Create the inference engine
inference = AIDogfight()
inference.learn_params(X, theta)
# Get the solution
sol = inference.search_solution(X, theta)