arXiv subjects

Shuang Feng

Publications and source records attributed to Shuang Feng.

7 recordsLinked to original sources

arXiv2026

Equivalent Circuit Model based Electric Vehicle Evacuation with Mobile Charging Stations

The increasing penetration of electric vehicles (EVs) introduces new challenges for emergency evacuation planning due to limited driving range, long charging times, and constrained charging infrastructure, particularly under disaster induced disruptions. This paper proposes a novel optimization based evacuation framework for EVs using Equivalent Circuit Models (ECMs) to jointly address routing, charging, and congestion management. By leveraging electrical analogies, traffic flow is modeled as electrical current, travel time as resistance, and driving range as voltage, enabling the use of Kirchhoff laws to enforce flow balance and energy feasibility constraints. The proposed controllable ECM incorporates binary switches to regulate route selection and explicitly models charging delays and range replenishment at both Fixed Charging Stations (FCSs) and Mobile Charging Stations (MCSs). The resulting formulation leads to an integer programming problem that determines optimal evacuation routes, charging durations, and the placement and number of MCSs to minimize evacuation time. The framework is extended to multiple origin destination pairs using the principle of superposition and supports fairness aware performance metrics, including worst case, average, and variance based evacuation times. Simulation studies on large scale transportation networks in California demonstrate that the proposed approach significantly improves evacuation efficiency and robustness, particularly in scenarios with limited charging access, highlighting the critical role of MCSs in EV based emergency evacuations.

eess.SY↗

arXiv2024

An Extremely Data-efficient and Generative LLM-based Reinforcement Learning Agent for Recommenders

Recent advancements in large language models (LLMs) have enabled understanding webpage contexts, product details, and human instructions. Utilizing LLMs as the foundational architecture for either reward models or policies in reinforcement learning has gained popularity -- a notable achievement is the success of InstructGPT. RL algorithms have been instrumental in maximizing long-term customer satisfaction and avoiding short-term, myopic goals in industrial recommender systems, which often rely on deep learning models to predict immediate clicks or purchases. In this project, several RL methods are implemented and evaluated using the WebShop benchmark environment, data, simulator, and pre-trained model checkpoints. The goal is to train an RL agent to maximize the purchase reward given a detailed human instruction describing a desired product. The RL agents are developed by fine-tuning a pre-trained BERT model with various objectives, learning from preferences without a reward model, and employing contemporary training techniques such as Proximal Policy Optimization (PPO) as used in InstructGPT, and Direct Preference Optimization (DPO). This report also evaluates the RL agents trained using generative trajectories. Evaluations were conducted using Thompson sampling in the WebShop simulator environment. The simulated online experiments demonstrate that agents trained on generated trajectories exhibited comparable task performance to those trained using human trajectories. This has demonstrated an example of an extremely low-cost data-efficient way of training reinforcement learning agents. Also, with limited training time (<2hours), without utilizing any images, a DPO agent achieved a 19% success rate after approximately 3000 steps or 30 minutes of training on T4 GPUs, compared to a PPO agent, which reached a 15% success rate.

cs.LG↗

arXiv2022

NTIRE 2022 Challenge on High Dynamic Range Imaging: Methods and Results

This paper reviews the challenge on constrained high dynamic range (HDR) imaging that was part of the New Trends in Image Restoration and Enhancement (NTIRE) workshop, held in conjunction with CVPR 2022. This manuscript focuses on the competition set-up, datasets, the proposed methods and their results. The challenge aims at estimating an HDR image from multiple respective low dynamic range (LDR) observations, which might suffer from under- or over-exposed regions and different sources of noise. The challenge is composed of two tracks with an emphasis on fidelity and complexity constraints: In Track 1, participants are asked to optimize objective fidelity scores while imposing a low-complexity constraint (i.e. solutions can not exceed a given number of operations). In Track 2, participants are asked to minimize the complexity of their solutions while imposing a constraint on fidelity scores (i.e. solutions are required to obtain a higher fidelity score than the prescribed baseline). Both tracks use the same data and metrics: Fidelity is measured by means of PSNR with respect to a ground-truth HDR image (computed both directly and with a canonical tonemapping operation), while complexity metrics include the number of Multiply-Accumulate (MAC) operations and runtime (in seconds).

