1 citations · 1 across the 4 of their papers we have counts for
4 papers
Sharp Bounds on the Independence Number of Simplicial Spheres
Jesús A. De Loera, Ethan X. Fang, Junwei Lu +2
We study the maximum size of an independent set in the graph of a simplicial sphere. Let denote this maximum over all simplicial -spheres on vertices, and let $…
Hypothesis-Disciplined Multi-Agent Automated Formalization of Asymptotic Statistical Theory
Tingzhou Wei, Zeyu Zheng, Ethan X. Fang +1
Asymptotic statistical theory is a challenging domain for AI-assisted formalization: its central results mix convergence statements, asymptotic expansions, functional analysis, and…
Expected Work Search: Combining Win Rate and Proof Size Estimation
Owen Randall, Martin Müller, Ting Han Wei +1
We propose Expected Work Search (EWS), a new game solving algorithm. EWS combines win rate estimation, as used in Monte Carlo Tree Search, with proof size estimation, as used in Pr…
Monte Carlo Tree Search in the Presence of Transition Uncertainty
Farnaz Kohankhaki, Kiarash Aghakasiri, Hongming Zhang +3
Monte Carlo Tree Search (MCTS) is an immensely popular search-based framework used for decision making. It is traditionally applied to domains where a perfect simulation model of t…