arXiv subjects

Jiyuan Yang

Publications and source records attributed to Jiyuan Yang.

27 records · Page 2Linked to original sources

arXiv2024

Efficient Information Geometry Approach for Massive MIMO-OFDM Channel Estimation

We investigate the channel estimation for massive multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems. We revisit the information geometry approach (IGA) for massive MIMO-OFDM channel estimation. By using the constant magnitude property of the entries of the measurement matrix, we find that the second-order natural parameters of the distributions on all the auxiliary manifolds are equivalent to each other, and the first-order natural parameters are asymptotically equivalent to each other at the fixed point. Motivated by these results, we simplify the process of IGA and propose an efficient IGA (EIGA) for massive MIMO-OFDM channel estimation, which allows efficient implementation with fast Fourier transformation (FFT). We then establish a sufficient condition of its convergence and accordingly find a range of the damping factor for the convergence. We show that this range of damping factor is sufficiently wide by using the specific properties of the measurement matrices. Further, we prove that at the fixed point, the a posteriori mean obtained by EIGA is asymptotically optimal. Simulations confirm that EIGA can achieve the optimal performance with low complexity in a limited number of iterations.

cs.IT↗

arXiv2024

Uncovering Selective State Space Model's Capabilities in Lifelong Sequential Recommendation

Sequential Recommenders have been widely applied in various online services, aiming to model users' dynamic interests from their sequential interactions. With users increasingly engaging with online platforms, vast amounts of lifelong user behavioral sequences have been generated. However, existing sequential recommender models often struggle to handle such lifelong sequences. The primary challenges stem from computational complexity and the ability to capture long-range dependencies within the sequence. Recently, a state space model featuring a selective mechanism (i.e., Mamba) has emerged. In this work, we investigate the performance of Mamba for lifelong sequential recommendation (i.e., length>=2k). More specifically, we leverage the Mamba block to model lifelong user sequences selectively. We conduct extensive experiments to evaluate the performance of representative sequential recommendation models in the setting of lifelong sequences. Experiments on two real-world datasets demonstrate the superiority of Mamba. We found that RecMamba achieves performance comparable to the representative model while significantly reducing training duration by approximately 70% and memory costs by 80%. Codes and data are available at \url{https://github.com/nancheng58/RecMamba}.

cs.IR↗

arXiv2024

Signal Detection for Ultra-Massive MIMO: An Information Geometry Approach

In this paper, we propose an information geometry approach (IGA) for signal detection (SD) in ultra-massive multiple-input multiple-output (MIMO) systems. We formulate the signal detection as obtaining the marginals of the a posteriori probability distribution of the transmitted symbol vector. Then, a maximization of the a posteriori marginals (MPM) for signal detection can be performed. With the information geometry theory, we calculate the approximations of the a posteriori marginals. It is formulated as an iterative m-projection process between submanifolds with different constraints. We then apply the central-limit-theorem (CLT) to simplify the calculation of the m-projection since the direct calculation of the m-projection is of exponential-complexity. With the CLT, we obtain an approximate solution of the m-projection, which is asymptotically accurate. Simulation results demonstrate that the proposed IGA-SD emerges as a promising and efficient method to implement the signal detector in ultra-massive MIMO systems.

cs.IT↗

arXiv2023

Debiasing Sequential Recommenders through Distributionally Robust Optimization over System Exposure

