Team GPLSI at QClef 2026: Quantum-Inspired Instance Selection and Clustering
Santiago Galiano Segura, Francisco Valero-Abellón, Mónica Sánchez Bellido, Jairo Madrigal Cutillas, Juan Pablo Consuegra‐Ayala, Olga Francés, Manuel Palomar, Paloma Moreda, Elena Lloret
This paper presents the participation of the GPLSI team in the Quantum CLEF (QClef) Lab at CLEF 2026, focusing on Task 2 - Instance Selection and Task 3 - Clustering. The QClef Lab explores the applicability of quantum and quantum-inspired techniques to core AI tasks, emphasizing optimization efficiency and data reduction. For Task 2, we propose two multi-paradigm approaches for selecting representative training instances for sentiment classification: a precision-driven, SVM-augmented LocalSets method, and a compression-driven Reinforcement Learning approach based on stratified topological partitioning. For Task 3, we introduce a unified quantum-inspired clustering framework that integrates four distinct pivot selection strategies for document grouping in embedding space. Our methods achieved competitive performance across both tasks, highlighting a fundamental trade-off between predictive accuracy and computational efficiency. Notably, our LocalSets approach achieved the second highest classification effectiveness for instance selection, while our novel Query-aware Multilevel Graph Clustering strategy delivered the most robust results for Task 3, effectively balancing ranking preservation (nDCG@10) and cluster compactness (DBI). Overall, our findings support the potential of annealing-based techniques to deliver effective trade-offs between performance and computational efficiency in realistic machine learning pipelines.
This paper presents the participation of the GPLSI team in the Quantum CLEF (QClef) Lab at CLEF 2026, focusing on Task 2 - Instance Selection and Task 3 - Clustering. The QClef Lab explores the applicability of quantum and quantum-inspired techniques to core AI tasks, emphasizing optimization efficiency and data reduction. For Task 2, we propose two multi-paradigm approaches for selecting representative training instances for sentiment classification: a precision-driven, SVM-augmented LocalSets method, and a compression-driven Reinforcement Learning approach based on stratified topological partitioning. For Task 3, we introduce a unified quantum-inspired clustering framework that integrates four distinct pivot selection strategies for document grouping in embedding space. Our methods achieved competitive performance across both tasks, highlighting a fundamental trade-off between predictive accuracy and computational efficiency. Notably, our LocalSets approach achieved the second highest classification effectiveness for instance selection, while our novel Query-aware Multilevel Graph Clustering strategy delivered the most robust results for Task 3, effectively balancing ranking preservation (nDCG@10) and cluster compactness (DBI). Overall, our findings support the potential of annealing-based techniques to deliver effective trade-offs between performance and computational efficiency in realistic machine learning pipelines.
This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.
The emerging field of Quantum Computing (QC) is attracting considerable research interest due to its potential. It is in fact believed that QC could revolutionize the way we approach complex problems by significantly reducing the time required to solve them. Although QC is still in its early stages of development, certain problems can already be addressed using quantum computers, offering a glimpse into its capabilities. The goal of the QuantumCLEF lab is to raise awareness of QC and to design, develop, and evaluate new QC algorithms aimed at solving challenges typically encountered in the implementation of Information Retrieval (IR) and Recommender Systems (RS). Furthermore, the lab provides a valuable opportunity to engage with QC technologies, which are often difficult to access. In this work, we present an overview of the second edition of QuantumCLEF, a lab focused on applying Quantum Annealing (QA), a specific QC paradigm, to three tasks: Feature Selection for IR and RS systems, Instance Selection for IR systems, and Clustering for IR systems. A total of 44 teams registered for the lab, with 5 teams successfully submitting their runs in accordance with the lab guidelines. Given the novelty of the topics, participants were provided with extensive examples and comprehensive materials to help them understand how QA works and how to program quantum annealers.
Abstract Instance selection algorithms for supervised classification and regression tasks in machine learning aim to reduce the size of training datasets whilst maintaining the performance of models by selecting the most important, high-fidelity training labels from a large pool of instances in the original datasets. Traditional instance selection methods such as cluster-based techniques demonstrate enhanced generalization capabilities on fewer data points compared with random sampling approaches, but often suffer from high computational costs, sensitivity to hyperparameters and non-deterministic time complexities. This paper proposes QReduce which is a novel instance selection algorithm which models datasets as N-dimensional graphs with each data point corresponding to a vertex and edges constructed between points in a k-nearest neighbour manner. This graph is subjected to quantum annealing to solve the minimum vertex cover or maximum cut graph combinatorial optimization problems and yield a subgraph representing the reduced subset of instances selected for the reduced dataset. Solving such NP-hard problems are intractable for exact classical solvers on account of combinatorial explosion of the problem’s search space, and quantum annealing was shown to outperform other approximate metaheuristic techniques such as simulated annealing, justifying it as a strong metaheuristic optimization model. QReduce enables recursive reduction of the dataset and has the benefits of less sensitivity to hyperparameters as well as a deterministic time complexity, enabling efficient and effective reduction in storage and compute requirements for training complex machine learning models in the age of green and sustainable AI. Experimental results demonstrate the efficacy of QReduce, outperforming existing instance selection techniques and having the highest average percentage data reduction to percentage accuracy reduction ratios on datasets for both classification and regression tasks, thereby making it a best-in-class instance selection algorithm for selecting high-fidelity training labels in supervised machine learning tasks.
This study explores quantum-inspired optimization algorithms (QIOAs) as practical tools for solving constrained combinatorial problems on classical machines. We analyze tasks that can be formulated in Ising or QUBO forms and benchmark three representative approaches: Simulated Bifurcation (SB), Quantum-Inspired Particle Swarm Optimization (QPSO), and a tensor-network (TN) method. A unified evaluation protocol is introduced that captures solution quality, feasibility, runtime, energy consumption, parameter sensitivity, and scalability. To ensure reliable performance, we develop automated penalty-adjustment and schedule-calibration strategies. Experimental results across diverse benchmarks show that SB and TN together yield the best trade-offs between accuracy and runtime: SB is efficient on dense instances with moderate penalties and low energy use, while TN is advantageous for sparse or modular networks, especially on GPUs. QPSO is competitive in smoother landscapes but more sensitive to hyperparameters. By linking performance to structural properties such as spectral gaps and constraint activity, we provide guidance for selecting suitable algorithms. Overall, QIOAs emerge as effective intermediaries between existing classical heuristics and emerging quantum devices, supported by a reproducible, energy-aware evaluation framework.
In recent days, sentiment analysis (SA) has emerged as a critical aspect of data analytics as user-generated content is rapidly disseminating across social media platforms, and other online channels. Breakthroughs in NLP and DL have significantly improved the contextual understanding and efficiency of SA models. Despite their success, traditional NLP and DL models have faced limitations within high-dimensional feature spaces, parameter optimization, and data scalability. This research work presents a novel SA framework based on quantum inspired DL (QIDL) techniques. We investigated hybrid models that integrate classical DL techniques with quantum inspired learning such as feature encoding, attention mechanisms, and context modeling. Three QIDL models have been studied, namely, QCNN, QLSTM, and QBERT. The performance of these models is evaluated on three benchmark sentiment datasets: IMDb, Twitter Sentiment, and SST-5. The experimental studies on the IMDb, Twitter Sentiment, and SST-5 datasets show that QCNN, QLSTM, and Q-BERT surpass their classical counterparts by approximately 1.6-2.7%, 1.5-3.3%; 1.5-2.6%, 1.4-4.2%; and 1-3%, 1.7-2.6%, respectively, in classification accuracy and macro-F1 score. Of all the benchmark models, Q-BERT achieved the best overall performance, attaining 55.8% accuracy and a macro-F1 score of 54.2% on the multi-class SST-5 dataset. Hence, it is evident that the proposed QIDL models achieve competitive classification performance while maintaining robustness in sparse and highdimensional settings.
Quantum-inspired algorithms represent a novel approach to enhancing machine learning models, particularly in areas demanding high performance. This paper explores the design and application of quantum-inspired algorithms, drawing inspiration from quantum mechanics principles to improve the efficiency and effectiveness of various machine learning tasks. We detail a framework centered around adapting existing machine learning models – specifically neural networks – to exploit quantum phenomena such as superposition and entanglement, aiming to address current limitations in areas like reinforcement learning and generative modeling. The core mechanism revolves around incorporating these quantum concepts into the model's architecture and training process to achieve enhanced performance and robustness. This work presents a comprehensive overview of the proposed approach, highlighting the potential benefits and challenges of this emerging field.