arXiv subjects

Yue Chen

Publications and source records attributed to Yue Chen.

At least 145 records · Page 8Linked to original sources

arXiv2024

A new multiple-arc model of the resonant Kuiper belt objects -- Plutinos

To incorporate the gravitational influence of Kuiper belt objects (KBOs) in planetary ephemerides, uniform-ring models are commonly employed. In this paper, for representing the KBO population residing in Neptune's 2:3 mean motion resonance (MMR), known as the Plutinos, we introduce a three-arc model by considering their resonant characteristics. Each `arc' refers to a segment of the uniform ring and comprises an appropriate number of point masses. Then the total perturbation of Plutinos is numerically measured by the change in the Sun-Neptune distance ($Δd_{SN}$). We conduct a comprehensive investigation to take into account various azimuthal and radial distributions associated with the resonant amplitudes ($A$) and eccentricities ($e$) of Plutinos, respectively. The results show that over a 100-year period: (1) at the smallest $e=0.05$, the Sun-Neptune distance change $Δd_{SN}$ caused by Plutinos decreases significantly as $A$ reduces. It can deviate from the value of $Δd_{SN}$ obtained in the ring model by approximately 100 km; (2) as $e$ increases in the medium range of 0.1-0.2, the difference in $Δd_{SN}$ between the arc and ring models becomes increasingly significant; (3) at the largest $e\gtrsim0.25$, $Δd_{SN}$ can approach zero regardless of $A$, and the arc and ring models exhibit a substantial difference in $Δd_{SN}$, reaching up to 170 km. Then the applicability of our three-arc model is further verified by comparing it to the perturbations induced by observed Plutinos on the positions of both Neptune and Saturn. Moreover, the concept of the multiple-arc model, designed for Plutinos, can be easily extended to other MMRs densely populated by small bodies.

astro-ph.EP↗

arXiv2024

A Differentially Private Energy Trading Mechanism Approaching Social Optimum

This paper proposes a differentially private energy trading mechanism for prosumers in peer-to-peer (P2P) markets, offering provable privacy guarantees while approaching the Nash equilibrium with nearly socially optimal efficiency. We first model the P2P energy trading as a (generalized) Nash game and prove the vulnerability of traditional distributed algorithms to privacy attacks through an adversarial inference model. To address this challenge, we develop a privacy-preserving Nash equilibrium seeking algorithm incorporating carefully calibrated Laplacian noise. We prove that the proposed algorithm achieves $ε$-differential privacy while converging in expectation to the Nash equilibrium with a suitable stepsize. Numerical experiments are conducted to evaluate the algorithm's robustness against privacy attacks, convergence behavior, and optimality compared to the non-private solution. Results demonstrate that our mechanism effectively protects prosumers' sensitive information while maintaining near-optimal market outcomes, offering a practical approach for privacy-preserving coordination in P2P markets.

cs.GT↗

arXiv2024

Development of a New Type of Vortex Bladeless Wind Turbine for Urban Energy Systems

Innovation and development of renewable energy devices are crucial for reaching a sustainable and environmentally conscious future. This work focuses on the development of a new type of renewable energy devices in the context of Smart Garden at the Chinese University of Hong Kong, which aims to design a bladeless wind turbine for urban areas, addressing the pressing need for clean energy locally and globally. Traditional wind turbines have been widely adopted in recent decades, while bladeless wind turbines have also displayed their advantages and uniqueness in urban areas. A Vortex Bladeless Wind Turbine (VBWT) is modeled by using Fusion 360 to optimize wind energy generation in urban settings with limited space and buildings-dominated landscape. Optimal parameters of the VBWT were obtained by comparing the results of drag force, lift force and deflection, via the simulations in Ansys. Hardware of proposed bladeless wind turbine has been assembled and developed by 3-dimensional printing. Additional tests and adjustments on hardware further improve the performance of the developed wind turbine. The outcomes of this work have the potential to contribute to future renewable energy initiatives and devote the sustainability efforts in urban energy systems.

cs.CE↗

arXiv2024

Results of the Big ANN: NeurIPS'23 competition

