Reverse Annealing for Nonnegative/Binary Matrix Factorization
It was recently shown that quantum annealing can be used as an effective, fast subroutine in certain types of matrix factorization algorithms. The quantum annealing algorithm performed best for quick, approximate answers, but performance rapidly plateaued. In this paper, we utilize reverse annealing instead of forward annealing in the quantum annealing subroutine for nonnegative/binary matrix factorization problems. After an initial global search with forward annealing, reverse annealing performs a series of local searches that refine existing solutions. The combination of forward and reverse annealing significantly improves performance compared to forward annealing alone for all but the shortest run times.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Relaxation-assisted reverse annealing on nonnegative/binary matrix factorization
Quantum annealing has garnered significant attention as meta-heuristics inspired by quantum physics for combinatorial optimization problems. Among its many applications, nonnegative/binary matrix factorization stands out…
Combinatorial OptimizationNonnegative/Binary Matrix Factorization for Image Classification using Quantum Annealing
Classical computing has borne witness to the development of machine learning. The integration of quantum technology into this mix will lead to unimaginable benefits and be regarded as a giant leap forward in mankind's ab…
image-classificationImage ClassificationImage Analysis Based on Nonnegative/Binary Matrix Factorization
Using nonnegative/binary matrix factorization (NBMF), a matrix can be decomposed into a nonnegative matrix and a binary matrix. Our analysis of facial images, based on NBMF and using the Fujitsu Digital Annealer, leads t…
ClassificationGeneral Classificationimage-classificationImage Classification+1Heuristics for Exact Nonnegative Matrix Factorization
The exact nonnegative matrix factorization (exact NMF) problem is the following: given an $m$-by-$n$ nonnegative matrix $X$ and a factorization rank $r$, find, if possible, an $m$-by-$r$ nonnegative matrix $W$ and an $r$…
Collaborative filtering based on nonnegative/binary matrix factorization
Collaborative filtering generates recommendations based on user-item similarities through rating data, which may involve numerous unrated items. To predict scores for unrated items, matrix factorization techniques, such …
Collaborative Filtering