arXiv subjects

Shiyao Guo

Publications and source records attributed to Shiyao Guo.

4 recordsLinked to original sources

arXiv2026

Unlearning Is Not Just Erasing: Temporal Decoupling via Generation Inequality

Large language models (LLMs) require effective unlearning to address privacy regulations and safety concerns. However, achieving precise forgetting without compromising general utility remains challenging. Existing sequence- and token-level methods penalize target outputs without modeling their context-dependent retrieval paths, which can disrupt linguistic structure or suppress benign knowledge. We present ADU, a fine-grained, training-based framework that shifts unlearning from token erasure to contextual attention-pathway decoupling. Exploiting the functional distinction between local and global attention heads, ADU identifies preplan positions that retrieve persistent sensitive anchors and fixes their candidate paths under the original model. It then trains attention-projection adapters to suppress attention mass along these paths while preserving local-attention structure and retain-set language modeling. Post-training activation exchange tests whether the modified attention-output module transmits the learned forgetting effect. ADU achieves the strongest aggregate performance among evaluated baselines on the TOFU and WMDP benchmarks, including a Forget Quality of (0.93) on TOFU. It preserves 87--98% of model utility (92.9% on average versus 81.9% for baselines) while reducing side effects in benign contexts.

cs.CL↗

arXiv2026

AdapShot: Adaptive Many-Shot In-Context Learning with Semantic-Aware KV Cache Reuse

Many-Shot In-Context Learning (ICL) has emerged as a promising paradigm, leveraging extensive examples to unlock the reasoning potential of Large Language Models (LLMs). However, existing methods typically rely on a predetermined, fixed number of shots. This static approach often fails to adapt to the varying difficulty of different queries, leading to either insufficient context or interference from noise. Furthermore, the prohibitive computational and memory costs of long contexts severely limit Many-Shot's feasibility. To address the above limitations, we propose AdapShot, which dynamically optimizes shot counts and leverages KV cache reuse for efficient inference. Specifically, we design a probe-based evaluation mechanism that utilizes output entropy to determine the optimal number of shots. To bypass the redundant prefilling computation during both the probing and inference phases, we incorporate a semantics-aware KV cache reuse strategy. Within this reuse strategy, to address positional encoding incompatibilities, we introduce a decoupling and re-encoding method that enables the flexible reordering of cached key-value pairs. Extensive experiments demonstrate that AdapShot achieves an average performance gain of around 10% and a 4.64x speedup compared to state-of-the-art DBSA.

cs.AI↗

arXiv2026

Joint Precoding and Phase-Shift Optimization for Beyond-Diagonal RIS-Aided ISAC System

Beyond diagonal reconfigurable intelligent surfaces (BD-RIS) can realize the interconnection between reflecting elements through the impedance network, thereby providing a new approach for the performance improvement of integrated sensing and communication (ISAC) systems. This paper investigates the optimization problem of BD-RIS-aided multiuser ISAC system, aiming to achieve the flexible design of trade-offs between communication and sensing performance. Specifically, we propose an optimization framework jointly combining the multiuser interference management and sensing beam gain approximation method. By jointly optimizing the precoding vector and RIS phase-shift matrix, improving the multiuser communication sum rate through the proposed interference management method, and enhancing the system sensing performance through the beam gain approximation method. For the resulting non-convex weighted optimization problem, we employ the alternating optimization (AO) algorithm to decouple it into two subproblems of precoding vector and phase-shift matrix optimization, with each step admitting closed-form solutions.Simulation results demonstrate that the proposed BD-RIS-aided ISAC system can achieve significant improvement in the trade-offs between communication and sensing performance than the traditional diagonal RIS, verifying the effectiveness of the proposed optimization framework.

cs.IT↗

arXiv2021

PET Image Reconstruction with Multiple Kernels and Multiple Kernel Space Regularizers

Kernelized maximum-likelihood (ML) expectation maximization (EM) methods have recently gained prominence in PET image reconstruction, outperforming many previous state-of-the-art methods. But they are not immune to the problems of non-kernelized MLEM methods in potentially large reconstruction error and high sensitivity to iteration number. This paper demonstrates these problems by theoretical reasoning and experiment results, and provides a novel solution to solve these problems. The solution is a regularized kernelized MLEM with multiple kernel matrices and multiple kernel space regularizers that can be tailored for different applications. To reduce the reconstruction error and the sensitivity to iteration number, we present a general class of multi-kernel matrices and two regularizers consisting of kernel image dictionary and kernel image Laplacian quatradic, and use them to derive the single-kernel regularized EM and multi-kernel regularized EM algorithms for PET image reconstruction. These new algorithms are derived using the technical tools of multi-kernel combination in machine learning, image dictionary learning in sparse coding, and graph Laplcian quadratic in graph signal processing. Extensive tests and comparisons on the simulated and in vivo data are presented to validate and evaluate the new algorithms, and demonstrate their superior performance and advantages over the kernelized MLEM and other conventional methods.

eess.IV↗