9 citations · 14 across the 17 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CL2026
Beyond Facts: Benchmarking Distributional Reading Comprehension in Large Language Models
Pei-Fu Guo, Ya-An Tsai, Chun-Chia Hsu +6
While most reading comprehension benchmarks for LLMs focus on factual information that can be answered by localizing specific textual evidence, many real-world tasks require unders…
stat.ML2026
An Efficient Algorithm for Thresholding Monte Carlo Tree Search
Shoma Nameki, Atsuyoshi Nakamura, Junpei Komiyama +1
We introduce the Thresholding Monte Carlo Tree Search problem, in which, given a tree and a threshold , a player must answer whether the root node value of $\mathc…