Trenton Lau

Abstract: The exact computation of the Normalized Maximum Likelihood (NML) codelength for regular non-smooth estimators (e.g., Lasso) has been historically limited by the cubic scaling walls of manifold-constrained projection and volume integration. At each step of the geometric Propose-and-Project Metropolis–Hastings (PPMH) sampler, evaluating the projection operator requires inverting an \( (N + k) \times (N + k) \) generalized KKT matrix, while calculating the volume factor requires the determinant of an \( (N - k) \times (N - k) \) Gram matrix. This paper presents an exact, mathematically equivalent formulation that bypasses both bottlenecks by utilizing the block Schur complement and Sylvester’s determinant identity. We prove that the computational complexity of both operations collapses from \( \mathcal{O}(N^3) \) to \( \mathcal{O}(k^3 + N^2k) \) per step. We generalize this reduction to Sparse Support Vector Machines (SVMs), Elastic Net, and Group Lasso. Finally, we provide a rigorous numerical stability analysis and evaluate the sampler’s efficiency using the Effective Sample Size (ESS) per second. Our empirical benchmarks on high-dimensional datasets confirm a constant speedup exceeding \( 14{,}100\times \) while maintaining double-precision numerical equivalence, rendering exact non-smooth NML estimation highly tractable for large-scale statistical inference.

Abstract: The Normalized Maximum Likelihood (NML) codelength, or stochastic complexity, represents a principled criterion for universal coding. While recent coarea-based formulations provided a calculation method for smooth models, this framework collapses for the non-smooth estimators ubiquitous in modern machine learning (e.g., Lasso, Sparse SVMs). In this work, we provide a rigorous framework for computing the NML for regular path-differentiable Lipschitz (PDL) estimators. By applying classical geometric measure theory and bridging the coarea formula with conservative Jacobians, we prove that the stochastic complexity for non-smooth models is well-posed and theoretically consistent with the outputs of modern Automatic Differentiation. To compute this quantity exactly, we introduce the Propose-and-Project Metropolis–Hastings (PDL-PPMH) sampler, a geometric MCMC algorithm capable of traversing the non-differentiable level sets of the maximum likelihood estimator. We theoretically justify its components, including a stochastic tangent space proposal and a provably convergent non-smooth projection solver. We demonstrate the method’s robustness by sampling from a high-dimensional Lasso posterior (\( P = 2000 \ )), while simultaneously quantifying the computational scaling that governs the trade-off between exactness and mixing time. Crucially, we empirically demonstrate that our exact NML criterion provides a highly data-efficient alternative to cross-validation, achieving statistically indistinguishable predictive optima without requiring data splitting. Altogether, our work paves the way for the theoretical analysis of the NML codelength for regular non-smooth models.

Abstract: We study explosive connectivity and mechanical rigidity in three-dimensional cubic lattice structures under Achlioptas-type product-rule dynamics. Our work combines extensive numerical simulation with the development of a new theoretical framework. For connectivity, we rigorously establish the presence of sublinear-width merger-cascade windows for \( k \ge 2 \), which drive macroscopic jumps in the order parameter and imply a first-order transition. For rigidity, we discover numerically that for richly-connected hosts, increasing the number of choices \( k \) monotonically enhances the efficiency of rigidification. To explain this phenomenon, we propose a theoretical model centered on a conditional progress function that links an edge’s local product-rule score to its global mechanical utility. We show that this function becomes non-increasing, thus explaining the observed monotonic efficiency, under two physically-motivated assumptions. Altogether, our work provides new insights into the relationship between local dynamics and global connectivity and rigidity in cubic lattice structures via both theory and computation.