convGAN.py 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395
  1. import numpy as np
  2. import matplotlib.pyplot as plt
  3. from library.interfaces import GanBaseClass
  4. from library.dataset import DataSet
  5. from keras.layers import Dense, Input, Multiply, Flatten, Conv1D, Reshape
  6. from keras.models import Model
  7. from keras import backend as K
  8. from tqdm import tqdm
  9. import tensorflow as tf
  10. from tensorflow.keras.optimizers import Adam
  11. from tensorflow.keras.layers import Lambda
  12. from library.NNSearch import NNSearch
  13. import warnings
  14. warnings.filterwarnings("ignore")
  15. def repeat(x, times):
  16. return [x for _i in range(times)]
  17. def create01Labels(totalSize, sizeFirstHalf):
  18. labels = repeat(np.array([1,0]), sizeFirstHalf)
  19. labels.extend(repeat(np.array([0,1]), totalSize - sizeFirstHalf))
  20. return np.array(labels)
  21. class ConvGAN(GanBaseClass):
  22. """
  23. This is a toy example of a GAN.
  24. It repeats the first point of the training-data-set.
  25. """
  26. def __init__(self, n_feat, neb=5, gen=None, neb_epochs=10, withMajorhoodNbSearch=False, debug=False):
  27. self.isTrained = False
  28. self.n_feat = n_feat
  29. self.neb = neb
  30. self.nebInitial = neb
  31. self.genInitial = gen
  32. self.gen = gen if gen is not None else self.neb
  33. self.neb_epochs = 10
  34. self.loss_history = None
  35. self.debug = debug
  36. self.minSetSize = 0
  37. self.conv_sample_generator = None
  38. self.maj_min_discriminator = None
  39. self.withMajorhoodNbSearch = withMajorhoodNbSearch
  40. self.cg = None
  41. self.canPredict = True
  42. if self.neb is not None and self.gen is not None and self.neb > self.gen:
  43. raise ValueError(f"Expected neb <= gen but got neb={neb} and gen={gen}.")
  44. def reset(self, dataSet):
  45. """
  46. Resets the trained GAN to an random state.
  47. """
  48. self.isTrained = False
  49. if dataSet is not None:
  50. nMinoryPoints = dataSet.data1.shape[0]
  51. if self.nebInitial is None:
  52. self.neb = nMinoryPoints
  53. else
  54. self.neb = min(self.nebInitial, nMinoryPoints)
  55. else:
  56. self.neb = self.nebInitial
  57. self.gen = self.genInitial if self.genInitial is not None else self.neb
  58. ## instanciate generator network and visualize architecture
  59. self.conv_sample_generator = self._conv_sample_gen()
  60. ## instanciate discriminator network and visualize architecture
  61. self.maj_min_discriminator = self._maj_min_disc()
  62. ## instanciate network and visualize architecture
  63. self.cg = self._convGAN(self.conv_sample_generator, self.maj_min_discriminator)
  64. if self.debug:
  65. print(self.conv_sample_generator.summary())
  66. print('\n')
  67. print(self.maj_min_discriminator.summary())
  68. print('\n')
  69. print(self.cg.summary())
  70. print('\n')
  71. def train(self, dataSet, discTrainCount=5):
  72. """
  73. Trains the GAN.
  74. It stores the data points in the training data set and mark as trained.
  75. *dataSet* is a instance of /library.dataset.DataSet/. It contains the training dataset.
  76. We are only interested in the first *maxListSize* points in class 1.
  77. """
  78. if dataSet.data1.shape[0] <= 0:
  79. raise AttributeError("Train: Expected data class 1 to contain at least one point.")
  80. # Store size of minority class. This is needed during point generation.
  81. self.minSetSize = dataSet.data1.shape[0]
  82. # Precalculate neighborhoods
  83. self.nmbMin = NNSearch(self.neb).fit(haystack=dataSet.data1)
  84. if self.withMajorhoodNbSearch:
  85. self.nmbMaj = NNSearch(self.neb).fit(haystack=dataSet.data0, needles=dataSet.data1)
  86. else:
  87. self.nmbMaj = None
  88. # Do the training.
  89. self._rough_learning(dataSet.data1, dataSet.data0, discTrainCount)
  90. # Neighborhood in majority class is no longer needed. So save memory.
  91. self.nmbMaj = None
  92. self.isTrained = True
  93. def generateDataPoint(self):
  94. """
  95. Returns one synthetic data point by repeating the stored list.
  96. """
  97. return (self.generateData(1))[0]
  98. def generateData(self, numOfSamples=1):
  99. """
  100. Generates a list of synthetic data-points.
  101. *numOfSamples* is a integer > 0. It gives the number of new generated samples.
  102. """
  103. if not self.isTrained:
  104. raise ValueError("Try to generate data with untrained Re.")
  105. ## roughly claculate the upper bound of the synthetic samples to be generated from each neighbourhood
  106. synth_num = (numOfSamples // self.minSetSize) + 1
  107. ## generate synth_num synthetic samples from each minority neighbourhood
  108. synth_set=[]
  109. for i in range(self.minSetSize):
  110. synth_set.extend(self._generate_data_for_min_point(i, synth_num))
  111. ## extract the exact number of synthetic samples needed to exactly balance the two classes
  112. synth_set = np.array(synth_set[:numOfSamples])
  113. return synth_set
  114. def predictReal(self, data):
  115. prediction = self.maj_min_discriminator.predict(data)
  116. return np.array([x[0] for x in prediction])
  117. # ###############################################################
  118. # Hidden internal functions
  119. # ###############################################################
  120. # Creating the GAN
  121. def _conv_sample_gen(self):
  122. """
  123. the generator network to generate synthetic samples from the convex space
  124. of arbitrary minority neighbourhoods
  125. """
  126. ## takes minority batch as input
  127. min_neb_batch = Input(shape=(self.n_feat,))
  128. ## reshaping the 2D tensor to 3D for using 1-D convolution,
  129. ## otherwise 1-D convolution won't work.
  130. x = tf.reshape(min_neb_batch, (1, self.neb, self.n_feat), name=None)
  131. ## using 1-D convolution, feature dimension remains the same
  132. x = Conv1D(self.n_feat, 3, activation='relu')(x)
  133. ## flatten after convolution
  134. x = Flatten()(x)
  135. ## add dense layer to transform the vector to a convenient dimension
  136. x = Dense(self.neb * self.gen, activation='relu')(x)
  137. ## again, witching to 2-D tensor once we have the convenient shape
  138. x = Reshape((self.neb, self.gen))(x)
  139. ## row wise sum
  140. s = K.sum(x, axis=1)
  141. ## adding a small constant to always ensure the row sums are non zero.
  142. ## if this is not done then during initialization the sum can be zero.
  143. s_non_zero = Lambda(lambda x: x + .000001)(s)
  144. ## reprocals of the approximated row sum
  145. sinv = tf.math.reciprocal(s_non_zero)
  146. ## At this step we ensure that row sum is 1 for every row in x.
  147. ## That means, each row is set of convex co-efficient
  148. x = Multiply()([sinv, x])
  149. ## Now we transpose the matrix. So each column is now a set of convex coefficients
  150. aff=tf.transpose(x[0])
  151. ## We now do matrix multiplication of the affine combinations with the original
  152. ## minority batch taken as input. This generates a convex transformation
  153. ## of the input minority batch
  154. synth=tf.matmul(aff, min_neb_batch)
  155. ## finally we compile the generator with an arbitrary minortiy neighbourhood batch
  156. ## as input and a covex space transformation of the same number of samples as output
  157. model = Model(inputs=min_neb_batch, outputs=synth)
  158. opt = Adam(learning_rate=0.001)
  159. model.compile(loss='mean_squared_logarithmic_error', optimizer=opt)
  160. return model
  161. def _maj_min_disc(self):
  162. """
  163. the discriminator is trained intwo phase:
  164. first phase: while training GAN the discriminator learns to differentiate synthetic
  165. minority samples generated from convex minority data space against
  166. the borderline majority samples
  167. second phase: after the GAN generator learns to create synthetic samples,
  168. it can be used to generate synthetic samples to balance the dataset
  169. and then rettrain the discriminator with the balanced dataset
  170. """
  171. ## takes as input synthetic sample generated as input stacked upon a batch of
  172. ## borderline majority samples
  173. samples = Input(shape=(self.n_feat,))
  174. ## passed through two dense layers
  175. y = Dense(250, activation='relu')(samples)
  176. y = Dense(125, activation='relu')(y)
  177. y = Dense(75, activation='relu')(y)
  178. ## two output nodes. outputs have to be one-hot coded (see labels variable before)
  179. output = Dense(2, activation='sigmoid')(y)
  180. ## compile model
  181. model = Model(inputs=samples, outputs=output)
  182. opt = Adam(learning_rate=0.0001)
  183. model.compile(loss='binary_crossentropy', optimizer=opt)
  184. return model
  185. def _convGAN(self, generator, discriminator):
  186. """
  187. for joining the generator and the discriminator
  188. conv_coeff_generator-> generator network instance
  189. maj_min_discriminator -> discriminator network instance
  190. """
  191. ## by default the discriminator trainability is switched off.
  192. ## Thus training the GAN means training the generator network as per previously
  193. ## trained discriminator network.
  194. discriminator.trainable = False
  195. ## input receives a neighbourhood minority batch
  196. ## and a proximal majority batch concatenated
  197. batch_data = Input(shape=(self.n_feat,))
  198. ##- print(f"GAN: 0..{self.neb}/{self.gen}..")
  199. ## extract minority batch
  200. min_batch = Lambda(lambda x: x[:self.neb])(batch_data)
  201. ## extract majority batch
  202. maj_batch = Lambda(lambda x: x[self.gen:])(batch_data)
  203. ## pass minority batch into generator to obtain convex space transformation
  204. ## (synthetic samples) of the minority neighbourhood input batch
  205. conv_samples = generator(min_batch)
  206. ## concatenate the synthetic samples with the majority samples
  207. new_samples = tf.concat([conv_samples, maj_batch],axis=0)
  208. ##- new_samples = tf.concat([conv_samples, conv_samples, conv_samples, conv_samples],axis=0)
  209. ## pass the concatenated vector into the discriminator to know its decisions
  210. output = discriminator(new_samples)
  211. ##- output = Lambda(lambda x: x[:2 * self.gen])(output)
  212. ## note that, the discriminator will not be traied but will make decisions based
  213. ## on its previous training while using this function
  214. model = Model(inputs=batch_data, outputs=output)
  215. opt = Adam(learning_rate=0.0001)
  216. model.compile(loss='mse', optimizer=opt)
  217. return model
  218. # Create synthetic points
  219. def _generate_data_for_min_point(self, index, synth_num):
  220. """
  221. generate synth_num synthetic points for a particular minoity sample
  222. synth_num -> required number of data points that can be generated from a neighbourhood
  223. data_min -> minority class data
  224. neb -> oversampling neighbourhood
  225. index -> index of the minority sample in a training data whose neighbourhood we want to obtain
  226. """
  227. runs = int(synth_num / self.neb) + 1
  228. synth_set = []
  229. for _run in range(runs):
  230. batch = self.nmbMin.getNbhPointsOfItem(index)
  231. synth_batch = self.conv_sample_generator.predict(batch)
  232. synth_set.extend(synth_batch)
  233. return synth_set[:synth_num]
  234. # Training
  235. def _rough_learning(self, data_min, data_maj, discTrainCount):
  236. generator = self.conv_sample_generator
  237. discriminator = self.maj_min_discriminator
  238. GAN = self.cg
  239. loss_history = [] ## this is for stroring the loss for every run
  240. step = 0
  241. minSetSize = len(data_min)
  242. labels = tf.convert_to_tensor(create01Labels(2 * self.gen, self.gen))
  243. for neb_epoch_count in range(self.neb_epochs):
  244. if discTrainCount > 0:
  245. for n in range(discTrainCount):
  246. for min_idx in range(minSetSize):
  247. ## generate minority neighbourhood batch for every minority class sampls by index
  248. min_batch_indices = self.nmbMin.neighbourhoodOfItem(min_idx)
  249. min_batch = self.nmbMin.getPointsFromIndices(min_batch_indices)
  250. ## generate random proximal majority batch
  251. maj_batch = self._BMB(data_maj, min_batch_indices)
  252. ## generate synthetic samples from convex space
  253. ## of minority neighbourhood batch using generator
  254. conv_samples = generator.predict(min_batch)
  255. ## concatenate them with the majority batch
  256. concat_sample = tf.concat([conv_samples, maj_batch], axis=0)
  257. ## switch on discriminator training
  258. discriminator.trainable = True
  259. ## train the discriminator with the concatenated samples and the one-hot encoded labels
  260. discriminator.fit(x=concat_sample, y=labels, verbose=0)
  261. ## switch off the discriminator training again
  262. discriminator.trainable = False
  263. for min_idx in range(minSetSize):
  264. ## generate minority neighbourhood batch for every minority class sampls by index
  265. min_batch_indices = self.nmbMin.neighbourhoodOfItem(min_idx)
  266. min_batch = self.nmbMin.getPointsFromIndices(min_batch_indices)
  267. ## generate random proximal majority batch
  268. maj_batch = self._BMB(data_maj, min_batch_indices)
  269. ## generate synthetic samples from convex space
  270. ## of minority neighbourhood batch using generator
  271. conv_samples = generator.predict(min_batch)
  272. ## concatenate them with the majority batch
  273. concat_sample = tf.concat([conv_samples, maj_batch], axis=0)
  274. ## switch on discriminator training
  275. discriminator.trainable = True
  276. ## train the discriminator with the concatenated samples and the one-hot encoded labels
  277. discriminator.fit(x=concat_sample, y=labels, verbose=0)
  278. ## switch off the discriminator training again
  279. discriminator.trainable = False
  280. ## use the GAN to make the generator learn on the decisions
  281. ## made by the previous discriminator training
  282. ##- print(f"concat sample shape: {concat_sample.shape}/{labels.shape}")
  283. gan_loss_history = GAN.fit(concat_sample, y=labels, verbose=0)
  284. ## store the loss for the step
  285. loss_history.append(gan_loss_history.history['loss'])
  286. step += 1
  287. if self.debug and (step % 10 == 0):
  288. print(f"{step} neighbourhood batches trained; running neighbourhood epoch {neb_epoch_count}")
  289. if self.debug:
  290. print(f"Neighbourhood epoch {neb_epoch_count + 1} complete")
  291. if self.debug:
  292. run_range = range(1, len(loss_history) + 1)
  293. plt.rcParams["figure.figsize"] = (16,10)
  294. plt.xticks(fontsize=20)
  295. plt.yticks(fontsize=20)
  296. plt.xlabel('runs', fontsize=25)
  297. plt.ylabel('loss', fontsize=25)
  298. plt.title('Rough learning loss for discriminator', fontsize=25)
  299. plt.plot(run_range, loss_history)
  300. plt.show()
  301. self.conv_sample_generator = generator
  302. self.maj_min_discriminator = discriminator
  303. self.cg = GAN
  304. self.loss_history = loss_history
  305. ## convGAN
  306. def _BMB(self, data_maj, min_idxs):
  307. ## Generate a borderline majority batch
  308. ## data_maj -> majority class data
  309. ## min_idxs -> indices of points in minority class
  310. ## gen -> convex combinations generated from each neighbourhood
  311. if self.nmbMaj is not None:
  312. return self.nmbMaj.neighbourhoodOfItemList(min_idxs, maxCount=self.gen)
  313. else:
  314. return tf.convert_to_tensor(
  315. data_maj[np.random.randint(len(data_maj), size=self.gen)]
  316. )