PulseAugur
EN
LIVE 10:37:31

New algorithms achieve optimal competitive ratios for convex function chasing

By PulseAugur Editorial · [1 sources] ·

Researchers have developed new algorithms for the problem of chasing convex functions, which involves a learner and an adversary. For Euclidean movement, a new method called Clipped Proximal Descent (CPD) achieves an O(kappa^(1/3)) competitive ratio for smooth convex functions with quadratic growth, improving upon previous bounds. For squared Euclidean movement, the optimal dimension-free competitive ratio for convex functions with quadratic growth has been established through a refined analysis of Regularized Online Balanced Descent (R-OBD) and a matching lower bound. AI

IMPACT Establishes new theoretical bounds for optimization algorithms relevant to machine learning.

RANK_REASON The cluster contains an academic paper detailing new algorithms and theoretical results in machine learning. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New algorithms achieve optimal competitive ratios for convex function chasing

How we ranked this

Signal score
13 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
The cluster contains an academic paper detailing new algorithms and theoretical results in machine learning. [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
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

Full methodology in our editorial standards.

COVERAGE [1]

  1. arXiv cs.LG TIER_1 English(EN) · Linzhe He, Sifan Yang, Wei Jiang, Lijun Zhang ·

    Optimal Competitive Ratios for Chasing Convex Functions with Quadratic Growth

    arXiv:2611.08078v1 Announce Type: new Abstract: Chasing convex function has attracted much attention in recent years, which can be formulated as a game between a learner and an adversary. In each round, the adversary reveals a convex function, and the learner selects a decision a…

RELATED ENTITIES

RELATED TOPICS