BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Baosen Zhang

Baosen Zhang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Systems and Controleess.SYmath.OCeess.SPMachine LearningComputer Science and Game TheoryMultiagent SystemsArtificial Intelligencecond-mat.mtrl-sciphysics.soc-ph

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
19works
0followers
10topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

19 published item(s)

preprint2026arXiv

From Knowledge to Action: Outcomes of the 2025 Large Language Model (LLM) Hackathon for Applications in Materials Science and Chemistry

Large language models (LLMs) are rapidly changing how researchers in materials science and chemistry discover, organize, and act on scientific knowledge. This paper analyzes a broad set of community-developed LLM applications in an effort to identify emerging patterns in how these systems can be used across the scientific research lifecycle. We organize the projects into two complementary categories: Knowledge Infrastructure, systems that structure, retrieve, synthesize, and validate scientific information; and Action Systems, systems that execute, coordinate, or automate scientific work across computational and experimental environments. The submissions reveal a shift from single-purpose LLM tools toward integrated, multi-agent workflows that combine retrieval, reasoning, tool use, and domain-specific validation. Prominent themes include retrieval-augmented generation as grounding infrastructure, persistent structured knowledge representations, multimodal and multilingual scientific inputs, and early progress toward laboratory-integrated closed-loop systems. Together, these results suggest that LLMs are evolving from general-purpose assistants into composable infrastructure for scientific reasoning and action. This work provides a community snapshot of that transition and a practical taxonomy for understanding emerging LLM-enabled workflows in materials science and chemistry.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Safe Trajectory Gradient Flow Control of a Grid-Interfacing Inverter

Grid-interfacing inverters serve as the interface between renewable energy resources and the electric power grid, offering fast, programmable control capabilities. However, their operation is constrained by hardware limitations, such as bounds on the current magnitude. Existing control methods for these systems often neglect these constraints during controller design and instead rely on ad hoc limiters, which can introduce instability or degrade performance. In this work, we present a control framework that directly incorporates constraints into the control of a voltage-source inverter. We propose a safe trajectory gradient flow controller, which applies the safe gradient flow method to a rolling horizon trajectory optimization problem to ensure that the states remain within a safe set defined by the constraints while directing the trajectory towards an optimal equilibrium point of a nonlinear program. Simulation results demonstrate that our approach can drive the outputs of a simulated inverter system to optimal values and maintain state constraints, even when using a limited number of optimization steps per control cycle.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Cyber-Physical Attack Leveraging Subsynchronous Resonance

This paper discusses how a cyber attack could take advantage of torsional resonances in the shaft of turbo-generators to inflict severe physical damage to a power system. If attackers were able to take over the control of a battery energy storage device, they could modulate the injection of this device at a frequency that matches one of the sub-synchronous resonance frequencies of a generator. Small changes in injection might be sufficient to excite one of these mechanical resonances, resulting in metal fatigue and ultimately a catastrophic failure in the shaft of the generator. Using a state-space model of the electromechanical system, the paper develops transfer functions linking the magnitude of the malicious injections to the magnitude of oscillations in the speed and angle of the various masses connected to the shaft. Numerical results from a two-area power system demonstrate the existence of vulnerable frequencies and show that damaging mechanical oscillations can be triggered without causing easily detectable signals at the generator terminals.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Data-Driven Modeling of Aggregate Flexibility under Uncertain and Non-Convex Load Models

Bundling a large number of distributed energy resources through a load aggregator has been advocated as an effective means to integrate such resources into whole-sale energy markets. To ease market clearing, system operators allow aggregators to submit bidding models of simple prespecified polytopic shapes. Aggregators need to carefully design and commit to a polytope that best captures their energy flexibility along a day-ahead scheduling horizon. This work puts forth a model-informed data-based optimal flexibility design for aggregators, which deals with the time-coupled, uncertain, and non-convex models of individual loads. The proposed solution first generates efficiently a labeled dataset of (non)-disaggregatable schedules. The feasible set of the aggregator is then approximated by an ellipsoid upon training a convex quadratic classifier using the labeled dataset. The ellipsoid is subsequently inner approximated by a polytope. Using Farkas lemma, the obtained polytope is finally inner approximated by the polytopic shape dictated by the market. Numerical tests show the effectiveness of the proposed flexibility design framework for designing the feasible sets of small- and large-sized aggregators coordinating solar photovoltaics, thermostatically-controlled loads, batteries, and electric vehicles. The tests further demonstrate that it is crucial for the aggregator to consider time-coupling and uncertainties in optimal flexibility design.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Equilibrium-Independent Stability Analysis for Distribution Systems with Lossy Transmission Lines

