Searcharxiv⌕ Search

arXiv subjects

Jin Li

Publications and source records attributed to Jin Li.

At least 181 records · Page 10Linked to original sources
arXiv2023

G-STO: Sequential Main Shopping Intention Detection via Graph-Regularized Stochastic Transformer

Sequential recommendation requires understanding the dynamic patterns of users' behaviors, contexts, and preferences from their historical interactions. Most existing works focus on modeling user-item interactions only from the item level, ignoring that they are driven by latent shopping intentions (e.g., ballpoint pens, miniatures, etc). The detection of the underlying shopping intentions of users based on their historical interactions is a crucial aspect for e-commerce platforms, such as Amazon, to enhance the convenience and efficiency of their customers' shopping experiences. Despite its significance, the area of main shopping intention detection remains under-investigated in the academic literature. To fill this gap, we propose a graph-regularized stochastic Transformer method, G-STO. By considering intentions as sets of products and user preferences as compositions of intentions, we model both of them as stochastic Gaussian embeddings in the latent representation space. Instead of training the stochastic representations from scratch, we develop a global intention relational graph as prior knowledge for regularization, allowing relevant shopping intentions to be distributionally close. Finally, we feed the newly regularized stochastic embeddings into Transformer-based models to encode sequential information from the intention transitions. We evaluate our main shopping intention identification model on three different real-world datasets, where G-STO achieves significantly superior performances to the baselines by 18.08% in Hit@1, 7.01% in Hit@10, and 6.11% in NDCG@10 on average.

cs.IR↗
arXiv2023

Using entropy bounds to avoid the cosmological singularity and constrain cosmological particle production

In this work, we study the applications of entropy bounds in two toy cosmological models with particle production (annihilation), i.e., a radiation-dominated universe and a dust-dominated universe. We consider the co-moving volume and the volume covered by the particle horizon of a given observer as the thermodynamic systems satisfying entropy bounds. For the Bekenstein bound and the spherical entropy bound, it is found that the cosmological singularity can be avoided and cosmological particle production needs to be truncated in some special cases. Our study can be extended to other cosmological models with particle production.

astro-ph.CO↗
arXiv2023

Text Is All You Need: Learning Language Representations for Sequential Recommendation

Sequential recommendation aims to model dynamic user behavior from historical interactions. Existing methods rely on either explicit item IDs or general textual features for sequence modeling to understand user preferences. While promising, these approaches still struggle to model cold-start items or transfer knowledge to new datasets. In this paper, we propose to model user preferences and item features as language representations that can be generalized to new items and datasets. To this end, we present a novel framework, named Recformer, which effectively learns language representations for sequential recommendation. Specifically, we propose to formulate an item as a "sentence" (word sequence) by flattening item key-value attributes described by text so that an item sequence for a user becomes a sequence of sentences. For recommendation, Recformer is trained to understand the "sentence" sequence and retrieve the next "sentence". To encode item sequences, we design a bi-directional Transformer similar to the model Longformer but with different embedding layers for sequential recommendation. For effective representation learning, we propose novel pretraining and finetuning methods which combine language understanding and recommendation tasks. Therefore, Recformer can effectively recommend the next item based on language representations. Extensive experiments conducted on six datasets demonstrate the effectiveness of Recformer for sequential recommendation, especially in low-resource and cold-start settings.

cs.IR↗
arXiv2023

Learning to Personalize Recommendation based on Customers' Shopping Intents

Understanding the customers' high level shopping intent, such as their desire to go camping or hold a birthday party, is critically important for an E-commerce platform; it can help boost the quality of shopping experience by enabling provision of more relevant, explainable, and diversified recommendations. However, such high level shopping intent has been overlooked in the industry due to practical challenges. In this work, we introduce Amazon's new system that explicitly identifies and utilizes each customer's high level shopping intents for personalizing recommendations. We develop a novel technique that automatically identifies various high level goals being pursued by the Amazon customers, such as "go camping", and "preparing for a beach party". Our solution is in a scalable fashion (in 14 languages across 21 countries). Then a deep learning model maps each customer's online behavior, e.g. product search and individual item engagements, into a subset of high level shopping intents. Finally, a realtime ranker considers both the identified intents as well as the granular engagements to present personalized intent-aware recommendations. Extensive offline analysis ensures accuracy and relevance of the new recommendations and we further observe an 10% improvement in the business metrics. This system is currently serving online traffic at amazon.com, powering several production features, driving significant business impacts