The 2023 Big ANN Challenge, held at NeurIPS 2023, focused on advancing the state-of-the-art in indexing data structures and search algorithms for practical variants of Approximate Nearest Neighbor (ANN) search that reflect the growing complexity and diversity of workloads. Unlike prior challenges that emphasized scaling up classical ANN search ~\cite{DBLP:conf/nips/SimhadriWADBBCH21}, this competition addressed filtered search, out-of-distribution data, sparse and streaming variants of ANNS. Participants developed and submitted innovative solutions that were evaluated on new standard datasets with constrained computational resources. The results showcased significant improvements in search accuracy and efficiency over industry-standard baselines, with notable contributions from both academic and industrial teams. This paper summarizes the competition tracks, datasets, evaluation metrics, and the innovative approaches of the top-performing submissions, providing insights into the current advancements and future directions in the field of approximate nearest neighbor search.

cs.IR↗

arXiv2024

EqvAfford: SE(3) Equivariance for Point-Level Affordance Learning

Humans perceive and interact with the world with the awareness of equivariance, facilitating us in manipulating different objects in diverse poses. For robotic manipulation, such equivariance also exists in many scenarios. For example, no matter what the pose of a drawer is (translation, rotation and tilt), the manipulation strategy is consistent (grasp the handle and pull in a line). While traditional models usually do not have the awareness of equivariance for robotic manipulation, which might result in more data for training and poor performance in novel object poses, we propose our EqvAfford framework, with novel designs to guarantee the equivariance in point-level affordance learning for downstream robotic manipulation, with great performance and generalization ability on representative tasks on objects in diverse poses.

cs.RO↗

arXiv2024

RLGNet: Repeating-Local-Global History Network for Temporal Knowledge Graph Reasoning

Temporal Knowledge Graph (TKG) reasoning involves predicting future events based on historical information. However, due to the unpredictability of future events, this task is highly challenging. To address this issue, we propose a multi-scale hybrid architecture model based on ensemble learning, called RLGNet (Repeating-Local-Global History Network). Inspired by the application of multi-scale information in other fields, we introduce the concept of multi-scale information into TKG reasoning. Specifically, RLGNet captures and integrates different levels of historical information by combining modules that process information at various scales. The model comprises three modules: the Repeating History Module focuses on identifying repetitive patterns and trends in historical data, the Local History Module captures short-term changes and details, and the Global History Module provides a macro perspective on long-term changes. Additionally, to address the limitations of previous single-architecture models in generalizing across single-step and multi-step reasoning tasks, we adopted architectures based on Recurrent Neural Networks (RNN) and Multi-Layer Perceptrons (MLP) for the Local and Global History Modules, respectively. This hybrid architecture design enables the model to complement both multi-step and single-step reasoning capabilities. Finally, to address the issue of noise in TKGs, we adopt an ensemble learning strategy, combining the predictions of the three modules to reduce the impact of noise on the final prediction results. In the evaluation on six benchmark datasets, our approach generally outperforms existing TKG reasoning models in multi-step and single-step reasoning tasks.

cs.AI↗

arXiv2024

Phonon Heat Transport and Anisotropic Tuning of Quantum Fluctuations in a Frustrated Honeycomb Magnet

Honeycomb cobalt oxides containing 3$\it{d}$ Co$^{2+}$ ions might realize frustrated magnetism and novel quantum phases. Among candidate materials, Na$_{3}$Co$_{2}$SbO$_{6}$ stands out for its distorted honeycomb lattice and significant in-plane anisotropy, motivating vector-field tuning inside the honeycomb plane. Here we use thermal transport down to the mK regime to study twin-free crystals of Na$_{3}$Co$_{2}$SbO$_{6}$ subject to in-plane vector fields. We find that the thermal conductivity $κ$ never exceeds the heat-transport capability of phonons, rendering its suppression primarily due to phonon scattering off magnetic excitations and/or domain boundaries. The system's field-driven quantum criticality manifests itself as an abundance of magnetic fluctuations hindering the heat transport, which further depends on the field direction in an intriguing manner.

cond-mat.str-el↗

arXiv2024

A Two-Stage Online Algorithm for EV Charging Station Energy Management and Carbon Trading

