Antibodies represent essential tools in research and diagnostics and are rapidly growing in importance as therapeutics. Commonly used methods to obtain novel antibodies typically yield several candidates capable of engaging a given target. The development steps that follow, however, are usually performed with only one or few candidates since they can be resource demanding, thereby increasing the risk of failure of the overall antibody discovery program. In particular, insufficient solubility, which may lead to aggregation under typical storage conditions, often hinders the ability of a candidate antibody to be developed and manufactured. Here we show that the selection of soluble lead antibodies from an initial library screening can be greatly facilitated by a fast computational prediction of solubility that requires only the amino acid sequence as input. We quantitatively validate this approach on a panel of nine distinct monoclonal antibodies targeting nerve growth factor (NGF), for which we compare the predicted and measured solubilities finding a very close match, and we further benchmark our predictions with published experimental data on aggregation hotspots and solubility of mutational variants of one of these antibodies.