As others have mentioned, in lattice-based key exchange the derived secret is a function of contributions of both parties.
In fact, the standardized algorithms are very "diffie-hellman-like" in practice (the design paradigm goes by the name of noisy diffie hellman).
There is a significant difference with standard diffie hellman though, namely that DH key exchange forms what is known as non-interactive key exchange (NIKE).
There are some strong information-theoretic barriers to giving such a construction using common lattice-based design paradigms.
In particular, there are some known impossibility results from constructions that use (polynomially-large) moduli $q$.
Interestingly, yesterday a new lattice-based KEM has been proposed, roughly looking at how efficient one can make lattice-based NIKE (by accepting the fact that one needs $q$ super-polynomially large).
This is to say that if you really like DH-type schemes, and the lattice-based versions of them that aren't NIKE aren't good enough for you, there's a lattice-based candidate you can look into now :)