Search arXiv⌕ Search

arXiv subjects

Jin Li

Publications and source records attributed to Jin Li.

At least 217 records · Page 12Linked to original sources

Coarse-to-Fine Sparse Sequential Recommendation

Sequential recommendation aims to model dynamic user behavior from historical interactions. Self-attentive methods have proven effective at capturing short-term dynamics and long-term preferences. Despite their success, these approaches still struggle to model sparse data, on which they struggle to learn high-quality item representations. We propose to model user dynamics from shopping intents and interacted items simultaneously. The learned intents are coarse-grained and work as prior knowledge for item recommendation. To this end, we present a coarse-to-fine self-attention framework, namely CaFe, which explicitly learns coarse-grained and fine-grained sequential dynamics. Specifically, CaFe first learns intents from coarse-grained sequences which are dense and hence provide high-quality user intent representations. Then, CaFe fuses intent representations into item encoder outputs to obtain improved item representations. Finally, we infer recommended items based on representations of items and corresponding intents. Experiments on sparse datasets show that CaFe outperforms state-of-the-art self-attentive recommenders by 44.03% NDCG@5 on average.

cs.IR↗

Neural Points: Point Cloud Representation with Neural Fields for Arbitrary Upsampling

In this paper, we propose Neural Points, a novel point cloud representation and apply it to the arbitrary-factored upsampling task. Different from traditional point cloud representation where each point only represents a position or a local plane in the 3D space, each point in Neural Points represents a local continuous geometric shape via neural fields. Therefore, Neural Points contain more shape information and thus have a stronger representation ability. Neural Points is trained with surface containing rich geometric details, such that the trained model has enough expression ability for various shapes. Specifically, we extract deep local features on the points and construct neural fields through the local isomorphism between the 2D parametric domain and the 3D local patch. In the final, local neural fields are integrated together to form the global surface. Experimental results show that Neural Points has powerful representation ability and demonstrate excellent robustness and generalization ability. With Neural Points, we can resample point cloud with arbitrary resolutions, and it outperforms the state-of-the-art point cloud upsampling methods. Code is available at https://github.com/WanquanF/NeuralPoints.

cs.CV↗

Learning Personalized Item-to-Item Recommendation Metric via Implicit Feedback

This paper studies the item-to-item recommendation problem in recommender systems from a new perspective of metric learning via implicit feedback. We develop and investigate a personalizable deep metric model that captures both the internal contents of items and how they were interacted with by users. There are two key challenges in learning such model. First, there is no explicit similarity annotation, which deviates from the assumption of most metric learning methods. Second, these approaches ignore the fact that items are often represented by multiple sources of meta data and different users use different combinations of these sources to form their own notion of similarity. To address these challenges, we develop a new metric representation embedded as kernel parameters of a probabilistic model. This helps express the correlation between items that a user has interacted with, which can be used to predict user interaction with new items. Our approach hinges on the intuition that similar items induce similar interactions from the same user, thus fitting a metric-parameterized model to predict an implicit feedback signal could indirectly guide it towards finding the most suitable metric for each user. To this end, we also analyze how and when the proposed method is effective from a theoretical lens. Its empirical effectiveness is also demonstrated on several real-world datasets.

cs.IR↗

AI-enabled Automatic Multimodal Fusion of Cone-Beam CT and Intraoral Scans for Intelligent 3D Tooth-Bone Reconstruction and Clinical Applications

A critical step in virtual dental treatment planning is to accurately delineate all tooth-bone structures from CBCT with high fidelity and accurate anatomical information. Previous studies have established several methods for CBCT segmentation using deep learning. However, the inherent resolution discrepancy of CBCT and the loss of occlusal and dentition information largely limited its clinical applicability. Here, we present a Deep Dental Multimodal Analysis (DDMA) framework consisting of a CBCT segmentation model, an intraoral scan (IOS) segmentation model (the most accurate digital dental model), and a fusion model to generate 3D fused crown-root-bone structures with high fidelity and accurate occlusal and dentition information. Our model was trained with a large-scale dataset with 503 CBCT and 28,559 IOS meshes manually annotated by experienced human experts. For CBCT segmentation, we use a five-fold cross validation test, each with 50 CBCT, and our model achieves an average Dice coefficient and IoU of 93.99% and 88.68%, respectively, significantly outperforming the baselines. For IOS segmentations, our model achieves an mIoU of 93.07% and 95.70% on the maxillary and mandible on a test set of 200 IOS meshes, which are 1.77% and 3.52% higher than the state-of-art method. Our DDMA framework takes about 20 to 25 minutes to generate the fused 3D mesh model following the sequential processing order, compared to over 5 hours by human experts. Notably, our framework has been incorporated into a software by a clear aligner manufacturer, and real-world clinical cases demonstrate that our model can visualize crown-root-bone structures during the entire orthodontic treatment and can predict risks like dehiscence and fenestration. These findings demonstrate the potential of multi-modal deep learning to improve the quality of digital dental models and help dentists make better clinical decisions.

