Reference health
Non-stationary Stochastic Optimization under L_{p,q}-Variation Measures
21/21 checkable references clean · checked 2026-08-29
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.
17 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 21 checked references that resolve
resolves10.1109/tit.2011.2182178
Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
resolves10.1561/2200000024
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
resolves10.1016/j.sorms.2015.03.001
Dynamic pricing and learning: Historical origins, current research, and new directions
resolves10.1109/cdc.2016.7799379
Online optimization in dynamic environments: Improved regret rates for strongly convex problems
resolves10.1109/tit.2011.2165799
Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls
The 17 references without a DOI — listed, not checked
no DOI — not checkedCompeting in the dark: An efficient algorithm for bandit linear optimization
no DOI — not checkedOptimal algorithms for online convex optimization with multi-point bandit feedback
no DOI — not checkedref11
no DOI — not checkedOnline convex optimization in the bandit setting: gradient descent without a gradient
no DOI — not checkedref16
no DOI — not checkedBeyond the regret minimization barrier: Optimal algorithms for stochastic stronglyconvex optimization
no DOI — not checkedBandit convex optimization: Towards tight bounds
no DOI — not checkedOnline optimization: Competing with dynamic comparators
no DOI — not checkedQuery complexity of derivative-free optimization
no DOI — not checkedMulti-armed bandits: Competing with optimal sequences
no DOI — not checkedA survey of algorithms and analysis for adaptive online learning
no DOI — not checkedImproved regret guarantees for online smooth convex optimization with bandit feedback
no DOI — not checkedref32
no DOI — not checkedNoise-adaptive margin-based active learning and lower bounds under tsybakov noise condition
no DOI — not checkedref35
no DOI — not checkedref36
no DOI — not checkedOnline convex programming and generalized infinitesimal gradient ascent
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-29 — 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.3014773"><img src="https://citestamp.com/citestamped/10.2139/ssrn.3014773/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[](https://citestamp.com/citestamped/10.2139/ssrn.3014773)