arXiv subjects

Yue Chen

Publications and source records attributed to Yue Chen.

At least 217 records · Page 12Linked to original sources

arXiv2022

Zero-shot Cross-Linguistic Learning of Event Semantics

Typologically diverse languages offer systems of lexical and grammatical aspect that allow speakers to focus on facets of event structure in ways that comport with the specific communicative setting and discourse constraints they face. In this paper, we look specifically at captions of images across Arabic, Chinese, Farsi, German, Russian, and Turkish and describe a computational model for predicting lexical aspects. Despite the heterogeneity of these languages, and the salient invocation of distinctive linguistic resources across their caption corpora, speakers of these languages show surprising similarities in the ways they frame image content. We leverage this observation for zero-shot cross-lingual learning and show that lexical aspects can be predicted for a given language despite not having observed any annotated data for this language at all.

cs.CL↗

arXiv2022

Robust Generation Dispatch with Strategic Renewable Power Curtailment and Decision-Dependent Uncertainty

As renewable energy sources replace traditional power sources (such as thermal generators), uncertainty grows while there are fewer controllable units. To reduce operational risks and avoid frequent real-time emergency controls, a preparatory schedule of renewable generation curtailment is required. This paper proposes a novel two-stage robust generation dispatch (RGD) model, where the preparatory curtailment schedule is optimized in the pre-dispatch stage. The curtailment schedule will then influence the variation range of real-time renewable power output, resulting in a decision-dependent uncertainty (DDU) set. In the re-dispatch stage, the controllable units adjust their outputs within the reserve capacities to maintain power balancing. To overcome the difficulty in solving the RGD with DDU, an adaptive column-and-constraint generation (AC\&CG) algorithm is developed. We prove that the proposed algorithm can generate the optimal solution in finite iterations. Numerical examples show the advantages of the proposed model and algorithm, and validate their practicability and scalability.

math.OC↗

arXiv2022

GPUMD: A package for constructing accurate machine-learned potentials and performing highly efficient atomistic simulations

We present our latest advancements of machine-learned potentials (MLPs) based on the neuroevolution potential (NEP) framework introduced in [Fan et al., Phys. Rev. B 104, 104309 (2021)] and their implementation in the open-source package GPUMD. We increase the accuracy of NEP models both by improving the radial functions in the atomic-environment descriptor using a linear combination of Chebyshev basis functions and by extending the angular descriptor with some four-body and five-body contributions as in the atomic cluster expansion approach. We also detail our efficient implementation of the NEP approach in graphics processing units as well as our workflow for the construction of NEP models, and we demonstrate their application in large-scale atomistic simulations. By comparing to state-of-the-art MLPs, we show that the NEP approach not only achieves above-average accuracy but also is far more computationally efficient. These results demonstrate that the GPUMD package is a promising tool for solving challenging problems requiring highly accurate, large-scale atomistic simulations. To enable the construction of MLPs using a minimal training set, we propose an active-learning scheme based on the latent space of a pre-trained NEP model. Finally, we introduce three separate Python packages, GPYUMD, CALORINE, and PYNEP, which enable the integration of GPUMD into Python workflows.

physics.comp-ph↗

arXiv2022

An Energy Sharing Mechanism Considering Network Constraints and Market Power Limitation

As the number of prosumers with distributed energy resources (DERs) grows, the conventional centralized operation scheme may suffer from conflicting interests, privacy concerns, and incentive inadequacy. In this paper, we propose an energy sharing mechanism to address the above challenges. It takes into account network constraints and fairness among prosumers. In the proposed energy sharing market, all prosumers play a generalized Nash game. The market equilibrium is proved to have nice features in a large market or when it is a variational equilibrium. To deal with the possible market failure, inefficiency, or instability in general cases, we introduce a price regulation policy to avoid market power exploitation. The improved energy sharing mechanism with price regulation can guarantee existence and uniqueness of a socially near-optimal market equilibrium. Some advantageous properties are proved, such as prosumer's individual rationality, a sharing price structure similar to the locational marginal price, and the tendency towards social optimum with an increasing number of prosumers. For implementation, a practical bidding algorithm is developed with convergence condition. Experimental results validate the theoretical outcomes and show the practicability of our model and method.