eess.IV↗

I4/mcm-Si$_{48}$: An Ideal Topological Nodal-Line Semimetal

Topological semimetals (TSMs) have attracted numerous attention due to their exotic physical properties and great application potentials. Silicon-based TMSs are of particularly importance because of their high abundance, nontoxicity and natural compatibility with current semiconductor industry. In this work, an ideal low-energy topological nodal-line semimetal (TNLSM) silicon (I4/mcm-Si$_{48}$) with a clean band crossing at Fermi level is screened from thousands of silicon allotropes by the transferable tight-binding and DFT-HSE calculations. The results of formation energy, phonon dispersion, ab initio molecular dynamics and elastic constants show that I4/mcm-Si48 possesses good stability and is more stable than several synthetized silicon structures. By analyzing the symmetry, it reveals that the topological nodal-line of I4/mcm-Si48 is protected by mirror symmetry and inversion, time-reversal and SU(2) spin-rotation symmetries, and the nearly flat drumhead-like surface spectrum is observed. Furthermore, I4/mcm-Si48 exhibits exotic photoelectric properties and the Dirac fermions with high Fermi velocity (3.4$\sim$4.36$\times$10$^5$ m/s) can be excited by low energy photons. Our study provides a promising topological nodal-line semimetal for fundamental research and potential practical applications in semiconductor-compatible high-speed photoelectric devices.

cond-mat.mtrl-sci↗

GraphEye: A Novel Solution for Detecting Vulnerable Functions Based on Graph Attention Network

With the continuous extension of the Industrial Internet, cyber incidents caused by software vulnerabilities have been increasing in recent years. However, software vulnerabilities detection is still heavily relying on code review done by experts, and how to automatedly detect software vulnerabilities is an open problem so far. In this paper, we propose a novel solution named GraphEye to identify whether a function of C/C++ code has vulnerabilities, which can greatly alleviate the burden of code auditors. GraphEye is originated from the observation that the code property graph of a non-vulnerable function naturally differs from the code property graph of a vulnerable function with the same functionality. Hence, detecting vulnerable functions is attributed to the graph classification problem.GraphEye is comprised of VecCPG and GcGAT. VecCPG is a vectorization for the code property graph, which is proposed to characterize the key syntax and semantic features of the corresponding source code. GcGAT is a deep learning model based on the graph attention graph, which is proposed to solve the graph classification problem according to VecCPG. Finally, GraphEye is verified by the SARD Stack-based Buffer Overflow, Divide-Zero, Null Pointer Deference, Buffer Error, and Resource Error datasets, the corresponding F1 scores are 95.6%, 95.6%,96.1%,92.6%, and 96.1% respectively, which validate the effectiveness of the proposed solution.

cs.CR↗

ApolloRL: a Reinforcement Learning Platform for Autonomous Driving

We introduce ApolloRL, an open platform for research in reinforcement learning for autonomous driving. The platform provides a complete closed-loop pipeline with training, simulation, and evaluation components. It comes with 300 hours of real-world data in driving scenarios and popular baselines such as Proximal Policy Optimization (PPO) and Soft Actor-Critic (SAC) agents. We elaborate in this paper on the architecture and the environment defined in the platform. In addition, we discuss the performance of the baseline agents in the ApolloRL environment.

cs.RO↗

Simulation of a Xe-based X-ray Polarimeter at 10-30 keV

Polarization detection of X-rays is a non-negligible topic to astrophysical observation. Many polarization detection methods have been well developed for X-rays in the energy range below 10~keV, while the detection at 10-30~keV is rarely discussed. This paper presents a simulation study of a Xe-based gas pixel detector, which can achieve the polarization detection of X-rays at 10-30~keV. To verify the emission angle distribution of photoelectrons, different electromagnetic models in Geant4 were investigated. After a necessary modification by considering the missing factor when sampling the emission angle, a good agreement can be achieved. Moreover, the detection capability of 20~keV polarized photons was discussed and the modulation factor could be 43\%.

astro-ph.IM↗

High precision measurement of cosmic curvature: from gravitational waves and cosmic chronometer

