From Targets to Rewards: Continuous Target Sets in the Algorithmic Search Framework

Milo Knell, Sahil Rane, Forrest Bicker, Tiger Che, Alan Wu, George Montañez

2024

Abstract

Many machine learning tasks have a measure of success that is naturally continuous, such as error under a loss function. We generalize the Algorithmic Search Framework (ASF), used for modeling machine learning domains as discrete search problems, to the continuous space. Moving from discrete target sets to a continuous measure of success extends the applicability of the ASF by allowing us to model fundamentally continuous notions like fuzzy membership. We generalize many results from the discrete ASF to the continuous space and prove novel results for a continuous measure of success. Additionally, we derive an upper bound for the expected performance of a search algorithm under arbitrary levels of quantization in the success measure, demonstrating a negative relationship between quantization and the performance upper bound. These results improve the fidelity of the ASF as a framework for modeling a range of machine learning and artificial intelligence tasks.

Download


Paper Citation


in Harvard Style

Knell M., Rane S., Bicker F., Che T., Wu A. and Montañez G. (2024). From Targets to Rewards: Continuous Target Sets in the Algorithmic Search Framework. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-680-4, SciTePress, pages 558-567. DOI: 10.5220/0012370600003636


in Bibtex Style

@conference{icaart24,
author={Milo Knell and Sahil Rane and Forrest Bicker and Tiger Che and Alan Wu and George Montañez},
title={From Targets to Rewards: Continuous Target Sets in the Algorithmic Search Framework},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2024},
pages={558-567},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012370600003636},
isbn={978-989-758-680-4},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - From Targets to Rewards: Continuous Target Sets in the Algorithmic Search Framework
SN - 978-989-758-680-4
AU - Knell M.
AU - Rane S.
AU - Bicker F.
AU - Che T.
AU - Wu A.
AU - Montañez G.
PY - 2024
SP - 558
EP - 567
DO - 10.5220/0012370600003636
PB - SciTePress