Files
ray-project--ray/rllib/policy/tests/test_policy_state_swapping.py
2026-07-13 13:17:40 +08:00

130 lines
4.6 KiB
Python

import unittest
import gymnasium as gym
import numpy as np
import tree # pip install dm_tree
import ray
from ray.rllib.algorithms.appo import APPOConfig, APPOTorchPolicy
from ray.rllib.policy.policy_map import PolicyMap
from ray.rllib.utils.test_utils import check
from ray.rllib.utils.tf_utils import get_tf_eager_cls_if_necessary
class TestPolicyStateSwapping(unittest.TestCase):
"""Tests, whether Policies' states can be swapped out via their state on a GPU."""
@classmethod
def setUpClass(cls) -> None:
ray.init()
@classmethod
def tearDownClass(cls) -> None:
ray.shutdown()
def test_policy_swap_gpu(self):
config = (
APPOConfig().api_stack(
enable_rl_module_and_learner=False,
enable_env_runner_and_connector_v2=False,
)
# Use a single GPU for this test.
.resources(num_gpus=1)
)
obs_space = gym.spaces.Box(-1.0, 1.0, (4,), dtype=np.float32)
dummy_obs = obs_space.sample()
act_space = gym.spaces.Discrete(100)
num_policies = 2
capacity = 1
cls = get_tf_eager_cls_if_necessary(APPOTorchPolicy, config)
# Create empty, swappable-policies PolicyMap.
policy_map = PolicyMap(capacity=capacity, policy_states_are_swappable=True)
# Create and add some TF2 policies.
for i in range(num_policies):
config.training(lr=(i + 1) * 0.01)
policy = cls(
observation_space=obs_space,
action_space=act_space,
config=config.to_dict(),
)
policy_map[f"pol{i}"] = policy
# Create a dummy batch with all 1.0s in it (instead of zeros), so we have a
# better chance of changing our weights during an update.
dummy_batch_ones = tree.map_structure(
lambda s: np.ones_like(s),
policy_map["pol0"]._dummy_batch,
)
dummy_batch_twos = tree.map_structure(
lambda s: np.full_like(s, 2.0),
policy_map["pol0"]._dummy_batch,
)
logits = {
pid: p.compute_single_action(dummy_obs)[2]["action_dist_inputs"]
for pid, p in policy_map.items()
}
# Make sure policies output different deterministic actions. Otherwise,
# this test would not work.
check(logits["pol0"], logits["pol1"], atol=0.0000001, false=True)
# Test proper policy state swapping.
for i in range(50):
pid = f"pol{i % num_policies}"
print(i)
pol = policy_map[pid]
# Make sure config has been changed properly.
self.assertTrue(pol.config["lr"] == ((i % num_policies) + 1) * 0.01)
# After accessing `pid`, assume it's the most recently accessed
# item now.
self.assertTrue(policy_map._deque[-1] == pid)
self.assertTrue(len(policy_map._deque) == capacity)
self.assertTrue(len(policy_map.cache) == capacity)
self.assertTrue(pid in policy_map.cache)
# Actually compute one action to trigger tracing operations of
# the graph. These may be performed lazily by the DL framework.
check(
pol.compute_single_action(dummy_obs)[2]["action_dist_inputs"],
logits[pid],
)
# Test, whether training (on the GPU) will affect the state swapping.
for i in range(num_policies):
pid = f"pol{i % num_policies}"
pol = policy_map[pid]
if i == 0:
pol.learn_on_batch(dummy_batch_ones)
else:
assert i == 1
pol.learn_on_batch(dummy_batch_twos)
# Make sure, we really changed the NN during training and update our
# actions dict.
old_logits = logits[pid]
logits[pid] = pol.compute_single_action(dummy_obs)[2]["action_dist_inputs"]
check(logits[pid], old_logits, atol=0.0000001, false=True)
# Make sure policies output different deterministic actions. Otherwise,
# this test would not work.
check(logits["pol0"], logits["pol1"], atol=0.0000001, false=True)
# Once more, test proper policy state swapping.
for i in range(50):
pid = f"pol{i % num_policies}"
pol = policy_map[pid]
check(
pol.compute_single_action(dummy_obs)[2]["action_dist_inputs"],
logits[pid],
)
if __name__ == "__main__":
import sys
import pytest
sys.exit(pytest.main(["-v", __file__]))