← Back to all news
arXiv Machine Learning 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\).

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
1d ago

Sharp Oracle-Regret Tradeoffs for Projection-Free Online Convex Optimization

The paper studies online convex optimization when the learner can only query an exact linear optimization oracle. It establishes a dimension‑free minimax expected regret bound of θ(GD max{√T, T/(1+min{Q,BT})^{1/4}}) for convex G‑Lipschitz losses, where Q is the total oracle budget and B the per‑round limit. The authors provide matching lower and upper bounds, showing how strict per‑round or total‑budget constraints affect the achievable regret, and extend the analysis to smooth losses with curvature‑dependent bounds.

By Vaneet Aggarwal
More like this →