Although the spatial curvature has been measured with very high precision, it still suffers from the well known cosmic curvature tension. In this paper, we propose an improved method to determine the cosmic curvature, by using the simulated data of binary neutron star mergers observed by the second generation space-based DECi-hertz Interferometer Gravitational-wave Observatory (DECIGO). By applying the Hubble parameter observations of cosmic chronometers to the DECIGO standard sirens, we explore different possibilities of making measurements of the cosmic curvature referring to a distant past: one is to reconstruct the Hubble parameters through the Gaussian process without the influence of hypothetical models, and the other is deriving constraints on $Ω_K$ in the framework of non-flat $Λ$ cold dark matter model. It is shown that in the improved method DECIGO could provide a reliable and stringent constraint on the cosmic curvature ($Ω_{K} = -0.007\pm0.016$), while we could only expect the zero cosmic curvature to be established at the precision of $ΔΩ_K=0.12$ in the second model-dependent method. Therefore, our results indicate that in the framework of methodology proposed in this paper, the increasing number of well-measured standard sirens in DECIGO could significantly reduce the bias of estimations for cosmic curvature. Such constraint is also comparable to the precision of Planck 2018 results with the newest cosmic microwave background (CMB) observations ($ΔΩ_{K} \approx 0.018$), based on the concordance $Λ$CDM model.

astro-ph.CO↗

On the correspondence between energy conservation and energy-momentum tensor conservation in cosmology

The correspondence between the thermodynamic energy equation satisfied by a closed co-moving volume and the conservation equation satisfied by the energy-momentum tensor of the matter inside the co-moving volume is extended to a more general system with an arbitrary cosmological horizon and a heat source. The energy of the system consisting of a cosmological horizon and its internal matter could be conserved by defining a surface energy on the horizons. Therefore, energy conservation and energy-momentum tensor conservation can always be consistent for such a system. On the other hand, from the perspective of classical thermodynamics, one can define an effective pressure at the cosmological horizon to guarantee that the thermodynamic energy equation inside the horizon is consistent with the energy-momentum tensor conservation equation of the matter inside the horizon. These systems can satisfy the generalized second law of thermodynamics under appropriate conditions. The definitions of the surface energy and the effective pressure are extended to the gravity theory with non-minimal coupling between geometry and matter, in which geometry could be regarded as a heat source.

gr-qc↗

Improved Polar-code-based Efficient Post-processing Algorithm for Quantum Key Distribution

Combined with one-time pad encryption scheme, quantum key distribution guarantees the unconditional security of communication in theory. However, error correction and privacy amplification in the post-processing phase of quantum key distribution result in high time delay, which limits the final secret key generation rate and the practicability of quantum key distribution systems. To alleviate this limitation, this paper proposes an efficient post-processing algorithm based on polar codes for quantum key distribution. In this algorithm, by analyzing the channel capacity of the main channel and the wiretap channel respectively under the Wyner's wiretap channel model, we design a codeword structure of polar codes, so that the error correction and privacy amplification could be completed synchronously in a single step. Through combining error correction and privacy amplification into one single step, this efficient post-processing algorithm reduces complexity of the system and lower the post-processing delay. Besides, the reliable and secure communicaiton conditions for this algorithm has been given in this paper. Simulation results show that this post-processing algorithm satisfies the reliable and secure communication conditions well.

quant-ph↗

$\rm{SL}(n)$ covariant function-valued valuations

Classifications of $\rm{SL}(n)$ covariant function-valued valuations are established with some assumptions of continuity. New valuations, for example, weighted moment functions, are introduced and our classifications give unified characterizations of the Laplace transform on convex bodies, $L_p$ moment bodies, $L_p$ difference bodies, and polar $L_p$ moment bodies ($L_{-p}$ intersection bodies). Using the new classifications, we also establish some Euler-type relations.

math.MG↗

Efficient Robotic Manipulation Through Offline-to-Online Reinforcement Learning and Goal-Aware State Information

End-to-end learning robotic manipulation with high data efficiency is one of the key challenges in robotics. The latest methods that utilize human demonstration data and unsupervised representation learning has proven to be a promising direction to improve RL learning efficiency. The use of demonstration data also allows "warming-up" the RL policies using offline data with imitation learning or the recently emerged offline reinforcement learning algorithms. However, existing works often treat offline policy learning and online exploration as two separate processes, which are often accompanied by severe performance drop during the offline-to-online transition. Furthermore, many robotic manipulation tasks involve complex sub-task structures, which are very challenging to be solved in RL with sparse reward. In this work, we propose a unified offline-to-online RL framework that resolves the transition performance drop issue. Additionally, we introduce goal-aware state information to the RL agent, which can greatly reduce task complexity and accelerate policy learning. Combined with an advanced unsupervised representation learning module, our framework achieves great training efficiency and performance compared with the state-of-the-art methods in multiple robotic manipulation tasks.

cs.RO↗

Large-Gap Quantum Spin Hall State and Temperature-Induced Lifshitz Transition in Bi4Br4

