Researcher profile

Ben Liang

Ben Liang contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

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

8 published item(s)

preprint2026arXiv

3DTMDet: A Dual-Path Synergy Network of Transformer and SSM for 3D Object Detection in Point Clouds

A fundamental challenge in point cloud object detection lies in the conflict between the extreme sparsity of distant points and the need for remote context understanding. The existing methods typically use 1D serialization to expand the receptive field, which inevitably discards already scarce local geometric details and reduces detection of distant and small objects. To address this issue, we propose 3DTMDet, a novel detection network that synergistically combines state space models (Mamba) with Transformers. The core idea is to utilize SSM's linear complexity and advantages in long sequence modeling to effectively capture global interactions between sparse and distant points, while using Transformer modules with local attention to encode fine-grained geometric structures in local point sets, preserving accurate shape information. We propose the 3D Hybrid Mamba Transformer (3DHMT) block, which uses an SSM-Attention-SSM pipeline to balance global context understanding and local detail preservation, effectively alleviating the tension between receptive field enlargement and geometric preservation in remote detection. In addition, we introduced a voxel generation block inspired by LiDAR physics, which diffuses features along the sensor observation direction to reconstruct the complete object structure of occlusion and distant areas. Extensive experiments conducted on the KITTI and ONCE datasets have shown that 3DTMDet outperforms state-of-the-art detectors. The code is available at https://github.com/QiuBingwen/3DTMDet.

preprint2026arXiv

Coupled Data and Measurement Space Dynamics for Enhanced Diffusion Posterior Sampling

Inverse problems, where the goal is to recover an unknown signal from noisy or incomplete measurements, are central to applications in medical imaging, remote sensing, and computational biology. Diffusion models have recently emerged as powerful priors for solving such problems. However, existing methods either rely on projection-based techniques that enforce measurement consistency through heuristic updates, or they approximate the likelihood $p(\boldsymbol{y} \mid \boldsymbol{x})$, often resulting in artifacts and instability under complex or high-noise conditions. To address these limitations, we propose a novel framework called \emph{coupled data and measurement space diffusion posterior sampling} (C-DPS), which eliminates the need for constraint tuning or likelihood approximation. C-DPS introduces a forward stochastic process in the measurement space $\{\boldsymbol{y}_t\}$, evolving in parallel with the data-space diffusion $\{\boldsymbol{x}_t\}$, which enables the derivation of a closed-form posterior $p(\boldsymbol{x}_{t-1} \mid \boldsymbol{x}_t, \boldsymbol{y}_{t-1})$. This coupling allows for accurate and recursive sampling based on a well-defined posterior distribution. Empirical results demonstrate that C-DPS consistently outperforms existing baselines, both qualitatively and quantitatively, across multiple inverse problem benchmarks.

preprint2022arXiv

Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions

The performance of online convex optimization algorithms in a dynamic environment is often expressed in terms of the dynamic regret, which measures the decision maker's performance against a sequence of time-varying comparators. In the analysis of the dynamic regret, prior works often assume Lipschitz continuity or uniform smoothness of the cost functions. However, there are many important cost functions in practice that do not satisfy these conditions. In such cases, prior analyses are not applicable and fail to guarantee the optimization performance. In this letter, we show that it is possible to bound the dynamic regret, even when neither Lipschitz continuity nor uniform smoothness is present. We adopt the notion of relative smoothness with respect to some user-defined regularization function, which is a much milder requirement on the cost functions. We first show that under relative smoothness, the dynamic regret has an upper bound based on the path length and functional variation. We then show that with an additional condition of relatively strong convexity, the dynamic regret can be bounded by the path length and gradient variation. These regret bounds provide performance guarantees to a wide variety of online optimization problems that arise in different application domains. Finally, we present numerical experiments that demonstrate the advantage of adopting a regularization function under which the cost functions are relatively smooth.

preprint2022arXiv

Random Caching Design for Multi-User Multi-Antenna HetNets with Interference Nulling

The strong interference suffered by users can be a severe problem in cache-enabled networks (CENs) due to the content-centric user association mechanism. To tackle this issue, multi-antenna technology may be employed for interference management. In this paper, we consider a user-centric interference nulling (IN) scheme in two-tier multi-user multi-antenna CEN, with a hybrid most-popular and random caching policy at macro base stations (MBSs) and small base stations (SBSs) to provide file diversity. All the interfering SBSs within the IN range of a user are requested to suppress the interference at this user using zero-forcing beamforming. Using stochastic geometry analysis techniques, we derive a tractable expression for the area spectral efficiency (ASE). A lower bound on the ASE is also obtained, with which we then consider ASE maximization, by optimizing the caching policy and IN coefficient. To solve the resultant mixed integer programming problem, we design an alternating optimization algorithm to minimize the lower bound of the ASE. Our numerical results demonstrate that the proposed caching policy yields performance that is close to the optimum, and it outperforms several existing baselines.

