A quantum annealing based hard attention network selects image blocks by solving a QUBO, and claims faster, smoother, and more noise-robust training than two classical hard attention baselines.
Learning visual question answer- ing by bootstrapping hard attention,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
REJECT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
QAHAN: A Quantum Annealing Hard Attention Network
A quantum annealing based hard attention network selects image blocks by solving a QUBO, and claims faster, smoother, and more noise-robust training than two classical hard attention baselines.