Power distribution systems are becoming much more active with increased penetration of distributed energy resources. Because of the intermittent nature of these resources, the stability of distribution systems under large disturbances and time-varying conditions is becoming a key issue in practical operations. Because the transmission lines in distribution systems are lossy, standard approaches in power system stability analysis do not readily apply and the understanding of transient stability remains open even for simplified models. This paper proposes a novel equilibrium-independent transient stability analysis of distribution systems with lossy lines. We certify network-level stability by breaking the network into subsystems, and by looking at the equilibrium-independent passivity of each subsystem, the network stability is certified through a diagonal stability property of the interconnection matrix. This allows the analysis scale to large networked systems with time-varying equilibria. The proposed method gracefully extrapolates between lossless and lossy systems, and provides a simple yet effective approach to optimize control efforts with guaranteed stability regions. Case studies verify that the proposed method is much less conservative than existing approaches and also scales to large systems.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Safe and Efficient Model Predictive Control Using Neural Networks: An Interior Point Approach

Model predictive control (MPC) provides a useful means for controlling systems with constraints, but suffers from the computational burden of repeatedly solving an optimization problem in real time. Offline (explicit) solutions for MPC attempt to alleviate real time computational challenges using either multiparametric programming or machine learning. The multiparametric approaches are typically applied to linear or quadratic MPC problems, while learning-based approaches can be more flexible and are less memory-intensive. Existing learning-based approaches offer significant speedups, but the challenge becomes ensuring constraint satisfaction while maintaining good performance. In this paper, we provide a neural network parameterization of MPC policies that explicitly encodes the constraints of the problem. By exploring the interior of the MPC feasible set in an unsupervised learning paradigm, the neural network finds better policies faster than projection-based methods and exhibits substantially shorter solve times. We use the proposed policy to solve a robust MPC problem, and demonstrate the performance and computational gains on a standard test system.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

An Iterative Approach to Finding Global Solutions of AC Optimal Power Flow Problems

The existence of multiple solutions to AC optimal power flow (ACOPF) problems has been noted for decades. Existing solvers are generally successful in finding local solutions, which are stationary points but may not be globally optimal. In this paper, we propose a simple iterative approach to find globally optimal solutions to ACOPF problems. First, we call an existing solver for the ACOPF problem. From the solution and the associated dual variables, we form a partial Lagrangian. Then we optimize this partial Lagrangian and use its solution as a warm start to call the solver again for the ACOPF problem. By repeating this process, we can iteratively improve the solution quality, moving from local solutions to global ones. We show the effectiveness our algorithm on standard IEEE networks. The simulation results show that our algorithm can escape from local solutions to achieve global optimums within a few iterations.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

A Convex Neural Network Solver for DCOPF with Generalization Guarantees

The DC optimal power flow (DCOPF) problem is a fundamental problem in power systems operations and planning. With high penetration of uncertain renewable resources in power systems, DCOPF needs to be solved repeatedly for a large amount of scenarios, which can be computationally challenging. As an alternative to iterative solvers, neural networks are often trained and used to solve DCOPF. These approaches can offer orders of magnitude reduction in computational time, but they cannot guarantee generalization, and small training error does not imply small testing errors. In this work, we propose a novel algorithm for solving DCOPF that guarantees the generalization performance. First, by utilizing the convexity of DCOPF problem, we train an input convex neural network. Second, we construct the training loss based on KKT optimality conditions. By combining these two techniques, the trained model has provable generalization properties, where small training error implies small testing errors. In experiments, our algorithm improves the optimality ratio of the solutions by a factor of five in comparison to end-to-end models.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Consensus-Based Set-Theoretic Control in Power Systems

Set-theoretic control is a useful technique for dealing with the uncertainty introduced into power systems by renewable energy resources. Although set operations are computationally expensive in large systems, distributed approaches serve as a remedy. In this paper, we propose a novel consensus-based approach for set-theoretic frequency control in power systems. A robust controlled-invariant set (RCI) for the system is generated by composing RCIs for each bus in the network. The process of generating these sets uses a consensus-based approach in order to facilitate discovery of mutually compatible subsystem RCIs. Each bus seeks to maximize the size of its own RCI while treating the effects of coupling as an unknown-but-bounded disturbance. The consensus routine, which demonstrates linear convergence, is embedded into a backwards reachability analysis of initial safe sets. Results for a 9-bus test case show that simple model predictive controllers associated with the resulting RCIs maintain safe operation when the system is subjected to worst case (adversarial) fluctuations in net demand, where conventional controllers are shown to fail.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Frequency Stability Using MPC-based Inverter Power Control in Low-Inertia Power Systems

