mlsanityData to 14 Oct 2026

Performance-Driven QUBO for Recommender Systems on Quantum Annealers

arXiv 2410.15272 ↗First posted 20 Oct 2024cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Quantum annealers offer a promising hardware platform for solving combinatorial optimization problems, especially those formulated as Quadratic Unconstrained Binary Optimization (QUBO). In this work, we propose PDQUBO (Performance-Driven Quadratic Unconstrained Binary Optimization), a QUBO-based feature selection method that is directly executable on quantum annealers. Unlike prior QUBO-based feature selection approaches on quantum annealers, PDQUBO explicitly quantifies the performance impact of both individual features and feature pairs on recommender system models. This alignment between QUBO optimization objectives and model performance ensures that the solution direction is closely tied to recommendation quality, making it well-suited for practical deployment on quantum hardware. Moreover, by leveraging counterfactual analysis, PDQUBO is model-agnostic and evaluation-metric-independent, making it broadly applicable across diverse recommender architectures and assessment criteria. In addition, we investigate the instability of quantum annealing on real quantum devices with respect to varying problem sizes and problem difficulties. Extensive experiments on real-world datasets demonstrate that PDQUBO consistently outperforms prior QUBO-based feature selection methods on quantum annealers. Furthermore, we compare PDQUBO against classical feature selection baselines on click-through rate (CTR) prediction tasks, showing its strong performance and highlighting the potential of using quantum annealers for real-world feature selection applications. Our findings suggest that integrating quantum optimization with counterfactual analysis provides a promising direction for effective feature selection in recommender systems.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 84 references that are in the map. First posted on arXiv 20 Oct 2024.

Builds on

29 of 84 references.

References · 29

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  2. 2017Neural Collaborative Filteringcited by 1,111
  3. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
  4. 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 373
  5. 2020Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Reviewcited by 174
  6. 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 96
  7. 2019FiBiNET: Combining Feature Importance and Bilinear feature Interaction for Click-Through Rate Predictioncited by 83
  8. 2021Noisy intermediate-scale quantum (NISQ) algorithmscited by 79
  9. 2022Learning and Evaluating Graph Neural Network Explanations based on Counterfactual and Factual Reasoningcited by 79
  10. 2022KuaiRand: An Unbiased Sequential Recommendation Dataset with Randomly Exposed Videoscited by 72
  11. 2021Counterfactual Explainable Recommendationcited by 60
  12. 2021CauseRec: Counterfactual User Sequence Synthesis for Sequential Recommendationcited by 46
17 more
  1. 2022A Survey on Trustworthy Recommender Systemscited by 41
  2. 2020QUBO Formulations for Training Machine Learning Modelscited by 33
  3. 2022AutoField: Automating Feature Selection in Deep Recommender Systemscited by 30
  4. 2021Counterfactual Explanations for Neural Recommenderscited by 27
  5. 2022Feature Selection on Quantum Computerscited by 21
  6. 2021Feature Selection for Recommender Systems with Quantum Computingcited by 14
  7. 2022Measuring "Why" in Recommender Systems: a Comprehensive Survey on the Evaluation of Explainable Recommendationcited by 14
  8. 2022Reinforced Path Reasoning for Counterfactual Explainable Recommendationcited by 13
  9. 2022Towards Feature Selection for Ranking and Classification Exploiting Quantum Annealerscited by 11
  10. 2015Escaping the Local Minima via Simulated Annealing: Optimization of Approximately Convex Functionscited by 10
  11. 2023Counterfactual Explanation for Fairness in Recommendationcited by 9
  12. 2024ERASE: Benchmarking Feature Selection Methods for Deep Recommender Systemscited by 9
  13. 2023Path-Specific Counterfactual Fairness for Recommender Systemscited by 7
  14. 2023SHARK: A Lightweight Model Compression Approach for Large-scale Recommender Systemscited by 6
  15. 2022LPFS: Learnable Polarizing Feature Selection for Click-Through Rate Predictioncited by 4
  16. 2022Supervised Feature Compression based on Counterfactual Analysiscited by 1
  17. 2024CRUISE on Quantum Computing for Feature Selection in Recommender Systemscited by 1

Built on by

Not cited yet.