The increasing electric vehicle (EV) adoption challenges the energy management of charging stations (CSs) due to the large number of EVs and the underlying uncertainties. Moreover, the carbon footprint of CSs is growing significantly due to the rising charging power demand. This makes it important for CSs to properly manage their energy usage and ensure their carbon footprint stay within their carbon emission quotas. This paper proposes a two-stage online algorithm for this purpose, considering the different time scales of energy management and carbon trading. In the first stage, the CS characterizes the real-time aggregate EV power flexibility, in terms of upper and lower bounds on the total charging power, by a Lyapunov optimization-based online algorithm. In the second stage, the CS co-optimizes energy management and carbon trading, with EV charging power chosen within the aggregate flexibility region provided by the first stage. A generalized battery model is proposed to capture the dynamic carbon footprint changes and carbon trading. A virtual carbon queue is designed to develop an online algorithm for the second stage, which can ensure the carbon footprint of CS be within its carbon emission quota and its total operation cost is nearly offline optimal. Case studies validate the effectiveness and advantages of the proposed algorithm.

math.OC↗

arXiv2024

General-purpose machine-learned potential for 16 elemental metals and their alloys

Machine-learned potentials (MLPs) have exhibited remarkable accuracy, yet the lack of general-purpose MLPs for a broad spectrum of elements and their alloys limits their applicability. Here, we present a feasible approach for constructing a unified general-purpose MLP for numerous elements, demonstrated through a model (UNEP-v1) for 16 elemental metals and their alloys. To achieve a complete representation of the chemical space, we show, via principal component analysis and diverse test datasets, that employing one-component and two-component systems suffices. Our unified UNEP-v1 model exhibits superior performance across various physical properties compared to a widely used embedded-atom method potential, while maintaining remarkable efficiency. We demonstrate our approach's effectiveness through reproducing experimentally observed chemical order and stable phases, and large-scale simulations of plasticity and primary radiation damage in MoTaVW alloys. This work represents a significant leap towards a unified general-purpose MLP encompassing the periodic table, with profound implications for materials science.

cond-mat.mtrl-sci↗

arXiv2024

Empowering Embodied Manipulation: A Bimanual-Mobile Robot Manipulation Dataset for Household Tasks

The advancements in embodied AI are increasingly enabling robots to tackle complex real-world tasks, such as household manipulation. However, the deployment of robots in these environments remains constrained by the lack of comprehensive bimanual-mobile robot manipulation data that can be learned. Existing datasets predominantly focus on single-arm manipulation tasks, while the few dual-arm datasets available often lack mobility features, task diversity, comprehensive sensor data, and robust evaluation metrics; they fail to capture the intricate and dynamic nature of household manipulation tasks that bimanual-mobile robots are expected to perform. To overcome these limitations, we propose BRMData, a Bimanual-mobile Robot Manipulation Dataset specifically designed for household applications. BRMData encompasses 10 diverse household tasks, including single-arm and dual-arm tasks, as well as both tabletop and mobile manipulations, utilizing multi-view and depth-sensing data information. Moreover, BRMData features tasks of increasing difficulty, ranging from single-object to multi-object grasping, non-interactive to human-robot interactive scenarios, and rigid-object to flexible-object manipulation, closely simulating real-world household applications. Additionally, we introduce a novel Manipulation Efficiency Score (MES) metric to evaluate both the precision and efficiency of robot manipulation methods in household tasks. We thoroughly evaluate and analyze the performance of advanced robot manipulation learning methods using our BRMData, aiming to drive the development of bimanual-mobile robot manipulation technologies. The dataset is now open-sourced and available at https://embodiedrobot.github.io/.

cs.RO↗

arXiv2024

Antisymmetric Planar Hall Effect in Rutile Oxide Films Induced by the Lorentz Force

The conventional Hall effect is linearly proportional to the field component or magnetization component perpendicular to a film. Despite the increasing theoretical proposals on the Hall effect to the in-plane field or magnetization in various special systems induced by the Berry curvature, such an unconventional Hall effect has only been experimentally reported in Weyl semimetals and in a heterodimensional superlattice. Here, we report an unambiguous experimental observation of the antisymmetric planar Hall effect (APHE) with respect to the in-plane magnetic field in centrosymmetric rutile RuO2 and IrO2 single-crystal films. The measured Hall resistivity is found to be linearly proportional to the component of the applied in-plane magnetic field along a particular crystal axis and to be independent of the current direction or temperature. Both the experimental observations and theoretical calculations confirm that the APHE in rutile oxide films is induced by the Lorentz force. Our findings can be generalized to ferromagnetic materials for the discovery of anomalous Hall effects and quantum anomalous Hall effects induced by in-plane magnetization. In addition to significantly expanding knowledge of the Hall effect, this work opens the door to explore new members in the Hall effect family.