cs.GT↗

arXiv2022

Towards Transactive Energy: An Analysis of Information-related Practical Issues

The development of distributed energy resources, such as rooftop photovoltaic (PV) panels, batteries, and electric vehicles (EVs), has decentralized our power system operation, where transactive energy markets empower local energy exchanges. Transactive energy contributes to building a low-carbon energy system by better matching the distributed renewable sources and demand. Effective market mechanisms are a key part of transactive energy market design. Despite fruitful research on related topics, some practical challenges must be addressed. This review surveys three practical issues related to information exchange in transactive energy markets: asynchronous computing, truthful reporting, and privacy preservation. We summarize the state-of-the-art results and introduce relevant multidisciplinary theories. Based on these findings, we suggest several potential research directions that could provide insights for future studies.

eess.SY↗

arXiv2022

A Surgical Platform for Intracerebral Hemorrhage Robotic Evacuation (ASPIHRE): A Non-metallic MR-guided Concentric Tube Robot

Intracerebral hemorrhage (ICH) is the deadliest stroke sub-type, with a one-month mortality rate as high as 52%. Due to the potential cortical disruption caused by craniotomy, conservative management (watchful waiting) has historically been a common method of treatment. Minimally invasive evacuation has recently become an accepted method of treatment for patients with deep-seated hematoma 30-50 mL in volume, but proper visualization and tool dexterity remain constrained in conventional endoscopic approaches, particularly with larger hematoma volumes (> 50 mL). In this article we describe the development of ASPIHRE (A Surgical Platform for Intracerebral Hemorrhage Robotic Evacuation), the first-ever concentric tube robot that uses off-the-shelf plastic tubes for MR-guided ICH evacuation, improving tool dexterity and procedural visualization. The robot kinematics model is developed based on a calibration-based method and tube mechanics modeling, allowing the models to consider both variable curvature and torsional deflection. The MR-safe pneumatic motors are controlled using a variable gain PID algorithm producing a rotational accuracy of 0.317 +/- 0.3 degrees. The hardware and theoretical models are validated in a series of systematic bench-top and MRI experiments resulting in positional accuracy of the tube tip of 1.39 +\- 0.54 mm. Following validation of targeting accuracy, the evacuation efficacy of the robot was tested in an MR-guided phantom clot evacuation experiment. The robot was able to evacuate an initially 38.36 mL clot in 5 minutes, leaving a residual hematoma of 8.14 mL, well below the 15 mL guideline suggesting good post-ICH evacuation clinical outcomes.

cs.RO↗

arXiv2022

Distributed Coordination of Charging Stations Considering Aggregate EV Power Flexibility

In recent years, electric vehicle (EV) charging stations have witnessed a rapid growth. However, effective management of charging stations is challenging due to individual EV owners' privacy concerns, competing interests of different stations, and the coupling distribution network constraints. To cope with this challenge, this paper proposes a two-stage scheme. In the first stage, the aggregate EV power flexibility region is derived by solving an optimization problem. We prove that any trajectory within the obtained region corresponds to at least one feasible EV dispatch strategy. By submitting this flexibility region instead of the detailed EV data to the charging station operator, EV owners' privacy can be preserved and the computational burden can be reduced. In the second stage, a distributed coordination mechanism with a clear physical interpretation is developed with consideration of AC power flow constraints. We prove that the proposed mechanism is guaranteed to converge to the centralized optimum. Case studies validate the theoretical results. Comprehensive performance comparisons are carried out to demonstrate the advantages of the proposed scheme.

eess.SY↗

arXiv2022

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↗

arXiv2022

Hallucinated Neural Radiance Fields in the Wild

