A nested-projection gradient algorithm attains O(log T) regret with O(log T) cumulative constraint violation for strongly convex losses, and O(√T) for both with convex losses; the body's proof is coherent, though the abstract claims lower-bound results the body never contains.
Outlier-Robust Greedy Pursuit Algorithms in _
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LG 2years
2026 2representative citing papers
citing papers explorer
-
A Geometric Approach to Constrained Online Learning
A nested-projection gradient algorithm attains O(log T) regret with O(log T) cumulative constraint violation for strongly convex losses, and O(√T) for both with convex losses; the body's proof is coherent, though the abstract claims lower-bound results the body never contains.
- Constrained Contextual Bandits with Adversarial Contexts