BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Zhiyong Chen

Zhiyong Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Information Theoryeess.SYMachine Learningmath.ITmath.OCSystems and Controleess.SPMultiagent SystemsRoboticsArtificial Intelligencecond-mat.mtrl-sci

Trust snapshot

Quick read

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

17 published item(s)

preprint2026arXiv

Channel Estimation for RIS-Assisted mmWave Systems via Diffusion Models

Reconfigurable intelligent surface (RIS) has been recognized as a promising technology for next-generation wireless communications. However, the performance of RIS-assisted systems critically depends on accurate channel state information (CSI). To address this challenge, this letter proposes a novel channel estimation method for RIS-aided millimeter-wave (mmWave) systems based on diffusion models (DMs). Specifically, the forward diffusion process of the original signal is formulated to model the received signal as a noisy observation within the framework of DMs. Subsequently, the channel estimation task is formulated as the reverse diffusion process, and a sampling algorithm based on denoising diffusion implicit models (DDIMs) is developed to enable effective inference. Furthermore, a lightweight neural network, termed BRCNet, is introduced to replace the conventional U-Net, significantly reducing the number of parameters and computational complexity. Extensive experiments conducted under various scenarios demonstrate that the proposed method consistently outperforms existing baselines.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

CR^2: Cost-Aware Risk-Controlled Routing for Wireless Device-Edge LLM Inference

As large language models (LLMs) move from centralized clouds to mobile edge environments, efficient serving must balance latency, energy consumption, and accuracy under constrained device-edge resources. Query-level routing between lightweight on-device models and stronger edge models provides a flexible mechanism to navigate this trade-off. However, existing routers are designed for centralized cloud settings and optimize token-level costs, failing to capture the dynamic latency and energy overheads in wireless edge deployments. In this paper, we formulate mobile edge LLM routing as a deployment-constrained, cost-aware decision problem, and propose CR^2, a two-stage device-edge routing framework. CR^2 decouples a lightweight on-device margin gate from an edge-side utility selector for deferred queries. The margin gate operates on frozen query embeddings and a user-specified cost weight to predict whether local execution is utility-optimal relative to the best edge alternative under the target operating point. We further introduce a conformal risk control (CRC) calibration procedure that maps each operating point to an acceptance threshold, enabling explicit control of the marginal false-acceptance risk under the full-information utility reference. Experiments on the routing task show that CR^2 closely matches a full-information reference router using only device-side signals before deferral. Compared with strong query-level baselines, CR^2 consistently improves the deployable accuracy-cost Pareto frontier and reduces normalized deployment cost by up to 16.9% at matched accuracy.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Domain-Adaptive Communication-Rate Optimization for Sim-to-Real Humanoid-Robot Wireless XR Teleoperation

Wireless extended reality (XR) teleoperation provides embodied interaction capability for collecting humanoid robot demonstrations, but the large-scale adoption is restricted by the overhead of high-frequency motion transmission. This paper develops a system framework that integrates sampling, transmission, interpolation, and reconstruction and formulates a communication-rate optimization that aims to minimize the communication energy while maintaining the reconstruction accuracy of robot motion trajectories through dimension-wise sampling-rate control. Since acquiring real-time feedback from physical robots is limited by hardware costs, it is necessary to solve the problem through simulator interaction with offline real-domain data correction. To guide sim-to-real adaptation, we provide a PAC-Bayes generalization characterization that reveals the effects of latent density-ratio estimation, finite-sample deviation, and encoder bias. Building on this analysis, we propose a proximal policy optimization (PPO) method with density-ratio weighting and trust-region regularization. Experiments on public humanoid teleoperation dataset show that the proposed method improves the tradeoff between reconstruction error and communication energy consumption under sim-to-real distribution shift. We further analyze the effectiveness of the proposed algorithm across various wireless channels and dynamic motion trajectories.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Multiagent Reinforcement Learning with Neighbor Action Estimation

Multiagent reinforcement learning, as a prominent intelligent paradigm, enables collaborative decision-making within complex systems. However, existing approaches often rely on explicit action exchange between agents to evaluate action value functions, which is frequently impractical in real-world engineering environments due to communication constraints, latency, energy consumption, and reliability requirements. From an artificial intelligence perspective, this paper proposes an enhanced multiagent reinforcement learning framework that employs action estimation neural networks to infer agent behaviors. By integrating a lightweight action estimation module, each agent infers neighboring agents' behaviors using only locally observable information, enabling collaborative policy learning without explicit action sharing. This approach is fully compatible with standard TD3 algorithms and scalable to larger multiagent systems. At the engineering application level, this framework has been implemented and validated in dual-arm robotic manipulation tasks: two robotic arms collaboratively lift objects. Experimental results demonstrate that this approach significantly enhances the robustness and deployment feasibility of real-world robotic systems while reducing dependence on information infrastructure. Overall, this research advances the development of decentralized multiagent artificial intelligence systems while enabling AI to operate effectively in dynamic, information-constrained real-world environments.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

Scalable Multiagent Reinforcement Learning with Collective Influence Estimation

Multiagent reinforcement learning (MARL) has attracted considerable attention due to its potential in addressing complex cooperative tasks. However, existing MARL approaches often rely on frequent exchanges of action or state information among agents to achieve effective coordination, which is difficult to satisfy in practical robotic systems. A common solution is to introduce estimator networks to model the behaviors of other agents and predict their actions; nevertheless, such designs cause the size and computational cost of the estimator networks to grow rapidly with the number of agents, thereby limiting scalability in large-scale systems. To address these challenges, this paper proposes a multiagent learning framework augmented with a Collective Influence Estimation Network (CIEN). By explicitly modeling the collective influence of other agents on the task object, each agent can infer critical interaction information solely from its local observations and the task object's states, enabling efficient collaboration without explicit action information exchange. The proposed framework effectively avoids network expansion as the team size increases; moreover, new agents can be incorporated without modifying the network structures of existing agents, demonstrating strong scalability. Experimental results on multiagent cooperative tasks based on the Soft Actor-Critic (SAC) algorithm show that the proposed method achieves stable and efficient coordination under communication-limited environments. Furthermore, policies trained with collective influence modeling are deployed on a real robotic platform, where experimental results indicate significantly improved robustness and deployment feasibility, along with reduced dependence on communication infrastructure.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

A Sampling Control Framework and Applications to Robust and Adaptive Control

In this paper, we propose a novel sampling control framework based on the emulation technique where the sampling error is regarded as an auxiliary input to the emulated system. Utilizing the supremum norm of sampling error, the design of periodic sampling and event-triggered control law renders the error dynamics bounded-input-bounded-state (BIBS), and when coupled with system dynamics, achieves global or semi-global stabilization. The proposed framework is then extended to tackle the event-triggered and periodic sampling stabilization for a system where only partial state is available for feedback and the system is subject to parameter uncertainties. The proposed framework is further extended to solve two classes of event-triggered adaptive control problems where the emulated closed-loop system does not admit an input-to-state stability (ISS) Lyapunov function. For the first class of systems with linear parameterized uncertainties, even-triggered global adaptive stabilization is achieved without the global Lipschitz condition on nonlinearities as often required in the literature. For the second class of systems with uncertainties whose bound is unknown, the event-triggered adaptive (dynamic) gain controller is designed for the first time. Finally, theoretical results are verified by two numerical examples.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Adaptive Cooperative Tracking and Parameter Estimation of an Uncertain Leader over General Directed Graphs

This paper studies cooperative tracking problem of heterogeneous Euler-Lagrange systems with an uncertain leader. Different from most existing works, system dynamic knowledge of the leader node is unaccessible to any follower node in our paper. Distributed adaptive observers are designed for all follower nodes, simultaneously estimate the state and parameters of the leader node. The observer design does not rely on the frequency knowledge of the leader node, and the estimation errors are shown to converge to zero exponentially. Moreover, the results are applied to general directed graphs, where the symmetry of Laplacian matrix does not hold. This is due to two newly developed Lyapunov equations, which solely depend on communication network topologies. Interestingly, using these Lyapunov equations, many results of multi-agent systems over undirected graphs can be extended to general directed graphs. Finally, this paper also advances the knowledge base of adaptive control systems by providing a main tool in the analysis of parameter convergence for adaptive observers.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Age of Information-based Scheduling for Wireless D2D Systems with a Deep Learning Approach

Device-to-device (D2D) links scheduling for avoiding excessive interference is critical to the success of wireless D2D communications. Most of the traditional scheduling schemes only consider the maximum throughput or fairness of the system and do not consider the freshness of information. In this paper, we propose a novel D2D links scheduling scheme to optimize an age of information (AoI) and throughput jointly scheduling problem when D2D links transmit packets under the last-come-first-serve policy with packet-replacement (LCFS-PR). It is motivated by the fact that the maximum throughput scheduling may reduce the activation probability of links with poor channel conditions, which results in terrible AoI performance. Specifically, We derive the expression of the overall average AoI and throughput of the network under the spatio-temporal interfering queue dynamics with the mean-field assumption. Moreover, a neural network structure is proposed to learn the mapping from the geographic location to the optimal scheduling parameters under a stationary randomized policy, where the scheduling decision can be made without estimating the channel state information(CSI) after the neural network is well-trained. To overcome the problem that implicit loss functions cannot be back-propagated, we derive a numerical solution of the gradient. Finally, numerical results reveal that the performance of the deep learning approach is close to that of a local optimal algorithm which has a higher computational complexity. The trade-off curve of AoI and throughput is also obtained, where the AoI tends to infinity when throughput is maximized.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Fixed-time Synchronization of Networked Uncertain Euler-Lagrange Systems

This paper considers the fixed-time control problem of a multi-agent system composed of a class of Euler-Lagrange dynamics with parametric uncertainty and a dynamic leader under a directed communication network. A distributed fixed-time observer is first proposed to estimate the desired trajectory and then a fixed-time controller is constructed by transforming uncertain Euler-Lagrange systems into second-order systems and utilizing the backstepping design procedure. The overall design guarantees that the synchronization errors converge to zero in a prescribed time independent of initial conditions. The control design conditions can also be relaxed for a weaker finite-time control requirement.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Multi-wavelength magnetic coding of helical luminescence in ferromagnetic 2D layered CrI3

Two-dimensional (2D) van der Waals (vdW) ferromagnets have opened new avenues for manipulating spin at the limits of single or few atomic layers, and for creating unique magneto-exciton devices through the coupling of long-range ferromagnetic (FM) orders and excitons. However, 2D vdW ferromagnets explored so far have rarely possessed exciton behaviors; to date, FM CrI3 have been recently revealed to show ligand-field photoluminescence correlated with FM ordering, but typically with a broad emission peak. Alternatively, many-body excitons have been observed in antiferromagnetic (AFM) NiPS3, but the coupling of excitons with AFM orders is exponentially more difficult, owing to extremely high coercivity. Here, we report a straightforward approach to realize strong coupling of narrow helical emission and FM orders at a low magnetic field in CrI3 through a relatively simple microsphere cavity. We show that the resonant whispering-gallery-modes (WGM) of SiO2 microspheres give rising to a series of strong oscillation helical emissions with a full width at half-maximum (FWHM) of ~5 nm under continuous wave excitation. Reversible magnetic control and coding of helical luminescence with multiwavelength is realized in the range of 950-1100 nm. This work enables plenty of opportunities for creating magnetic encoding lasing for photonic integrated chips.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Structural Consensus in Networks with Directed Topologies and Its Cryptographic Implementation

The existing cryptosystem based approaches for privacy-preserving consensus of networked systems are usually limited to those with undirected topologies. This paper proposes a new privacy-preserving algorithm for networked systems with directed topologies to reach confidential consensus. As a prerequisite for applying the algorithm, a structural consensus problem is formulated and the solvability conditions are discussed for an explicitly constructed controller. The controller is then implemented with encryption to achieve consensus while avoiding individual's information leakage to external eavesdroppers and/or malicious internal neighbors.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Coupling effect and pole assignment in trajectory regulation of multi-agent systems

This paper revisits a well studied leader-following consensus problem of linear multi-agent systems, while aiming at follower nodes' transient performance. Conventionally, when not all follower nodes have access to the leader's state information, distributed observers are designed to estimate the leader's state, and the observers are coupled via communication network. Then each follower node only needs to track its observer's state independently, without interacting with its neighbors. This paper deliberately introduces certain coupling effect among follower nodes, such that the follower nodes tend to converge to each other cooperatively on the way they converge to the leader. Moreover, by suitably designing the control law, the poles of follower nodes can be assigned as desired, and thus transient tracking performance can also be adjusted.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Communications-Caching-Computing Tradeoff Analysis for Bidirectional Data Computation in Mobile Edge Networks

With the advent of the modern mobile traffic, e.g., online gaming, augmented reality delivery and etc., a novel bidirectional computation task model where the input data of each task consists of two parts, one generated at the mobile device in real-time and the other originated from the Internet proactively, is emerging as an important use case of 5G. In this paper, for ease of analytical analysis, we consider the homogeneous bidirectional computation task model in a mobile edge network which consists of one mobile edge computing (MEC) server and one mobile device, both enabled with computing and caching capabilities. Each task can be served via three mechanisms, i.e., local computing with local caching, local computing without local caching and computing at the MEC server. To minimize the average bandwidth, we formulate the joint caching and computing optimization problem under the latency, cache size and average power constraints. We derive the closed-form expressions for the optimal policy and the minimum bandwidth. The tradeoff among communications, computing and caching is illustrated both analytically and numerically, which provides insightful guideline for the network designers.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Control of Large-Scale Networked Cyberphysical Systems Using Cryptographic Techniques

