SearcharxivSearch

arXiv subjects

Zixin Ye

Publications and source records attributed to Zixin Ye.

4 recordsLinked to original sources

Asymptotic expansions relating to the distribution of the product of correlated normal random variables

Asymptotic expansions are derived for the tail distribution of the product of two correlated normal random variables with non-zero means and arbitrary variances, and more generally the sum of independent copies of such random variables. Asymptotic approximations are also given for the quantile function. Numerical results are given to test the performance of the asymptotic approximations.

math.PR

Asymptotic approximations for the distribution of the product of correlated normal random variables

We obtain asymptotic approximations for the probability density function of the product of two correlated normal random variables with non-zero means and arbitrary variances. As a consequence, we deduce asymptotic approximations for the tail probabilities and quantile functions of this distribution, as well as an asymptotic approximation for the widely used risk measures value at risk and tail value at risk.

math.PR

Learning-Based Predictive Control via Real-Time Aggregate Flexibility

Aggregators have emerged as crucial tools for the coordination of distributed, controllable loads. To be used effectively, an aggregator must be able to communicate the available flexibility of the loads they control, as known as the aggregate flexibility to a system operator. However, most of existing aggregate flexibility measures often are slow-timescale estimations and much less attention has been paid to real-time coordination between an aggregator and an operator. In this paper, we consider solving an online optimization in a closed-loop system and present a design of real-time aggregate flexibility feedback, termed the maximum entropy feedback (MEF). In addition to deriving analytic properties of the MEF, combining learning and control, we show that it can be approximated using reinforcement learning and used as a penalty term in a novel control algorithm -- the penalized predictive control (PPC), which modifies vanilla model predictive control (MPC). The benefits of our scheme are (1). Efficient Communication. An operator running PPC does not need to know the exact states and constraints of the loads, but only the MEF. (2). Fast Computation. The PPC often has much less number of variables than an MPC formulation. (3). Lower Costs. We show that under certain regularity assumptions, the PPC is optimal. We illustrate the efficacy of the PPC using a dataset from an adaptive electric vehicle charging network and show that PPC outperforms classical MPC.

math.OC

Towards Balanced Three-phase Charging: Phase Optimization in Adaptive Charging Networks

We study the problem of phase optimization for electric-vehicle (EV) charging. We formulate our problem as a non-convex mixed-integer programming problem whose objective is to minimize the charging loss. Despite the hardness of directly solving this non-convex problem, we solve a relaxation of the original problem by proposing the PXA algorithm where "P", "X", and "A" stand for three variable matrices in the formed phase optimization problems. We show that under certain conditions, the solution is given by the PXA precisely converges to the global optimum. In addition, using the idea of model predictive control (MPC), we design the {PXA-MPC}, which is an online implementation of the PXA. Compared to other empirical phase balancing strategies, the PXA algorithm significantly improves the charging performance by maximizing energy delivery, minimizing charging price, and assisting future energy planning. The efficacy of our algorithm is demonstrated using data collected from a real-world adaptive EV charging network (ACN).

math.OC