AI Glossary / Graphs and symbolic AI / Intermediate

Selection problem

Definition

A selection problem, in the decision-theoretic sense used here, is the task of gathering costly evidence about alternatives before choosing one for use. The aim is a good final choice, with the cost of testing or computation taken into account, rather than maximizing rewards earned during the tests themselves.

What it means

Suppose an AI planner can run simulations of several possible actions before executing one. A poor simulated outcome can be informative without causing the real-world loss that executing the action would cause. The simulation has its own cost, such as time or computation.

This separates the selection problem from a standard cumulative-reward bandit problem, where each trial is itself an action producing a reward or loss that contributes to the objective. Methods can be related, but their optimality claims do not transfer automatically.

The term also has other meanings, including finding the kth-smallest item in a collection. This entry follows the source-list context of choosing among uncertain alternatives through evidence gathering, not that order-statistic problem.

How it works

Represent the uncertain utility or performance of each alternative and the evidence already available. Define what a test or simulation can reveal and what it costs. Evidence updates the estimates used for the final choice.

At each stage, decide whether to gather more information and, if so, which alternative or comparison to investigate. The useful test is not necessarily the one associated with the currently highest estimate. An uncertain competitor may be worth testing because the result could change the final decision.

In a Bayesian formulation, a policy can seek to maximize expected utility of the selected alternative minus evidence-gathering cost. Other formulations use a fixed testing budget or a target probability of choosing correctly. These objectives are related but not identical.

Stopping is part of the decision. Additional evidence has value when it is expected to improve the eventual choice enough to justify its cost. Computing that value exactly can itself be difficult, so practical methods often use approximations whose limitations should be stated.

Three practical examples

  • An AI planner allocates simulation runs among candidate actions before committing to one action in the environment.
  • A design team tests several prototypes to select one for further development, treating test expense separately from the chosen design's eventual value.
  • A computing team compares candidate configurations under a limited evaluation budget before selecting one configuration for a later workload.

Think of it this way

Think of sampling paint on small test boards before choosing a color for a room. The test is performed to inform the later commitment; an unattractive test board is not equivalent to repainting the whole room badly.

The analogy is limited because preferences may be subjective and information imperfect. A mathematical selection model requires explicit alternatives, uncertainty, evidence costs and a criterion for the final decision.

Worked example

Consider two alternatives measured in invented utility units. A is known to provide 60. B provides either 40 or 100, each with probability one-half. Before further information, B has expected utility 0.5×40+0.5×100=70, so choosing immediately favors B over A.

Suppose an ideal test reveals B's value perfectly. After a result of 40, choose A and obtain 60; after a result of 100, choose B and obtain 100. Expected utility after the information, before paying for it, is 0.5×60+0.5×100=80.

The expected value of this perfect information is 80−70=10. If the test costs 6 compatible utility units, testing yields net expected utility 74, above the immediate choice's 70. If it costs 12, the net is 68, so that test is not worthwhile under this one-test model.

Real tests usually reveal less than perfect information. This idealized calculation does not make ordinary simulations perfectly informative.

Illustrative case study

In a fictional project, Cedar Simulation uses a cumulative-reward policy to allocate evaluations among candidate plans. The team notices that the policy avoids a poorly estimated alternative even when another simulation might show it to be the best final choice.

The reviewers distinguish rewards earned by real actions from information gained by simulations. They evaluate the testing policy using final decision quality and simulation cost, rather than the sum of simulated outcomes alone.

The case identifies a possible objective mismatch. It does not prove that a particular bandit-inspired heuristic is ineffective or that a replacement will always improve results.

Common misconceptions and mistakes

  • Every sequential test problem has the same objective as a bandit problem. Some tests only inform a later choice.
  • The currently best alternative is always the best one to test. Evidence about a competitor can change the decision.
  • More information is always worth buying. Its expected decision benefit can be smaller than its cost.
  • A simulated failure necessarily causes the corresponding real-world loss. The simulation and execution are distinct events.
  • Selection means sorting a list here. This entry concerns uncertain alternatives and evidence acquisition.
  • A simple per-option score is guaranteed to give the optimal testing policy. General selection problems can depend on the other available alternatives.

Business use

For AI evaluation workflows, state whether tests are learning opportunities before deployment or real deployments whose outcomes already count toward the objective. The distinction changes the testing objective.

Express evaluation costs and final decision value consistently. Include deadlines or resource limits where they affect whether more testing is useful. A test that arrives after the decision cannot provide the same benefit as timely evidence.

Report the assumptions behind uncertainty estimates and any stopping approximation. The best-supported candidate is not necessarily the best possible alternative.

People also ask

Does a selection problem require perfect tests?

No. Evidence can be noisy or partial; the model should describe that uncertainty.

Is this the same as evolutionary selection?

No. Evolutionary selection chooses population members, whereas this sense concerns acquiring evidence before a final decision.

Can bandit methods still be useful?

They can serve as heuristics in related settings, but their guarantees must be checked against the selection objective.

Check your understanding

In the worked example, why is the value of perfect information 10 rather than 80?

Answer: Information is compared with the best decision already available. Expected utility rises from 70 without the test to 80 with its information, giving an incremental value of 10 before test cost.

Related terms

  • Metareasoning
  • Stopping rule
  • Expected utility
  • Value of information
  • best-arm identification
  • bandit problem
  • simulation budget
  • Bayesian decision theory

Learn next

Replace the perfect test with one that sometimes misreports B's value. Specify its accuracy and calculate the posterior probabilities after each result. Compare the resulting decision value with the perfect-information benchmark and the cost of the test.

  • Perfect information

More in Graphs and symbolic AI

  • Search tree - A search tree is a tree-shaped representation of the alternatives explored from an initial search node.
  • Second Order Centrality - Second order centrality is a network measure based on the standard deviation of the time between successive visits to a node by a specified random walk.
  • Selection - Selection in an evolutionary algorithm is the process of choosing individuals from a population for reproduction or survival according to a defined rule.
  • Semantic ambiguity - Semantic ambiguity occurs when an expression allows more than one interpretation of its meaning.
  • Semantic audio - Semantic audio is the analysis and representation of audio in terms of meaningful content, such as sound events, instruments, musical structure or...
  • Semantic computing - Semantic computing is a broad field concerned with connecting computational content to its meaning and to users' intentions.

Sources

Russell and Norvig's corrected selection-problem discussion: https://aima.cs.berkeley.edu/errata/aima-586.pdf

Hay, Russell, Tolpin and Shimony, Selecting Computations: Theory and Applications: https://aima.cs.berkeley.edu/~russell/papers/uai12-meta.pdf

Relevant definitions and distinctions were reviewed. The two-alternative calculation and Cedar Simulation case are original illustrations.

Previous: Selection bias Next: Selectional restriction

  • Home
  • Daily AI Updates
  • Blog
  • AIFBL Academy
  • AI Glossary
  • Products and Tools
  • Store
  • Free CFO AI Prompt Pack
  • About Shihan Sheriff
  • Privacy Policy
  • Terms of Use
  • Refund Policy
  • Cookie Policy
  • Earnings Disclaimer