Signals 4 · free daily AI digest

Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems

Paper recorded by Signals 4 on 2026-09-24 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-24 on arXiv · recorded by Signals 4 on 2026-09-25

Category: cs.LG · 机器学习 · first seen 2026-09-25

Abstract

We study the deterministic oracle complexity of finding approximate solutions to composite monotone inclusion problems, formed by the sum of a smooth single-valued monotone operator and a maximally monotone set-valued operator, under the tangent-residual criterion. We introduce the Anchored Extra-Proximal (AEP) framework, which combines an anchored extrapolation step with an inexact anchored proxi

Read on arXiv →

#4 most recent of 293 cs.LG papers we have recorded · ↑ newer: A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bod · ↓ older: The Alignment Illusion in Multimodal Large Language Models
Cite this page: Anchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems: the #4 most recent of 293 cs.LG papers we have recorded (as of 2026-09-24). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/anchored-extra-proximal-methods-optimal-higher-order-methods-for-monotone-inclus.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.LG papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions