arXiv:2609.37841v1 Announce Type: new
Abstract: Masked generative models offer parallel token prediction, but accurate parallel sampling must account for dependencies among tokens. When dependencies...
By Ryotaro Kawata, Satoshi Hayakawa, Taiji Suzuki
arXiv:2610. 13924v1 Announce Type: new Abstract: A parallel sampler can choose at random which coordinates to generate together.
By Tianyi Wu
Probabilistic Focal Search (PFS) augments traditional Focal Search by probabilistically choosing between the standard heuristic-guided expansion and expanding the minimum‑f node in OPEN. This strategy advances the lower bound, enlarges the FOCAL frontier, and can dramatically reduce node expansions—up to 90% in some benchmarks such as N‑Puzzle and TSP—especially when long f_min plateaus delay useful FOCAL admissions. An anytime variant, APFS, outperforms other tested anytime algorithms on the Generalized Covering TSP, and the same probabilistic scheduler transfers to Dynamic Potential Search as Probabilistic Dynamic Potential Search (PDPS), though its effectiveness varies by domain and bound.
By Minh Vu Duc, Trung Le Huu, H\`a Minh Ho\`ang, Trung Thanh Nguyen, Phuong Khanh Nguyen, Huynh Thi Thanh Binh
arXiv:2610. 29898v1 Announce Type: new Abstract: Haussler's covering lemma (JCTA 1995) gives the sharp $(C/\delta)^d$ metric-entropy bound for binary VC classes under normalized $\ell_1$ distance.
By Shihao Shao, Dacheng Tao
arXiv:2509. 08521v2 Announce Type: replace-cross Abstract: FMT$^{*}$ plans efficiently in static worlds by expanding a cost-ordered wavefront and collision-checking lazily, but its single-pass unvisited rule cannot revise paths when obstacles change.
By Soheil Espahbodi Nia
arXiv:2609.10196v1 Announce Type: cross
Abstract: Attias, Hanneke and Ramaswami (NeurIPS 2025) asked whether randomization provably reduces the oracle calls needed for online learning when the class...
By Xuan Li
arXiv:2511.05620v2 Announce Type: replace
Abstract: We study worst-case dynamic regret of specific multi-armed bandit algorithms on piecewise-stationary instances with at most one breakpoint. Our con...
By Gal Mendelson, Eyal Tadmor
arXiv:2607. 17469v1 Announce Type: cross Abstract: A randomized algorithm may terminate almost surely even though exceptional random tapes make it run forever.
By Yunbei Xu
arXiv:2609.13692v1 Announce Type: cross
Abstract: LLM serving reuses KV cache by exact prefix match, so when a prompt is assembled from a set of reusable pieces -- retrieved passages, tool definition...
By Rong He
The paper introduces a technique called introduced feedback delays to improve regret bounds in episodic adversarial Markov Decision Processes (AMDPs). By estimating the Q‑function using future episodes while still updating the policy, the authors achieve µO(poly(H)√{SAK}) regret for tabular AMDPs and µO(poly(d,H)√{K}) regret for linear AMDPs, resolving long‑standing gaps. The method also extends to settings with actual feedback delays, providing optimal bounds in both state and delay dimensions.
By Aarush Kulkarni, Khang Nguyen, William Chang, Yan Dai
Consistent submodular maximization studies the tradeoff between solution quality and stability when elements arrive over time. For a monotone submodular objective, which models diminishing returns, an...
The paper studies learning from runs that stop at their first incorrect decision, revealing only the queries and correct labels up to that point. It analyzes how many such runs are required to learn a hypothesis from a fixed binary class of VC dimension at most $d$, providing bounds on the number of runs and distinct pilots needed to achieve a risk estimate within ε of the optimal risk. The results include upper bounds on sample complexity, treatment of unknown cost ceilings, and matching lower bounds for finite classes.
By Michal \v{C}ert\'ik