English(EN) Dynamic Optimistic Constrained OCO with Memory via Delay Equivalence

新框架解决具有记忆和动态约束的在线学习问题

作者 PulseAugur 编辑部 · [1 个来源] · 2026-11-06 05:00

研究人员引入了一个新的在线凸优化框架，该框架具有记忆和时变约束（COCO-M），旨在捕捉有状态在线学习和具有预算约束的非随机控制的动态。所提出的乐观算法结合了不可信的预测来管理通用动态遗憾和累积约束违反。这项工作首次建立了同时适应环境非平稳性和预测准确性的界限，改进了先前受限的假设，并提供了子线性最坏情况保证，这些保证会随着预测准确性的提高而增强。 AI

影响引入了一种新的有状态在线学习和控制框架，有可能提高动态环境下的效率。

排序理由学术论文，详细介绍了一种新的在线凸优化算法框架。[lever_c_demoted from research: ic=1 ai=1.0]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。我们如何撰写摘要 →

本文如何被排名

Signal score: 12 / 100; Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket: Tool; 学术论文，详细介绍了一种新的在线凸优化算法框架。[lever_c_demoted from research: ic=1 ai=1.0]
Source corroboration: Single-source cluster; Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics: paper, other; Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance: High; Clearly on-topic for AI-industry coverage.
Story freshness: Same-day; Cluster formed today. Ranking reflects the current source set at time of score.

完整方法见我们的编辑标准。

报道来源 [1]

arXiv cs.LG TIER_1 English(EN) · Mohammed Abdullah, George Iosifidis, Salah Eddine Elayoubi, Tijani Chahed · 2026-11-06 05:00

带记忆的动态乐观约束OCO通过延迟等价实现

arXiv:2611.08302v1 Announce Type: new Abstract: Online Convex Optimization with memory and time-varying constraints (COCO-M) is a recently-introduced framework that captures the dynamics of stateful online learning and non-stochastic control with budget constraints. Despite its e…

本文如何被排名

报道来源 [1]

带记忆的动态乐观约束OCO通过延迟等价实现

相关实体

相关话题