The electrical grid is evolving from a network consisting of mostly synchronous machines to a mixture of synchronous machines and inverter-based resources such as wind, solar, and energy storage. This transformation has led to a decrease in mechanical inertia, which necessitate a need for the new resources to provide frequency responses through their inverter interfaces. In this paper we proposed a new strategy based on model predictive control to determine the optimal active-power set-point for inverters in the event of a disturbance in the system. Our framework explicitly takes the hard constraints in power and energy into account, and we show that it is robust to measurement noise, limited communications and delay by using an observer to estimate the model mismatches in real-time. We demonstrate the proposed controller significantly outperforms an optimally tuned virtual synchronous machine on a standard 39-bus system under a number of scenarios. In turn, this implies optimized inverter-based resources can provide better frequency responses compared to conventional synchronous machines.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Input Convex Neural Networks for Optimal Voltage Regulation

The increasing penetration of renewables in distribution networks calls for faster and more advanced voltage regulation strategies. A promising approach is to formulate the problem as an optimization problem, where the optimal reactive power injection from inverters are calculated to maintain the voltages while satisfying power network constraints. However, existing optimization algorithms require the exact topology and line parameters of underlying distribution system, which are not known for most cases and are difficult to infer. In this paper, we propose to use specifically designed neural network to tackle the learning and optimization problem together. In the training stage, the proposed input convex neural network learns the mapping between the power injections and the voltages. In the voltage regulation stage, such trained network can find the optimal reactive power injections by design. We also provide a practical distributed algorithm by using the trained neural network. Theoretical bounds on the representation performance and learning efficiency of proposed model are also discussed. Numerical simulations on multiple test systems are conducted to illustrate the operation of the algorithm.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Learning to Solve Network Flow Problems via Neural Decoding

Many decision-making problems in engineering applications such as transportation, power system and operations research require repeatedly solving large-scale linear programming problems with a large number of different inputs. For example, in energy systems with high levels of uncertain renewable resources, tens of thousands of scenarios may need to be solved every few minutes. Standard iterative algorithms for linear network flow problems, even though highly efficient, becomes a bottleneck in these applications. In this work, we propose a novel learning approach to accelerate the solving process. By leveraging the rich theory and economic interpretations of LP duality, we interpret the output of the neural network as a noisy codeword, where the codebook is given by the optimization problem's KKT conditions. We propose a feedforward decoding strategy that finds the optimal set of active constraints. This design is error correcting and can offer orders of magnitude speedup compared to current state-of-the-art iterative solvers, while providing much better solutions in terms of feasibility and optimality compared to end-to-end learning approaches.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Multi-Agent Reinforcement Learning in Cournot Games

In this work, we study the interaction of strategic agents in continuous action Cournot games with limited information feedback. Cournot game is the essential market model for many socio-economic systems where agents learn and compete without the full knowledge of the system or each other. We consider the dynamics of the policy gradient algorithm, which is a widely adopted continuous control reinforcement learning algorithm, in concave Cournot games. We prove the convergence of policy gradient dynamics to the Nash equilibrium when the price function is linear or the number of agents is two. This is the first result (to the best of our knowledge) on the convergence property of learning algorithms with continuous action spaces that do not fall in the no-regret class.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

No-regret Learning in Cournot Games

This paper examines the convergence of no-regret learning in Cournot games with continuous actions. Cournot games are the essential model for many socio-economic systems, where players compete by strategically setting their output quantity. We assume that players do not have full information of the game and thus cannot pre-compute a Nash equilibrium. Two types of feedback are considered: one is bandit feedback and the other is gradient feedback. To study the convergence of the induced sequence of play, we introduce the notion of convergence in measure, and show that the players' actual sequence of action converges to the unique Nash equilibrium. In addition, our results naturally extend the no-regret learning algorithms' time-average regret bounds to obtain the final-iteration convergence rates. Together, our work presents significantly sharper convergence results for learning in games without strong assumptions on game property (e.g., monotonicity) and shows how exploiting the game information feedback can influence the convergence rates.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Safe Reinforcement Learning of Control-Affine Systems with Vertex Networks

