Reference health
Regularized Online Exponentially Concave Optimization
17/17 checkable references clean · checked 2026-08-27
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
18 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 17 checked references that resolve
resolves10.1145/1553374.1553493
Stochastic methods for
<i>l</i>
<sub>1</sub>
regularized loss minimization
resolves10.1016/j.neucom.2017.06.084
Incremental on-line learning: A review and comparison of state of the art algorithms
resolves10.1016/j.neucom.2022.05.024
Distributed online convex optimization with a bandit primal-dual mirror descent push-sum algorithm
resolves10.1016/j.neucom.2019.03.094
Online distributed stochastic learning algorithm for convex optimization in time-varying directed networks
The 18 references without a DOI — listed, not checked
no DOI — not checkedEfficient online and batch learning using forward backward splitting
no DOI — not checkedDual averaging method for regularized stochastic learning and online optimization
no DOI — not checkedComposite objective mirror descent
no DOI — not checkedSparse Online Learning via Truncated Gradient
no DOI — not checkedOnline convex programming and generalized infinitesimal gradient ascent
no DOI — not checkedOnline convex programming and generalized infinitesimal gradient ascent
no DOI — not checkedStrongly adaptive online learning over partial intervals
no DOI — not checkedBeyond logarithmic bounds in online learning
no DOI — not checkedProjection-free online learning
no DOI — not checkedOptimal strategies and minimax lower bounds for online convex games
no DOI — not checkedBeyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
no DOI — not checkedA simple analysis for exp-concave empirical minimization with arbitrary convex regularizer
no DOI — not checkedLower and upper bounds on the generalization of stochastic exponentially concave optimization
no DOI — not checkedConvergence rates of inexact proximalgradient methods for convex optimization
no DOI — not checkedEfficient second order online learning by sketching
no DOI — not checkedRobust frequent directions with application in online learning
no DOI — not checkedref34
no DOI — not checkedLogistic regression: Tight bounds for stochastic and online optimization
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-08-27 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.2139/ssrn.4651334"><img src="https://citestamp.com/citestamped/10.2139/ssrn.4651334/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.2139/ssrn.4651334)