Turning context into control
- Instructions
- Predictions
- Control
Human instructions become disturbance predictions, connecting language models to feedback control.
Reliable decisions in an uncertain world.
I study how learning improves decisions under imperfect predictions and models, connecting mathematical guarantees, AI agents, and energy infrastructure.
Good predictions create opportunities. Reliable algorithms make them useful.
Information, trust, and physical constraints connect these research themes.Algorithms that benefit from accurate advice while limiting the cost of errors. This thread studies consistency, robustness, competitive analysis, and the value of different forms of predictive information.
Explore this themePredictive control with performance and feasibility guarantees. The work spans perturbation analysis, nonlinear policy certification, aggregate flexibility, and distributed system level synthesis.
Explore this themeLanguage models provide context, preferences, and predictions for sequential decisions. Algorithmic guidance and structural certification connect these capabilities to explicit performance guarantees.
Explore this themeControl and learning for electric vehicle charging, renewable integration, demand forecasting, water systems, and grid coordination. Physical constraints and changing operating conditions shape the algorithms.
Explore this themeLearning and optimization with interacting agents. This work examines uncertain beliefs, strategic advice, equilibrium, and the distribution of benefits from shared predictive models.
Explore this themeLearning network structure from limited measurements and adapting graph models to heterogeneous local geometry. These results connect measurement complexity, physical networks, and useful representations.
Explore this themeHuman instructions become disturbance predictions, connecting language models to feedback control.
Separate mixed disturbances and adapt confidence in each prediction source as conditions change.
Graph learning that adapts to local structure instead of imposing one geometry on an entire network.
An open platform linking physical energy measurements, human context, and simulation for energy management.
ARGNN learns a node specific Riemannian metric instead of imposing one fixed curvature on an entire graph. A diagonal metric parameterization and geometric regularization support efficient training, with convergence analysis and experiments on homophilic and heterophilic graphs.
NACF turns news into structured treatments and estimates load trajectories under alternative event conditions. Reweighting and representation balancing address observed confounding. Experiments examine factual accuracy and interpretable demand perturbations without claiming that unobserved counterfactual outcomes can be directly validated.
DualNILM jointly recognizes appliance states and identifies energy injected behind the meter. Its transformer architecture combines temporal learning tasks to separate consumption from injections, with evaluation on measured and synthesized datasets.
A measure of advice quality connects simulators and payoff predictions to strategic performance. The paper establishes benefits of reliable advice for approximate Stackelberg play and limitations on simultaneously exploiting accurate advice and protecting against inaccurate advice.
PEARL separates a physical photovoltaic simulator from a learned residual correction. A controlled benchmark compares several machine learning architectures and a coupled modeling baseline, examining accuracy while retaining the physical model as an interpretable reference.
Strong optimality refines the usual consistency and robustness tradeoff to account for each prediction. A bilevel optimization framework constructs algorithms for ski rental and one max search, with case studies in power management and trading.
A hybrid quantum learning model estimates energy community responses to prices, while quantum amplitude estimation supports uncertainty calculations. Numerical studies assess accuracy and resource requirements. Reported timing advantages assume ideal quantum devices rather than deployed hardware.
VigilMPC accepts a predictor update only when a backup plan remains feasible under tightened constraints. Recursive feasibility and constraint satisfaction follow under the tube MPC assumptions. Evaluation uses simulated neural dynamics and a switching benchmark, rather than clinical deployment.
Structural certification links performance on compositional goals to local guarantees on world model transitions. The results identify reliable pieces of a model without requiring universal competence, and establish limits on the precision of such guarantees.
The study identifies a gap between quick preference discovery and sustained exploitation by language agents. LEAD combines LLM reasoning with dueling bandit algorithms to obtain weak and strong regret guarantees, with evaluations under noisy and adversarial prompts.
A hierarchical game couples an energy sharing mechanism with transportation decisions and power network constraints. The paper establishes properties of the energy sharing equilibrium and reformulates the coupled problem for numerical solution.
A language to distribution module converts contextual instructions into disturbance predictions for MPC. The framework closes the loop between instructions, predictions, and control, with a regret analysis for linear dynamics under the stated training assumptions.
LAOC restricts online decisions to safe action sets while exploiting learned predictions for pump scheduling. Analysis characterizes the relationship between safety requirements and operating costs, with a building water supply case study.
OpenCEM presents a platform design connecting energy time series, events, human context, and simulation. An on campus solar and battery installation motivates evaluation of context sensitive control. The paper describes planned data and API capabilities.
OOD Charging adapts an awareness radius using temporal difference errors to balance learned scheduling with a robust baseline. Evaluation on ACN data examines behavioral changes during COVID 19 and the resulting distribution shift.
PredSLS integrates forecasts directly into system level synthesis with locality constraints. Temporal decay of prediction effects supports finite horizon approximations, while spatial and temporal decomposition enable scalable computation across a network.
A Bayesian value function and Bellman Jensen gap quantify the value of imperfect transition forecasts. BOLA separates offline value learning from online adaptation, with sample efficiency analysis and experiments in synthetic environments and wind energy storage control.
RobustML combines a learned dispatch algorithm with a bound on worst case cost. A combined cycle cogeneration case study examines dispatch and ramping costs as renewable penetration increases, including performance under distribution shift.
The Pasadena case study formulates solar hosting capacity planning as a robust optimization problem. It connects uncertainty in renewable generation and demand to distribution network constraints and practical choices along a municipal decarbonization pathway.
Two proximity models represent user satisfaction with station locations. Population, travel, road network, and point of interest data inform a submodular optimization problem, solved approximately with a greedy method and evaluated in Haikou.
The Equitable Objective trains a public predictive model around the outcomes of heterogeneous downstream agents. A policy gradient method and theoretical analysis study a more equitable distribution of performance, beyond optimizing prediction accuracy alone.
DISC learns confidence in predictions of latent disturbance components. Competitive analysis covers linear and more general mixing functions, showing how online confidence adaptation can exploit accurate forecasts while maintaining protection against large errors.
The paper formalizes a risk and opportunity tradeoff for agents with uncertain beliefs about other players. Upper and lower bounds characterize the Pareto frontier in normal form and stochastic Bayesian games, with numerical illustrations of the tradeoff.
ACRL constrains cumulative costs relative to a policy prior at each round, rather than only in expectation over episodes. The analysis establishes cost guarantees and regret relative to the constrained optimum, with experiments in carbon aware computing.
Q value predictions expose more information than an opaque policy recommendation. For a single trajectory MDP, the analysis characterizes consistency and robustness tradeoffs and shows how structured advice improves the guarantees available from a robust baseline.
Simply blending two stabilizing policies can cause instability. An adaptive confidence policy instead uses approximate model information to certify stability, with competitive guarantees under bounded nonlinearity and evaluations on Cart Pole and charging under distribution shift.
A general analysis pipeline converts perturbation bounds for finite horizon control into dynamic regret bounds for MPC. It handles prediction errors in costs, dynamics, and disturbances, and extends the analysis to constrained and nonlinear settings under suitable regularity conditions.
A confidence parameter governs how much a linear quadratic controller trusts disturbance predictions. Competitive bounds describe the tradeoff between accurate and inaccurate advice, and a self tuning policy adapts confidence online using observed prediction quality.
PXA solves a relaxation of the phase optimization problem, with convergence guarantees under specified conditions. Its MPC implementation updates decisions online. Experiments use adaptive charging network data to examine energy delivery, charging costs, and phase balance.
A proximity based satisfaction model turns station placement into monotone submodular maximization. A greedy algorithm has a provable approximation ratio, with a Haikou case study using population, travel, and point of interest data.
A decentralized prediction provision scheme lets consumers obtain local forecasts and exchange summaries with a virtual power plant. The analysis studies social surplus, convergence, and the demand gap relative to centralized information sharing.
Entropic aggregation summarizes a local controller's feasible actions for a remote decision maker. Penalized Predictive Control can approach the regret of full information control under causal invariance and a sufficiently long prediction window.
Maximum entropy feedback summarizes the feasible actions of controllable loads. Reinforcement learning approximates this feedback for Penalized Predictive Control, reducing information and computation requirements. Charging data demonstrates the coordination approach.
An iterative procedure extracts and clusters the tail portions of charging curves despite missing observations, variable lengths, scheduling effects, and measurement noise. Experiments on ACN data illustrate how these patterns can support useful charging models.
A general fractional multiple knapsack model captures assignment and rate constraints. An online primal dual algorithm obtains near optimal competitive guarantees and is evaluated using charging traces. This work provides an online allocation foundation without requiring learned predictions.
Bounds for noisy and noiseless graph recovery connect sparsity, graph distributions, and linear measurements. A three stage recovery scheme and practical algorithm are studied on canonical graphs and electrical grid admittance matrices.
ORC jointly recommends stations and prices while scheduling charging for sequential arrivals. A customizable value function supports competitive guarantees despite uncertainty in arrivals and user choices. Experiments compare operator revenue with benchmark scheduling methods.
Information theoretic bounds relate measurement requirements to graph complexity and recovery error. A recovery algorithm estimates topology and parameters from linear measurements, with demonstrations on graph families and electrical grid test cases.
Try a different phrase, theme, or year.
Conceptual links between research themes, grounded in the papers below.
Trust adaptation in linear quadratic control and perturbation bounds for MPC connect the quality of a forecast to the cost of acting on it. Nonlinear certification adds stability to this picture.
INSTRUCT MPC translates human instructions into disturbance predictions. World model certification and VigilMPC study complementary ways of deciding which learned models can support reliable planning and safe updates.
Q value advice and imperfect transition forecasts provide structured information for reinforcement learning. LEAD applies a related principle by supporting language agents with dueling bandit algorithms.
Aggregate flexibility communicates feasible actions for coordinated charging. Robust dispatch and safe water control connect performance guarantees to operational costs and physical constraints.
OpenCEM motivates shared contextual energy benchmarks. INSTRUCT MPC uses instructions for control, while counterfactual load forecasting represents news events as interventions on electricity demand.
In strategic environments, advice quality affects both opportunity and risk. The Bayesian game and repeated game results expose limits on combining exploitation with protection against inaccurate beliefs.
Virtual power plants use renewable predictions to coordinate consumers. Energy sharing and transportation games model how charging demand, prices, and network constraints interact.
Graph recovery estimates electrical network parameters. Charging curve clustering and energy disaggregation recover useful structure from observed behavior and aggregate meter readings.
Questions motivated by this body of work. These are directions to explore, rather than established results.
Open question
Can contextual and world model updates be certified before they affect a physical system?
Connect language conditioned predictions with local world model guarantees and feasibility checks. An open challenge is preserving safety when both the context and the learned dynamics change during operation.
Open question
Which prediction errors actually matter for the decision being made?
Move from a single forecast accuracy score to guarantees that reflect the prediction, the task, and the affected transitions. This suggests adaptive confidence allocation across sources, horizons, and latent disturbances.
Open question
Can distributed energy and water resources adapt together under changing conditions?
Combine local feasibility summaries with distributed predictive control and contextual energy models. Open questions include communication limits, distribution shift, and guarantees across coupled physical networks.
Open question
How should shared models balance efficiency, strategic risk, and equity?
Connect the downstream objectives of public models to robust strategic decision making. A key challenge is evaluating advice when its benefits and failures are distributed unevenly across participating agents.