Searcharxiv⌕ Search

arXiv subjects

Jihong Park

Publications and source records attributed to Jihong Park.

At least 19 recordsLinked to original sources

Hard/Soft NLoS Detection via Combinatorial Data Augmentation for 6G Positioning

A key enabler for meeting the stringent requirements of 6G positioning is the ability to exploit site-dependent information governing line-of-sight (LoS) and non-line-of-sight (NLoS) propagation. However, acquiring such environmental information in real time is challenging in practice. To address this issue, we propose a novel NLoS detection algorithm termed combinatorial data augmentation-guided NLoS detection (CDA-ND), which builds upon our prior work. CDA-ND generates numerous preliminary estimated locations (PELs) by applying multilateration over many gNodeB (gNB) combinations using a single snapshot of range measurements. When a target gNB is in NLoS, the resulting PELs split into two clusters: one derived using the target gNB's range measurement and the other derived without it. Their displacement is summarized by a single vector, called the NLoS evidence vector (NEV), which is used to compute an NLoS likelihood score. Based on this score, two modes of NLoS detection are developed. First, each gNB is classified as LoS or NLoS, termed hard decision (HD), using a simple threshold test. Second, each gNB's NLoS confidence is probabilistically quantified, termed soft decision (SD), which extends HD with weak site-survey priors, namely empirical NLoS-score samples and the average NLoS probability. We then design positioning algorithms tailored to these two modes by excluding gNBs deemed NLoS and re-weighting the remaining gNBs for SD. The proposed CDA-ND achieves high reliability in indoor factory environments under frequency range 1, attaining NLoS detection accuracies of 96.8% and 91.5% when the proportion of NLoS gNBs is approximately 18% and 56%, respectively. As a result, integrating CDA-ND into positioning significantly reduces mean absolute error by about 22% and 67% in LoS- and NLoS-dominant environments, respectively.

cs.IT↗

Stable and efficient covariance estimation for sample L-moments using Hájek projections

L-moments are useful summary statistics and are widely used in statistical analysis. The joint covariance matrix of sample L-moments not only describes their sampling uncertainty but is also needed for covariance-weighted distances and related statistical procedures. An exact unbiased covariance estimator is already available. However, in our previous applications, this estimator sometimes produced singular or indefinite covariance matrices. Such matrices cause problems when matrix inversion is required. The present paper addresses this difficulty. We examine standard positive-definite corrections and two covariance estimators based on leave-one-out sample L-moments: the delete-one jackknife estimator and an estimator based on the Hájek projection. Both are positive semidefinite by construction. Simulation results show that the projection estimator generally has smaller estimation error and better numerical stability than the exact unbiased estimator. The jackknife estimator overestimates the variances of higher-order sample L-moments and has larger estimation error than the projection estimator. We also develop fast rank-prefix algorithms for the three covariance estimators considered. These algorithms substantially reduce computation time.

stat.ME↗

Automated selection of $r$ in $r$-largest order statistics models: finite-sample performance and return-level inference

Selecting the number $r$ of upper order statistics is a key practical issue in fitting $r$-largest order statistics models. The entropy difference test for selecting $r$ relies on a large-sample approximation. The score test can be used for small samples but is computationally demanding. To obtain a fast method that is also applicable to small samples, we propose a method based on the conditional cumulative distribution function (CCDF), which applies a sequence of Cramér--von Mises goodness-of-fit tests. The tests are calibrated by a parametric bootstrap in which each refit is replaced by a single Newton step, so the computation remains fast. We also revisit the spacings test and show that the two test statistics become nearly identical as $r$ increases. Monte Carlo simulations show that the CCDF test has accurate size and good power in small and moderate samples. Further simulations show that a few additional order statistics can reduce the error of return-level estimates compared with those obtained from the block maxima only. The method is illustrated using rainfall data from Sancheong, Korea.

stat.ME↗

Workflow-Aware Communication and Computation Scheduling for Mobile Edge AI Agents