cond-mat.mes-hall↗

arXiv2024

PreMevE-MEO: Predicting Ultra-relativistic Electrons Using Observations from GPS Satellites

Ultra-relativistic electrons with energies greater than or equal to two megaelectron-volt (MeV) pose a major radiation threat to spaceborne electronics, and thus specifying those highly energetic electrons has a significant meaning to space weather communities. Here we report the latest progress in developing our predictive model for MeV electrons in the outer radiation belt. The new version, primarily driven by electron measurements made along medium-Earth-orbits (MEO), is called PREdictive MEV Electron (PreMevE)-MEO model that nowcasts ultra-relativistic electron flux distributions across the whole outer belt. Model inputs include above 2 MeV electron fluxes observed in MEOs by a fleet of GPS satellites as well as electrons measured by one Los Alamos satellite in the geosynchronous orbit. We developed an innovative Sparse Multi-Inputs Latent Ensemble NETwork (SmileNet) which combines convolutional neural networks with transformers, and we used long-term in-situ electron data from NASA's Van Allen Probes mission to train, validate, optimize, and test the model.It is shown that PreMevE-MEO can provide hourly nowcasts with high model performance efficiency and high correlation with observations.This prototype PreMevE-MEO model demonstrates the feasibility of making high-fidelity predictions driven by observations from longstanding space infrastructure in MEO, thus has great potential of growing into an invaluable space weather operational warning tool.

physics.space-ph↗

arXiv2024

STYLE: Improving Domain Transferability of Asking Clarification Questions in Large Language Model Powered Conversational Agents

Equipping a conversational search engine with strategies regarding when to ask clarification questions is becoming increasingly important across various domains. Attributing to the context understanding capability of LLMs and their access to domain-specific sources of knowledge, LLM-based clarification strategies feature rapid transfer to various domains in a post-hoc manner. However, they still struggle to deliver promising performance on unseen domains, struggling to achieve effective domain transferability. We take the first step to investigate this issue and existing methods tend to produce one-size-fits-all strategies across diverse domains, limiting their search effectiveness. In response, we introduce a novel method, called Style, to achieve effective domain transferability. Our experimental results indicate that Style bears strong domain transferability, resulting in an average search performance improvement of ~10% on four unseen domains.

cs.CL↗

arXiv2024

Preferred-Action-Optimized Diffusion Policies for Offline Reinforcement Learning

Offline reinforcement learning (RL) aims to learn optimal policies from previously collected datasets. Recently, due to their powerful representational capabilities, diffusion models have shown significant potential as policy models for offline RL issues. However, previous offline RL algorithms based on diffusion policies generally adopt weighted regression to improve the policy. This approach optimizes the policy only using the collected actions and is sensitive to Q-values, which limits the potential for further performance enhancement. To this end, we propose a novel preferred-action-optimized diffusion policy for offline RL. In particular, an expressive conditional diffusion model is utilized to represent the diverse distribution of a behavior policy. Meanwhile, based on the diffusion model, preferred actions within the same behavior distribution are automatically generated through the critic function. Moreover, an anti-noise preference optimization is designed to achieve policy improvement by using the preferred actions, which can adapt to noise-preferred actions for stable training. Extensive experiments demonstrate that the proposed method provides competitive or superior performance compared to previous state-of-the-art offline RL methods, particularly in sparse reward tasks such as Kitchen and AntMaze. Additionally, we empirically prove the effectiveness of anti-noise preference optimization.

cs.LG↗

arXiv2024

t-SMILES: A Scalable Fragment-based Molecular Representation Framework for De Novo Molecule Generation

