4 ms·
Sampling sequentially to find the highest joint probability over the sequence is definitely a search problem. that's why you see algorithms like beam search oft
by radarsat1 2y ago
Sampling sequentially to find the highest joint probability over the sequence is definitely a search problem. that's why you see algorithms like beam search often used for sampling.