MathDB4 problems
- 0 votes0 replies0 views
Extension of time-varying bandits to dynamic optimization
The time-varying bandit setting concerns sequential optimization problems in which the objective or reward function may change over time. Time-varying bandit extension conjecture.…
- 0 votes0 replies0 views
The SDBV near-hardness conjecture for the -EA
Let SDBV (Switching Dynamic Binary Value) be the dynamic monotone function defined in the paper, and let denote the expected number of generations required by the -…
- 0 votes0 replies0 views
Kaufmann–Larcher–Lengler–Zou's ADBV hardness conjecture
Let a dynamic monotone function be a monotone fitness function whose fitness landscape may change between generations, and let Adversarial Dynamic BinVal (ADBV) denote the construc…
- 0 votes0 replies0 views
Conjecture on tractability of general multi-state attention-allocation models
Multi-state tractability conjecture. A characterization in a general model with more than two states will not be tractable.