Tree-of-thought for complex decisions in Agentic AI - Model Metrics & Evaluation

Metrics & Evaluation - Tree-of-thought for complex decisions

Which metric matters for Tree-of-thought and WHY

Tree-of-thought methods help AI make step-by-step decisions by exploring many possible paths. To know if the AI is good at this, we look at accuracy of final decisions and efficiency (how many steps or time it takes). Accuracy shows if the AI picks the right answer. Efficiency shows if it does so quickly without wasting effort. Sometimes, precision and recall matter if the task involves finding correct options among many possibilities.

Confusion matrix for decision outcomes

      | Predicted Yes | Predicted No |
      |---------------|--------------|
      | True Positive | False Positive|
      | False Negative| True Negative |

      TP: Correctly chosen good decisions
      FP: Wrongly chosen bad decisions
      FN: Missed good decisions
      TN: Correctly rejected bad decisions

      Total decisions = TP + FP + FN + TN
    

This matrix helps us count how many decisions were right or wrong, guiding metrics like precision and recall.

Precision vs Recall tradeoff with examples

Imagine the AI is choosing steps in a complex plan:

• High precision: The AI picks mostly correct steps, but might miss some good ones. Good when wrong steps are costly.
• High recall: The AI finds most good steps, but may include some wrong ones. Good when missing a good step is worse than extra wrong steps.

For example, in medical diagnosis, high recall is key to catch all illnesses. In legal decisions, high precision avoids false accusations.

What good vs bad metric values look like

Good metrics:

• Accuracy above 85% means most decisions are correct.
• Precision and recall both above 80% show balanced and reliable choices.
• Efficiency: fewer steps or less time to reach decisions.

Bad metrics:

• Accuracy below 60% means many wrong decisions.
• Precision very low (e.g., 40%) means many wrong steps chosen.
• Recall very low (e.g., 30%) means many good steps missed.
• Very high number of steps/time means inefficient decision-making.

Common pitfalls in metrics for Tree-of-thought

• Accuracy paradox: High accuracy can hide poor recall if data is unbalanced.
• Data leakage: Using future information in training inflates metrics falsely.
• Overfitting: Model performs well on training paths but poorly on new ones.
• Ignoring efficiency: Good accuracy but very slow decisions may be impractical.
• Confusing precision and recall: Each measures different errors; mixing them leads to wrong conclusions.

Self-check question

Your tree-of-thought AI model has 98% accuracy but only 12% recall on important decision steps. Is it good for production? Why or why not?

Answer: No, it is not good. The low recall means the AI misses most important steps, even if overall accuracy looks high. This can cause critical errors in complex decisions. Improving recall is essential.

Key Result

For tree-of-thought models, balanced accuracy, precision, and recall combined with decision efficiency best show performance quality.

Practice

1.

What is the main purpose of using a tree-of-thought approach in complex decisions?

easy

A. To avoid making any decision

B. To randomly select an action without analysis

C. To break down decisions into smaller, manageable steps

D. To speed up decisions by ignoring options

Solution

1. Step 1: Understand the concept of tree-of-thought

   Tree-of-thought breaks complex decisions into smaller steps to simplify the process.

2. Step 2: Identify the purpose of breaking down decisions

   This helps explore options carefully and find better solutions.

3. Final Answer:

   To break down decisions into smaller, manageable steps -> Option C

4. Quick Check:

   Tree-of-thought = smaller steps [OK]

Hint: Think of breaking big problems into small parts [OK]

Common Mistakes:

• Confusing tree-of-thought with random choice
• Thinking it avoids decisions
• Assuming it speeds up by ignoring options

2.

Which of the following correctly represents a step in building a tree-of-thought?

1. Start with initial state
2. Generate possible actions
3. Evaluate outcomes
4. Choose best path

easy

A. Choose best path, generate actions, start with initial state, evaluate outcomes

B. Start with initial state, generate actions, evaluate outcomes, choose best path

