AINewsnow

Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps

This story is from 2026-09-10. It is preserved in the archive; the latest stories are on the live feed.

arXiv:2609.09524v1 Announce Type: cross Abstract: We study the oracle complexity of computing a point with small fixed-point residual $\|T(x)-x\| \leq \epsilon$, for a general norm $\|\cdot\|$ and a self-map $T$ of a compact convex set. We study this problem in the setting where $T$ is nonexpansive…

Read the full story at arXiv stat.ML ↗

Timeline · 1 report

  1. 2026-09-10 04:00 · arXiv stat.ML
    Oracle Complexity of Stochastic Fixed-Point Equations with Nonexpansive Maps

More stories

  1. Trump announces a new 'AI Force,' but says he will not 'stifle' AI — Business Insider AI
  2. Introducing Kimi K3 on Amazon Bedrock — AWS Machine Learning Blog
  3. Introducing Amazon SageMaker HyperPod Inference Gateway — AWS Machine Learning Blog
  4. Anthropic, OpenAI, SpaceXAI, Google sued over call to ‘pace’ AI development — Politico Technology
  5. Google's Gemini AI hacks three other companies during security test — Sky News Technology
  6. Gemini Hacked Three Companies in First Known Breakout by Google’s AI — Wall Street Journal Technology
  7. OpenAI reveals cases of ‘concerning’ AI behaviour as it announces new disclosure system — The Guardian AI
  8. AI's role in building AI surging? Anthropic says Claude now leads 26% of its R&D — Mint AI

Get the daily brief of stories like this at 6:30 every morning →