preprint2021arXiv

Distributed coordinated precoding for MIMO cellular network virtualization

This paper presents a new virtualization method for the downlink of a multi-cell multiple-input multiple-output (MIMO) network, to achieve service isolation among multiple Service Providers (SPs) that share the base station resources of an Infrastructure Provider (InP). Each SP designs a virtual precoder for its users in each cell, as its service demand to the InP, without the need to be aware of the existence of the other SPs or to know the channel state information (CSI) outside the cell. The InP performs network virtualization to meet the SPs' service demands while managing both the inter-SP and inter-cell interference. We consider coordinated multi-cell precoding at the InP and formulate an optimization problem to minimize a weighted sum of signal leakage and precoding deviation, with per-cell transmit power constraints. We propose a fully distributed semi-closed-form solution at each cell, without any CSI exchange across cells. We further propose a low-complexity scheme to allocate the virtual transmit power, for the InP to regulate between interference elimination and virtual demand maximization. Simulation results demonstrate that our precoding solution for network virtualization substantially outperforms the traditional spectrum isolation alternative. It can approach the performance of fully cooperative precoding when the number of antennas is large.

preprint2021arXiv

Task Offloading and Resource Allocation with Multiple CAPs and Selfish Users

In this work, we consider a multi-user mobile edge computing system with multiple computing access points (CAPs). Each mobile user has multiple dependent tasks that must be processed in a round-by-round schedule. In every round, a user may process their individual task locally, or choose to offload their task to one of the $M$ CAPs or the remote cloud server, in order to possibly reduce their processing cost. We aim to jointly optimize the offloading decisions of the users and the resource allocation decisions for each CAP over a global objective function, defined as a weighted sum of total energy consumption and the round time. We first present a centralized heuristic solution, termed MCAP, where the original problem is relaxed to a semi-definite program (SDP) to probabilistically generate the offloading decision. Then, recognizing that the users often exhibit selfish behavior to reduce their individual cost, we propose a game-theoretical approach, termed MCAP-NE, which allows us to compute a Nash Equilibrium (NE) through a finite improvement method starting from the previous SDP solution. This approach leads to a solution from which the users have no incentive to deviate, with substantially reduced NE computation time. In simulation, we compare the system cost of the NE solution with those of MCAP, MCAP-NE, a random mapping, and the optimal solution, showing that our NE solution attains near optimal performance under a wide set of parameter settings, as well as demonstrating the advantages of using MCAP to produce the initial point for MCAP-NE.

preprint2020arXiv

Novel Molecular Signaling Method and System for Molecular Communication in Human Body

Recently, Molecular Communication (MC) has been recognized as an enabling technology for nanonetworks where MC is envisioned to enable nanorobots to achieve sophisticated and complex tasks in the human body for promising medical applications. Many MC methods that can be applied in the human body have been proposed and modeled in the literature. However, none of them can be used to convey information between distant points that are separated by body fluids, tissues, or placed in different organs. In this paper, we propose a new method and system for Molecular Communication in the Body, denoted MoSiMe and MoCoBo, respectively. The method takes advantage of how the absorption, distribution, metabolization, and elimination (ADME) bodily processes affects drugs, referred to as Pharmacokinetics (PK) in pharmacology, to enable MC between any points of the human body regardless of their distance even if they are in different parts of the body and separated by tissues and fluids. The architecture, design and components of the MoCoBo system and MoSiMe method are described and different transmitter designs, including a novel passive transmitter design for the first time in telecommunications, are introduced. An analytical model for the body channel is derived and validated with respect to existing human and animal tests. The model captures the ADME bodily processes that affect the kinetics of substances administered to the body. Additionally, an experimental MoCoBo proof of concept platform, capable of reliably sending and receiving a stream of bits between a transmitter and a receiver, is built and validated against clinical trials, animal tests and analytical models. The introduced platform can also be utilized to test modulation techniques and designs for new MoCoBo transmitters and receivers.

preprint2020arXiv

Online Resource Procurement and Allocation in a Hybrid Edge-Cloud Computing System

By acquiring cloud-like capacities at the edge of a network, edge computing is expected to significantly improve user experience. In this paper, we formulate a hybrid edge-cloud computing system where an edge device with limited local resources can rent more from a cloud node and perform resource allocation to serve its users. The resource procurement and allocation decisions depend not only on the cloud's multiple rental options but also on the edge's local processing cost and capacity. We first propose an offline algorithm whose decisions are made with full information of future demand. Then, an online algorithm is proposed where the edge node makes irrevocable decisions in each timeslot without future information of demand. We show that both algorithms have constant performance bounds from the offline optimum. Numerical results acquired with Google cluster-usage traces indicate that the cost of the edge node can be substantially reduced by using the proposed algorithms, up to $80\%$ in comparison with baseline algorithms. We also observe how the cloud's pricing structure and edge's local cost influence the procurement decisions.