Discrepancy Minimization via Regularization.

SODA(2023)

引用 0|浏览2
暂无评分
摘要
We introduce a new algorithmic framework for discrepancy minimization based on regularization. We demonstrate how varying the regularizer allows us to re-interpret several breakthrough works in algorithmic discrepancy, ranging from Spencer's theorem [Spencer 1985, Bansal 2010] to Banaszczyk's bounds [Banaszczyk 1998, Bansal-Dadush-Garg 2016]. Using our techniques, we also show that the Beck-Fiala and Koml\'os conjectures are true in a new regime of pseudorandom instances.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络