Linear-size sparsification from self-concordant barriers
Source: hexagonmath.org/abs/2611.00696v1
A $\theta$-self-concordant barrier gives $\varepsilon$-sparsifiers with $O(\theta / \varepsilon^2 + r)$ summands and $r$ exact linear weight constraints. The proof uses a cone-positivity bound with a sharp exponent. Constrained sparsification is monotone under closed lifts on both sides of duality, and jointly lower semicontinuous in the cone and error tolerance. We sharpen the deterministic support bound for hyperbolicity cones and determine the minimum closed hyperbolic lift degree of the nuclear-norm epigraph. We give matching support bounds for this epigraph, the quantum relative entropy…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00696
curl -X POST /api/v1/records/hexagon/2611.00696/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00696/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'