cs.IR↗
arXiv2023

Atom-referenced on-chip soliton microcomb

For the applications of the frequency comb in microresonators, it is essential to obtain a fully frequency-stabilized microcomb laser source. Here, we demonstrate an atom-referenced stabilized soliton microcomb generation system based on the integrated microring resonator. The pump light around $1560.48\,\mathrm{nm}$ locked to an ultra-low-expansion (ULE) cavity, is frequency-doubled and referenced to the atomic transition of $^{87}\mathrm{Rb}$. The repetition rate of the soliton microcomb is injection-locked to an atomic-clock-stabilized radio frequency (RF) source, leading to mHz stabilization at $1$ seconds. As a result, all comb lines have been frequency-stabilized based on the atomic reference and could be determined with very high precision reaching $\sim18\,\mathrm{Hz}$ at 1 second, corresponding to the frequency stability of $9.5\times10^{-14}$. Our approach provides an integrated and fully stabilized microcomb experiment scheme with no requirement of $f-2f$ technique, which could be easily implemented and generalized to various photonic platforms, thus paving the way towards the portable and ultraprecise optical sources for high precision spectroscopy.

physics.optics↗
arXiv2023

MPMNet: A Data-Driven MPM Framework for Dynamic Fluid-Solid Interaction

High-accuracy, high-efficiency physics-based fluid-solid interaction is essential for reality modeling and computer animation in online games or real-time Virtual Reality (VR) systems. However, the large-scale simulation of incompressible fluid and its interaction with the surrounding solid environment is either time-consuming or suffering from the reduced time/space resolution due to the complicated iterative nature pertinent to numerical computations of involved Partial Differential Equations (PDEs). In recent years, we have witnessed significant growth in exploring a different, alternative data-driven approach to addressing some of the existing technical challenges in conventional model-centric graphics and animation methods. This paper showcases some of our exploratory efforts in this direction. One technical concern of our research is to address the central key challenge of how to best construct the numerical solver effectively and how to best integrate spatiotemporal/dimensional neural networks with the available MPM's pressure solvers.

cs.GR↗
arXiv2023

Differentially Private Numerical Vector Analyses in the Local and Shuffle Model

Numerical vector aggregation plays a crucial role in privacy-sensitive applications, such as distributed gradient estimation in federated learning and statistical analysis of key-value data. In the context of local differential privacy, this study provides a tight minimax error bound of $O(\frac{ds}{nε^2})$, where $d$ represents the dimension of the numerical vector and $s$ denotes the number of non-zero entries. By converting the conditional/unconditional numerical mean estimation problem into a frequency estimation problem, we develop an optimal and efficient mechanism called Collision. In contrast, existing methods exhibit sub-optimal error rates of $O(\frac{d^2}{nε^2})$ or $O(\frac{ds^2}{nε^2})$. Specifically, for unconditional mean estimation, we leverage the negative correlation between two frequencies in each dimension and propose the CoCo mechanism, which further reduces estimation errors for mean values compared to Collision. Moreover, to surpass the error barrier in local privacy, we examine privacy amplification in the shuffle model for the proposed mechanisms and derive precisely tight amplification bounds. Our experiments validate and compare our mechanisms with existing approaches, demonstrating significant error reductions for frequency estimation and mean estimation on numerical vectors.

cs.CR↗
arXiv2023

Fine-grained Private Knowledge Distillation

Knowledge distillation has emerged as a scalable and effective way for privacy-preserving machine learning. One remaining drawback is that it consumes privacy in a model-level (i.e., client-level) manner, every distillation query incurs privacy loss of one client's all records. In order to attain fine-grained privacy accountant and improve utility, this work proposes a model-free reverse $k$-NN labeling method towards record-level private knowledge distillation, where each record is employed for labeling at most $k$ queries. Theoretically, we provide bounds of labeling error rate under the centralized/local/shuffle model of differential privacy (w.r.t. the number of records per query, privacy budgets). Experimentally, we demonstrate that it achieves new state-of-the-art accuracy with one order of magnitude lower of privacy loss. Specifically, on the CIFAR-$10$ dataset, it reaches $82.1\%$ test accuracy with centralized privacy budget $1.0$; on the MNIST/SVHN dataset, it reaches $99.1\%$/$95.6\%$ accuracy respectively with budget $0.1$. It is the first time deep learning with differential privacy achieve comparable accuracy with reasonable data privacy protection (i.e., $\exp(ε)\leq 1.5$). Our code is available at https://github.com/liyuntong9/rknn.

