Cover Image

Online Convex Optimisation: The Optimal Switching Regret for all Segmentations Simultaneously

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pasteris, Stephen, Hicks, Chris, Mavroudis, Vasilios, Herbster, Mark
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fairness with Exponential Weights
by: Pasteris, Stephen, et al.
Published: (2024)

Extraction Propagation
by: Pasteris, Stephen, et al.
Published: (2024)

Nearest Neighbour with Bandit Feedback
by: Pasteris, Stephen, et al.
Published: (2023)

Inherently Interpretable and Uncertainty-Aware Models for Online Learning in Cyber-Security Problems
by: Kolicic, Benjamin, et al.
Published: (2024)

A View on Out-of-Distribution Identification from a Statistical Testing Theory Perspective
by: Caron, Alberto, et al.
Published: (2024)

On Efficient Bayesian Exploration in Model-Based Reinforcement Learning
by: Caron, Alberto, et al.
Published: (2025)

Towards Causal Model-Based Policy Optimization
by: Caron, Alberto, et al.
Published: (2025)

Adversarial Online Collaborative Filtering
by: Pasteris, Stephen, et al.
Published: (2023)

Beyond Rewards in Reinforcement Learning for Cyber Defence
by: Bates, Elizabeth, et al.
Published: (2026)

Mitigating Deep Reinforcement Learning Backdoors in the Neural Activation Space
by: Vyas, Sanyam, et al.
Published: (2024)

Less is more? Rewards in RL for Cyber Defence
by: Bates, Elizabeth, et al.
Published: (2025)

Autonomous Network Defence using Reinforcement Learning
by: Foley, Myles, et al.
Published: (2024)

Entity-based Reinforcement Learning for Autonomous Cyber Defence
by: Thompson, Isaac Symes, et al.
Published: (2024)

Beyond Training-time Poisoning: Component-level and Post-training Backdoors in Deep Reinforcement Learning
by: Vyas, Sanyam, et al.
Published: (2025)

An Attentive Graph Agent for Topology-Adaptive Cyber Defence
by: Sandoval, Ilya Orson, et al.
Published: (2025)

Bandits with Abstention under Expert Advice
by: Pasteris, Stephen, et al.
Published: (2024)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

DRMD: Deep Reinforcement Learning for Malware Detection under Concept Drift
by: McFadden, Shae, et al.
Published: (2025)

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
by: Ye, Haishan
Published: (2026)

SoK: The Pitfalls of Deep Reinforcement Learning for Cybersecurity
by: McFadden, Shae, et al.
Published: (2026)

Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal
by: Ziomek, Juliusz, et al.
Published: (2024)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Small Gradient Norm Regret for Online Convex Optimization
by: Gao, Wenzhi, et al.
Published: (2026)

Achieving Optimal Static and Dynamic Regret Simultaneously in Bandits with Deterministic Losses
by: Qian, Jian, et al.
Published: (2026)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
by: Yang, Wenhao, et al.
Published: (2025)

Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization
by: Supantha, Subhamon, et al.
Published: (2025)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Adaptivity and Universality: Problem-dependent Universal Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2025)

Bayesian Optimistic Optimisation with Exponentially Decaying Regret
by: Tran-The, Hung, et al.
Published: (2021)

Environment Complexity and Nash Equilibria in a Sequential Social Dilemma
by: Yasir, Mustafa, et al.
Published: (2024)

CybORG++: An Enhanced Gym for the Development of Autonomous Cyber Agents
by: Emerson, Harry, et al.
Published: (2024)

Differential Privacy in the Extensive-Form Bandit Problem
by: Pasteris, Stephen, et al.
Published: (2026)

Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications
by: Liu, Zijian
Published: (2025)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
by: Jia, Tingkai, et al.
Published: (2026)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Structure-Dependent Regret and Constraint Violation Bounds for Online Convex Optimization with Time-Varying Constraints
by: Liu, Xiufeng, et al.
Published: (2026)

Poisoning Attacks on LLMs Require a Near-constant Number of Poison Samples
by: Souly, Alexandra, et al.
Published: (2025)

Model-Free, Regret-Optimal Best Policy Identification in Online CMDPs
by: Zhou, Zihan, et al.
Published: (2023)