Maximizing the Minimum Eigenvalue in Constant Dimension
In an instance of the minimum eigenvalue problem, we are given a collection of $ n $ vectors
$ v_1,\ldots, v_n\subset {\mathbb {R}^ d} $, and the goal is to pick a subset $ B\subseteq [n] …
$ v_1,\ldots, v_n\subset {\mathbb {R}^ d} $, and the goal is to pick a subset $ B\subseteq [n] …
Efficient Determinant Maximization for All Matroids
Determinant maximization provides an elegant generalization of problems in many areas,
including convex geometry, statistics, machine learning, fair allocation of goods, and …
including convex geometry, statistics, machine learning, fair allocation of goods, and …
Polynomial-Time Algorithms for Weaver's Discrepancy Problem in a Dense Regime
Given $ v_1,\ldots, v_m\in\mathbb {C}^ d $ with $\| v_i\|^ 2=\alpha $ for all $ i\in [m] $ as input
and suppose $\sum_ {i= 1}^ m|\langle u, v_i\rangle|^ 2= 1$ for every unit vector …
and suppose $\sum_ {i= 1}^ m|\langle u, v_i\rangle|^ 2= 1$ for every unit vector …