cs.CR↗
arXiv2023

On statistical fluctuations in collective flows

In relativistic heavy-ion collisions, event-by-event fluctuations are known to have non-trivial implications. Even though the probability distribution is geometrically isotropic for the initial conditions, the anisotropic $\varepsilon_n$ still differs from zero owing to the statistical fluctuations in the energy profile. On the other hand, the flow harmonics extracted from the hadron spectrum using the multi-particle correlators are inevitably subjected to non-vanishing variance due to the finite number of hadrons emitted in individual events. As one aims to extract information on the fluctuations in the initial conditions via flow harmonics and their fluctuations, finite multiplicity may play a role in interfering with such an effort. In this study, we explore the properties and impacts of such fluctuations in the initial and final states, which both notably appear to be statistical ones originating from the finite number of quanta of the underlying system. We elaborate on the properties of the initial-state eccentricities for the smooth and event-by-event fluctuating initial conditions and their distinct impacts on the resulting flow harmonics. Numerical simulations are performed. The possible implications of the present study are also addressed.

nucl-th↗
arXiv2023

Differential Aggregation against General Colluding Attackers

Local Differential Privacy (LDP) is now widely adopted in large-scale systems to collect and analyze sensitive data while preserving users' privacy. However, almost all LDP protocols rely on a semi-trust model where users are curious-but-honest, which rarely holds in real-world scenarios. Recent works show poor estimation accuracy of many LDP protocols under malicious threat models. Although a few works have proposed some countermeasures to address these attacks, they all require prior knowledge of either the attacking pattern or the poison value distribution, which is impractical as they can be easily evaded by the attackers. In this paper, we adopt a general opportunistic-and-colluding threat model and propose a multi-group Differential Aggregation Protocol (DAP) to improve the accuracy of mean estimation under LDP. Different from all existing works that detect poison values on individual basis, DAP mitigates the overall impact of poison values on the estimated mean. It relies on a new probing mechanism EMF (i.e., Expectation-Maximization Filter) to estimate features of the attackers. In addition to EMF, DAP also consists of two EMF post-processing procedures (EMF* and CEMF*), and a group-wise mean aggregation scheme to optimize the final estimated mean to achieve the smallest variance. Extensive experimental results on both synthetic and real-world datasets demonstrate the superior performance of DAP over state-of-the-art solutions.

cs.CR↗
arXiv2023

Generating Synthetic Mixed-type Longitudinal Electronic Health Records for Artificial Intelligent Applications

The recent availability of electronic health records (EHRs) have provided enormous opportunities to develop artificial intelligence (AI) algorithms. However, patient privacy has become a major concern that limits data sharing across hospital settings and subsequently hinders the advances in AI. Synthetic data, which benefits from the development and proliferation of generative models, has served as a promising substitute for real patient EHR data. However, the current generative models are limited as they only generate single type of clinical data for a synthetic patient, i.e., either continuous-valued or discrete-valued. To mimic the nature of clinical decision-making which encompasses various data types/sources, in this study, we propose a generative adversarial network (GAN) entitled EHR-M-GAN which simultaneously synthesizes mixed-type timeseries EHR data. EHR-M-GAN is capable of capturing the multidimensional, heterogeneous, and correlated temporal dynamics in patient trajectories. We have validated EHR-M-GAN on three publicly-available intensive care unit databases with records from a total of 141,488 unique patients, and performed privacy risk evaluation of the proposed model. EHR-M-GAN has demonstrated its superiority over state-of-the-art benchmarks for synthesizing clinical timeseries with high fidelity, while addressing the limitations regarding data types and dimensionality in the current generative models. Notably, prediction models for outcomes of intensive care performed significantly better when training data was augmented with the addition of EHR-M-GAN-generated timeseries. EHR-M-GAN may have use in developing AI algorithms in resource-limited settings, lowering the barrier for data acquisition while preserving patient privacy.

cs.LG↗
arXiv2023

Shadow thermodynamics of the Hayward-AdS black hole

In this paper, the phase structure of the Hayward-AdS black hole (BH) is studied using shadow formalism. It has been found that the shadow radius is a monotonic function of the horizon radius and can therefore play an equivalent role to the horizon radius in characterizing the thermodynamics of Hayward-AdS BH. The thermodynamic phase transition (PT) of the Hayward-AdS BH is investigated with the shadow radius. It is shown that as the magnetic charge increases, the shadow radius becomes larger, while the coexistence temperature becomes lower. The thermal profile of the Hayward-AdS BH is established by combining the temperature diagram and the shadow cast diagram, which shows that for a fixed magnetic charge, the temperature of the Hayward-AdS BH increases with the pressure while the region of the thermal profile decreases with the pressure. In particular, the temperature of the Hayward-AdS BH follows an N-type change trend when it is smaller than the critical temperature. This imply that the BH shadow may be used to investigate the thermodynamics of the Hayward-AdS BH.

gr-qc↗
arXiv2023

A Framework for Mutual Information-based MIMO Integrated Sensing and Communication Beamforming Design

Integrated sensing and communication (ISAC) unifies sensing and communication, and improves the efficiency of the spectrum, energy, and hardware. In this work, we investigate the ISAC beamforming design to maximize the mutual information between the target response matrix of a point radar target and the echo signals, while ensuring the data rate requirements of the communication users. In order to study the impact of the echo interference caused by communication users on sensing performance, we study two scenarios: a single communication user and multiple communication users. For the case of a single communication user, we consider three types of echo interference, no interference, a point interference, and an extended interference. For the case of multiple communication users, the interference is also an extended one, and furthermore, each user's communication rate requirement needs to be satisfied. To find the optimal beamforming design in these problems, we provide a closed-form solution with low complexiy, a semidefinite relaxation (SDR) method, a low-complexity algorithm based on the Majorization-Minimization (MM) method and the successive convex approximation (SCA) method, and an algorithm based on MM method and SCA method, respectively. Numerical results demonstrate that, compared to the ISAC beamforming schemes based on the Cramér-Rao bound (CRB) metric and the beampattern metric, the proposed mutual information metric can bring better beampattern and root mean square error (RMSE) of angle estimation. Furthermore, our proposed schemes designed based on the mutual information metric can suppress the echo interference from the communication users effectively.

eess.SP↗
arXiv2023

Using simulated Tianqin gravitational wave data and electromagnetic wave data to study the coincidence problem and Hubble tension problem

In this paper, we use electromagnetic wave data (H0LiCOW, $H(z)$, SNe) and gravitational wave data (Tianqin) to constrain the interacting dark energy (IDE) model and investigate the Hubble tension problem and coincidences problem. By combining these four kinds of data (Tianqin+H0LiCOW+SNe+$H(z)$), we obtained the parameter values at the confidence interval of $1σ$: $Ω_m=0.36\pm0.18$, $ω_x=-1.29^{+0.61}_{-0.23}$, $ξ=3.15^{+0.36}_{-1.1}$, and $H_0=70.04\pm0.42$ $kms^{-1}Mpc^{-1}$. According to our results, the best valve of $H_0$ show that the Hubble tension problem can be alleviated to some extent. In addition, the $ξ+3ω_x = -0.72^{+2.19}_{-1.19}(1σ)$ of which the center value indicates the coincidence problem is slightly alleviated. However, the $ξ+3ω_x = 0$ is still within the $1σ$ error range which indicates the $Λ$CDM model is still the model which is in best agreement with the observational data at present. Finally, we compare the constraint results of electromagnetic wave and gravitational wave on the model parameters and find that the constraint effect of electromagnetic wave data on model parameters is better than that of simulated Tianqin gravitational wave data.

astro-ph.CO↗
arXiv2022

Complementary Calibration: Boosting General Continual Learning with Collaborative Distillation and Self-Supervision

