A Unified Approach to Discrepancy Minimization

05/02/2022
by   Nikhil Bansal, et al.
0

We study a unified approach and algorithm for constructive discrepancy minimization based on a stochastic process. By varying the parameters of the process, one can recover various state-of-the-art results. We demonstrate the flexibility of the method by deriving a discrepancy bound for smoothed instances, which interpolates between known bounds for worst-case and random instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2022

Discrepancy Minimization via Regularization

We introduce a new algorithmic framework for discrepancy minimization ba...
research
06/24/2020

Discrepancy Minimization via a Self-Balancing Walk

We study discrepancy minimization for vectors in ℝ^n under various setti...
research
02/02/2018

Stochastic Kriging for Inadequate Simulation Models

Stochastic kriging is a popular metamodeling technique for representing ...
research
10/02/2019

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization

Consider a unit interval [0,1] in which n points arrive one-by-one indep...
research
11/18/2019

Algorithmic Discrepancy Minimization

This report will be a literature review on a result in algorithmic discr...
research
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...
research
11/16/2022

Keeping it sparse: Computing Persistent Homology revisited

In this work, we study several variants of matrix reduction via Gaussian...

Please sign up or login with your details

Forgot password? Click here to reset