Finite-Sum Weak Minty Inclusions
Descriptions may be stale. Consult the linked Lean sources.
Finite-Sum Weak Minty Inclusions
We consider finding
More precisely, the inclusion is
Our assumptions:
Assumption 1 (Monotonicity and resolvent access).
For every
Assumption 2 (Finite-sum Lipschitz bounds). For all
Assumption 3 (Weak Minty solution and initial
distance). There exists
A component query
After the allotted calls, the output
Results
In a real Hilbert space with its Borel measurable structure,
| Result | Oracle complexity | Novelty | Limitations |
|---|---|---|---|
| (1) VarianceReducedWeakMintyInclusion
(Ours) |
Deterministic total-call budget. |
||
(2) (Pethick et al. 2025, Cor. 6.3) Full weak-Minty range; finite-dimensional setting. |
(1): For |
(1): Variance-reduced
branch needs known |
|
(3) (Tran-Dinh and Nguyen-Trung 2026, sec. 3.3, Corollaries 2–3) Finite-dimensional; |
Expected component and resolvent calls; |
(1): Scope: |
(1): Larger universal constants. |
(4) (Cai et al. 2023, Cor. 4.5) Special case: |
For |
(1): Scope: graph weak
Minty, arbitrary monotone |
(1): |
(5) (Alizadeh et al. 2025, Cor. 2, v3) Euclidean special case: |
Claimed Existential iterate satisfying |
(1): Full |
(1): No cost saving against (5)’s claimed bound on this restricted range; accuracy criteria differ. |
Abbr: