Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
10works
0followers
15topics
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

10 published item(s)

preprint2026arXiv

Optimizing Server Placement for Vertical Federated Learning in Dynamic Edge/Fog Networks

We investigate the control and optimization of vertical federated learning (VFL), a class of distributed machine learning (ML) methods in which edge/fog devices contain separate data features, in dynamic edge/fog networks. Owing to heterogeneous data features and hardware across edge/fog networks, devices' contributions to VFL vary substantially, and, moreover, dynamic edge/fog networks can lead to the permanent exit or entry of select data features. In this setting, our proposed methodology, server controlled VFL in dynamic networks (SC-DN), first establishes the existence of a global first-order stationary point for every global round, and then leverages this result to jointly optimize ML model training and resource consumption based on four key control variables: (i) server placement, (ii) device-to-server transmit power, (iii) local device processor frequency, and (iv) local training iterations per global round. The resulting optimization formulation contains coupled variables as well as numerous forms of logarithmic constraints which we show is a mixed-integer signomial program, an NP-hard problem, and for which we develop a general solver. Finally, via experiments on both image and multi-modal datasets, we show that our methodology demonstrates superior classification/regression performance and resource consumption savings than even greedy methodologies.

preprint2024arXiv

Multi-Source to Multi-Target Decentralized Federated Domain Adaptation

Heterogeneity across devices in federated learning (FL) typically refers to statistical (e.g., non-i.i.d. data distributions) and resource (e.g., communication bandwidth) dimensions. In this paper, we focus on another important dimension that has received less attention: varying quantities/distributions of labeled and unlabeled data across devices. In order to leverage all data, we develop a decentralized federated domain adaptation methodology which considers the transfer of ML models from devices with high quality labeled data (called sources) to devices with low quality or unlabeled data (called targets). Our methodology, Source-Target Determination and Link Formation (ST-LF), optimizes both (i) classification of devices into sources and targets and (ii) source-target link formation, in a manner that considers the trade-off between ML model accuracy and communication energy efficiency. To obtain a concrete objective function, we derive a measurable generalization error bound that accounts for estimates of source-target hypothesis deviations and divergences between data distributions. The resulting optimization problem is a mixed-integer signomial program, a class of NP-hard problems, for which we develop an algorithm based on successive convex approximations to solve it tractably. Subsequent numerical evaluations of ST-LF demonstrate that it improves classification accuracy and energy efficiency over state-of-the-art baselines.

preprint2022arXiv

Coded Caching with Heterogeneous User Profiles

Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Several works have studied the achievable peak and average rates under different conditions: variable file lengths or popularities, variable cache sizes, decentralized networks, etc. However, very few have considered the possibility of heterogeneous user profiles, despite modern content providers are investing heavily in categorizing users according to their habits and preferences. This paper proposes three coded caching schemes with uncoded pre-fetching for scenarios where end users are grouped into classes with different file demand sets (FDS). One scheme ignores the difference between the classes, another ignores the intersection between them and the third decouples the delivery of files common to all FDS from those unique to a single class. The transmission rates of the three schemes are compared with a lower bound to evaluate their gap to optimality, and with each other to show that each scheme can outperform the other two when certain conditions are met.

preprint2022arXiv

GenAD: General Representations of Multivariate Time Seriesfor Anomaly Detection

The reliability of wireless base stations in China Mobile is of vital importance, because the cell phone users are connected to the stations and the behaviors of the stations are directly related to user experience. Although the monitoring of the station behaviors can be realized by anomaly detection on multivariate time series, due to complex correlations and various temporal patterns of multivariate series in large-scale stations, building a general unsupervised anomaly detection model with a higher F1-score remains a challenging task. In this paper, we propose a General representation of multivariate time series for Anomaly Detection(GenAD). First, we pre-train a general model on large-scale wireless base stations with self-supervision, which can be easily transferred to a specific station anomaly detection with a small amount of training data. Second, we employ Multi-Correlation Attention and Time-Series Attention to represent the correlations and temporal patterns of the stations. With the above innovations, GenAD increases F1-score by total 9% on real-world datasets in China Mobile, while the performance does not significantly degrade on public datasets with only 10% of the training data.

preprint2022arXiv

Less is More: Generating Grounded Navigation Instructions from Landmarks

We study the automatic generation of navigation instructions from 360-degree images captured on indoor routes. Existing generators suffer from poor visual grounding, causing them to rely on language priors and hallucinate objects. Our MARKY-MT5 system addresses this by focusing on visual landmarks; it comprises a first stage landmark detector and a second stage generator -- a multimodal, multilingual, multitask encoder-decoder. To train it, we bootstrap grounded landmark annotations on top of the Room-across-Room (RxR) dataset. Using text parsers, weak supervision from RxR's pose traces, and a multilingual image-text encoder trained on 1.8b images, we identify 971k English, Hindi and Telugu landmark descriptions and ground them to specific regions in panoramas. On Room-to-Room, human wayfinders obtain success rates (SR) of 71% following MARKY-MT5's instructions, just shy of their 75% SR following human instructions -- and well above SRs with other generators. Evaluations on RxR's longer, diverse paths obtain 61-64% SRs on three languages. Generating such high-quality navigation instructions in novel environments is a step towards conversational navigation tools and could facilitate larger-scale training of instruction-following agents.

preprint2021arXiv

On the Evaluation of Vision-and-Language Navigation Instructions

Vision-and-Language Navigation wayfinding agents can be enhanced by exploiting automatically generated navigation instructions. However, existing instruction generators have not been comprehensively evaluated, and the automatic evaluation metrics used to develop them have not been validated. Using human wayfinders, we show that these generators perform on par with or only slightly better than a template-based generator and far worse than human instructors. Furthermore, we discover that BLEU, ROUGE, METEOR and CIDEr are ineffective for evaluating grounded navigation instructions. To improve instruction evaluation, we propose an instruction-trajectory compatibility model that operates without reference instructions. Our model shows the highest correlation with human wayfinding outcomes when scoring individual instructions. For ranking instruction generation systems, if reference instructions are available we recommend using SPICE.

preprint2021arXiv

The Terrestrial Planet Formation around M Dwarfs: In-situ, Inward Migration or Reversed Migration

Terrestrial planets are commonly observed to orbit M dwarfs with close-in trajectories. In this work, we extensively perform N-body simulations of planetesimal accretion with three models of in-situ, inward migration and reversed migration to explore terrestrial formation in tightly compact systems of M dwarfs. In the simulations, the solid disks are assumed to be 0.01\% of the masses of host stars and spread from 0.01 to 0.5 AU with the surface density profile scaling with $r^{-k}$ according to the observations. Our results show that in-situ scenario may produce $7.77^{+3.23}_{-3.77}$ terrestrial planets with an average mass of $1.23^{+4.01}_{-0.93} \ M_{\oplus}$ around M dwarfs. The number of planets tends to increase as the disk slope is steeper or with a larger stellar mass. Moreover, we show that $2.55^{+1.45}_{-1.55}$ planets with mass of $3.76^{+8.77}_{-3.46} \ M_{\oplus}$ are formed in the systems via inward migration, while $2.85^{+1.15}_{-0.85}$ planets with $3.01^{+13.77}_{-2.71} \ M_{\oplus}$ are yielded under reversed migration. Migration scenarios can also deliver plentiful water from the exterior of ice line to the interior due to more efficient accretion. The simulation outcomes of reversed migration model produce the best matching with observations, being suggestive of a likely mechanism for planetary formation around M dwarfs.

preprint2020arXiv

Departure from the Exact Location of Mean Motion Resonances Induced by the Gas Disk in the Systems Observed by Kepler

The statistical results of transiting planets show that there are two peaks around 1.5 and 2.0 in the distribution of orbital period ratios. A large number of planet pairs are found near the exact location of mean motion resonances (MMRs). In this work, we find out that the depletion and structures of gas disk play crucial roles in driving planet pairs out of exact location of MMRs. Under such scenario, planet pairs are trapped into exact MMRs during orbital migration firstly and keep migrating in a same pace. The eccentricities can be excited. Due to the existence of gas disk, eccentricities can be damped leading to the change of orbital period. It will make planet pairs depart from the exact location of MMRs. With depletion timescales larger than 1 Myr, near MMRs configurations are formed easily. Planet pairs have higher possibilities to escape from MMRs with higher disk aspect ratio. Additionally, with weaker corotation torque, planet pairs can depart farther from exact location of MMRs. The final location of the innermost planets in systems are directly related to the transition radius from optically thick region to inner optically thin disk. While the transition radius is smaller than 0.2 AU at the late stage of star evolution process, the innermost planets can reach around 10 days. Our formation scenario is a possible mechanism to explain the formation of near MMRs configuration with the innermost planet farther than 0.1 AU.

preprint2020arXiv

Narrative Interpolation for Generating and Understanding Stories

We propose a method for controlled narrative/story generation where we are able to guide the model to produce coherent narratives with user-specified target endings by interpolation: for example, we are told that Jim went hiking and at the end Jim needed to be rescued, and we want the model to incrementally generate steps along the way. The core of our method is an interpolation model based on GPT-2 which conditions on a previous sentence and a next sentence in a narrative and fills in the gap. Additionally, a reranker helps control for coherence of the generated text. With human evaluation, we show that ending-guided generation results in narratives which are coherent, faithful to the given ending guide, and require less manual effort on the part of the human guide writer than past approaches.

preprint2020arXiv

The Definition and Long-term Variations of Beijing Blue Days

The phenomenon of Beijing Blue days first occurs on June 11, 2015, and become a hot society topic in a short time. Thus, Beijing's blue day is not only what ordinary people desire but national needs. In this work, using the data of daily average meteorological observations during 1980 and 2014, we select three standards for defining Beijing blue day (BBI), which contain no rain, clear sky, and great dry visibility, and the accuracy is 73.4%.Our study finds that Beijing shares the most significant acceleration in the BTH region, with a growth rate of 2.66 d/year. The greatest seasonal average and the maximum acceleration rate appear in winter for total BBI and continuous BBI days, the least is in summer, while Beijing blue appears most frequently in January. BBI is more related to relative humidity and rainless day on an annual scale, but different in different seasons.