This paper focuses on finding reinforcement learning policies for control systems with hard state and action constraints. Despite its success in many domains, reinforcement learning is challenging to apply to problems with hard constraints, especially if both the state variables and actions are constrained. Previous works seeking to ensure constraint satisfaction, or safety, have focused on adding a projection step to a learned policy. Yet, this approach requires solving an optimization problem at every policy execution step, which can lead to significant computational costs. To tackle this problem, this paper proposes a new approach, termed Vertex Networks (VNs), with guarantees on safety during exploration and on learned control policies by incorporating the safety constraints into the policy network architecture. Leveraging the geometric property that all points within a convex set can be represented as the convex combination of its vertices, the proposed algorithm first learns the convex combination weights and then uses these weights along with the pre-calculated vertices to output an action. The output action is guaranteed to be safe by construction. Numerical examples illustrate that the proposed VN algorithm outperforms vanilla reinforcement learning in a variety of benchmark control tasks.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Transfer Learning for HVAC System Fault Detection

Faults in HVAC systems degrade thermal comfort and energy efficiency in buildings and have received significant attention from the research community, with data driven methods gaining in popularity. Yet the lack of labeled data, such as normal versus faulty operational status, has slowed the application of machine learning to HVAC systems. In addition, for any particular building, there may be an insufficient number of observed faults over a reasonable amount of time for training. To overcome these challenges, we present a transfer methodology for a novel Bayesian classifier designed to distinguish between normal operations and faulty operations. The key is to train this classifier on a building with a large amount of sensor and fault data (for example, via simulation or standard test data) then transfer the classifier to a new building using a small amount of normal operations data from the new building. We demonstrate a proof-of-concept for transferring a classifier between architecturally similar buildings in different climates and show few samples are required to maintain classification precision and recall.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Using Mobility for Electrical Load Forecasting During the COVID-19 Pandemic

The novel coronavirus (COVID-19) pandemic has posed unprecedented challenges for the utilities and grid operators around the world. In this work, we focus on the problem of load forecasting. With strict social distancing restrictions, power consumption profiles around the world have shifted both in magnitude and daily patterns. These changes have caused significant difficulties in short-term load forecasting. Typically algorithms use weather, timing information and previous consumption levels as input variables, yet they cannot capture large and sudden changes in socioeconomic behavior during the pandemic. In this paper, we introduce mobility as a measure of economic activities to complement existing building blocks of forecasting algorithms. Mobility data acts as good proxies for the population-level behaviors during the implementation and subsequent easing of social distancing measures. The major challenge with such dataset is that only limited mobility records are associated with the recent pandemic. To overcome this small data problem, we design a transfer learning scheme that enables knowledge transfer between several different geographical regions. This architecture leverages the diversity across these regions and the resulting aggregated model can boost the algorithm performance in each region's day-ahead forecast. Through simulations for regions in the US and Europe, we show our proposed algorithm can outperform conventional forecasting methods by more than three-folds. In addition, we demonstrate how the proposed model can be used to project how electricity consumption would recover based on different mobility scenarios.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Distributed Algorithms for Optimal Power Flow Problem

Optimal power flow (OPF) is an important problem for power generation and it is in general non-convex. With the employment of renewable energy, it will be desirable if OPF can be solved very efficiently so its solution can be used in real time. With some special network structure, e.g. trees, the problem has been shown to have a zero duality gap and the convex dual problem yields the optimal solution. In this paper, we propose a primal and a dual algorithm to coordinate the smaller subproblems decomposed from the convexified OPF. We can arrange the subproblems to be solved sequentially and cumulatively in a central node or solved in parallel in distributed nodes. We test the algorithms on IEEE radial distribution test feeders, some random tree-structured networks, and the IEEE transmission system benchmarks. Simulation results show that the computation time can be improved dramatically with our algorithms over the centralized approach of solving the problem without decomposition, especially in tree-structured problems. The computation time grows linearly with the problem size with the cumulative approach while the distributed one can have size-independent computation time.

0 citations0 reviewsNo code linkedOpen access
preprint2011arXiv

Distributed Storage for Intermittent Energy Sources: Control Design and Performance Limits

One of the most important challenges in the integration of renewable energy sources into the power grid lies in their `intermittent' nature. The power output of sources like wind and solar varies with time and location due to factors that cannot be controlled by the provider. Two strategies have been proposed to hedge against this variability: 1) use energy storage systems to effectively average the produced power over time; 2) exploit distributed generation to effectively average production over location. We introduce a network model to study the optimal use of storage and transmission resources in the presence of random energy sources. We propose a Linear-Quadratic based methodology to design control strategies, and we show that these strategies are asymptotically optimal for some simple network topologies. For these topologies, the dependence of optimal performance on storage and transmission capacity is explicitly quantified.

0 citations0 reviewsNo code linkedOpen access