Effective representation of molecules is a crucial factor affecting the performance of artificial intelligence models. This study introduces a flexible, fragment-based, multiscale molecular representation framework called t-SMILES (tree-based SMILES) with three code algorithms: TSSA, TSDY and TSID. It describes molecules using SMILES-type strings obtained by performing a breadth-first search on a full binary tree formed from a fragmented molecular graph. Systematic evaluations using JTVAE, BRICS, MMPA, and Scaffold show the feasibility of constructing a multi-code molecular description system, where various descriptions complement each other, enhancing the overall performance. In addition, it can avoid overfitting and achieve higher novelty scores while maintaining reasonable similarity on labeled low-resource datasets, regardless of whether the model is original, data-augmented, or pre-trained then fine-tuned. Furthermore, it significantly outperforms classical SMILES, DeepSMILES, SELFIES and baseline models in goal-directed tasks. And it surpasses state-of-the-art fragment, graph and SMILES based approaches on ChEMBL, Zinc, and QM9.

cs.LG↗

arXiv2024

LEAP: Optimization Hierarchical Federated Learning on Non-IID Data with Coalition Formation Game

Although Hierarchical Federated Learning (HFL) utilizes edge servers (ESs) to alleviate communication burdens, its model performance will be degraded by non-IID data and limited communication resources. Current works often assume that data is uniformly distributed, which however contradicts the heterogeneity of IoT. Solutions of additional model training to check the data distribution inevitably increases computational costs and the risk of privacy leakage. The challenges in solving these issues are how to reduce the impact of non-IID data without involving raw data and how to rationalize the communication resource allocation for addressing straggler problem. To tackle these challenges, we propose a novel optimization method based on coaLition formation gamE and grAdient Projection, called LEAP. Specifically, we combine edge data distribution with coalition formation game innovatively to adjust the correlations between clients and ESs dynamically, which ensures optimal correlations. We further capture the client heterogeneity to achieve the rational bandwidth allocation from coalition perception and determine the optimal transmission power within specified delay constraints at client level. Experimental results on four real datasets show that LEAP is able to achieve 20.62% improvement in model accuracy compared to the state-of-the-art baselines. Moreover, LEAP effectively reduce transmission energy consumption by at least about 2.24 times.

cs.GT↗

arXiv2024

Achieving Social Optimum and Budget Balance via a Joint Electricity-Carbon Pricing Mechanism

Decarbonizing electric grids is a crucial global endeavor in the pursuit of carbon neutrality. Taking carbon emissions from generation into account when pricing electricity usage is an essential way to achieve this goal. However, such pricing is not trivial due to the requirements of an effective electricity market, such as maintaining budget balance, providing incentives to motivate participants to follow the dispatch schedule, and minimizing the impact on affected parties compared to when they were in the traditional electricity market. Although existing joint electricity-carbon pricing mechanisms have shown promising performance in reducing emissions in power networks, they can hardly meet all the requirements. This paper proposes a novel joint electricity-carbon pricing mechanism based on primal-dual optimality condition-enabled transformation. An algorithm for determining the critical market parameter is developed. The proposed pricing mechanism is proven to possess all the desired properties, including budget balance, individual rationality, dispatch-following incentive compatibility, and truthful-bidding incentive compatibility. These properties ensure the proposed mechanism can incentivize market participants to achieve carbon-aware social optimum in a self-organized and sustainable way. Numerical experiments show the advantages of the proposed pricing mechanism compared to the existing marginal-based and carbon emission flow-based pricing mechanisms.

math.OC↗

arXiv2024

Optimal Real-time Bidding Strategy For EV Aggregators in Wholesale Electricity Markets

With the rapid growth of electric vehicles (EVs), EV aggregators have been playing a increasingly vital role in power systems by not merely providing charging management but also participating in wholesale electricity markets. This work studies the optimal real-time bidding strategy for an EV aggregator. Since the charging process of EVs is time-coupled, it is necessary for EV aggregators to consider future operational conditions (e.g., future EV arrivals) when deciding the current bidding strategy. However, accurately forecasting future operational conditions is challenging under the inherent uncertainties. Hence, there demands a real-time bidding strategy based solely on the up-to-date information, which is the main goal of this work. We start by developing an online optimal EV charging management algorithm for the EV aggregator via Lyapunov optimization. Based on this, an optimal real-time bidding strategy (bidding cost curve and bounds) for the aggregator is derived. Then, an efficient yet practical algorithm is proposed to obtain the bidding strategy. It shows that with the proposed bidding strategy, the aggregator's profit is nearly offline optimal. Moreover, the wholesale electricity market clearing result aligns with the individual aggregator's optimal charging strategy given the prices. Case studies against several benchmarks are conducted to evaluate the performance of the proposed method.

math.OC↗