Strong average self-concordance of the
log-determinant metric at linear scale
Abstract
Strong average self-concordance controls the change in the local norm of a Gaussian step when an arbitrary positive-semidefinite form is added to its proposal precision. For the log-determinant metric on real symmetric positive-definite matrices, we prove this property for every scaled metric with . This replaces the quadratic sufficient scale of Kook and Vempala (COLT 2024) by a linear one. The admissible proposal radius depends only on the error tolerance, and the guarantee includes feasibility and a two-sided bound on the change in squared local norm. The auxiliary form can correlate matrix entries. We normalize the proposal to a centered Gaussian matrix with covariance bounded by the identity. A paired-trace estimate of Song and Zhang (arXiv 2026) bounds its quartic trace moment, and Gaussian Poincaré reduces the cubic-trace variance to the same fourth moment. Both are uniformly over these covariance contractions, yielding the linear scale. We also determine the exact strong self-concordance threshold , making this the optimal scale for requiring strong self-concordance and strong average self-concordance simultaneously.
Note. This paper was generated entirely by AI, including MiMo, using an automated research pipeline developed by Chenghua Liu and Hanyu Li.
1 Introduction
A Dikin proposal measures a Gaussian displacement in the metric at its starting point; the reverse proposal measures that same displacement at its endpoint. Average self-concordance controls the difference between these two squared local lengths. When the proposal metric is a sum of components, a useful statement must control each component under the Gaussian step generated by the full sum. Strong average self-concordance (SASC) imposes precisely this requirement by allowing an arbitrary positive-semidefinite addition to the proposal precision [1].
For the log-determinant barrier on positive-definite matrices, this addition changes the structure of the random matrix. Without it, a congruence transformation produces a Frobenius-isotropic Gaussian matrix, whose independent coordinates permit direct trace moment calculations. With it, the transformed covariance is still bounded by the identity, but the matrix entries may be correlated. Kook and Vempala [1, Theorem 3.6] prove ordinary average self-concordance at scale , whereas their SASC guarantee uses the ambient dimension as the scale. They identify the loss of entry independence in Remark G.7 and ask whether the quadratic SASC scale can be improved.
Covariance domination alone does not immediately supply the trace estimates needed at linear scale. For example, replacing by for a centered Gaussian matrix with covariance at most the identity gives an expectation bound . After factoring out the target norm-change scale , this term is multiplied by , where is the metric scale and the proposal radius. The resulting bound is of order , losing a factor of relative to the desired linear scale. The loss is already visible for the isotropic Gaussian: its quartic trace has order , although the fourth moment of its Frobenius norm has order . A successful estimate must retain the trace structure while allowing arbitrary correlations.
We prove SASC for every . The normalized covariance can be diagonalized in an orthonormal basis of symmetric matrices, even though that basis need not be the coordinate basis. The identity holds in every such basis. Combined with the paired-trace estimate of Song and Zhang [3, Lemma 5.8], it gives the required fourth moment uniformly over covariance contractions. Gaussian Poincaré then bounds the variance of by that same fourth moment. These two estimates control the leading cubic term and the quartic remainder in the norm change. The quartic estimate also ensures that the proposed endpoint stays inside the cone.
The scale has a second interpretation. Strong self-concordance (SSC), introduced in the sampling setting by Laddha, Lee, and Vempala [2], is a deterministic bound on the normalized metric derivative. We compute its Hilbert–Schmidt norm exactly and show that SSC holds if and only if , attaining the lower endpoint of [1, Lemma E.23]. Hence is the minimum scale at which SSC and SASC hold together. This necessity comes from SSC; the SASC-only question concerns uniformity of the proposal radius across matrix orders and is discussed after the SSC calculation.
1.1 Metric and main theorem
We consider the log-determinant barrier on the positive semidefinite (PSD) cone. For an integer , let be the space of real symmetric matrices and let be its positive-definite cone. The Frobenius inner product is , which equals for symmetric matrices. Write and , so that . For , set
| (1) |
We identify bilinear forms with their self-adjoint Riesz operators for the Frobenius inner product. In particular, . The notation denotes the Hilbert–Schmidt norm of an operator on , whereas and denote matrix norms.
The distinction between operator and matrix norms matters for SSC, which measures all directions of the metric derivative together. We use the following normalizations. For a Hessian metric, ordinary self-concordance means .
Definition 1.1 (Strong self-concordance).
A self-concordant positive-definite Hessian metric is strongly self-concordant (SSC) if
| (2) |
for every base point and every direction .
Definition 1.2 (Uniform strong average self-concordance).
Let be a family of continuous positive-definite metrics, each defined on for some . The family is uniformly strongly average self-concordant if, for every , there is with the following property. For every , every base point , every positive-semidefinite bilinear form on , and every , the proposal
| (3) |
satisfies
| (4) |
A metric is called SASC when its singleton family has this property. Setting gives the corresponding average self-concordance condition.
The covariance in (3) is relative to the Frobenius inner product. The radius is independent of the matrix order, the metric in the family, the base point, and the auxiliary form. Only the pointwise value enters the proposal; it may be singular, and no smoothness or conditioning assumption is imposed. The norm change is measured using , not . Proposals outside the cone are counted as failures, so the event does not require evaluating outside its domain.
Theorem 1.3 (Linear SASC scaling and the exact SSC threshold).
For every integer and every , the proposal (3) with satisfies (4) uniformly over and , whenever and
| (5) |
In fact, the stronger two-sided estimate holds:
| (6) |
Thus is uniformly SASC.
Moreover, is SSC if and only if . Consequently, for each fixed ,
| (7) |
The theorem controls the norm change of the log-determinant component itself. This differs from controlling the complete Metropolis ratio, where the quadratic and determinant terms may cancel. Song and Zhang [3, Lemmas 5.3 and 5.15] use such cancellation in their analysis of spectrahedral walks; their covariance-eigenmode argument in Lemma 5.9 is also a technical ingredient of the trace estimates used here. Chen and Kook [4, Theorem 1 and Corollary 3] already obtain total-variation mixing on truncated PSD cones for a hybrid metric containing a linearly scaled log-determinant component, through first-order regularity. Their separate fourth-order criterion concerns ordinary ASC [4, Definition 5 and Lemma 6]. Thus a linear SASC bound answers the local regularity question without asserting a further mixing-time improvement. Numbered references to [1] use the published COLT version; those to [3, 4] use arXiv version 1.
2 Gaussian trace estimates
We first remove the base point and the auxiliary precision from the moment calculation. For , the invertible congruence operator satisfies . Normalization leaves a Gaussian covariance contraction on the full Frobenius space, as observed in [1, Remark G.7]. The subsequent estimates depend only on that contraction, so they apply uniformly to every auxiliary form in Theorem 1.3.
Lemma 2.1 (Normalized proposal covariance).
Let have the law (3) for , and set
| (8) |
Then is a centered Gaussian in , and its covariance operator satisfies .
Proof.
Writing for the Riesz operator of , the covariance transformation rule gives
The inequality follows from inverse monotonicity of positive-definite operators, and the last identity follows from invertibility of . The displayed covariance is positive semidefinite. ∎
Remark 2.2 (Coordinate normalization).
An orthonormal basis of is and for , where is the elementary matrix. Let denote coordinates in this basis, so its off-diagonal coordinates are . If instead stores each off-diagonal entry once, define by . The raw-coordinate matrix of is then , and
where is the raw-coordinate matrix of . All Hilbert–Schmidt norms use orthonormal coordinates; the raw upper-triangular coordinate map is not a Frobenius isometry.
Diagonalizing a covariance operator gives independent scalar Gaussian coefficients multiplying symmetric matrices that need not commute. In a fourth-moment expansion, the difficult terms have the alternating order . The following specialization of [3, Lemma 5.8] bounds them by the adjacent terms , whose sum is controlled by .
Lemma 2.3 (Paired traces).
Let , and suppose for a PSD matrix . Then
| (9) |
Proof.
For symmetric , Frobenius Cauchy–Schwarz gives
| (10) |
Summing with , proves the first inequality in (9). For the second, both and are PSD, and therefore
The nonnegativity follows by writing the trace of a product of PSD matrices as . ∎
The paired-trace inequality turns covariance domination into a fourth-moment bound without discarding matrix multiplication inside the trace. The cubic trace is odd, hence centered; differentiating it in Gaussian coordinates produces , so Gaussian Poincaré reduces its variance to the same fourth moment. This also covers singular covariance operators.
Proposition 2.4 (Gaussian trace bounds).
Let be a centered Gaussian in with covariance . Then
| (11) |
Proof.
Diagonalize in a Frobenius-orthonormal basis , and write
The covariance basis may rotate arbitrarily with the auxiliary form. The following sum-of-squares identity is unchanged by that rotation:
| (12) |
In the basis of Remark 2.2, the diagonal terms sum to , and the off-diagonal terms sum to . For another orthonormal basis, writing its change-of-basis matrix as , the identity shows that the sum of squares is unchanged.
Set and . As in the covariance-eigenbasis argument of [3, Lemma 5.9], gives
| (13) |
We now expand the fourth moment in the independent coefficients, retaining the order of the matrix factors. Using , the three Wick pairings give
| (14) |
Lemma 2.3 bounds the last sum in absolute value by , proving .
For the second estimate, let . Its expectation is zero because the law of is invariant under . Gaussian Poincaré in the independent coordinates gives
| (15) |
Here , and the second inequality uses Parseval and . Finally, for .
The polynomial Gaussian Poincaré inequality used here is recalled with a self-contained proof in Appendix A.1. ∎
The orders in (11) cannot be reduced uniformly over covariance contractions. For the Frobenius-isotropic Gaussian , whose covariance is the identity,
| (16) |
These identities, derived in Appendix A.2, locate the factor of saved over a Frobenius-norm estimate. The appendix also shows by convexity that the isotropic quartic moment is maximal under . The cubic-trace variance bound above uses Gaussian Poincaré, so it does not require a covariance-monotonicity assertion for a sixth-degree polynomial.
3 Uniform control of the local norm change
At scale , the moment bounds of Proposition 2.4, multiplied by , are independent of . To turn them into a statement about the endpoint metric, we need both a remainder bound and feasibility. The deterministic estimate below applies while ; in the probabilistic argument, the same quartic event that bounds its remainder will enforce this condition.
Lemma 3.1 (Metric-change remainder).
If , , and , then
| (17) |
Proof.
For ,
Apply this identity to , where are the eigenvalues of , divide by , and sum. This gives
The triangle inequality and the coefficient bound prove (17). ∎
Proof of the SASC assertion in Theorem 1.3.
Fix as in the theorem, and define by (8). Lemma 2.1 gives . Proposition 2.4, together with , yields
| (18) |
The cubic term is centered and is controlled by its second moment; the quartic term is nonnegative and is controlled by its first moment. Accordingly, define
Chebyshev’s inequality and Markov’s inequality imply
| (19) | ||||
| (20) |
where the final inequalities use . Their sum is less than for .
Before applying the remainder estimate, we use to verify that the endpoint metric is defined. Since and , we have . On ,
Hence , and .
On , substituting and using that commutes with gives
| (21) |
Lemma 3.1 now yields
Thus (6), and hence (4), holds with probability at least . All dependence on the matrix order and scale entered through in (18); the base point and auxiliary form entered only through . This proves the asserted uniformity. ∎
4 The exact strong self-concordance threshold
The probabilistic argument gives SASC at every scale . Necessity for the joint assertion is determined by the deterministic SSC inequality. After the same congruence normalization, the metric derivative acts on symmetric matrices by the anticommutator . Its full spectrum gives the exact Hilbert–Schmidt norm; the extremal direction is a scalar dilation of the base point.
Proposition 4.1 (Normalized derivative identity).
For , , and ,
| (22) |
Consequently, is SSC if and only if .
Proof.
Write and . Differentiating (1) gives
Define . The map satisfies and . Therefore is orthogonal, and the normalized derivative is . Its Hilbert–Schmidt norm equals that of .
Diagonalize , with eigenvalues . In the associated orthonormal symmetric-matrix basis, the eigenvalues of are and for . It follows that
This proves (22), with equality in the final inequality for . Since , (2) holds for every direction exactly when .
It remains to check the ordinary self-concordance prerequisite at these scales. For ,
where , and . Conversely, if , the direction already violates the SSC inequality. ∎
Proposition 4.1 and the SASC estimate in Section 3 prove Theorem 1.3. The extremal SSC direction also explains why (7) is an exact threshold: the derivative normalization is fixed, so reducing makes that direction violate the inequality. SASC permits a different tradeoff because its admissible radius can change with a constant rescaling. If a family is uniformly SASC with radius , then, for any fixed , the family is uniformly SASC with radius . Indeed, put and . Then
and both the norm change and its bound for multiply by . In particular, under Definition 1.2, every at a fixed matrix order is SASC with a radius that may depend on and . A necessary scaling law for SASC alone would therefore have to concern a profile with a radius uniform in . The theorem supplies a linear sufficient profile; the lower bound proved here is the SSC obstruction.
The same scale can be expressed through the barrier’s gradient parameter. Relative to the Frobenius inner product, and , so
Thus the gradient parameter of is : it is at scale , and equals at scale . Thus the SASC guarantee is attained with gradient parameter equal to the ambient dimension. This is a consequence of the local scaling calculation; the mixing results cited in the introduction use their own additional geometric and acceptance estimates.
Appendix A Auxiliary Gaussian calculations
A.1 Polynomial Gaussian Poincaré inequality
Let be a vector of independent standard Gaussian variables. For every polynomial , the inequality follows from a finite Hermite expansion. Define the probabilists’ Hermite polynomials by . Gaussian integration of the product of two generating functions gives , and differentiation in gives . Their leading coefficients are one, so their products form a basis for multivariate polynomials. If , orthogonality, independence, and the derivative identity imply
Here is a multi-index, , and . Comparison of the finite sums proves the required inequality.
A.2 Exact isotropic trace moments
For identity covariance, the coordinate independence permits exact formulas for the two moments in (16). These formulas distinguish the actual trace scale from the larger moments of the Frobenius norm and verify the order used in the main proof. Let have identity covariance in . Its diagonal entries are independent , and its upper-triangular off-diagonal entries are independent , independently of the diagonal entries.
For an orthonormal basis , direct multiplication in the basis of Remark 2.2 gives
| (23) |
The left side is unchanged by an orthogonal change of basis. Applying (14) with and then (23), we obtain
Here , and Parseval applied to gives .
For the cubic moment, write , for , and . Expanding the trace and using gives
The expansion separates diagonal cubic fluctuations, diagonal terms weighted by off-diagonal squares, and triangle monomials. These three terms are pairwise orthogonal in Gaussian . The first two are orthogonal because . Conditional on the off-diagonal entries, both have mean zero, while the triangle term is fixed. Within the second sum, distinct indices have zero cross moment because . Distinct triangle monomials in the last sum also have zero cross moment, since their product contains an edge variable to an odd power. Finally,
It follows that
where the triangle sum is empty for .
The isotropic quartic moment is also the maximum over . To see this without an entrywise comparison, let . For symmetric ,
by (10). Thus is convex. Given a centered Gaussian with covariance , take an independent centered Gaussian with covariance . Then has the same law as , and conditional Jensen gives
This covariance monotonicity argument applies to the convex quartic trace. The cubic-trace second-moment bound used in the main proof instead follows from Gaussian Poincaré.
References
- [1] Y. Kook and S. S. Vempala. Gaussian cooling and Dikin walks: The interior-point method for logconcave sampling. In Proceedings of the 37th Conference on Learning Theory (COLT), volume 247 of Proceedings of Machine Learning Research, pages 3137–3240, 2024. https://proceedings.mlr.press/v247/kook24b.html.
- [2] A. Laddha, Y. T. Lee, and S. S. Vempala. Strong self-concordance and sampling. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pages 1212–1222, 2020. https://doi.org/10.1145/3357713.3384272.
- [3] Z. Song and L. Zhang. A general framework for Metropolis-adjusted Dikin walks: Dimension-square mixing on polytopes and log-det walks on spectrahedra. arXiv:2608.25273v1, 2026. https://arxiv.org/abs/2608.25273v1.
- [4] Y. Chen and Y. Kook. On two proofs of mixing of weighted Dikin walks. arXiv:2608.28566v1, 2026. https://arxiv.org/abs/2608.28566v1.