AI agents are increasingly deployed in mobile edge environments to autonomously handle diverse tasks through multi-step workflows. Unlike conventional dependency-aware tasks with predefined dependency structures, agent workflows are dynamically generated based on intermediate execution results. To minimize the weighted sum of job completion latencies, this paper models partially revealed agent workflows using dynamic workflow graphs and formulates an online scheduling problem that jointly optimizes computation placement, wireless resource block allocation, and edge computing resource allocation. To address the uncertainty of future workflow evolution, we first transform the weighted completion time objective into an equivalent per-slot holding cost and characterize the optimal policy through a Bellman equation. We then construct a tractable look-ahead cost-to-go surrogate based on the revealed workflow and the estimated remaining latencies of active jobs. The proposed scheduling algorithm leverages the surrogate to determine computation placement and uses the resulting operation criticality to allocate wireless and edge computing resources online. Simulation results show that the proposed algorithm outperforms the benchmark schemes across diverse scenarios.

cs.NI↗

Strong Consistency and Asymptotic Normality of the Maximum Likelihood Estimator in $r$-Largest Generalized Extreme-Value Models

We study maximum likelihood estimation in the three-parameter $r$-largest generalized extreme-value ($r$GEV) model with a fixed number $r$ of upper order statistics per block. Because the support depends on all three parameters, the classical regular theory does not apply. We show that the maximum likelihood estimator is strongly consistent on compact parameter sets contained in $k<1$, where $k=-γ$ denotes the shape parameter. For $k_0<1/2$, the range in which the model is differentiable in quadratic mean, the estimator is root-$n$ consistent, asymptotically normal and asymptotically efficient. The proof verifies the conditions of the moving-support likelihood theorem of Bücher and Segers for the ordered $r$-dimensional likelihood; the main new ingredients are a sequential modified likelihood criterion and a support-loss bound showing that the regularity threshold $k_0<1/2$ does not depend on $r$. In simulated heavy-tailed cases with only $50$ blocks, using five to seven order statistics instead of the block maximum reduces the relative bias of the 100-year return level from $6$--$13\%$ to below $5\%$.

stat.ME↗

Fisher Information and Differentiability for $r$-Largest Generalized Extreme-Value Models

The $r$ largest observations of a block form a dependent random vector whose support moves with all three parameters of the $r$-largest generalized extreme-value ($r$GEV) model. For a fixed number $r$ of order statistics, we show that the model is differentiable in quadratic mean if and only if $k_0<1/2$, where $k=-γ$ is the shape parameter; the threshold is thus the same as for block maxima, because only the largest or the smallest retained order statistic can reach the moving boundary. In this range the Fisher information is positive definite and decomposes into the block-maximum information plus contributions of the lower order statistics, and it equals the negative expected Hessian, which we prove without using any estimator. The model is then locally asymptotically normal, whereas for $k_0\ge1/2$ root-$n$ local asymptotic normality fails. Numerically, using the five largest order statistics instead of the block maximum alone lowers the efficient asymptotic standard error by about $45\%$ for the shape parameter and by $20$--$24\%$ for the 100-year return level in heavy-tailed cases ($k_0\le-0.2$), but by only about $2\%$ for the return level when $k_0=0.4$.

math.ST↗

Model-Driven Deep Learning with Rank-One Sensing for Efficient CSI Feedback

Downlink channel state information (CSI) feedback is essential for beamforming optimization in frequency-division duplex (FDD) massive multiple-input multiple-output (MIMO) systems. However, the feedback overhead increases with the number of antennas and subcarriers, posing a major challenge to practical deployment. Although recent deep learning (DL)-based methods reduce this overhead by compressing CSI at the user equipment (UE) and reconstructing it at the base station (BS), most of them treat CSI as a generic image and rely on convolutional or Transformer architectures. As a result, the low-rank multipath prior is insufficiently exploited, while non-negligible computation is introduced at both the UE and the BS. To address this issue, we propose a low-rank prior (LRP)-guided CSI feedback framework that performs structured sensing and reconstruction directly over rank-one channel components. Specifically, the LRP encoder conducts learnable rank-one sensing to obtain path-aware measurements at the UE, while the LRP decoder reconstructs CSI through rank-one synthesis at the BS, avoiding the iterative recovery required by classical solvers. To compensate for finite-rank approximation residuals, we extend our previous DCRNet into DCRNetV2 by incorporating the proposed LRP backbone and gated dilated-convolutional residual branches. Experiments on multiple datasets and scenarios show that the proposed methods achieve a better accuracy-complexity tradeoff than existing model-based and DL-based baselines. In particular, standalone LRP achieves more than $10$~dB NMSE improvement over model-based baselines with much lower complexity, while DCRNetV2 achieves comparable accuracy to state-of-the-art Transformer-based methods with only about one-fifth of the complexity. The source code is available at https://github.com/tangshunpu/DCRNetV2.

