age of information 1no-regret learning 1online convex optimization 1real-time scheduling 1safety-critical IoT 1
From the 1 of 6 linked papers with an AI index.
1 citations · 1 across the 5 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026
Real-Time Hard Peak Age-of-Information Safety with No-Regret Learning
Wentao Zhang, Wentao Mo
The paper proposes an online convex optimization method (OCO-PAoI-Hard) that guarantees zero per-slot violations of hard peak Age of Information deadlines in safety‑critical IoT sy…
cs.LG2026
Noise-Adaptive High-Probability Regret Bounds for Online Convex Optimization
Wentao Zhang, Yutong Zhang, Wentao Mo
We study high-probability regret bounds for online convex optimization (OCO) with strongly convex losses and establish three results that resolve open questions at the intersection…