Neural Radiance Fields (NeRF) has recently gained popularity for its impressive novel view synthesis ability. This paper studies the problem of hallucinated NeRF: i.e., recovering a realistic NeRF at a different time of day from a group of tourism images. Existing solutions adopt NeRF with a controllable appearance embedding to render novel views under various conditions, but they cannot render view-consistent images with an unseen appearance. To solve this problem, we present an end-to-end framework for constructing a hallucinated NeRF, dubbed as Ha-NeRF. Specifically, we propose an appearance hallucination module to handle time-varying appearances and transfer them to novel views. Considering the complex occlusions of tourism images, we introduce an anti-occlusion module to decompose the static subjects for visibility accurately. Experimental results on synthetic data and real tourism photo collections demonstrate that our method can hallucinate the desired appearances and render occlusion-free images from different views. The project and supplementary materials are available at https://rover-xingyu.github.io/Ha-NeRF/.

cs.CV↗

arXiv2022

Generalized Multi-cluster Game under Partial-decision Information with Applications to Management of Energy Internet

The decision making and management of many engineering networks involves multiple parties with conflicting interests, while each party is constituted with multiple agents. Such problems can be casted as a multi-cluster game. Each cluster is treated as a self-interested player in a non-cooperative game where agents in the same cluster cooperate together to optimize the payoff function of the cluster. In a large-scale network, the information of agents in a cluster can not be available immediately for agents beyond this cluster, which raise challenges to the existing Nash equilibrium seeking algorithms. Hence, we consider a partial-decision information scenario in generalized Nash equilibrium seeking for multi-cluster games in a distributed manner. We reformulate the problem as finding zeros of the sum of preconditioned monotone operators by the primal-dual analysis and graph Laplacian matrix. Then a distributed generalized Nash equilibrium seeking algorithm is proposed without requiring fully awareness of its opponent clusters' decisions based on a forward-backward-forward method. With the algorithm, each agent estimates the strategies of all the other clusters by communicating with neighbors via an undirected network. We show that the derived operators can be monotone when the communication strength parameter is sufficiently large. We prove the algorithm convergence resorting to the fixed point theory by providing a sufficient condition. We discuss its potential application in Energy Internet with numerical studies.

cs.GT↗

arXiv2022

Hybrid Reinforcement Learning for STAR-RISs: A Coupled Phase-Shift Model Based Beamformer

A simultaneous transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) assisted multi-user downlink multiple-input single-output (MISO) communication system is investigated. In contrast to the existing ideal STAR-RIS model assuming an independent transmission and reflection phase-shift control, a practical coupled phase-shift model is considered. Then, a joint active and passive beamforming optimization problem is formulated for minimizing the long-term transmission power consumption, subject to the coupled phase-shift constraint and the minimum data rate constraint. Despite the coupled nature of the phase-shift model, the formulated problem is solved by invoking a hybrid continuous and discrete phase-shift control policy. Inspired by this observation, a pair of hybrid reinforcement learning (RL) algorithms, namely the hybrid deep deterministic policy gradient (hybrid DDPG) algorithm and the joint DDPG & deep-Q network (DDPG-DQN) based algorithm are proposed. The hybrid DDPG algorithm controls the associated high-dimensional continuous and discrete actions by relying on the hybrid action mapping. By contrast, the joint DDPG-DQN algorithm constructs two Markov decision processes (MDPs) relying on an inner and an outer environment, thereby amalgamating the two agents to accomplish a joint hybrid control. Simulation results demonstrate that the STAR-RIS has superiority over other conventional RISs in terms of its energy consumption. Furthermore, both the proposed algorithms outperform the baseline DDPG algorithm, and the joint DDPG-DQN algorithm achieves a superior performance, albeit at an increased computational complexity.

eess.SY↗

arXiv2022

Improved Approximation of Dispatchable Region in Radial Distribution Networks via Dual SOCP