General Continual Learning (GCL) aims at learning from non independent and identically distributed stream data without catastrophic forgetting of the old tasks that don't rely on task boundaries during both training and testing stages. We reveal that the relation and feature deviations are crucial problems for catastrophic forgetting, in which relation deviation refers to the deficiency of the relationship among all classes in knowledge distillation, and feature deviation refers to indiscriminative feature representations. To this end, we propose a Complementary Calibration (CoCa) framework by mining the complementary model's outputs and features to alleviate the two deviations in the process of GCL. Specifically, we propose a new collaborative distillation approach for addressing the relation deviation. It distills model's outputs by utilizing ensemble dark knowledge of new model's outputs and reserved outputs, which maintains the performance of old tasks as well as balancing the relationship among all classes. Furthermore, we explore a collaborative self-supervision idea to leverage pretext tasks and supervised contrastive learning for addressing the feature deviation problem by learning complete and discriminative features for all classes. Extensive experiments on four popular datasets show that our CoCa framework achieves superior performance against state-of-the-art methods. Code is available at https://github.com/lijincm/CoCa.

cs.CV↗
arXiv2022

Detecting Exploit Primitives Automatically for Heap Vulnerabilities on Binary Programs

Automated Exploit Generation (AEG) is a well-known difficult task, especially for heap vulnerabilities. Previous works first detected heap vulnerabilities and then searched for exploitable states by using symbolic execution and fuzzing techniques on binary programs. However, it is not always easy to discovery bugs using fuzzing or symbolic technologies and solvable for internal overflow of heap objects. In this paper, we present a solution DEPA to detect exploit primitives based on primitive-crucial-behavior model for heap vulnerabilities. The core of DEPA contains two novel techniques, 1) primitive-crucial-behavior identification through pointer dependence analysis, and 2) exploit primitive determination method which includes triggering both vulnerabilities and exploit primitives. We evaluate DEPA on eleven real-world CTF(capture the flag) programs with heap vulnerabilities and DEPA can discovery arbitrary write and arbitrary jump exploit primitives for ten programs except for program multi-heap. Results showed that primitive-crucial-behavior identification and determining exploit primitives are accurate and effective by using our approach. In addition, DEPA is superior to the state-of-the-art tools in determining exploit primitives for the heap object internal overflow

cs.CR↗
arXiv2022

A review of Generative Adversarial Networks for Electronic Health Records: applications, evaluation measures and data sources

Electronic Health Records (EHRs) are a valuable asset to facilitate clinical research and point of care applications; however, many challenges such as data privacy concerns impede its optimal utilization. Deep generative models, particularly, Generative Adversarial Networks (GANs) show great promise in generating synthetic EHR data by learning underlying data distributions while achieving excellent performance and addressing these challenges. This work aims to review the major developments in various applications of GANs for EHRs and provides an overview of the proposed methodologies. For this purpose, we combine perspectives from healthcare applications and machine learning techniques in terms of source datasets and the fidelity and privacy evaluation of the generated synthetic datasets. We also compile a list of the metrics and datasets used by the reviewed works, which can be utilized as benchmarks for future research in the field. We conclude by discussing challenges in GANs for EHRs development and proposing recommended practices. We hope that this work motivates novel research development directions in the intersection of healthcare and machine learning.

cs.LG↗
arXiv2022

Probing the gravitational wave background from cosmic strings with Alternative LISA-TAIJI network

As one of the detection targets of all gravitational wave detectors at present, stochastic gravitational wave background (SGWB) provides us an important way to understand the evolution of our universe. In this paper, we explore the feasibility of detecting the SGWB generated by the loops, which arose throughout the cosmological evolution of the cosmic string network, by individual space detectors (e.g.~LISA, TAIJI) and joint space detectors (LISA-TAIJI). For joint detectors, we choose three different configurations of TAIJI (e.g.~TAIJIm, TAIJIp, TAIJIc) to form the LISA-TAIJI networks. And we investigate the performance of them to detect the SGWB. Though comparing the power-law sensitivity (PLS) curves of individual space detectors and joint detectors with energy density spectrum of SGWB. We find that LISA-TAIJIc has the best sensitivity for detecting the SGWB from cosmic string loops and is promising to further constrains the tension of cosmic sting $Gμ=O(10^{-17})$.

gr-qc↗