arXiv Machine Learning October 28, 2026 By Leo Maynard-Zhang, Sunmook Choi, Yahya Sattar, Yassir Jedra, Sarah Dean, Maryam Fazel

Performance Gaps Between Open-Loop, Certainty-Equivalent, and Optimal Control Under Action-Dependent Observations

Read the original on arXiv Machine Learning →

arXiv:2610. 33412v1 Announce Type: new Abstract: In dynamical systems, feedback can improve performance by allowing decisions to depend on past observations, rather than being designed a priori.

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.

arXiv Machine Learning

Sep 22

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

arXiv:2302.07477v4 Announce Type: replace Abstract: We study the optimal sample complexity of tabular reinforcement learning for infinite-horizon discounted Markov decision processes. The unrestricte...

By Shengbo Wang, Jose Blanchet, Peter Glynn

reinforcement-learning

arXiv Machine Learning

Oct 5

Sample complexity of variance-reduced policy gradient: weaker assumptions and lower bounds

arXiv:2610.03165v1 Announce Type: new Abstract: Several variance-reduced versions of REINFORCE based on importance sampling achieve an improved $O(\epsilon^{-3})$ sample complexity to find an $\epsil...

By Gabor Paczolay, Matteo Papini, Alberto Maria Metelli, Istvan Harmati, Marcello Restelli

reinforcement-learning

arXiv Machine Learning

Oct 7

Linear Bandits under Exact Sliding-Window Constraints

arXiv:2610. 08745v1 Announce Type: new Abstract: We study linear bandits under exact sliding-window constraints, where every consecutive block of actions must belong to a prescribed feasible set.

By Seyed Mohammad Hadi Hosseini, Yasin Abbasi-Yadkori, Sattar Vakili

benchmarks

arXiv Machine Learning

Jul 21

When Can Safe Controllers Adapt? Information before Commitment

arXiv:2607. 16895v1 Announce Type: new Abstract: Safe adaptive control is online adaptation under a safety guarantee on the learning trajectory itself.

By Venkatesh Saligrama

safety

arXiv Machine Learning

Aug 17

Consistent Model Chasing Is Minimax Optimal: The Exact Value of Scalar Adversarial Adaptive Control under Large Parametric Uncertainty

arXiv:2608. 13651v1 Announce Type: cross Abstract: We solve exactly a fundamental problem of adaptive control against adversarial disturbances: regulate the scalar system $x_{t+1} = ax_t + u_t + w_t$, $x_0=0$, $\|w\|_\infty \le 1$, where the constant pole $a \in [-\Delta, \Delta]$ is unknown in sign and magnitude and $\Delta$ is arbitrarily large.

By Dimitar Ho

safety

arXiv Statistics ML

Sep 2

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits

arXiv:2511.08097v2 Announce Type: replace-cross Abstract: We consider a general infinite horizon Heterogeneous Restless multi-armed Bandit (RMAB). Heterogeneity is a fundamental problem for many real...

By Dheeraj Narasimha, Nicolas Gast

reinforcement-learning

One email a morning, machine-written

Related stories

Optimal Sample Complexity of Stable Discounted Markov Decision Processes

Sample complexity of variance-reduced policy gradient: weaker assumptions and lower bounds

Linear Bandits under Exact Sliding-Window Constraints

When Can Safe Controllers Adapt? Information before Commitment

Consistent Model Chasing Is Minimax Optimal: The Exact Value of Scalar Adversarial Adaptive Control under Large Parametric Uncertainty

Model Predictive Control is almost Optimal for Heterogeneous Restless Multi-armed Bandits