The concept of dispatchable region is useful in quantifying how much renewable generation power the system can handle. In this paper, we aim to provide an improved dispatchable region approximation method in distribution networks. First, based on the nonlinear Dist-Flow model, an optimization problem that minimizes the sum of slack variables is formulated to describe the dispatchable region. The nonconvexity caused by alternating-current (AC) power flow constraints makes it intractable. To deal with this issue, the problem is relaxed to a second-order cone program (SOCP) whose strong dual problem is derived. Then, an SOCP-based projection algorithm is developed to construct a convex polytopic approximation. We prove that the proposed algorithm can generate the accurate SOCP-relaxed dispatchable region under certain conditions. Furthermore, a heuristic method is proposed to approximately remove the regions that make the SOCP relaxation inexact. The final region obtained is the difference of several convex sets and can be nonconvex. Thus, the proposed approach may provide a better approximation of the actually nonconvex dispatchable region than previous work that could construct convex sets only. Numerical results demonstrate that the proposed method can achieve a high accuracy of approximation with simple computation.

math.OC↗

arXiv2022

A Distributed Online Algorithm for Promoting Energy Sharing Between EV Charging Stations

In recent years, electric vehicle (EV) charging station has experienced an increasing supply-demand mismatch due to its fluctuating renewables and unpredictable charging demand. To reduce its operating cost, this paper proposes a distributed online algorithm to promote the energy sharing between charging stations. We begin with the offline and centralized version of the EV charging stations operation problem, whose objective is to minimize the long-term time-average total cost. Then, we develop an online implementation approach based on the Lyapunov optimization framework. Although the proposed online algorithm runs in a prediction-free manner, we prove that by properly choosing the parameters, the time-coupling constraints remain to be satisfied. We also provide a theoretical bound for the optimality gap between the offline and online optimums. Furthermore, an improved alternating direction method of multipliers (ADMM) algorithm with iteration truncation is proposed to enable distributed computation. The proposed algorithm can protect privacy while being suitable for online implementation. Case studies validate the effectiveness of the theoretical results. Comprehensive performance comparisons are carried out to demonstrate the advantages of the proposed method.

math.OC↗

arXiv2022

Dynamical structural instability and its implication on the physical properties of infinite-layer nickelates

We use first-principles calculations to find that in infinite-layer nickelates $R$NiO$_2$, the widely studied tetragonal $P4/mmm$ structure is only dynamically stable for early lanthanide elements $R$ = La-Sm. For late lanthanide elements $R$ = Eu-Lu, an imaginary phonon frequency appears at $A=(π,π,π)$ point. For those infinite-layer nickelates, condensation of this phonon mode into the $P4/mmm$ structure leads to a more energetically favorable $I4/mcm$ structure that is characterized by an out-of-phase rotation of "NiO$_4$ square". Special attention is given to two borderline cases: PmNiO$_2$ and SmNiO$_2$, in which both the $P4/mmm$ structure and the $I4/mcm$ structure are local minima and the energy difference between the two structures can be fine-tuned by epitaxial strain. Compared to the $P4/mmm$ structure, $R$NiO$_2$ in the $I4/mcm$ structure has a substantially reduced Ni $d_{x^2-y^2}$ bandwidth, a smaller Ni $d$ occupancy, a "cleaner" Fermi surface with a lanthanide-$d$-derived electron pocket suppressed at $Γ$ point, and a decreased critical $U_{\textrm{Ni}}$ to stabilize long-range antiferromagnetic ordering. All these features imply enhanced correlation effects and favor Mott physics. Our work reveals the importance of structure-property relation in infinite-layer nickelates, in particular, the spontaneous "NiO$_4$ square" rotation provides a tuning knob to render $R$NiO$_2$ in the $I4/mcm$ structure a closer analogy to superconducting infinite-layer cuprates.

cond-mat.mtrl-sci↗

arXiv2022

Laser Manipulation of Spin-Exchange Interaction Between Alkaline-Earth Atoms in $^1$S$_0$ and $^3$P$_2$ States

