Feature Selection for Recommender Systems with Quantum Computing

  title={Feature Selection for Recommender Systems with Quantum Computing},
  author={Riccardo Nembrini and Maurizio Ferrari Dacrema and Paolo Cremonesi},
The promise of quantum computing to open new unexplored possibilities in several scientific fields has been long discussed, but until recently the lack of a functional quantum computer has confined this discussion mostly to theoretical algorithmic papers. It was only in the last few years that small but functional quantum computers have become available to the broader research community. One paradigm in particular, quantum annealing, can be used to sample optimal solutions for a number of NP… 

Optimizing the Selection of Recommendation Carousels with Quantum Computing

This paper proposes a formulation of the carousel selection problem for black box recommenders, that can be solved effectively on a quantum annealer and has the advantage of being simple.

Are Quantum Computers Practical Yet? A Case for Feature Selection in Recommender Systems using Tensor Networks

Collaborative filtering models generally perform better than content-based filtering models and do not require careful feature engineering. However, in the cold-start scenario collaborative

Towards Recommender Systems with Community Detection and Quantum Computing

This work aims to experimentally explore the feasibility of using currently available quantum computers, based on the Quantum Annealing paradigm, to build a recommender system exploiting community detection, and shows promise in its ability to support new recommendation models and to bring improved scalability as technology evolves.

A Survey on Quantum Computing for Recommendation Systems

An overview of the current state of the art in the literature is given, outlining the different proposed methodologies and techniques and highlighting the challenges that arise from this new approach to the recommendation systems domain.

Towards Feature Selection for Ranking and Classification Exploiting Quantum Annealers

The feasibility of using currently available quantum computing architectures to solve some quadratic feature selection algorithms for both ranking and classification is explored and the effectiveness obtained is comparable to that of classical solvers, indicating that quantum computers are now reliable enough to tackle interesting problems.

Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer

This work proposes a quadratic unconstrained binary optimization (QUBO) scheme to combine with FM and apply quantum annealing (QA) computation and demonstrates the aforementioned computational advantage on current NISQ hardware by experimenting with a real example on a D-Wave annealer.

An Advantage Using Feature Selection with a Quantum Annealer

This paper tests this intuition against classical methods by utilizing open-source data sets and evaluating the efficacy of each trained statistical model well-known prediction algorithms and results display an advantage utilizing the features selected from the algorithm that leveraged QA.

How to Solve Combinatorial Optimization Problems Using Real Quantum Machines: A Recent Survey

This survey analyzes recent studies that solve real-scale COPs using quantum annealers and discusses how to reduce the size of the COP to be input to overcome the hardware limitations of the existing quantumAnnealer.

Evaluating the job shop scheduling problem on a D-wave quantum annealer

Job Shop Scheduling is a combinatorial optimization problem of particular importance for production environments where the goal is to complete a production task in the shortest possible time given

Virtual Network Function Embedding with Quantum Annealing

This work proposes a Quadratic Unconstrained Binary Optimisation (QUBO) formulation of this embedding process, exploring the implementation possibilities on D-Wave’s Quantum Annealers.



An Approach of Feature Subset Selection Using Simulated Quantum Annealing

This paper reduces classical benchmark feature evaluation functions like mRMR, JMI, and FCBF to QUBO formulation, enabling the use of quantum annealing based optimization to feature selection and empirical results confirm that SQA is able to produce at most equal or less number of features in all selected subset compared to SA.

A quantum-inspired classical algorithm for recommendation systems

  • Ewin Tang
  • Computer Science
    Electron. Colloquium Comput. Complex.
  • 2018
A classical analogue to Kerenidis and Prakash’s quantum recommendation system is given, previously believed to be one of the strongest candidates for provably exponential speedups in quantum machine learning, which produces recommendations exponentially faster than previous classical systems, which run in time linear in m and n.

Dynamic Grover search: applications in recommendation systems and optimization problems

This work tries to analyze the applicability of Grover search to process an unstructured database with a dynamic selection function in contrast to the static selection function used in the original work and shows how dynamicGrover search can be used to tackle a wide range of optimization problems where it improves complexity over existing optimization algorithms.

Recommendation systems with the quantum k–NN and Grover algorithms for data processing

The implementation of a quantum recommendation system that uses a quantum variant of the k-nearest neighbours algorithm and the Grover algorithm to search for a specific element in an unstructured database is discussed.

A Troubling Analysis of Reproducibility and Progress in Recommender Systems Research

This analysis compares recent results in the area of neural recommendation approaches based on collaborative filtering against a consistent set of existing simple baselines to discuss common issues in today’s research practice, which have apparently led the field to a certain level of stagnation.

A novel graph-based model for hybrid recommendations in cold-start scenarios

A novel graph, feature-based machine learning model is proposed to face the cold-start item scenario, learning the relevance of features from probabilities of item-based collaborative filtering algorithms.

Are we really making much progress? A worrying analysis of recent neural recommendation approaches

A systematic analysis of algorithmic proposals for top-n recommendation tasks that were presented at top-level research conferences in the last years sheds light on a number of potential problems in today's machine learning scholarship and calls for improved scientific practices in this area.

Solving the apparent diversity-accuracy dilemma of recommender systems

This paper introduces a new algorithm specifically to address the challenge of diversity and shows how it can be used to resolve this apparent dilemma when combined in an elegant hybrid with an accuracy-focused algorithm.

Performance of recommender algorithms on top-n recommendation tasks

An extensive evaluation of several state-of-the art recommender algorithms suggests that algorithms optimized for minimizing RMSE do not necessarily perform as expected in terms of top-N recommendation task, and new variants of two collaborative filtering algorithms are offered.

Minor-embedding in adiabatic quantum computation: I. The parameter setting problem

  • V. Choi
  • Computer Science, Physics
    Quantum Inf. Process.
  • 2008
The embedded Ising Hamiltonian for solving the maximum independent set (MIS) problem via adiabatic quantum computation (AQC) using an Ising spin-1/2 system is demonstrated.