3 papers
cs.DS2026
Computational Thresholds for Balanced and Fixed-Slice Independent Sets in Bipartite Graphs
Ijay Narang, Will Perkins, Yuzhou Wang +1
Motivated by recent work of Kocurek, Oveis Gharan, and Tjowasi, which gives an efficient sampling algorithm for the hard-core model on random regular bipartite graphs by decomposin…
cs.LG2026
Constant-Stepsize Stochastic Approximation: Finite-Time Convergence, Gaussian Approximation, and Tail Bounds
Zedong Wang, Yuyang Wang, Ijay Narang +3
Constant-stepsize stochastic approximation (SA) is widely used in learning for computational efficiency, yet the distribution of the iterates is typically intractable. Classical as…
math.CO2020
Maximum determinant and permanent of sparse 0-1 matrices
Igor Araujo, József Balogh, Yuzhou Wang
We prove that the maximum determinant of an matrix, with entries in and at most non-zero entries, is at most , which is best possible when $k…