The first paragraph of 4.17.4. Group algorithms library says that iterators can be passed to group algorithms:

The first argument to each function is a group, and data ranges can be described using pointers, iterators or instances of the multi_ptr class

However, all the joint_* functions have a restriction that the input is a pointer. Example: 4.17.4.1. any_of, all_of and none_of

template <typename Group, typename Ptr, typename Predicate>
bool joint_any_of(Group g, Ptr first, Ptr last, Predicate pred); // (1)

Constraints: Available only if sycl::is_group_v<std::decay_t> is true and Ptr is a pointer.

So are the group algorithms meant to also take in iterators? (I would presume this should be restricted to random access iterators, to be more precise.) Since these algorithms are like their std counterparts, I think they probably should. For example, for an accessor acc, it would make sense to do something like joint_any_of(group, acc.begin(), acc.end()) , but as the spec is, this is not necessarily allowed.