Ising-based Consensus Clustering on Specialized Hardware

03/04/2020
by   Eldan Cohen, et al.
11

The emergence of specialized optimization hardware such as CMOS annealers and adiabatic quantum computers carries the promise of solving hard combinatorial optimization problems more efficiently in hardware. Recent work has focused on formulating different combinatorial optimization problems as Ising models, the core mathematical abstraction used by a large number of these hardware platforms, and evaluating the performance of these models when solved on specialized hardware. An interesting area of application is data mining, where combinatorial optimization problems underlie many core tasks. In this work, we focus on consensus clustering (clustering aggregation), an important combinatorial problem that has received much attention over the last two decades. We present two Ising models for consensus clustering and evaluate them using the Fujitsu Digital Annealer, a quantum-inspired CMOS annealer. Our empirical evaluation shows that our approach outperforms existing techniques and is a promising direction for future research.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2022

A quantum-inspired tensor network method for constrained combinatorial optimization problems

Combinatorial optimization is of general interest for both theoretical s...
research
10/17/2020

Binary Matrix Factorization on Special Purpose Hardware

Many fundamental problems in data mining can be reduced to one or more N...
research
08/10/2023

Test Case Minimization with Quantum Annealers

Quantum annealers are specialized quantum computers for solving combinat...
research
08/10/2020

Ising Model Optimization Problems on a FPGA Accelerated Restricted Boltzmann Machine

Optimization problems, particularly NP-Hard Combinatorial Optimization p...
research
11/13/2018

A Tutorial on Formulating QUBO Models

The field of Combinatorial Optimization (CO) is one of the most importan...
research
02/10/2019

On modeling hard combinatorial optimization problems as linear programs: Refutations of the "unconditional impossibility" claims

There has been a series of developments in the recent literature (by ess...
research
05/09/2020

Natural evolution strategies and quantum approximate optimization

A notion of quantum natural evolution strategies is introduced, which pr...

Please sign up or login with your details

Forgot password? Click here to reset