eess.SP↗

Demo: Vision-Language Model-Guided Online Calibration of an Electromagnetic Digital Twin

An electromagnetic (EM) digital twin gives mobile robots wireless situational awareness but depends on material conductivities that change with the environment. Online calibration faces initialization sensitivity and measurement travel costs. We demonstrate a vision-language model (VLM)-guided framework using a Unitree G1 robot and NVIDIA Sionna, with two VLM calls: material classification maps visible materials through ITU-R P.2040 to conductivity priors for Sionna's gradient descent on accumulated received signal strength (RSS) measurements; waypoint planning selects the next measurement location online using residual RSS calibration error and image coverage. In a real indoor scenario, the framework achieves a normalized mean absolute conductivity error of $1.74\times10^{-4}$ within 20 m of travel; random initialization never converges, while random waypoints require over twice the travel.

cs.RO↗

Demo: Closed-Loop Sionna-Isaac Sim Co-Simulation Framework for Wireless-Aware Robot Navigation over ROS 2

A robot that offloads its control loop to the network carries the receiver with it, so link quality is decided by where it goes. Simulating this requires both a physics engine and a site-specific propagation model at once; to our knowledge no simulator natively unifies both, with existing couplings of the two limited to offline analyses. We demonstrate a real-time co-simulation framework coupling NVIDIA Isaac Sim and NVIDIA Sionna over ROS 2 that closes the perception-action-communication (PAC) loop between them. Sionna ray-traces the base-station-to-robot channel over the exact geometry Isaac Sim simulates on, rather than modeling it stochastically, and feeds channel states back into the control loop in real time. Ray-traced on GPU, the coverage map is refreshed in ~16ms (~60 Hz), fast enough for real-time control. To showcase the framework's utility, we implement a wireless-aware navigation application in an OpenStreetMap(OSM)-derived SUTD campus twin with two Nova Carter robots: the closed-loop planner eliminates communication outage at only +7.4% traversal time over the shortest-path baseline (which spends 7.9 s of its 81.2 s run disconnected).

cs.NI↗

Semantic Feature Channel Optimization: A Unified Framework for Analog and Digital Semantic Communications

Semantic communication (SC) aims to improve communication efficiency by transmitting only task-relevant information, termed semantic features (SFs). Most existing SC frameworks achieve this by optimizing the encoder and decoder while treating the channel between them as fixed. In this paper, we introduce a new perspective by explicitly modeling the entire process from the encoder output to the decoder input as an SF channel, resulting in an encoder-SF channel-decoder pipeline. We observe that the SF channel is configurable through transceiver operations, such as power allocation, thereby providing an additional degree of freedom for improving task performance. Inspired by this, we formulate a joint optimization problem for the encoder, SF channel, and decoder under a mutual information constraint between the transmitted and reconstructed SFs. To provide analytical insight, we derive the optimal SF channel in closed form for an analytically tractable setting. Based on this formulation, we develop a unified semantic feature channel optimization framework applicable to both analog and digital SC systems. To realize the SF channel in general communication systems, we further propose a physical-layer calibration strategy that aligns the actual SF channel with the trained one. Simulation results demonstrate that the proposed framework consistently improves task performance across various communication environments.

eess.SP↗

Low-Rank Prior-Guided Rank-One Sensing for Efficient CSI Feedback

Downlink channel state information (CSI) feedback is essential for frequency-division duplex massive MIMO, yet the feedback overhead grows rapidly with the numbers of antennas and subcarriers. To reduce this overhead, most deep learning approaches compress CSI by treating it as a generic image, leaving its low-rank multipath structure unexploited. In contrast, model-driven alternatives explicitly embed this structure in iterative recovery, but at the cost of high computational complexity and latency. To overcome these limitations, we propose a low-rank prior-guided (LRP) framework that performs learnable rank-one sensing at the user equipment to compress CSI into low-dimensional codewords, and reconstructs CSI by direct rank-one synthesis at the base station. Both compression and reconstruction are jointly optimized, and fully exploit the low-rank structure of CSI. We further develop DCRNetV2, which preserves LRP as its backbone and uses gated dilated-convolutional residual paths to compensate for finite-rank errors. Experimental results show that LRP outperforms iterative model-based methods with lower complexity, and DCRNetV2 achieves a better accuracy-complexity tradeoff than existing learning-based methods.

