DeepAI AI Chat
Log In Sign Up

Discrepancy Minimization in Input-Sparsity Time

10/22/2022
by   Yichuan Deng, et al.
0

A recent work of Larsen [Lar23] gave a faster combinatorial alternative to Bansal's SDP algorithm for finding a coloring x∈{-1,1}^n that approximately minimizes the discrepancy disc(A,x) : = A x _∞ of a general real-valued m× n matrix A. Larsen's algorithm runs in O(mn^2) time compared to Bansal's O(mn^4.5)-time algorithm, at the price of a slightly weaker logarithmic approximation ratio in terms of the hereditary discrepancy of A [Ban10]. In this work we present a combinatorial O(nnz(A) + n^3) time algorithm with the same approximation guarantee as Larsen, which is optimal for tall matrices m=poly(n). Using a more intricate analysis and fast matrix-multiplication, we achieve O(nnz(A) + n^2.53) time, which breaks cubic runtime for square matrices, and bypasses the barrier of linear-programming approaches [ES14] for which input-sparsity time is currently out of reach. Our algorithm relies on two main ideas: (i) A new sketching technique for finding a projection matrix with short ℓ_2-basis using implicit leverage-score sampling; (ii) A data structure for faster implementation of the iterative Edge-Walk partial-coloring algorithm of Lovett-Meka, using an alternative analysis that enables “lazy" batch-updates with low-rank corrections. Our result nearly closes the computational gap between real-valued and binary matrices (set-systems), for which input-sparsity time coloring was very recently obtained [JSS23].

READ FULL TEXT

page 1

page 2

page 3

page 4

11/08/2017

Constructive Discrepancy Minimization with Hereditary L2 Guarantees

In discrepancy minimization problems, we are given a family of sets S = ...
05/15/2023

Linear-Sized Sparsifiers via Near-Linear Time Discrepancy Theory

Discrepancy theory provides powerful tools for producing higher-quality ...
06/09/2022

Spencer's theorem in nearly input-sparsity time

A celebrated theorem of Spencer states that for every set system S_1,…, ...
02/27/2023

3-Coloring in Time O(1.3217^n)

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n)....
06/27/2018

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank

Computing the smallest number q such that the vertices of a given graph ...
06/24/2021

Optimal Fine-grained Hardness of Approximation of Linear Equations

The problem of solving linear systems is one of the most fundamental pro...
02/09/2022

Leverage Score Sampling for Tensor Product Matrices in Input Sparsity Time

We give an input sparsity time sampling algorithm for spectrally approxi...