Sequential recommendation (SR) models are typically trained on user-item interactions which are affected by the system exposure bias, leading to the user preference learned from the biased SR model not being fully consistent with the true user preference. Exposure bias refers to the fact that user interactions are dependent upon the partial items exposed to the user. Existing debiasing methods do not make full use of the system exposure data and suffer from sub-optimal recommendation performance and high variance. In this paper, we propose to debias sequential recommenders through Distributionally Robust Optimization (DRO) over system exposure data. The key idea is to utilize DRO to optimize the worst-case error over an uncertainty set to safeguard the model against distributional discrepancy caused by the exposure bias. The main challenge to apply DRO for exposure debiasing in SR lies in how to construct the uncertainty set and avoid the overestimation of user preference on biased samples. Moreover, how to evaluate the debiasing effect on biased test set is also an open question. To this end, we first introduce an exposure simulator trained upon the system exposure data to calculate the exposure distribution, which is then regarded as the nominal distribution to construct the uncertainty set of DRO. Then, we introduce a penalty to items with high exposure probability to avoid the overestimation of user preference for biased samples. Finally, we design a debiased self-normalized inverse propensity score (SNIPS) evaluator for evaluating the debiasing effect on the biased offline test set. We conduct extensive experiments on two real-world datasets to verify the effectiveness of the proposed methods. Experimental results demonstrate the superior exposure debiasing performance of proposed methods. Codes and data are available at \url{https://github.com/nancheng58/DebiasedSR_DRO}.

cs.IR↗

arXiv2023

Universal interatomic potential for perovskite oxides

With their celebrated structural and chemical flexibility, perovskite oxides have served as a highly adaptable material platform for exploring emergent phenomena arising from the interplay between different degrees of freedom. Molecular dynamics (MD) simulations leveraging classical force fields, commonly depicted as parameterized analytical functions, have made significant contributions in elucidating the atomistic dynamics and structural properties of crystalline solids including perovskite oxides. However, the force fields currently available for solids are rather specific and offer limited transferability, making it time-consuming to use MD to study new materials systems since a new force field must be parameterized and tested first. The lack of a generalized force field applicable to a broad spectrum of solid materials hinders the facile deployment of MD in computer-aided materials discovery (CAMD). Here, by utilizing a deep-neural network with a self-attention scheme, we have developed a unified force field that enables MD simulations of perovskite oxides involving 14 metal elements and conceivably their solid solutions with arbitrary compositions. Notably, isobaric-isothermal ensemble MD simulations with this model potential accurately predict the experimental phase transition sequences for several markedly different ferroelectric oxides, including a 6-element ternary solid solution, Pb(In$_{1/2}$Nb$_{1/2}$)O$_3$--Pb(Mg$_{1/3}$Nb$_{2/3}$)O$_3$--PbTiO$_3$. We believe the universal interatomic potential along with the training database, proposed regression tests, and the auto-testing workflow, all released publicly, will pave the way for a systematic improvement and extension of a unified force field for solids, potentially heralding a new era in CAMD.

cond-mat.mtrl-sci↗

arXiv2023

Modular development of deep potential for complex solid solutions

The multicomponent oxide solid solution is a versatile platform to tune the delicate balance between competing spin, charge, orbital, and lattice degrees of freedom for materials design and discovery. The development of compositionally complex oxides with superior functional properties has been largely empirical and serendipitous, in part due to the exceedingly complex chemistry and structure of solid solutions that span a range of length scales. The classical molecular dynamics (MD), as a powerful statistical method to investigate materials properties over large spatial and temporal scales, often plays a secondary role in computer-aided materials discovery because of the limited availability and accuracy of classical force fields. Here, we introduce the strategy of ``modular developing deep potential" (ModDP) that enables a systematic development and improvement of deep neural network-based model potential, termed as deep potential, for complex solid solutions with minimum human intervention. The converged training database associated with an end-member material is treated as an independent module and is reused to train the deep potential of solid solutions via a concurrent learning procedure. We apply ModDP to obtain classical force fields of two technologically important solid solutions, Pb$_x$Sr$_{1-x}$TiO$_3$ and Hf$_x$Zr$_{1-x}$O$_2$. For both materials systems, a single model potential is capable of predicting various properties of solid solutions including temperature-driven and composition-driven phase transitions over a wide range of compositions. In particular, the deep potential of Pb$_x$Sr$_{1-x}$TiO$_3$ reproduces a few known topological textures such as polar vortex lattice and electric dipole waves in PbTiO$_3$/SrTiO$_3$ superlattices, paving the way for MD investigations on the dynamics of topological structures in response to external stimuli.

cond-mat.mtrl-sci↗

arXiv2022

On the User Behavior Leakage from Recommender System Exposure

Modern recommender systems are trained to predict users potential future interactions from users historical behavior data. During the interaction process, despite the data coming from the user side recommender systems also generate exposure data to provide users with personalized recommendation slates. Compared with the sparse user behavior data, the system exposure data is much larger in volume since only very few exposed items would be clicked by the user. Besides, the users historical behavior data is privacy sensitive and is commonly protected with careful access authorization. However, the large volume of recommender exposure data usually receives less attention and could be accessed within a relatively larger scope of various information seekers. In this paper, we investigate the problem of user behavior leakage in recommender systems. We show that the privacy sensitive user past behavior data can be inferred through the modeling of system exposure. Besides, one can infer which items the user have clicked just from the observation of current system exposure for this user. Given the fact that system exposure data could be widely accessed from a relatively larger scope, we believe that the user past behavior privacy has a high risk of leakage in recommender systems. More precisely, we conduct an attack model whose input is the current recommended item slate (i.e., system exposure) for the user while the output is the user's historical behavior. Experimental results on two real-world datasets indicate a great danger of user behavior leakage. To address the risk, we propose a two-stage privacy-protection mechanism which firstly selects a subset of items from the exposure slate and then replaces the selected items with uniform or popularity-based exposure. Experimental evaluation reveals a trade-off effect between the recommendation accuracy and the privacy disclosure risk.

cs.IR↗

arXiv2022

Onsite and intersite electronic correlations in the Hubbard model for halide perovskites

Halide perovskites (HPs) are widely viewed as promising photovoltaic and light-emitting materials for their suitable band gaps in the visible spectrum. Density functional theory (DFT) calculations employing (semi)local exchange-correlation functionals usually underestimate the band gaps for these systems. Accurate descriptions of the electronic structures of HPs often demand higher-order levels of theory such as the Heyd-Scuseria-Ernzerhof (HSE) hybrid density functional and GW approximations that are much more computationally expensive than standard DFT. Here, we investigate three representative types of HPs, ABX3 halide perovskites, vacancy-ordered double perovskites (VODPs), and bond disproportionated halide perovskites (BDHPs), using DFT+U+V with onsite U and intersite V Hubbard parameters computed self-consistently without a priori assumption. The inclusion of Hubbard corrections improves the band gap prediction accuracy for all three types of HPs to a similar level of advanced methods. Moreover, the self-consistent Hubbard U is a meaningful indicator of the true local charge state of multivalence metal atoms in HPs. The inclusion of the intersite Hubbard V is crucial to properly capture the hybridization between valence electrons on neighboring atoms in BDHPs that have breathing-mode distortions of halide octahedra. In particular, the simultaneous convergence of both Hubbard parameters and crystal geometry enables a band gap prediction accuracy superior to HSE for BDHPs but at a fraction of the cost. Our work highlights the importance of using self-consistent Huabbard parameters when dealing with HPs that often possess intricate competitions between onsite localization and intersite hybridization.

cond-mat.mtrl-sci↗

arXiv2020

ServiceNet: A P2P Service Network

Given a large number of online services on the Internet, from time to time, people are still struggling to find out the services that they need. On the other hand, when there are considerable research and development on service discovery and service recommendation, most of the related work are centralized and thus suffers inherent shortages of the centralized systems, e.g., adv-driven, lack at trust, transparence and fairness. In this paper, we propose a ServiceNet - a peer-to-peer (P2P) service network for service discovery and service recommendation. ServiceNet is inspired by blockchain technology and aims at providing an open, transparent and self-growth, and self-management service ecosystem. The paper will present the basic idea, an architecture design of the prototype, and an initial implementation and performance evaluation the prototype design.

cs.DC↗