I have been looking for litterature on results obtained by deep neural networks to find dense (and quite possibly non-lattice, perhaps even non-periodic) sphere packings, but I have not been too successful. In fact, I am only aware of [a 2002 paper](https://www.researchgate.net/profile/David_Cornforth/publication/220935804_Evolution_in_the_Orange_Box_-_A_New_Approach_to_the_Sphere-Packing_Problem_in_CMAC-Based_Neural_Networks/links/0912f5109de2296b7c000000.pdf) by Cornforth.



> 
> What are more recent references ? If none exists, is that because there is an obvious no-go result, or is it only that nobody really tried ?
> 
> 
> 


There have been numerical enumerations of best non-lattice packings in small dimensions (see e.g. the answer by Yoav Kallus to [this question](https://mathoverflow.net/questions/248895/best-non-lattice-sphere-packings)), so there is data to compare the results of the neural network, and if successful there, to be a little bit confident that its higher dimensional candidates are interesting too.



Prospects for deep learning of non-lattice sphere packings
There’s definitely a lot of potential for finding great packings using computers. I don’t believe the known sphere packings up through 24 dimensions are all optimal, and a clever heuristic algorithm could plausibly beat some of them. (Dimensions 19 and 21 might be the lowest-hanging fruit.) I don’t think this would be easy, but it seems like it could reasonably be within reach.


I’m not an expert on neural networks, but I’m a little skeptical that they are the right tool for this problem. There are several issues I imagine you could overcome. For example, you’d need far more training data than anyone has currently, but you could try producing it with various other optimization algorithms. Another issue is that neural networks would probably perform better with softer constraints, but there are various problems of this sort that converge to sphere packing in suitable limits.


However, the one that stumps me is feature selection. If you want to train a neural network to generate good sphere packings across a range of dimensions, how are you going to represent the packings? For example, representing a lattice using a basis doesn’t strike me as useful. I haven’t tried it, so maybe I’m totally off base here, but I’m skeptical that a neural network would find this an informative and usable representation of the lattice. (Maybe it could detect patterns in beautiful bases for particularly symmetric lattices, but I don’t expect that to generalize nicely to many dimensions.)


So my take on this is that if you have a good idea for how to go about it, it’s worth trying, but I don’t have a proposal for how you could even get started. In particular, I don’t know of any recent references, and I’d bet there are few, if any.