eess.SP↗

Uncertainty-Weighted Fusion of Image and Synthetic Event for Video Anomaly Detection

Most existing video anomaly detectors rely on RGB frames alone, which limit their ability to capture abrupt or transient motion cues that are critical for identifying anomalous events. We propose Uncertainty Weighted Image Event Fusion (IEF-VAD), a framework that integrates complementary RGB and synthetic motion information through a principled weighting mechanism. The method models the high variance and heavy tailed characteristics of synthetic motion cues with a Student's t likelihood, computes value level inverse variance weights using a Laplace approximation to prevent the image modality from overshadowing motion information, and performs iterative refinement to suppress residual cross modal noise. This formulation provides a more balanced and reliable fusion process compared to cross attention or gating based approaches that often suffer from modality dominance. Without requiring an event camera or frame level annotations, IEF-VAD achieves new state of the art performance on multiple real world anomaly detection benchmarks and remains stable under degradation applied to individual modalities. The results indicate that extracting and integrating complementary motion cues is an effective direction for robust video understanding across diverse environments.

cs.CV↗

Rethinking the Foundations of Two-Sided AI Models for 6G

For next-generation air interfaces, two-sided artificial intelligence (AI) models have received growing attention, with AI models deployed at both the transmitter and receiver for efficient channel feedback and data communication. However, their practical deployment is complicated by assumptions commonly made in existing studies, including isolation from legacy users, training under predefined channel conditions, and gradient-based fine-tuning requiring substantial cross-vendor communication. This article revisits these assumptions and presents practical alternatives. First, for legacy coexistence, we integrate two-sided model processing into the 5G New Radio (NR) protocol stack and validate its operation alongside conventional NR on a real-world testbed. Second, instead of training under a massive number of predefined channel conditions, we construct a compact model table by jointly optimizing two-sided models with trainable surrogate channels, and select the best model according to the current channel condition to enable channel adaptation with high task performance and low training/storage overhead. Finally, unlike existing fine-tuning that exchanges large gradient vectors containing potentially private model information, we present gradient-free zeroth-order fine-tuning that requires only scalar feedback, facilitating multi-vendor interoperability. Together, these approaches advance the practical deployment of two-sided AI models while highlighting key open challenges.

eess.SP↗

Optimal Movable-Antenna Control for Multi-Path Sensing Guided by Prior AoA Statistic

Multi-path sensing, which aims to extract the geometric attributes of multiple propagation paths, is expected to be a key functionality of 6G. A movable antenna (MA) can enable this functionality by synthesizing an aperture through mechanical motion. However, existing MA-based sensing methods typically rely on exhaustive scanning over the entire movable region, resulting in significant control overhead and sensing latency, which limit their practicality for agile sensing. To address this challenge, this paper develops a prior-guided agile multi-path sensing framework that leverages weak prior angle-of-arrival (AoA) statistics as side information. The proposed framework is built on two key steps. First, the movable plate's three-dimensional orientation is optimized only once to configure a mechanically feasible scan region that enhances path visibility while preserving inter-path discriminability, guided by Fisher information analysis. Second, given the optimal plate orientation, the MA performs only two linear scans, whose non-collinear spatial phase projections are fused with the prior AoA statistics through a maximum a posteriori (MAP)-based estimator to recover the elevation and azimuth AoAs of multiple paths. The estimated AoAs are subsequently used to extract the times-of-arrival (ToAs) by enhancing the target path component while suppressing interference from other paths. With only one orientation adjustment and two linear scans, the proposed framework enables agile multi-path sensing with significantly reduced control overhead and latency, while achieving AoA and ToA estimation accuracy close to the single-path benchmark.

cs.IT↗

Breaking the Capacity Bottleneck in Model-Heterogeneous Federated Learning via Gradual Model Restoration

Federated learning (FL) enables distributed model training, yet in heterogeneous deployments, Bandwidth-Constrained Clients (BCCs) often contribute inefficiently due to limited uplink bandwidth. In model-heterogeneous FL with fixed small sub-models, BCCs with sub-models may improve quickly in early rounds but become under-parameterized later, resulting in slow convergence and poor generalization. To address this challenge, we propose FedGMR, a federated learning framework centered around Gradual Model Restoration (GMR), where GMR progressively increases each client's sub-model density during training, allowing BCCs to remain effective contributors throughout optimization. To make GMR practical under real-world heterogeneity, FedGMR is realized as an end-to-end workflow with asynchronous coordination and stable, mask-aware aggregation. We further establish convergence guarantees, showing that the aggregation error scales with the average sub-model density across clients and rounds, and that GMR provably narrows the gap toward full-model FL. Extensive experiments on FEMNIST, CIFAR-10, ImageNet-100, and StackOverflow demonstrate that FedGMR improves both convergence speed and final accuracy, especially under severe heterogeneity and non-IID data distributions. Code is available at https://github.com/machengjie321/ICML2026-FedGMR.

