Skip to content
NewA calmer, faster ZeroHour

Partially Informed Stochastic Optimization via Zeroth-Order Residual Tracking

arXiv cs.AI / cs.LG / cs.CLby El Mahdi Chayti ()1 min read1 · 1 read
AI summary · grok-4.7Summaries by Vani AI

PISO tracks unknown gradient residuals with zeroth-order probes for partially observed stochastic optimization.

PISO addresses optimization where only part of the gradient is observed and the rest must be inferred from function evaluations, including performative prediction, performative reinforcement learning, and black-box bilevel problems. It centres zeroth-order probes on a running residual estimate so variance tracks the estimation error. For smooth nonconvex objectives, stated complexities are O(d²ε⁻⁶) under Lipschitz gradients and O(d²ε⁻⁵) with a Lipschitz Hessian, using one probe, two function samples, and one known-component sample per update. Variants improve on tested baselines with comparable oracle access in three of five settings.

Key facts
  • Combines a known gradient component with a tracked residual estimate
  • Probe variance depends on tracking error rather than residual size
  • Reports O(d²ε⁻⁶) and O(d²ε⁻⁵) function-evaluation complexities
  • Beats comparable-oracle baselines in three of five tested settings
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at arxiv.org

Many optimization problems provide direct access to only part of the gradient, while the remaining component must be inferred from function evaluations. This structure arises in performative prediction, performative reinforcement learning, and bilevel optimization with a black-box lower level.

arXiv cs.AI / cs.LG / cs.CL

By El Mahdi Chayti · arxiv.org

Read the full article at arXiv cs.AI / cs.LG / cs.CL

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.