cs.CV↗

arXiv2022

Rational Solutions of First Order Algebraic Ordinary Differential Equations

Let $f(t,y,y')=\sum_{i=0}^n a_i(t,y)y'^i=0$ be an irreducible first order ordinary differential equation with polynomial coefficients. Eremenko in 1998 proved that there exists a constant $C$ such that every rational solution of $f(t,y,y')=0$ is of degree not greater than $C$. Examples show that this degree bound $C$ depends not only on the degrees of $f$ in $t,y,y'$ but also on the coefficients of $f$ viewed as the polynomial in $t,y,y'$. In this paper, we show that if $f$ satisfies $deg(f,y) 0 $ then the degree bound $C$ only depends on the degrees of $f$ in $t,y,y'$, and furthermore we present an explicit expression for $C$ in terms of the degrees of $f$ in $t,y,y'$.

math.CA↗

arXiv2021

Quasi-equivalence of heights in algebraic function fields of one variable

For points $(a,b)$ on an algebraic curve over a field $K$ with height $\mathfrak{h}$, the asymptotic relation between $\mathfrak{h}(a)$ and $\mathfrak{h}(b)$ has been extensively studied in diophantine geometry. When $K=\overline{k(t)}$ is the field of algebraic functions in $t$ over a field $k$ of characteristic zero, Eremenko in 1998 proved the following quasi-equivalence for an absolute logarithmic height $\mathfrak{h}$ in $K$: Given $P\in K[X,Y]$ irreducible over $K$ and $ε>0$, there is a constant $C$ only depending on $P$ and $ε$ such that for each $(a,b)\in K^2$ with $P(a,b)=0$, $$ (1-ε) °(P,Y) \mathfrak{h}(b)-C \leq °(P,X) \mathfrak{h}(a) \leq (1+ε) °(P,Y) \mathfrak{h}(b)+C. $$ In this article, we shall give an explicit bound for the constant $C$ in terms of the total degree of $P$, the height of $P$ and $ε$. This result is expected to have applications in some other areas such as symbolic computation of differential and difference equations.

cs.SC↗

arXiv2020

Rational Solutions of First Order Algebraic Ordinary Differential Equations

Let $f(t, y,y')=\sum_{i=0}^d a_i(t, y)y'^i=0$ be a first order ordinary differential equation with polynomial coefficients. Eremenko in 1999 proved that there exists a constant $C$ such that every rational solution of $f(t, y,y')=0$ is of degree not greater than $C$. Examples show that this degree bound $C$ depends not only on the degrees of $f$ in $t,y,y'$ but also on the coefficients of $f$ viewed as polynomial in $t,y,y'$. In this paper, we show that if $$\max_{i=0}^d \{{\rm deg}(a_i,y)-2(d-i)\}>0 $$ then the degree bound $C$ only depends on the degrees of $f$, and furthermore we present an explicit expression for $C$ in terms of the degrees of $f$.

cs.SC↗

arXiv2013

Meta-Analysis of Gene Level Association Tests

The vast majority of connections between complex disease and common genetic variants were identified through meta-analysis, a powerful approach that enables large samples sizes while protecting against common artifacts due to population structure, repeated small sample analyses, and/or limitations with sharing individual level data. As the focus of genetic association studies shifts to rare variants, genes and other functional units are becoming the unit of analysis. Here, we propose and evaluate new approaches for meta-analysis of rare variant association. We show that our approach retains useful features of single variant meta-analytic approaches and demonstrate its utility in a study of blood lipid levels in ~18,500 individuals genotyped with exome arrays.

stat.ME↗