Maximin Optimization for Binary Regression

Abstract

We consider regression problems with binary weights. Such optimization problems are ubiquitous in quantized learning models and digital communication systems. A natural approach is to optimize the corresponding Lagrangian using variants of the gradient ascent-descent method. Such maximin techniques are still poorly understood even in the concave-convex case. The non-convex binary constraints may lead to spurious local minima. Interestingly, we prove that this approach is optimal in linear regression with low noise conditions as well as robust regression with a small number of outliers. Practically, the method also performs well in regression with cross entropy loss, as well as non-convex multi-layer neural networks. Taken together our approach highlights the potential of saddle-point optimization for learning constrained models.

References in corpus (9)

• Adam: A Method for Stochastic Optimization
• BinaryConnect: Training Deep Neural Networks with binary weights during propagations
• DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradients
• Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activations
• Matrix Completion has No Spurious Local Minimum
• Non-convex Min-Max Optimization: Applications, Challenges, and Recent Theoretical Advances
• Understanding Straight-Through Estimator in Training Activation Quantized Neural Nets
• Back to Simplicity: How to Train Accurate BNNs from Scratch?
• Relaxed Quantization for Discretized Neural Networks