The strong matroid secretary conjecture asserts that every matroid admits a $1/e$-competitive secretary algorithm, matching the classical single-choice guarantee. We formulate a finite linear program whose value is the optimal ordinal competitive ratio of any fixed matroid; for all matroids of positive rank on seven el...
Kearns, Roth, and Ryu show that the output agent's error approaches the global predictor's error along sufficiently deep paths with suitable feature coverage, while insufficient depth can prevent aggregation even in large networks.
M. Bateni, Z. Hadizadeh, M. Hajiaghayi et al.· arXiv.org· 0 citations
This work develops a residual-based dynamic algorithm that selectively propagates local errors via push operations, maintaining an approximation to the evolving fixed point without full recomputation, and proves that the method achieves amortized $O(1/\epsilon)$ update time per graph change under a degree-normalized er...
Kiarash Banihashem, M. Hajiaghayi, Mahdi JafariRaviz et al.· 0 citations
Building on the pioneering paper of Kearns, Roth, and Ryu (SODA'26), we study information aggregation in a networked learning model. The model captures a central pattern in agentic AI: each agent sees only part of the data and passes on only its own conclusion. Their model considers a linear regression problem with the...
M. Bateni, Z. Hadizadeh, Mohammadtaghi Hajiaghayi et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.