Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§8.2.1, p. 65 — the distributed-lasso z-update is z = S_{λ/ρN}(x̄ + ū)

Proved
BoydADMM.ModelFit.lasso_z_update_soft_threshold

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

admmlassop2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-bookp2o-v1soft-thresholding

Let N≥1N\ge 1N≥1 be the number of data blocks, λ>0\lambda>0λ>0, ρ>0\rho>0ρ>0, and let x1,…,xN,u1,…,uN∈Rnx_1,\dots,x_N,u_1,\dots,u_N\in\mathbb R^nx1​,…,xN​,u1​,…,uN​∈Rn be the local variables xik+1x_i^{k+1}xik+1​ and scaled dual variables uiku_i^kuik​, with averages xˉ=1N∑ixi\bar x=\frac1N\sum_i x_ixˉ=N1​∑i​xi​ and uˉ=1N∑iui\bar u=\frac1N\sum_i u_iuˉ=N1​∑i​ui​. With the lasso regularizer r(z)=λ∥z∥1r(z)=\lambda\|z\|_1r(z)=λ∥z∥1​, the zzz-update of global-consensus ADMM minimizes

λ∥z∥1+Nρ2∥z−xˉ−uˉ∥22.\lambda\|z\|_1+\frac{N\rho}{2}\|z-\bar x-\bar u\|_2^2 .λ∥z∥1​+2Nρ​∥z−xˉ−uˉ∥22​.

A point z∈Rnz\in\mathbb R^nz∈Rn minimizes this function if and only if, for every component jjj,

zj=Sλ/(ρN)(xˉj+uˉj),z_j=S_{\lambda/(\rho N)}\bigl(\bar x_j+\bar u_j\bigr),zj​=Sλ/(ρN)​(xˉj​+uˉj​),

where SκS_\kappaSκ​ is the soft thresholding operator. In particular the minimizer is unique.

This is the gathering step of the distributed lasso: after averaging, the consensus update is a componentwise soft thresholding.

Formalization Note The book writes the threshold as λ/ρN\lambda/\rho Nλ/ρN, meaning λ/(ρN)\lambda/(\rho N)λ/(ρN). The objective is the general zzz-update of p. 65 with r=λ∥⋅∥1r=\lambda\|\cdot\|_1r=λ∥⋅∥1​ (the lasso regularizer of §8.1.1, p. 62). The statement is an equivalence, which includes existence and uniqueness. λ\lambdaλ is lam in Lean.

Preamble
import Mathlib
import Definitions.Def_BoydADMM_ModelFit_Basic

open Matrix
Formal statement
namespace BoydADMM.ModelFit

/-- §8.2.1, p. 65: the distributed-lasso `z`-update
`argmin_z (λ‖z‖₁ + (Nρ/2)‖z − x̄ − ū‖₂²)` is soft thresholding `S_{λ/(ρN)}(x̄ + ū)`, componentwise. -/
theorem lasso_z_update_soft_threshold {N n : ℕ} (hN : 0 < N)
    (x u : Fin N → EuclideanSpace ℝ (Fin n)) (lam ρ : ℝ) (hlam : 0 < lam) (hρ : 0 < ρ)
    (z : EuclideanSpace ℝ (Fin n)) :
    IsMinOn (fun z' : EuclideanSpace ℝ (Fin n) =>
        lam * l1norm z' + (N : ℝ) * ρ / 2 *
          ‖z' - (N : ℝ)⁻¹ • (∑ i, x i) - (N : ℝ)⁻¹ • (∑ i, u i)‖ ^ 2) Set.univ z ↔
      ∀ j, z j = BoydADMM.Prox.softThreshold (lam / (ρ * N))
        (((N : ℝ)⁻¹ • (∑ i, x i)) j + ((N : ℝ)⁻¹ • (∑ i, u i)) j) := by sorry

end BoydADMM.ModelFit
Source
Boyd, Parikh, Chu, Peleato, Eckstein, Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers, Found. Trends Mach. Learn. 3(1) (2011), p. 65, §8.2 (z-update) and §8.2.1
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me