You are right that 256^15 is a large search space. This number implies a 24bit color scheme. (2^24)^5 = 256^15 Many of the colors in the 2^24 range are s

You are right that 256^15 is a large search space. This number implies a 24bit color scheme. (2^24)^5 = 256^15 Many of the colors in the 2^24 range are similar which is why most of the linear search space is boring. Our eyes don't care much about #f67368 vs #f67468 but we do care about #f67368 vs #f6e668. Why? 0x73 x 2 = 0xe6 Instead of blindly incrementing RGB color values, look at colors which differ by powers of 2. For example, choose 15 random values between 0 and 8. Let's call them c0 to c14. Then assign those numbers to your color pallet as 8-bit RGB values as follows. Color0: R=2^c0, G=2^c1, B=2^c2 . . . Color5: R=2^c12, G=2^c13, B=2^c14 Rounding 2^8 down to 255. You will find non-boring color schemes because the search space better fits how our eyes see color. This new search space is only 9^15 which is just less than 2^48, far less than 2^120 and a lot more interesting. You could also search the HSV color space in this way and you don't have to only look at powers of two. Consider for, example powers of 1.25. The point is that by organizing your search, you will find interesting colors pallets easily. I'm betting that your GANs already encode some sort of exponential search based on how you trained them vs your initial attempt using L1/L2.