Derivaton of QUBO formulations for sparse estimation

01/11/2020
by   Tomohiro Yokota, et al.
0

We propose a quadratic unconstrained binary optimization (QUBO) formulation of the l1-norm, which enables us to perform sparse estimation in the Ising-type annealing methods including quantum annealing. The QUBO formulation is derived via the Legendre transformation and the Wolfe theorem, which have recently been employed in order to derive the QUBO formulations of ReLU-type functions. Furthermore, it is clarified that a simple application of the derivation method to the l1-norm case gives a redundant variable; finally a simplified QUBO formulation is obtained by removing the redundant variable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2021

l1-Norm Minimization with Regula Falsi Type Root Finding Methods

Sparse level-set formulations allow practitioners to find the minimum 1-...
research
07/05/2021

Quantum Annealing Formulation for Binary Neural Networks

Quantum annealing is a promising paradigm for building practical quantum...
research
04/13/2019

L1-norm Tucker Tensor Decomposition

Tucker decomposition is a common method for the analysis of multi-way/te...
research
03/15/2019

Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity

We propose a brand-new formulation of capacitated vehicle routing proble...
research
07/09/2021

Petri Net Modeling for Ising Model Formulation in Quantum Annealing

Quantum annealing is an emerging new platform for combinatorial optimiza...
research
01/31/2022

Sparse Signal Reconstruction with QUBO Formulation in l0-regularized Linear Regression

An l0-regularized linear regression for a sparse signal reconstruction i...

Please sign up or login with your details

Forgot password? Click here to reset