DeepAI AI Chat
Log In Sign Up

Discrepancy Minimization via Regularization

11/10/2022
by   Lucas Pesenti, et al.
Università Bocconi
IRIF
0

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ós conjectures are true in a new regime of pseudorandom instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/02/2022

A Unified Approach to Discrepancy Minimization

We study a unified approach and algorithm for constructive discrepancy m...
11/18/2019

Algorithmic Discrepancy Minimization

This report will be a literature review on a result in algorithmic discr...
02/04/2021

Online Discrepancy Minimization via Persistent Self-Balancing Walks

We study the online discrepancy minimization problem for vectors in ℝ^d ...
06/24/2020

Discrepancy Minimization via a Self-Balancing Walk

We study discrepancy minimization for vectors in ℝ^n under various setti...
09/13/2021

On Shallow Packings and Tusnády's Problem

Tusnády's problem asks to bound the discrepancy of points and axis-paral...
05/19/2012

New Analysis and Algorithm for Learning with Drifting Distributions

We present a new analysis of the problem of learning with drifting distr...
06/12/2018

A Fourier-Analytic Approach for the Discrepancy of Random Set Systems

One of the prominent open problems in combinatorics is the discrepancy o...