SearcharxivSearch

arXiv subjects

Stephen Russell

Publications and source records attributed to Stephen Russell.

4 recordsLinked to original sources

Semantic Substrate Dynamics Theory: An Operator-Theoretic Framework for Geometric Semantic Drift

Studies of semantic drift report heterogeneous signals, including embedding displacement, neighbor change, distributional divergence, and recursive trajectory instability, without a shared account that relates them. Semantic Substrate Dynamics Theory (SSDT) treats these signals as observables of one time-indexed substrate, St = (X, dt, Pt), that couples embedding geometry to a local diffusion kernel. The contribution is commensurability with a mechanism layer: the substrate separates within-basin churn from basin crossing, recursion-induced instability, and intervention-order effects, distinctions that a single detection score does not recover. Coarse Ricci curvature functions as a dense structural descriptor of basin and bridge geometry across the graph, and bridge mass, a node-level aggregate of incident negative curvature, functions as a sparse descriptor of the genuine bridge structure that is typically uncommon in embedding graphs. For recursive generation, node displacement relative to an origin decomposes into a radial component and a tangential component, which separates bounded departure from continuing reinterpretation. The predictions are stated in falsifiable form with a pre-declared rejection rule, and the predicted leading indicator of future rewiring is a local density statistic rather than the curvature aggregate. This manuscript provides the formal model, the assumptions, the observable roles, and the test contracts; empirical performance is deferred.

cs.CL

The Personalization Paradox: Semantic Loss vs. Reasoning Gains in Agentic AI Q&A

AIVisor, an agentic retrieval-augmented LLM for student advising, was used to examine how personalization affects system performance across multiple evaluation dimensions. Using twelve authentic advising questions intentionally designed to stress lexical precision, we compared ten personalized and non-personalized system configurations and analyzed outcomes with a Linear Mixed-Effects Model across lexical (BLEU, ROUGE-L), semantic (METEOR, BERTScore), and grounding (RAGAS) metrics. Results showed a consistent trade-off: personalization reliably improved reasoning quality and grounding, yet introduced a significant negative interaction on semantic similarity, driven not by poorer answers but by the limits of current metrics, which penalize meaningful personalized deviations from generic reference texts. This reveals a structural flaw in prevailing LLM evaluation methods, which are ill-suited for assessing user-specific responses. The fully integrated personalized configuration produced the highest overall gains, suggesting that personalization can enhance system effectiveness when evaluated with appropriate multidimensional metrics. Overall, the study demonstrates that personalization produces metric-dependent shifts rather than uniform improvements and provides a methodological foundation for more transparent and robust personalization in agentic AI.

cs.IR

Technical Report on Efficient Integration of Dynamic TDD with Massive MIMO

Recent advances in massive multiple-input multiple-output (MIMO) communication show that equipping base stations (BSs) with large arrays of antenna can significantly improve the performance of cellular networks. Massive MIMO has the potential to mitigate the interference in the network and enhance the average throughput per user. On the other hand, dynamic time division duplexing (TDD), which allows neighboring cells to operate with different uplink (UL) and downlink (DL) sub-frame configurations, is a promising enhancement for the conventional static TDD. Compared with static TDD, dynamic TDD can offer more flexibility to accommodate various UL and DL traffic patterns across different cells, but may result in additional interference among cells transmitting in different directions. Based on the unique characteristics and properties of massive MIMO and dynamic TDD, we propose a marriage of these two techniques, i.e., to have massive MIMO address the limitation of dynamic TDD in macro cell (MC) networks. Specifically, we advocate that the benefits of dynamic TDD can be fully extracted in MC networks equipped with massive MIMO, i.e., the BS-to-BS interference can be effectively removed by increasing the number of BS antennas. We provide detailed analysis using random matrix theory to show that the effect of the BS-to-BS interference on uplink transmissions vanishes as the number of BS antennas per-user grows infinitely large. Last but not least, we validate our analysis by numerical simulations.

eess.SP

An introduction to the analysis and implementation of sparse grid finite element methods

Our goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of freedom than their classical counterparts. After a brief discussion of the classical Galerkin finite element method with bilinear elements, we give a short analysis of what is probably the simplest sparse grid method: the two-scale technique of Lin et al. (2001). We then demonstrate how to extend this to a multiscale sparse grid method which, up to choice of basis, is equivalent to the hierarchical approach, as described by, e.g., Bungartz and Griebel (2004). However, by presenting it as an extension of the two-scale method, we can give an elementary treatment of its analysis and implementation. For each method considered, we provide MATLAB code, and a comparison of accuracy and computational costs.

math.NA