Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Max Wilson 0001

dblp:181/2393 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2020
0000-0002-0798-3391ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
quantum computing
0.412020
High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder · KDD 2020
Emerging computing paradigms › quantum computing
quantum machine learning
0.412020
High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder · KDD 2020
Information retrieval › similarity search
high-dimensional similarity search
0.112020
High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder · KDD 2020
Information retrieval
similarity search
0.112020
High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder · KDD 2020

Methods — techniques the papers use, named apart from their topics

variational autoencoder · 0.9quantum-assisted variational autoencoder · 0.9
YearPublicationVenuePosition
2020 High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder
abstract
Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the Quantum-assisted Variational Autoencoder (QVAE) has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset.Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.
Nicholas Gao, Max Wilson 0001, Thomas Vandal, Walter Vinci, Ramakrishna R. Nemani, Eleanor Gilbert Rieffel
KDD2