New framework for analyzing games with multi-dimensional singular controls and non-linear jumps.
problem Analyzing games with multi-dimensional singular controls and non-linear jump impacts.
method Probabilistic framework with novel class of MFGs (MFGs of parametrisations).
result Existence of equilibria and equivalence with MFGs of singular controls.
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.
Solves optimal control with state constraints using probabilistic methods.
problem Optimal control of diffusion processes within state constraints.
method Probabilistic representation and optimal control under mild conditions.
result Explicit formulae for optimally controlled dynamics in examples.
The paper introduces new tests for global controllability in hybrid systems.
problem Global controllability in hybrid systems with discrete events.
method Geometric formulation of hybrid systems and analysis of jump points.
result Hybrid systems can be globally controllable even if continuous systems are not.
A new method controls risk for set predictors using cross-validation.
problem Inefficient set predictors when data limited.
method Cross-validation conformal risk control (CV-CRC).
result CV-CRC offers theoretical guarantees and reduces set size.
Safe control for vehicles using learned perception from images.
problem Controlling autonomous vehicles with partial state information from images.
method Learned perception map and safe set design for a closed loop system.
result Generalization properties of the perception-control loop are favorable.
Boosting improves control of complex systems.
problem Improving performance of controllers for dynamical systems.
method Proposes a boosting framework for online control of dynamical systems.
result An efficient boosting algorithm that combines weak controllers into a more accurate one.
The paper extends conformal risk control to be valid with high probability over a growing calibration dataset.
problem Valid risk control over a growing calibration dataset.
method Quantile-based arguments for anytime-valid control.
result Guarantees remain valid with high probability over a cumulatively growing calibration dataset.
This dissertation uses deep reinforcement learning to improve drone flight control.
problem Inadequate traditional control methods for unpredictable CPS interactions.
method Developed a full solution stack for neuro-flight controllers using deep neural networks.
result Reinforcement learning enables training neural network controllers for stable and precise flight.
Non-bilinear observations make optimal control harder, showing non-convex costs and non-affine optimal controllers.
problem Optimal control from bilinear observations in linear systems is challenging.
method Analytical and numerical methods to study the non-convex cost-to-go and non-affine optimal controllers.
result The Separation Principle does not hold for bilinear observations, leading to non-convex costs and non-affine optimal controllers.
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 methods control false discoveries near the boundary in conformal novelty detection.
problem Over-optimistic assessments near the rejection threshold in conformal novelty detection.
method Support line (SL) correction and alternative procedures to control boundary false discovery rate (bFDR).
result New procedures control the boundary false discovery rate (bFDR) in the conformal setting.
Agents acting in the natural world aim at selecting appropriate actions based on noisy and partial sensory observations. Many behaviors leading to decision mak- ing and action selection in a closed loop setting are naturally phrased within a control theoretic framework. Within the framework of optimal Control Theory, o…
New methods prove controllability of non-linear systems, extending classical results.
problem Controllability of non-linear control systems.
method Analytic control system, graph completions, flows of vector fields, pseudogroup of local diffeomorphisms.
result Sufficient conditions for local controllability and accessibility of non-linear systems.
Tackles bridging machine learning and control theory for safety-critical systems.
problem Ensuring reliability and safety in machine learning applications for safety-critical systems.
method Review of recent advances in learning and control theory, historical context.
result Importance of control theorists joining the conversation on learning-related problems.
Study optimal control in unknown nonlinear systems with near-optimal regret bound.
problem Sequential control in unknown, nonlinear dynamical systems.
method LC^3 algorithm, based on information theory.
result Near-optimal O ( T ) O(\sqrt{T}) O ( T ) regret bound for episodic settings. New algorithm solves mean-field control problems using actor-critic learning with moment neural networks.
problem Solving mean-field control problems in continuous time reinforcement learning.
method Gradient-based policy and value function learning with moment neural networks on the Wasserstein space.
result Effective solution for diverse mean-field control problems, including multi-dimensional and nonlinear settings.
New algorithm minimizes worst-case regret in uncertain, time-varying dynamics.
problem Model-based policy learning in uncertain, time-varying dynamics.
method Planning regret metric and iterative algorithm for minimizing it.
result Empirical evidence shows the proposed algorithm outperforms existing methods.
The paper offers a method to create prediction sets with uncertainty control.
problem Calibrating and communicating uncertainty in machine learning predictions.
method Distribution-free, risk-controlling prediction sets using a holdout set to calibrate set sizes.
result Explicit finite-sample guarantees for error control in various machine learning tasks.
Polynomial-time reachability for LTI systems with TLL NN controllers is achieved.
problem Bounding the reachable set of LTI systems controlled by TLL NN controllers.
method Polynomial-time computation of exact one-step reachable set and tight bounding box via two methods.
result Exact reachability computation in polynomial time for TLL NN controllers.
Develops methods to select informative conformal prediction sets with FCR control.
problem Selecting informative prediction sets with FCR control in supervised learning.
method Unified framework for informative conformal prediction sets with FCR control.
result First procedures providing FCR control for informative prediction sets.
Efficiently controls unknown linear systems with black-box interactions.
problem Controlling an unknown linear dynamical system from black-box interactions.
method First efficient algorithm with sublinear regret, using robust system identification.
result Resolves open problem on stochastic LQR and black-box LQR control.
Robust regression model for safe exploration in control problems.
problem Learning and exploring safely in sequential control problems.
method Deep robust regression model trained to predict uncertainty bounds.
result Empirically outperforms conventional GP-based safe exploration.
A new method solves complex control problems with random coefficients.
problem Solving LQ McKean-Vlasov control problems with random coefficients.
method Decomposes the problem into two decoupled stochastic optimal control problems.
result The sum of optimal controls of auxiliary problems equals the original problem's optimal control.
The paper develops online methods to control familywise error rate in growing hypothesis testing sequences.
problem Controlling familywise error rate in a growing sequence of hypotheses over time.
method Unified algorithmic concepts for offline and online FWER control, including new adaptive online algorithms.
result Substantial gains in power demonstrated and formally proved in a Gaussian sequence model.
Paper benchmarks real-world noisy labels and proposes a method to improve deep learning performance.
problem Understanding deep learning with real-world noisy labels.
method Develops a simple method to handle both synthetic and real noisy labels.
result Method achieves best results on benchmark datasets and web noise.
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 method uses unlabeled data to estimate intercept in case-control logistic regression.
problem Estimating intercept in case-control logistic regression.
method Construct likelihood function, use iterative algorithm to find maximum likelihood estimator.
result Proposed method identifies intercept and improves estimation efficiency.
New method controls renewable energy storage and portfolio selection with probabilistic constraints.
problem Control of McKean-Vlasov dynamics with probabilistic state constraints.
method Level-set approach for exact penalization and running maximum/integral cost.
result Extension to mean-field setting with machine learning algorithm.
Study of 2D Lorentzian anti-de Sitter plane using geometric control theory.
problem Understanding extremal trajectories and reachable set on anti-de Sitter plane.
method Geometric control theory and differential geometry.
result Construction of optimal synthesis and description of Lorentzian distance.
CLIC learns to control objects in non-rewarding environments by imitating a mentor.
problem Learning in non-rewarding, multi-object environments with non-observable intentions.
method Curriculum Learning and Imitation (CLIC) for Control.
result CLIC effectively learns and imitates a mentor's interactions to control objects.
Motivated by the recent applications of game-theoretical learning techniques to the design of distributed control systems, we study a class of control problems that can be formulated as potential games with continuous action sets, and we propose an actor-critic reinforcement learning algorithm that provably converges t…
We consider in this paper the regularity problem for time-optimal trajectories of a single-input control-affine system on a n-dimensional manifold. We prove that, under generic conditions on the drift and the controlled vector field, any control u associated with an optimal trajectory is smooth out of a countable set o…
CTRL improves reinforcement learning by combining control strategies.
problem Controlling agents to herd and contain target agents in a goal region.
method CTRL algorithm that enhances tabular learning algorithms with a tutoring model-based control strategy.
result Significantly reduces learning times and improves exploration of the state-space.
Counterexample shows state-constrained optimal control problems can have Young measure gaps.
problem Existence of Young measure gaps in state-constrained optimal control problems.
method Provided a counterexample for smooth controllable systems state-constrained to the unit ball.
result Gap occurs in a regular setting with non-convex Lagrangian density.
We construct a time-consistent sublinear expectation in the setting of volatility uncertainty. This mapping extends Peng's G-expectation by allowing the range of the volatility uncertainty to be stochastic. Our construction is purely probabilistic and based on an optimal control formulation with path-dependent control …
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.
Study describes periodic controls in step 2 sub-Finsler problems on Carnot groups.
problem Optimal control problems on step 2 Carnot groups with convex control sets.
method Describes Casimirs and symplectic foliations; shows extremal controls are periodic.
result Extremal controls are either constant or periodic.
In a seminal paper Abadie, Diamond, and Hainmueller [2010] (ADH), see also Abadie and Gardeazabal [2003], Abadie et al. [2014], develop the synthetic control procedure for estimating the effect of a treatment, in the presence of a single treated unit and a number of control units, with pre-treatment outcomes observed f…
Efficient algorithm controls unknown systems with adversarial perturbations.
problem Controlling unknown linear systems with adversarial perturbations and convex losses.
method Measures regret against an optimal linear policy, provides efficient algorithm with sublinear regret bound.
result First efficient algorithm with sublinear regret bound of T^{2/3}.
New method infers causal effects without knowing control variables.
problem Inference errors when control variables are unknown.
method Proposes a method for inferring causal effects when control variables are unknown.
result Proves method yields asymptotically valid confidence intervals for average causal effects.
New approach to control diffusion processes with soft constraints.
problem Finding an optimal diffusion process with a target terminal distribution.
method Generalized Schrödinger bridge problem with soft constraints, solving for a geometric mixture of target and other distributions.
result The terminal distribution of the optimally controlled process is a geometric mixture of the target and another distribution.
The paper analyzes deep neural networks using control theory to set a time limit for their convergence.
problem Understanding the finite-time convergence of deep neural networks.
method Lyapunov based analysis of the loss function, control theory framework, finite-time control of non-linear systems.
result A priori guarantees of finite-time convergence for deep neural networks are provided.
Certainty equivalent controllers perform nearly optimally in LQ control problems with unknown dynamics.
problem Optimizing control in systems with unknown transition dynamics.
method Analysis of certainty equivalent controllers and comparison to optimal LQ controllers, using perturbation bounds for discrete Riccati equations.
result Sub-optimality gap scales as the square of the parameter error, improving upon previous results.
Improved MPC with neural networks and active sets for large-scale problems.
problem Large-scale model predictive control with guarantees on feasibility and stability.
method Combines offline-trained neural network and online primal active set solver.
result Achieves 2x reduction in online inference time for large problems.
Combining causality, control, and reinforcement learning for system control.
problem Learning to control dynamical systems using causal, control, and reinforcement learning approaches.
method Combining causal identification, control strategies, and reinforcement learning to control dynamical systems.
result Combining different learning paradigms for effective system control.
Iterative method learns unknown constraints for MPC control.
problem Learning to satisfy unknown polyhedral state constraints in iterative MPC.
method Collects and improves estimates of unknown constraints using collected data, designs an MPC controller to satisfy the estimated constraints.
result Robust and probabilistic guarantees of constraint satisfaction as a function of task iterations.
Develops a learning model predictive controller for competitive racing.
problem Lack of exploration in state space and complexity in obstacle avoidance.
method Explores state space through multiple initializations and develops a new method for convex terminal set selection.
result Yields a richer terminal safe set and maintains convexity.