Consider two decision problems A and B.
We know that A reduces to B in polynomial time --- if we could solve B, we have a procedure to solve A.
Now, let's say it is known that the worst case instances of A reduce to the average case instances of A.
Does it imply the same worst-to-average-case reduction for B?
If not, what are some known counterexamples, considering standard problems/complexity classes?