Memoization technique for optimizing functions with stochastic input
Edin H. Mulali\'c, Miomir S. Stankovi\'c, Radomir S. Stankovi\'c

TL;DR
This paper introduces a memoization-based optimization strategy for functions with stochastic inputs, leveraging decomposition and probability distributions to improve efficiency despite combinatorial challenges.
Contribution
It proposes a novel memoization technique that uses input probability distributions and decomposition to optimize stochastic functions, addressing combinatorial explosion issues.
Findings
Effective memoization reduces computation time for stochastic functions.
Probability-based input selection improves optimization accuracy.
Addresses combinatorial explosion in complex stochastic systems.
Abstract
In this paper we present a strategy for optimization functions with stochastic input. The main idea is to take advantage of decomposition in combination with a look-up table. Deciding what input values should be used for memoization is determined based on the underlying probability distribution of input variables. Special attention is given to difficulties caused by combinatorial explosion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEvolutionary Algorithms and Applications
