Paper tackles online optimization with memory and competitive control.
problem Minimizing hitting and switching costs in online optimization problems.
method Optimistic Regularized Online Balanced Descent algorithm.
result Achieves a constant, dimension-free competitive ratio.
New algorithm achieves logarithmic regret for adversarial online control.
problem Online linear-quadratic control in systems with adversarial disturbances.
method Characterization of optimal offline control law, reduced to online learning with approximate advantage functions.
result First algorithm with logarithmic regret for arbitrary adversarial disturbance sequences.
New control methods for systems with adversarial perturbations.
problem Control systems with adversarial noise.
method Online convex optimization and convex relaxations.
result Low regret policies against adversarial perturbations.
Biological research often involves testing a growing number of null hypotheses as new data is accumulated over time. We study the problem of online control of the familywise error rate (FWER), that is testing an apriori unbounded sequence of hypotheses (p-values) one by one over time without knowing the future, such th…
Develops a framework to control risk in online learning models.
problem Rigorous uncertainty quantification for online learning models.
method A framework for constructing uncertainty sets that provably control risk.
result Guarantees risk control at any user-specified level even with distribution shifts.
New algorithms control FDX while achieving more power in online multiple testing.
problem Problems with previous online multiple testing methods, including high FDX and low power.
method Developed new dynamic algorithms that adjust testing levels based on accumulated wealth.
result SupLORD algorithm achieves higher power and FDR control in synthetic experiments.
New algorithm reduces control error in systems with changing dynamics.
problem Online control of systems with time-varying linear dynamics.
method Introduces adaptive regret metric and a novel meta-algorithm.
result First adaptive regret bound for online convex optimization with memory.
Paper tackles online control of linear systems with unbounded noise.
problem Online control of linear systems under unbounded noise with unknown convex cost functions.
method Developed an algorithm achieving i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) high-probability regret under unbounded noise, and established O ( m p o l y ( log T ) ) O({
m poly} (\log T)) O ( m p o l y ( log T )) regret bound for strongly convex costs and sub-Gaussian noise. result Achieved i l d e O ( T ) ilde{O}(\sqrt{T}) i l d e O ( T ) high-probability regret under unbounded noise, and O ( m p o l y ( log T ) ) O({
m poly} (\log T)) O ( m p o l y ( log T )) regret bound for specific noise and cost conditions. New algorithm reduces decision switching in dynamic environments.
problem Online learning with memory and non-stationary environments.
method Dynamic policy regret, novel ensemble approach, meta-base decomposition.
result Proves optimal dynamic policy regret for memory length, non-stationarity, and time horizon.
New framework for online control in evolving populations.
problem Control of evolving populations in real-world conditions.
method Online control framework for linear and non-linear dynamical systems.
result Near-optimal regret bounds for gradient-based controllers.
New online learning algorithms improve cyberattack detection in industrial control systems.
problem Detecting cyberattacks in industrial control systems with limited resources.
method Online learning algorithms to process continuous data streams and address class imbalance.
result Improved detection rate of cyberattacks in industrial control systems.
Automates quality control for synthetic CTs generated from MR images.
problem Prevent downstream errors in RT treatment planning from synthetic CTs.
method Ensemble of sCT generators and uncertainty measure based on their disagreement.
result Uncertainty measure can detect input images outside expected MR distribution and sCT images with potential errors.
We consider Online Convex Optimization (OCO) in the setting where the costs are m m m -strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed Online Balanced Descent (OBD) algorithm is constant competitive in this setting, with competitive rat…
New method controls false discoveries in real-time data streams.
problem Online testing of hypotheses with strict error constraints and no future data.
method Structure-adaptive sequential testing (SAST) with alpha-investment algorithm.
result Substantial power gain over existing online testing rules.
We study data poisoning attacks in the online setting where training items arrive sequentially, and the attacker may perturb the current item to manipulate online learning. Importantly, the attacker has no knowledge of future training items nor the data generating distribution. We formulate online data poisoning attack…
New findings control FDR for online testing methods under positive dependence.
problem Maintaining FDR control for online testing methods under positive dependence.
method Developed new methods to control FDR for online testing procedures under positive dependence.
result SAFFRON and LORD control FDR under positive dependence, not just conditional superuniformity.
CAP algorithm controls FCR in online selective prediction.
problem Online predictive tasks with temporal multiplicity and FCR control.
method CAP framework with adaptive pick rule and calibration set construction.
result CAP achieves exact selection-conditional coverage guarantee and FCR control.
e-LOND algorithm controls FDR in online testing with arbitrary dependencies.
problem Online testing of hypotheses with unknown dependencies.
method e-LOND algorithm for FDR control under arbitrary dependence.
result e-LOND provides more power than existing methods through simulations.
New rules control false discoveries in online anomaly detection for time series data.
problem Controlling false discoveries in anomaly detection for time series data.
method Novel online false discovery rate control (FDRC) rules for time series anomaly detection.
result Ensures high power in detecting anomalies even when the alternative is rare and test statistics are serially dependent.
Optimal control in changing systems without strong convexity assumptions.
problem Adversarial changes in convex costs for unknown linear systems.
method Non-convex lower confidence bounds and computationally-efficient regret minimization.
result Achieves T \smash{\sqrt{T}} T -regret rate, optimal compared to best stabilizing controller. New method controls false discoveries in online testing with deadlines.
problem Controlling false discoveries in online hypothesis testing with decision deadlines.
method Benjamini-Hochberg-type procedure over a moving window of hypotheses with adaptive threshold parameters.
result Controls false discovery rate at every stage and adaptively chosen stopping times.
AntLer anticipates future learning to improve control performance.
problem Improving control performance through online learning is not well understood.
method AntLer uses a probabilistic model to anticipate future learning and optimize control parameters.
result AntLer approximates optimal solutions with high probability.
AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.
problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.
New algorithm achieves optimal regret in non-stochastic control, showing stochasticity is not beneficial.
problem Achieving optimal control in non-stochastic systems with adversarial noise.
method Novel online Newton step algorithm adapted to adversarial disturbances, using policy regret bounds.
result Optimal O ~ ( T ) \widetilde{\mathcal{O}}(\sqrt{T}) O ( T ) regret achieved in unknown dynamics, p o l y ( log T ) \mathrm{poly}(\log T) poly ( log T ) regret in known dynamics. New approach generates optimal disturbances for controller verification.
problem Optimizing disturbances for controller verification with blackbox access.
method Online learning approach that adaptively generates disturbances based on controller inputs.
result New algorithm (MOTR) outperforms existing methods in simulated examples.
Paper proposes online optimization for uncertain systems using machine learning and DRO.
problem Optimization of uncertain dynamical systems with distributional uncertainty.
method Combines machine learning with Distributional Robust Optimization (DRO) to handle uncertainty.
result Online solutions with probabilistic regret bounds for uncertain systems.
Simple online monitor detects unsafe LLM outputs.
problem LLMs generate unsafe outputs despite training.
method Thresholding external verifier signal to decide alarms.
result Simple design competitive with advanced methods.
Majorizing measures control sequential complexities for online learning.
problem Extending classical empirical processes theory to sequential cases.
method Generic chaining, majorizing measures, fractional covering numbers.
result Sharp control of worst-case sequential Rademacher complexity.
PCGS-TF uses a Transformer to adaptively control expert switching in non-stationary environments.
problem Static regret is insufficient for strictly online prediction in non-stationary settings.
method Policy-Controlled Generalized Share (PCGS) with a Transformer as an update controller.
result PCGS-TF achieves the lowest dynamic regret in non-stationary families and expert pools.
A/B testing improves marketing decisions by selecting effective stratification variables.
problem Improving the sensitivity of A/B testing through stratified sampling.
method Designing an algorithm to select a subset of stratification variables for variance reduction.
result The subset selection method outperforms other variance reduction techniques in A/B testing.
Private online FDR control for adaptive testing under differential privacy.
problem Controlling false discoveries in adaptive multiple hypothesis testing with privacy constraints.
method Private online algorithms based on non-private results, ensuring privacy and statistical performance.
result Strong guarantees for privacy and statistical performance in FDR and power.
New controller reduces regret in non-stochastic control with adversarial perturbations.
problem Non-stochastic control with adversarial perturbations and partially observed states.
method Denoised observations and online gradient descent.
result Sublinear regret bounds, optimal for known and unknown systems.
MaxCOSD algorithm tackles non-i.i.d. demands and stateful dynamics in online inventory control.
problem Managing inventory with non-i.i.d. demands and stateful dynamics.
method MaxCOSD, an online algorithm with provable guarantees for non-degeneracy assumptions.
result MaxCOSD achieves optimal performance for non-i.i.d. demands and stateful dynamics.
Efficient learning-based MPC for unknown nonlinear systems with state constraints.
problem Control of discrete-time nonlinear systems with unknown dynamics and state constraints.
method Receding horizon reinforcement learning (r-LPC) using Koopman operator-based prediction model.
result Proven closed-loop recursive feasibility, robustness, and asymptotic stability under function approximation errors.
This work proposes an online learning approach to tighten constraints in stochastic control problems.
problem Solving chance-constrained stochastic optimal control problems is computationally challenging.
method Reformulate chance constraints as a binary regression problem and use a GP model to learn constraint-tightening parameters online.
result The approach tightens constraints more effectively, leading to lower costs in numerical experiments.
New method solves nonseparable stochastic control problems.
problem Nonseparable and non-monotonic stochastic control problems.
method Scenario-decomposition solution framework using progressive hedging algorithm.
result Extends reach of stochastic optimal control.
The paper addresses errors in online selective conformal prediction and proposes new strategies to ensure valid inference.
problem Online selective conformal prediction's exchangeability issues and false coverage rate control problems.
method Evaluation and correction of existing calibration selection strategies, proposing new ones that preserve exchangeability.
result Novel calibration selection strategies ensure both selection-conditional coverage and FCR control.
FavMac maximizes value while controlling cost in multi-label prediction.
problem Value-maximizing predictions with strict cost control in multi-label scenarios.
method FavMac pipeline combining any multi-label classifier with online update mechanism.
result FavMac achieves higher value with strict cost control compared to baselines.
Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses H ( n ) = ( H 1 , … , H n ) \mathcal{H}(n) = (H_1,\dotsc, H_n) H ( n ) = ( H 1 , … , H n ) , Benjamini and Hochberg introduced the false discovery rate (FDR), which is the expected proportion of false positives among rejected nu…
We study optimal regret bounds for control in linear dynamical systems under adversarially changing strongly convex cost functions, given the knowledge of transition dynamics. This includes several well studied and fundamental frameworks such as the Kalman filter and the linear quadratic regulator. State of the art met…
Efficient algorithm for unknown linear systems with convex costs.
problem Controlling an unknown linear system with stochastic convex costs.
method Optimism in the Face of Uncertainty paradigm.
result Achieves optimal T \sqrt{T} T regret-rate. Study online control of unknown time-varying systems with negative and positive results.
problem Online control of time-varying systems with unknown dynamics.
method Algorithmic upper bounds and lower bounds for different policy classes.
result Sublinear adaptive regret bounds for Disturbance Response policies.
A method to minimize regret in multi-agent control systems with adversarial disturbances.
problem Optimal control of dynamical systems with adversarial disturbances and multiple agents.
method Reduction from online convex optimization to a distributed algorithm for multi-agent control.
result The resulting distributed algorithm has low regret relative to the optimal precomputed joint policy.
This work presents an explicit-implicit procedure to compute a model predictive control (MPC) law with guarantees on recursive feasibility and asymptotic stability. The approach combines an offline-trained fully-connected neural network with an online primal active set solver. The neural network provides a control inpu…
We study the control of a linear dynamical system with adversarial disturbances (as opposed to statistical noise). The objective we consider is one of regret: we desire an online control procedure that can do nearly as well as that of a procedure that has full knowledge of the disturbances in hindsight. Our main result…
Optimal control strategy uses random noise to adaptively control systems with unknown parameters.
problem Online adaptive control of linear quadratic regulator with unknown system parameters.
method Certainty equivalent control with exploratory random noise, refined estimates of system matrices.
result Achieves optimal regret scaling as Θ(√(d_u^2 d_x T)) with self-bounding ODE method.
Multiple hypothesis testing, a situation when we wish to consider many hypotheses, is a core problem in statistical inference that arises in almost every scientific field. In this setting, controlling the false discovery rate (FDR), which is the expected proportion of type I error, is an important challenge for making …
Optimal algorithm for LQR control with improved regret bound.
problem Nonstochastic control with quadratic losses (LQR control).
method Online algorithm with optimal dynamic regret of i l d e O ( e x t m a x { n 1 / 3 T V ( M 1 : n ) 2 / 3 , 1 } ) ilde{O}( ext{max}\{n^{1/3} \mathcal{TV}(M_{1:n})^{2/3}, 1\}) i l d e O ( e x t ma x { n 1/3 TV ( M 1 : n ) 2/3 , 1 }) . result Improves the best known rate of i l d e O ( n ( T V ( M 1 : n ) + 1 ) ) ilde{O}(\sqrt{n (\mathcal{TV}(M_{1:n})+1)} ) i l d e O ( n ( TV ( M 1 : n ) + 1 ) ) for general convex losses.