Pinball Loss Minimization for One-bit Compressive Sensing

by   Xiaolin Huang, et al.

The one-bit quantization can be implemented by one single comparator, which operates at low power and a high rate. Hence one-bit compressive sensing (1bit-CS) becomes very attractive in signal processing. When the measurements are corrupted by noise during signal acquisition and transmission, 1bit-CS is usually modeled as minimizing a loss function with a sparsity constraint. The existing loss functions include the hinge loss and the linear loss. Though 1bit-CS can be regarded as a binary classification problem because a one-bit measurement only provides the sign information, the choice of the hinge loss over the linear loss in binary classification is not true for 1bit-CS. Many experiments show that the linear loss performs better than the hinge loss for 1bit-CS. Motivated by this observation, we consider the pinball loss, which provides a bridge between the hinge loss and the linear loss. Using this bridge, two 1bit-CS models and two corresponding algorithms are proposed. Pinball loss iterative hard thresholding improves the performance of the binary iterative hard theresholding proposed in [6] and is suitable for the case when the sparsity of the true signal is given. Elastic-net pinball support vector machine generalizes the passive model proposed in [11] and is suitable for the case when the sparsity of the true signal is not given. A fast dual coordinate ascent algorithm is proposed to solve the elastic-net pinball support vector machine problem, and its convergence is proved. The numerical experiments demonstrate that the pinball loss, as a trade-off between the hinge loss and the linear loss, improves the existing 1bit-CS models with better performances.


page 1

page 2

page 3

page 4


Robust Decoding from 1-Bit Compressive Sampling with Least Squares

In 1-bit compressive sensing (1-bit CS) where target signal is coded int...

Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals

A universal 1-bit compressive sensing (CS) scheme consists of a measurem...

Greedy Algorithms for Hybrid Compressed Sensing

Compressed sensing (CS) is a technique which uses fewer measurements tha...

Nonconvex penalties with analytical solutions for one-bit compressive sensing

One-bit measurements widely exist in the real world, and they can be use...

A Generalized Weighted Loss for SVC and MLP

Usually standard algorithms employ a loss where each error is the mere a...

MC-ISTA-Net: Adaptive Measurement and Initialization and Channel Attention Optimization inspired Neural Network for Compressive Sensing

The optimization inspired network can bridge convex optimization and neu...

Feedback Acquisition and Reconstruction of Spectrum-Sparse Signals by Predictive Level Comparisons

In this letter, we propose a sparsity promoting feedback acquisition and...

Please sign up or login with your details

Forgot password? Click here to reset