arXiv Machine Learning August 18, 2026 By Karthick Krishna M., Haricharan Balasundaram, Rahul Vaze

Convex Optimization with Nested Evolving Feasible Sets

Read the original on arXiv Machine Learning →

arXiv:2605. 07386v2 Announce Type: replace Abstract: \emph{Convex Optimization with Nested Evolving Feasible Sets (CONES)} is considered where the objective function $f$ remains fixed but the feasible region evolves over time as a nested sequence $S_1 \supseteq S_2 \supseteq \cdots \supseteq S_T$.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

benchmarks

arXiv Machine Learning

Jul 15

A Geometric Approach to Constrained Online Learning

arXiv:2605. 21107v2 Announce Type: replace Abstract: We study constrained online convex optimization with adversarial time-varying constraints.

By Dhruv Sarkar, Abhishek Sinha

safety

arXiv Machine Learning

Aug 10

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory

arXiv:2602. 06902v3 Announce Type: replace Abstract: In this paper, we study dynamic regret in unconstrained online convex optimization (OCO) with movement costs.

By Hao Qiu, Andrew Jacobsen, Emmanuel Esposito, Mengxiao Zhang

arXiv Machine Learning

Jul 14

Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)

arXiv:2607. 10808v1 Announce Type: new Abstract: The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action $x_t \in \mathcal{X} \subset \mathbb{R}^d$, a convex loss function $f_t$ and a convex constraint function $g_t$ that drives the constraint $g_t(x)\le 0$ are revealed.

By Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze

benchmarks

arXiv Machine Learning

Jun 29

Learning in Markovian bandits with non-observable states and constrained decision epochs

arXiv:2606. 27448v1 Announce Type: new Abstract: This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs.

By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop

reinforcement-learning benchmarks safety

arXiv Machine Learning

Jul 23

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

arXiv:2607. 19854v1 Announce Type: new Abstract: We study horizon-free regret minimization for finite-horizon time-homogeneous tabular Markov decision processes with $S$ states, $A$ actions, horizon $H$, and per-trajectory total reward bounded by $1$.

By Runlong Zhou, Zihan Zhang, Maryam Fazel, Simon S. Du

reinforcement-learning

arXiv Machine Learning

Jun 5

Regret Minimization with Adaptive Opponents in Repeated Games

arXiv:2606. 06486v1 Announce Type: new Abstract: In this paper, we study regret minimization in repeated games with \emph{adaptive} opponents who can respond based on histories of play.

By Mingyang Liu, Asuman Ozdaglar, Tiancheng Yu, Kaiqing Zhang

Related stories

A Geometric Approach to Constrained Online Learning

Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory

Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)

Learning in Markovian bandits with non-observable states and constrained decision epochs

Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence

Regret Minimization with Adaptive Opponents in Repeated Games