Differentiation of the HTMC norm
Ascertain a principled method to differentiate the Harder than Monte Carlo (HTMC) norm ∥f∥_{H^γ}—defined via infinite sequences of binary circuits—so that gradient-based optimization methods can be applied to circuit-size minimization in the HTMC regime.
References
The convexity of the HTMC regime hints at the potential to use of convex optimization to solve the MCSP, but it is unclear how one could differentiate the HTMC norm because it is defined in terms of a discrete structure: infinite sequences of binary circuits.
— Deep Learning as a Convex Paradigm of Computation: Minimizing Circuit Size with ResNets
(2511.20888 - Jacot, 25 Nov 2025) in Subsection: Sandwich bound (following Theorem 2.1)