This paper aims to create a secure environment for networked control systems composed of multiple dynamic entities and computational control units via networking, in the presence of disclosure attacks. In particular, we consider the situation where some dynamic entities or control units are vulnerable to attacks and can become malicious. Our objective is to ensure that the input and output data of the benign entities are protected from the malicious entities as well as protected when they are transferred over the networks in a distributed environment. Both these security requirements are achieved using cryptographic techniques. However, the use of cryptographic mechanisms brings additional challenges to the design of controllers in the encrypted state space; the closed-loop system gains and states are required to match the specified cryptographic algorithms. In this paper, we propose a methodology for the design of secure networked control systems integrating the cryptographic mechanisms with the control algorithms. The approach is based on the separation principle, with the cryptographic techniques addressing the security requirements and the control algorithms satisfying their performance requirements.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Exploiting Computation Replication for Mobile Edge Computing: A Fundamental Computation-Communication Tradeoff Study

Existing works on task offloading in mobile edge computing (MEC) networks often assume a task is executed once at a single edge node (EN). Downloading the computed result from the EN back to the mobile user may suffer long delay if the downlink channel experiences strong interference or deep fading. This paper exploits the idea of computation replication in MEC networks to speed up the downloading phase. Computation replication allows each user to offload its task to multiple ENs for repetitive execution so as to create multiple copies of the computed result at different ENs which can then enable transmission cooperation and hence reduce the communication latency for result downloading. Yet, computation replication may also increase the communication latency for task uploading, despite the obvious increase in computation load. The main contribution of this work is to characterize asymptotically an order-optimal upload-download communication latency pair for a given computation load in a multi-user multi-server MEC network. Analysis shows when the computation load increases within a certain range, the downloading time decreases in an inversely proportional way if it is binary offloading or decreases linearly if it is partial offloading, both at the expense of linear increase in the uploading time.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Mobile Communications, Computing and Caching Resources Optimization for Coded Caching with Device Computing

Edge caching and computing have been regarded as an efficient approach to tackle the wireless spectrum crunch problem. In this paper, we design a general coded caching with device computing strategy for content computation, e.g., virtual reality (VR) rendering, to minimize the average transmission bandwidth with the caching capacity and the energy constraints of each mobile device, and the maximum tolerable delay constraint of each task. The key enabler is that because both coded data and stored data can be the data before or after computing, the proposed scheme has numerous edge computing and caching paths corresponding to different bandwidth requirement. We thus formulate a joint coded caching and computing optimization problem to decide whether the mobile devices cache the input data or the output data, which tasks to be coded cached and which tasks to compute locally. The optimization problem is shown to be 0-1 nonconvex nonsmooth programming and can be decomposed into the computation programming and the coded caching programming. We prove the convergence of the computation programming problem by utilizing the alternating direction method of multipliers (ADMM), and a stationary point can be obtained. For the coded cache programming, we design a low complexity algorithm to obtain an acceptable solution. Numerical results demonstrate that the proposed scheme provides a significant bandwidth saving by taking full advantage of the caching and computing capability of mobile devices.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Resilient Consensus via Weight Learning and Its Application in Fault-Tolerant Clock Synchronization

This paper addresses the distributed consensus problem in the presence of faulty nodes. A novel weight learning algorithm is introduced such that neither network connectivity nor a sequence of history records is required to achieve resilient consensus. The critical idea is to dynamically update the interaction weights among neighbors learnt from their credibility measurement. Basically, we define a reward function that is inversely proportional to the distance to its neighbor, and then adjust the credibility based on the reward derived at the present step and the previous credibility. In such a way, the interaction weights are updated at every step, which integrates the historic information and degrades the influences from faulty nodes. Both fixed and stochastic topologies are considered in this paper. Furthermore, we apply this novel approach in clock synchronization problem. By updating the logical clock skew and offset via the corresponding weight learning algorithms, respectively, the logical clock synchronization is eventually achieved regardless of faulty nodes. Simulations are provided to illustrate the effectiveness of the strategy.

0 citations0 reviewsNo code linkedOpen access