paper-with-me

홈 › Papers

Black-box optimization and quantum annealing for filtering out mislabeled training instances

2025-01-12 · Makoto Otsuka, Kento Kodama, Keisuke Morita, Masayuki Ohzeki

This study proposes an approach for removing mislabeled instances from contaminated training datasets by combining surrogate model-based black-box optimization (BBO) with postprocessing and quantum annealing. Mislabeled training instances, a common issue in real-world datasets, often degrade model generalization, necessitating robust and efficient noise-removal strategies. The proposed method evaluates filtered training subsets based on validation loss, iteratively refines loss estimates through surrogate model-based BBO with postprocessing, and leverages quantum annealing to efficiently sample diverse training subsets with low validation error. Experiments on a noisy majority bit task demonstrate the method's ability to prioritize the removal of high-risk mislabeled instances. Integrating D-Wave's clique sampler running on a physical quantum annealer achieves faster optimization and higher-quality training subsets compared to OpenJij's simulated quantum annealing sampler or Neal's simulated annealing sampler, offering a scalable framework for enhancing dataset quality. This work highlights the effectiveness of the proposed method for supervised learning tasks, with future directions including its application to unsupervised learning, real-world datasets, and large-scale implementations.

📄 PDF Abstract BibTeX arXiv:2501.06916

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Continuous black-box optimization with quantum annealing and random subspace coding

2021-04-30 · Syun Izawa, Koki Kitai, Shu Tanaka, Ryo Tamura 외

A black-box optimization algorithm such as Bayesian optimization finds extremum of an unknown function by alternating inference of the underlying function and optimization of an acquisition function. In a high-dimensiona…

Bayesian Optimization

Quantum-Inspired Episode Selection for Monte Carlo Reinforcement Learning via QUBO Optimization

2026-01-24 · Hadi Salloum, Ali Jnadi, Yaroslav Kholodov, Alexander Gasnikov arxiv

Monte Carlo (MC) reinforcement learning suffers from high sample complexity, especially in environments with sparse rewards, large state spaces, and correlated trajectories. We address these limitations by reformulating …

Reinforcement Learning

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

2022-05-09 · Artyom Nikitin, Andrei Chertkov, Rafael Ballester-Ripoll, Ivan Oseledets 외

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 information may be scarce or e…

Collaborative FilteringFeature Engineeringfeature selectionRecommendation Systems+1

Charged particle tracking with quantum annealing-inspired optimization

2019-08-13 · Alexander Zlokapa, Abhishek Anand, Jean-Roch Vlimant, Javier M. Duarte 외

At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for analysis are expected to face challenges due to scaling with track density. Quantum annealing has s…

Combinatorial Optimization

Quantum-Enhanced Selection Operators for Evolutionary Algorithms

2022-06-21 · David Von Dollen, Sheir Yarkoni, Daniel Weimer, Florian Neukart 외

Genetic algorithms have unique properties which are useful when applied to black box optimization. Using selection, crossover, and mutation operators, candidate solutions may be obtained without the need to calculate a g…

Evolutionary Algorithms