cs.DC↗

Loss-Resilient Wireless Video Token Communication over Block Fading Channels

Video token communication represents video content as discrete tokens that differ in their importance to reconstruction and exhibit temporal dependencies. When these tokens are packetized for wireless transmission, block fading can cause multiple important or correlated tokens to be lost together, severely degrading video reconstruction. To address this issue, we propose a loss-resilient wireless video token communication (WVTC) framework. WVTC evaluates token importance from the intrinsic predictive structure of video tokens, assigning high priority to structural I-tokens and measuring P-token importance by temporal neighborhood novelty. A shuffled mixed I/P-token packetization scheme disperses structural anchors and correlated temporal regions across packets. Using only current block channel state information, an online scheduler jointly considers packet importance density, MCS-dependent decoding reliability, block capacity, and importance concentration when allocating packets to fading blocks. At the receiver, a fine-tuned detokenizer reconstructs missing content from surviving tokens without retransmission. Numerical results demonstrate improved perceptual quality and more graceful degradation under increasing packet error rates.

cs.LG↗

Geometric Cross-Modal Token Selection for Latency-Constrained Multimodal Token Communication

This paper proposes a geometry-based joint cross-modal token selection framework for latency-constrained multimodal token communications. To capture cross-modal token dependencies, we leverage the cross-attention mechanism to project modality-specific tokens into a shared query-key space, where the modality with the fewest tokens serves as the anchor modality and the others as non-anchor modalities. Inspired by germ-grain models, we define an angular-distance metric and construct semantic grain regions around anchor queries. Based on this geometric representation, we identify cross-modal evidence shared across multiple anchor queries in this space and develop an intersection-based token selection (IBS) strategy that prioritizes non-anchor tokens whose key are covered by multiple grain regions. We further develop an erasure-aware extension, termed robust-IBS (R-IBS), for token-wise erasure channels using an expected angular-distance formulation. In both IBS and R-IBS, the grain regions are optimized for individual queries under a latency constraint, using block coordinate descent and a low-complexity greedy algorithm. Simulations corroborate the effectiveness of IBS and R-IBS under latency-constrained and token-wise erasure channels, achieving up to 31.6% and 29.2% task accuracy gains on visual question answering (VQA) and audio-visual question answering (AVQA) tasks, respectively, over existing token selection baselines.

eess.SP↗

Joint Laser Inter-Satellite Link Matching and Traffic Flow Routing in LEO Mega-Constellations via Lagrangian Duality

Low Earth orbit (LEO) mega-constellations greatly extend the coverage and resilience of future wireless systems. Within the mega-constellations, laser inter-satellite links (LISLs) enable high-capacity, long-range connectivity. Existing LISL schemes often overlook mechanical limitations of laser communication terminals (LCTs) and non-uniform global traffic profiles caused by uneven user and gateway distributions, leading to suboptimal throughput and underused LCTs/LISLs -- especially when each satellite carries only a few LCTs. This paper investigates the joint optimization of LCT connections and traffic routing to maximize the constellation throughput, considering the realistic LCT mechanics and a snapshot-level spatial traffic profile. We show that the resulting per-snapshot formulation is a mixed-integer program coupling LCT connections with flow-rate variables under link capacity constraints, and the associated fixed-snapshot abstract decision problem is NP-hard. Due to its intractability, we resort to relaxing the coupling constraints via Lagrangian duality, decomposing the problem into a weighted graph-matching for LCT connections, weighted shortest-path routing tasks, and a linear program for rate allocation. Here, Lagrange multipliers reflect congestion weights between satellites, jointly guiding the matching, routing, and rate allocation. Subgradient descent optimizes the multipliers, with proven convergence. Simulations using real-world constellation and terrestrial data show that our methods substantially improve network throughput by up to $35\%$--$145\%$ over existing non-joint approaches.

eess.SP↗