C. Evaluate outcomes, choose best path, start with initial state, generate actions

D. Generate actions, start with initial state, choose best path, evaluate outcomes

Solution

1. Step 1: Identify the logical order of steps

   We start from the initial state, then generate possible actions.

2. Step 2: Follow with evaluation and choice

   After generating actions, we evaluate outcomes and choose the best path.

3. Final Answer:

   Start with initial state, generate actions, evaluate outcomes, choose best path -> Option B

4. Quick Check:

   Logical step order = B [OK]

Hint: Follow the natural decision flow order [OK]

Common Mistakes:

• Mixing up the order of steps
• Starting with choice before generating actions
• Evaluating before generating actions

3.

Given the following simplified tree-of-thought code snippet, what is the printed output?

def tree_of_thought(state, depth):
    if depth == 0:
        return [state]
    results = []
    for action in ['A', 'B']:
        next_state = state + action
        results.extend(tree_of_thought(next_state, depth - 1))
    return results

print(tree_of_thought('', 2))

medium

A. ['AA', 'AB', 'BA', 'BB']

B. ['A', 'B']

C. ['', 'A', 'B']

D. ['AA', 'AB', 'BA']

Solution

1. Step 1: Understand recursion and depth

   At depth 2, the function appends two actions at each step, building strings of length 2.

2. Step 2: Trace the recursive calls

   Starting with '', actions 'A' and 'B' add to form 'A' and 'B', then again add 'A' or 'B' to form 'AA', 'AB', 'BA', 'BB'.

3. Final Answer:

   ['AA', 'AB', 'BA', 'BB'] -> Option A

4. Quick Check:

   All 2-length action combos = C [OK]

Hint: Count depth levels and action combinations [OK]

Common Mistakes:

• Confusing depth with number of actions
• Returning partial strings
• Missing recursive expansion

4.

Identify the error in this tree-of-thought function that prevents it from exploring all branches:

def tree_of_thought(state, depth):
    if depth == 0:
        return [state]
    results = []
    for action in ['A', 'B']:
        next_state = state + action
        results.append(tree_of_thought(next_state, depth - 1))
    return results

print(tree_of_thought('', 2))

medium

A. Using append instead of extend causes nested lists

B. Missing base case for depth == 0

C. Looping over wrong actions

D. Returning results before recursion

Solution

1. Step 1: Analyze list operations in recursion

   Using append adds the entire recursive list as a single element, creating nested lists.

2. Step 2: Correct method to flatten results

   Using extend adds elements individually, flattening the list as intended.

3. Final Answer:

   Using append instead of extend causes nested lists -> Option A

4. Quick Check:

   append vs extend affects list shape [OK]

Hint: Use extend to flatten recursive results [OK]

Common Mistakes:

• Confusing append and extend
• Ignoring base case presence
• Misunderstanding recursion flow

5.

You want to use tree-of-thought to decide the best sequence of moves in a game where each move has a score. Which approach best fits this goal?

def tree_of_thought(state, depth):
    if depth == 0:
        return [(state, score(state))]
    results = []
    for action in possible_actions(state):
        next_state = apply_action(state, action)
        results.extend(tree_of_thought(next_state, depth - 1))
    return results

# How to choose best sequence?

hard

A. Stop recursion early without exploring all sequences

B. Pick the first sequence returned without comparing scores

C. Ignore scores and choose randomly

D. After collecting all sequences and scores, select the sequence with the highest score

Solution

1. Step 1: Understand the goal of maximizing score

   The goal is to find the sequence with the highest score after exploring all options.

2. Step 2: Choose the best sequence after full exploration

   Collecting all sequences and their scores allows selecting the best one reliably.

3. Final Answer:

   After collecting all sequences and scores, select the sequence with the highest score -> Option D

4. Quick Check:

   Best score selection after exploration = A [OK]

Hint: Explore all, then pick highest score [OK]

Common Mistakes:

• Choosing first sequence without comparison
• Ignoring scores
• Stopping early and missing better options