Sign inGet started
Paper · arXiv

Logarithmic Regret via Passive Change Detection in Piecewise-Stationary Self-Tuning Regulation

We study minimum-variance control of an unknown autoregressive system with exogenous inputs and coefficients that change at unknown times. Under bounded independent disturbances, fixed detection gaps, stability and feasibility conditions, and sufficient time between changes, we prove \(O((C+1)\log((T+1)/δ))\) regret with probability at least \(1-δ\), where \(T\) is the horizon and \(C\) the number of changes. Unlike switching bandits, where unselected arms can change unobserved, admissible plant changes provide information during exploitation: the correct feasible controller leaves only the disturbance in the output, whereas a detectable change raises output energy under the old controlle...

AuthorsA. Ch. Madhusudanarao, Rahul Singh
Primary categorycs.LG
Published7 October 2026
Last updated at source7 October 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/7aa47f4f-56fe-4908-b8a6-bc8f2ace8db6" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.