Searching for new quantum spin Hall insulators with large fully opened energy gap to overcome the thermal disturbance at room temperature has attracted tremendous attention due to the one-dimensional (1D) spin-momentum locked topological edge states serving as dissipationless channels for the practical applications in low consumption electronics and high performance spintronics. Here, we report the investigation of topological nature of monolayer Bi4Br4 by the techniques of scanning tunneling microscopy and angle-resolved photoemission spectroscopy (ARPES). The topological non-triviality of 1D edge state integrals within the large bulk energy gap (~ 0.2 eV) is revealed by the first-principle calculations. The ARPES measurements at different temperature show a temperature-induced Lifshitz transition, corresponding to the resistivity anomaly caused by the shift of chemical potential. The connection between the emergency of superconductivity and the Lifshitz transition is discussed.

cond-mat.mtrl-sci↗

FDN: Finite Difference Network with Hierarchical Convolutional Features for Text-independent Speaker Verification

In recent years, using raw waveforms as input for deep networks has been widely explored for the speaker verification system. For example, RawNet and RawNet2 extracted speaker's feature embeddings from waveforms automatically for recognizing their voice, which can vastly reduce the front-end computation and obtain state-of-the-art performance. However, these models do not consider the speaker's high-level behavioral features, such as intonation, indicating each speaker's universal style, rhythm, \textit{etc}. This paper presents a novel network that can handle the intonation information by computing the finite difference of different speakers' utterance variations. Furthermore, a hierarchical way is also designed to enhance the intonation property from coarse to fine to improve the system accuracy. The high-level intonation features are then fused with the low-level embedding features. Experimental results on official VoxCeleb1 test data, VoxCeleb1-E, and VoxCeleb-H protocols show our method outperforms and robustness existing state-of-the-art systems. To facilitate further research, code is available at https://github.com/happyjin/FDN

eess.AS↗

Unsupervised Cross-Lingual Speech Emotion Recognition Using Pseudo Multilabel

Speech Emotion Recognition (SER) in a single language has achieved remarkable results through deep learning approaches in the last decade. However, cross-lingual SER remains a challenge in real-world applications due to a great difference between the source and target domain distributions. To address this issue, we propose an unsupervised cross-lingual Neural Network with Pseudo Multilabel (NNPM) that is trained to learn the emotion similarities between source domain features inside an external memory adjusted to identify emotion in cross-lingual databases. NNPM introduces a novel approach that leverages external memory to store source domain features and generates pseudo multilabel for each target domain data by computing the similarities between the external memory and the target domain features. We evaluate our approach on multiple different languages of speech emotion databases. Experimental results show our proposed approach significantly improves the weighted accuracy (WA) across multiple low-resource languages on Urdu, Skropus, ShEMO, and EMO-DB corpus. To facilitate further research, code is available at https://github.com/happyjin/NNPM

eess.AS↗

Enhanced Memory Network: The novel network structure for Symbolic Music Generation

Symbolic melodies generation is one of the essential tasks for automatic music generation. Recently, models based on neural networks have had a significant influence on generating symbolic melodies. However, the musical context structure is complicated to capture through deep neural networks. Although long short-term memory (LSTM) is attempted to solve this problem through learning order dependence in the musical sequence, it is not capable of capturing musical context with only one note as input for each time step of LSTM. In this paper, we propose a novel Enhanced Memory Network (EMN) with several recurrent units, named Enhanced Memory Unit (EMU), to explicitly modify the internal architecture of LSTM for containing music beat information and reinforces the memory of the latest musical beat through aggregating beat inside the memory gate. In addition, to increase the diversity of generated musical notes, cosine distance among adjacent time steps of hidden states is considered as part of loss functions to avoid a high similarity score that harms the diversity of generated notes. Objective and subjective evaluation results show that the proposed method achieves state-of-the-art performance. Code and music demo are available at https://github.com/qrqrqrqr/EMU

eess.AS↗

GeodesicEmbedding (GE): A High-Dimensional Embedding Approach for Fast Geodesic Distance Queries

In this paper, we develop a novel method for fast geodesic distance queries. The key idea is to embed the mesh into a high-dimensional space, such that the Euclidean distance in the high-dimensional space can induce the geodesic distance in the original manifold surface. However, directly solving the high-dimensional embedding problem is not feasible due to the large number of variables and the fact that the embedding problem is highly nonlinear. We overcome the challenges with two novel ideas. First, instead of taking all vertices as variables, we embed only the saddle vertices, which greatly reduces the problem complexity. We then compute a local embedding for each non-saddle vertex. Second, to reduce the large approximation error resulting from the purely Euclidean embedding, we propose a cascaded optimization approach that repeatedly introduces additional embedding coordinates with a non-Euclidean function to reduce the approximation residual. Using the precomputation data, our approach can determine the geodesic distance between any two vertices in near-constant time. Computational testing results show that our method is more desirable than previous geodesic distance queries methods.

cs.GR↗