Learning Anytime Predictions in Neural Networks via Adaptive Loss Balancing


  • Hanzhang Hu Carnegie Mellon University
  • Debadeepta Dey Microsoft
  • Martial Hebert Carnegie Mellon University
  • J. Andrew Bagnell Carnegie Mellon University




This work considers the trade-off between accuracy and testtime computational cost of deep neural networks (DNNs) via anytime predictions from auxiliary predictions. Specifically, we optimize auxiliary losses jointly in an adaptive weighted sum, where the weights are inversely proportional to average of each loss. Intuitively, this balances the losses to have the same scale. We demonstrate theoretical considerations that motivate this approach from multiple viewpoints, including connecting it to optimizing the geometric mean of the expectation of each loss, an objective that ignores the scale of losses. Experimentally, the adaptive weights induce more competitive anytime predictions on multiple recognition data-sets and models than non-adaptive approaches including weighing all losses equally. In particular, anytime neural networks (ANNs) can achieve the same accuracy faster using adaptive weights on a small network than using static constant weights on a large one. For problems with high performance saturation, we also show a sequence of exponentially deepening ANNs can achieve near-optimal anytime results at any budget, at the cost of a const fraction of extra computation.




How to Cite

Hu, H., Dey, D., Hebert, M., & Bagnell, J. A. (2019). Learning Anytime Predictions in Neural Networks via Adaptive Loss Balancing. Proceedings of the AAAI Conference on Artificial Intelligence, 33(01), 3812-3821. https://doi.org/10.1609/aaai.v33i01.33013812



AAAI Technical Track: Machine Learning