For k ≥ 3, a collection of k sets is said to form a weak ∆-system if the intersection of any two sets from the collection has the same size. Erdős and Szemerédi [8] asked about the size of the largest family F of subsets of {1, . . . , n} that does not contain a weak ∆-system. In this note we improve upon the best upper bound from [13], and show thatn where Θ(C) is the capset capacity. In particular, this shows that