Ultracold gases of fermionic alkaline-earth (like) atoms are hopeful candidates for the quantum simulation of many-body physics induced by magnetic impurities (e.g., the Kondo physics), because there are spin-exchange interactions (SEIs) between two atoms in the electronic ground ($^1$S$_0$) and metastable ($^3$P) state, respectively. Nevertheless, this SEI cannot be tuned via magnetic Feshbach resonance. In this work we propose three methods to control the SEI between one atom in the $^1$S$_0$ state and another atom in the $^3$P$_2$ states or $^3$P$_2$-$^3$P$_0$ dressed states, with one or two laser beams.These methods are based on the spin-dependent AC-Stark shifts of the $^3$P$_2$ states, or the $^3$P$_2$-$^3$P$_0$ Raman coupling. We show that due to the structure of alkaline-earth (like) atoms, the heating effects induced by the laser beams of our methods are very weak. For instance, for ultracold Yb atoms, AC-Stark-shift difference of variant spin states of the $^3$P$_2(F=3/2)$ level, or the strength of the $^3$P$_2$-$^3$P$_0$ Raman coupling, could be of the order of $(2π)$MHz, while the heating rate (photon scattering rate) is only of the order of Hz. As a result, the Feshbach resonances, with which one can efficiently control the SEI by changing the laser intensity, may be induced by the laser beams with low-enough heating rate, even if the scattering lengths of the bare inter-atomic interaction are so small that being comparable with the length scale associated with the van der Waals interaction.

cond-mat.quant-gas↗

arXiv2022

On Nash-Stackelberg-Nash Games under Decision-Dependent Uncertainties: Model and Equilibrium

In this paper, we discuss a class of two-stage hierarchical games with multiple leaders and followers, which is called Nash-Stackelberg-Nash (N-S-N) games. Particularly, we consider N-S-N games under decision-dependent uncertainties (DDUs). DDUs refer to the uncertainties that are affected by the strategies of decision-makers and have been rarely addressed in game equilibrium analysis. In this paper, we first formulate the N-S-N games with DDUs of complete ignorance, where the interactions between the players and DDUs are characterized by uncertainty sets that depend parametrically on the players' strategies. Then, a rigorous definition for the equilibrium of the game is established by consolidating generalized Nash equilibrium and Pareto-Nash equilibrium. Afterward, we prove the existence of the equilibrium of N-S-N games under DDUs by applying Kakutani's fixed-point theorem. Finally, an illustrative example is provided to show the impact of DDUs on the equilibrium of N-S-N games.

cs.GT↗

arXiv2022

Neuroevolution machine learning potentials: Combining high accuracy and low cost in atomistic simulations and application to heat transport

We develop a neuroevolution-potential (NEP) framework for generating neural network based machine-learning potentials. They are trained using an evolutionary strategy for performing large-scale molecular dynamics (MD) simulations. A descriptor of the atomic environment is constructed based on Chebyshev and Legendre polynomials. The method is implemented in graphic processing units within the open-source GPUMD package, which can attain a computational speed over $10^7$ atom-step per second using one Nvidia Tesla V100. Furthermore, per-atom heat current is available in NEP, which paves the way for efficient and accurate MD simulations of heat transport in materials with strong phonon anharmonicity or spatial disorder, which usually cannot be accurately treated either with traditional empirical potentials or with perturbative methods.

physics.comp-ph↗

arXiv2022

Anomalous transverse optic phonons in SnTe and PbTe -- revisited

We present a study of the soft transverse optic phonon mode in SnTe in comparison to the corresponding mode in PbTe using inelastic neutron scattering and ab-initio lattice dynamical calculations. In contrast to previous reports our calculations predict that the soft mode in SnTe features a strongly asymmetric spectral weight distribution qualitatively similar to that found in PbTe. Experimentally, we find that the overall width in energy of the phonon peaks is comparable in our neutron scattering spectra for SnTe and PbTe. We observe the well-known double-peak-like signature of the TO mode in PbTe even down to $T$ = 5 K questioning its proposed origin purely based on phonon-phonon scattering. The proximity to the incipient ferroelectric transition in PbTe likely plays an important role not included in current models.

cond-mat.mtrl-sci↗