Searcharxiv⌕ Search

arXiv subjects

Jianjun Chen

Publications and source records attributed to Jianjun Chen.

At least 73 records · Page 4Linked to original sources

GraphScale: A Framework to Enable Machine Learning over Billion-node Graphs

Graph Neural Networks (GNNs) have emerged as powerful tools for supervised machine learning over graph-structured data, while sampling-based node representation learning is widely utilized in unsupervised learning. However, scalability remains a major challenge in both supervised and unsupervised learning for large graphs (e.g., those with over 1 billion nodes). The scalability bottleneck largely stems from the mini-batch sampling phase in GNNs and the random walk sampling phase in unsupervised methods. These processes often require storing features or embeddings in memory. In the context of distributed training, they require frequent, inefficient random access to data stored across different workers. Such repeated inter-worker communication for each mini-batch leads to high communication overhead and computational inefficiency. We propose GraphScale, a unified framework for both supervised and unsupervised learning to store and process large graph data distributedly. The key insight in our design is the separation of workers who store data and those who perform the training. This separation allows us to decouple computing and storage in graph training, thus effectively building a pipeline where data fetching and data computation can overlap asynchronously. Our experiments show that GraphScale outperforms state-of-the-art methods for distributed training of both GNNs and node embeddings. We evaluate GraphScale both on public and proprietary graph datasets and observe a reduction of at least 40% in end-to-end training times compared to popular distributed frameworks, without any loss in performance. While most existing methods don't support billion-node graphs for training node embeddings, GraphScale is currently deployed in production at TikTok enabling efficient learning over such large graphs.

cs.LG↗

SFVInt: Simple, Fast and Generic Variable-Length Integer Decoding using Bit Manipulation Instructions

The ubiquity of variable-length integers in data storage and communication necessitates efficient decoding techniques. In this paper, we present SFVInt, a simple and fast approach to decode the prevalent Little Endian Base-128 (LEB128) varints. Our approach effectively utilizes the Bit Manipulation Instruction Set 2 (BMI2) in modern Intel and AMD processors, achieving significant performance improvement while maintaining simplicity and avoiding overengineering. SFVInt, with its generic design, effectively processes both 32-bit and 64-bit unsigned integers using a unified code template, marking a significant leap forward in varint decoding efficiency. We thoroughly evaluate SFVInt's performance across various datasets and scenarios, demonstrating that it achieves up to a 2x increase in decoding speed when compared to varint decoding methods used in established frameworks like Facebook Folly and Google Protobuf.

cs.DB↗

Decentralized Privacy Preservation for Critical Connections in Graphs

Many real-world interconnections among entities can be characterized as graphs. Collecting local graph information with balanced privacy and data utility has garnered notable interest recently. This paper delves into the problem of identifying and protecting critical information of entity connections for individual participants in a graph based on cohesive subgraph searches. This problem has not been addressed in the literature. To address the problem, we propose to extract the critical connections of a queried vertex using a fortress-like cohesive subgraph model known as $p$-cohesion. A user's connections within a fortress are obfuscated when being released, to protect critical information about the user. Novel merit and penalty score functions are designed to measure each participant's critical connections in the minimal $p$-cohesion, facilitating effective identification of the connections. We further propose to preserve the privacy of a vertex enquired by only protecting its critical connections when responding to queries raised by data collectors. We prove that, under the decentralized differential privacy (DDP) mechanism, one's response satisfies $(\varepsilon, δ)$-DDP when its critical connections are protected while the rest remains unperturbed. The effectiveness of our proposed method is demonstrated through extensive experiments on real-life graph datasets.

cs.CR↗

ATFNet: Adaptive Time-Frequency Ensembled Network for Long-term Time Series Forecasting

The intricate nature of time series data analysis benefits greatly from the distinct advantages offered by time and frequency domain representations. While the time domain is superior in representing local dependencies, particularly in non-periodic series, the frequency domain excels in capturing global dependencies, making it ideal for series with evident periodic patterns. To capitalize on both of these strengths, we propose ATFNet, an innovative framework that combines a time domain module and a frequency domain module to concurrently capture local and global dependencies in time series data. Specifically, we introduce Dominant Harmonic Series Energy Weighting, a novel mechanism for dynamically adjusting the weights between the two modules based on the periodicity of the input time series. In the frequency domain module, we enhance the traditional Discrete Fourier Transform (DFT) with our Extended DFT, designed to address the challenge of discrete frequency misalignment. Additionally, our Complex-valued Spectrum Attention mechanism offers a novel approach to discern the intricate relationships between different frequency combinations. Extensive experiments across multiple real-world datasets demonstrate that our ATFNet framework outperforms current state-of-the-art methods in long-term time series forecasting.

cs.LG↗

Efficient initialization of fluxonium qubits based on auxiliary energy levels

Fast and high-fidelity qubit initialization is crucial for low-frequency qubits such as fluxonium, and in applications of many quantum algorithms and quantum error correction codes. In a circuit quantum electrodynamics system, the initialization is typically achieved by transferring the state between the qubit and a short-lived cavity through microwave driving, also known as the sideband cooling process in atomic system. Constrained by the selection rules from the parity symmetry of the wavefunctions, the sideband transitions are only enabled by multi-photon processes which requires multi-tone or strong driving. Leveraging the flux-tunability of fluxonium, we circumvent this limitation by breaking flux symmetry to enable an interaction between a non-computational qubit transition and the cavity excitation. With single-tone sideband driving, we realize qubit initialization with a fidelity exceeding 99% within a duration of 300 ns, robust against the variation of control parameters. Furthermore, we show that our initialization scheme has a built-in benefit in simultaneously removing the second-excited state population of the qubit, and can be easily incorporated into a large-scale fluxonium processor.

quant-ph↗

MeshAC: A 3D Mesh Generation and Adaptation Package for Multiscale Coupling Methods

This paper introduces the MeshAC package, which generates three-dimensional adaptive meshes tailored for the efficient and robust implementation of multiscale coupling methods. While Delaunay triangulation is commonly used for mesh generation across the entire computational domain, generating meshes for multiscale coupling methods is more challenging due to intrinsic discrete structures such as defects, and the need to match these structures to the continuum domain at the interface. The MeshAC package tackles these challenges by generating meshes that align with fine-level discrete structures. It also incorporates localized modification and reconstruction operations specifically designed for interfaces. These enhancements improve both the implementation efficiency and the quality of the coupled mesh. Furthermore, MeshAC introduces a novel adaptive feature that utilizes gradient-based a posteriori error estimation, which automatically adjusts the atomistic region and continuum mesh, ensuring an optimal balance between accuracy and efficiency. This package can be directly applied to the geometry optimization problems of a/c coupling in static mechanics, with potential extensions to many other scenarios. Its capabilities are demonstrated for complex material defects, including straight edge dislocation in BCC W and double voids in FCC Cu. These results suggest that MeshAC can be a valuable tool for researchers and practitioners in computational mechanics.

cs.GR↗

Self-supervised Adaptive Weighting for Cooperative Perception in V2V Communications

Perception of the driving environment is critical for collision avoidance and route planning to ensure driving safety. Cooperative perception has been widely studied as an effective approach to addressing the shortcomings of single-vehicle perception. However, the practical limitations of vehicle-to-vehicle (V2V) communications have not been adequately investigated. In particular, current cooperative fusion models rely on supervised models and do not address dynamic performance degradation caused by arbitrary channel impairments. In this paper, a self-supervised adaptive weighting model is proposed for intermediate fusion to mitigate the adverse effects of channel distortion. The performance of cooperative perception is investigated in different system settings. Rician fading and imperfect channel state information (CSI) are also considered. Numerical results demonstrate that the proposed adaptive weighting algorithm significantly outperforms the benchmarks without weighting. Visualization examples validate that the proposed weighting algorithm can flexibly adapt to various channel conditions. Moreover, the adaptive weighting algorithm demonstrates good generalization to untrained channels and test datasets from different domains.

cs.CV↗

Cooperative Perception with Learning-Based V2V communications

Cooperative perception has been widely used in autonomous driving to alleviate the inherent limitation of single automated vehicle perception. To enable cooperation, vehicle-to-vehicle (V2V) communication plays an indispensable role. This work analyzes the performance of cooperative perception accounting for communications channel impairments. Different fusion methods and channel impairments are evaluated. A new late fusion scheme is proposed to leverage the robustness of intermediate features. In order to compress the data size incurred by cooperation, a convolution neural network-based autoencoder is adopted. Numerical results demonstrate that intermediate fusion is more robust to channel impairments than early fusion and late fusion, when the SNR is greater than 0 dB. Also, the proposed fusion scheme outperforms the conventional late fusion using detection outputs, and autoencoder provides a good compromise between detection accuracy and bandwidth usage.

eess.SP↗

Native approach to controlled-Z gates in inductively coupled fluxonium qubits

The fluxonium qubits have emerged as a promising platform for gate-based quantum information processing. However, their extraordinary protection against charge fluctuations comes at a cost: when coupled capacitively, the qubit-qubit interactions are restricted to XX-interactions. Consequently, effective XX- or XZ-interactions are only constructed either by temporarily populating higher-energy states, or by exploiting perturbative effects under microwave driving. Instead, we propose and demonstrate an inductive coupling scheme, which offers a wide selection of native qubit-qubit interactions for fluxonium. In particular, we leverage a built-in, flux-controlled ZZ-interaction to perform qubit entanglement. To combat the increased flux-noise-induced dephasing away from the flux-insensitive position, we use a continuous version of the dynamical decoupling scheme to perform noise filtering. Combining these, we demonstrate a 20 ns controlled-Z (CZ) gate with a mean fidelity of 99.53%. More than confirming the efficacy of our gate scheme, this high-fidelity result also reveals a promising but rarely explored parameter space uniquely suitable for gate operations between fluxonium qubits.

quant-ph↗

COOOL: A Learning-To-Rank Approach for SQL Hint Recommendations

Query optimization is a pivotal part of every database management system (DBMS) since it determines the efficiency of query execution. Numerous works have introduced Machine Learning (ML) techniques to cost modeling, cardinality estimation, and end-to-end learned optimizer, but few of them are proven practical due to long training time, lack of interpretability, and integration cost. A recent study provides a practical method to optimize queries by recommending per-query hints but it suffers from two inherited problems. First, it follows the regression framework to predict the absolute latency of each query plan, which is very challenging because the latencies of query plans for a certain query may span multiple orders of magnitude. Second, it requires training a model for each dataset, which restricts the application of the trained models in practice. In this paper, we propose COOOL to predict Cost Orders of query plans to cOOperate with DBMS by Learning-To-Rank. Instead of estimating absolute costs, COOOL uses ranking-based approaches to compute relative ranking scores of the costs of query plans. We show that COOOL is theoretically valid to distinguish query plans with different latencies. We implement COOOL on PostgreSQL, and extensive experiments on join-order-benchmark and TPC-H data demonstrate that COOOL outperforms PostgreSQL and state-of-the-art methods on single-dataset tasks as well as a unified model for multiple-dataset tasks. Our experiments also shed some light on why COOOL outperforms regression approaches from the representation learning perspective, which may guide future research.

cs.DB↗

Callee: Recovering Call Graphs for Binaries with Transfer and Contrastive Learning

Recovering binary programs' call graphs is crucial for inter-procedural analysis tasks and applications based on them.transfer One of the core challenges is recognizing targets of indirect calls (i.e., indirect callees). Existing solutions all have high false positives and negatives, making call graphs inaccurate. In this paper, we propose a new solution Callee combining transfer learning and contrastive learning. The key insight is that, deep neural networks (DNNs) can automatically identify patterns concerning indirect calls, which can be more efficient than designing approximation algorithms or heuristic rules to handle various cases. Inspired by the advances in question-answering applications, we utilize contrastive learning to answer the callsite-callee question. However, one of the toughest challenges is that DNNs need large datasets to achieve high performance, while collecting large-scale indirect-call ground-truths can be computational-expensive. Since direct calls and indirect calls share similar calling conventions, it is possible to transfer knowledge learned from direct calls to indirect ones. Therefore, we leverage transfer learning to pre-train DNNs with easy-to-collect direct calls and further fine-tune the indirect-call DNNs. We evaluate Callee on several groups of targets, and results show that our solution could match callsites to callees with an F1-Measure of 94.6%, much better than state-of-the-art solutions. Further, we apply Callee to binary code similarity detection and hybrid fuzzing, and found it could greatly improve their performance.

cs.SE↗

Adaptive Multigrid Strategy for Geometry Optimization of Large-Scale Three Dimensional Molecular Mechanics

In this paper, we present an efficient adaptive multigrid strategy for the geometry optimization of large-scale three dimensional molecular mechanics. The resulting method can achieve significantly reduced complexity by exploiting the intrinsic low-rank property of the material configurations and by combining the state-of-the-art adaptive techniques with the hierarchical structure of multigrid algorithms. To be more precise, we develop a oneway multigrid method with adaptive atomistic/continuum (a/c) coupling, e.g., blended ghost force correction (BGFC) approximations with gradient-based a posteriori error estimators on the coarse levels. We utilize state-of-the-art 3D mesh generation techniques to effectively implement the method. For 3D crystalline defects, such as vacancies, micro-cracks and dislocations, compared with brute-force optimization, complexity with superior rates can be observed numerically, and the strategy has a five-fold acceleration in terms of CPU time for systems with $10^8$ atoms.

physics.comp-ph↗

LAMOST Medium-Resolution Spectral Survey of Galactic Nebulae (LAMOST-MRS-N): Subtraction of Geocoronal Halpha Emission

We introduce a method of subtracting geocoronal Halpha emissions from the spectra of LAMOST medium-resolution spectral survey of Galactic nebulae (LAMOST-MRS-N). The flux ratios of the Halpha sky line to the adjacent OH lambda6554 single line do not show a pattern or gradient distribution in a plate. More interestingly, the ratio is well correlated to solar altitude, which is the angle of the sun relative to the Earth's horizon. It is found that the ratio decreases from 0.8 to 0.2 with the decreasing solar altitude from -17 to -73 degree. Based on this relation, which is described by a linear function, we can construct the Halpha sky component and subtract it from the science spectrum. This method has been applied to the LAMOST-MRS-N data, and the contamination level of the Halpha sky to nebula is reduced from 40% to less than 10%. The new generated spectra will significantly improve the accuracy of the classifications and the measurements of physical parameters of Galactic nebulae.

astro-ph.IM↗

Phase II of the LAMOST-Kepler/K2 survey. I. Time series of medium-resolution spectroscopic observations

Phase \RNum{2} of the LAMOST-{\sl Kepler/K}2 survey (LK-MRS), initiated in 2018, aims at collecting medium-resolution spectra ($R\sim7,500$; hereafter MRS) for more than $50,000$ stars with multiple visits ($\sim60$ epochs) over a period of 5 years (2018 September to 2023 June). We selected 20 footprints distributed across the {\sl Kepler} field and six {\sl K}2 campaigns, with each plate containing a number of stars ranging from $\sim2,000$ to $\sim 3,000$. During the first year of observations, the LK-MRS has already collected $\sim280,000$ and $\sim369,000$ high-quality spectra in the blue and red wavelength range, respectively. The atmospheric parameters and radial velocities for $\sim259,000$ spectra of $21,053$ targets were successfully calculated by the LASP pipeline. The internal uncertainties for the effective temperature, surface gravity, metallicity, and radial velocity are found to be $100$\,K, $0.15$\,dex, $0.09$\,dex, and $1.00$\,km\,s$^{-1}$, respectively. We found $14,997$, $20,091$, and $1,514$ stars in common with the targets from the LAMOST low-resolution survey (LRS), GAIA and APOGEE, respectively, corresponding to a fraction of $\sim70\%$, $\sim95\%$ and $\sim7.2\%$. In general, the parameters derived from LK-MRS spectra are consistent with those obtained from the LRS and APOGEE spectra, but the scatter increases as the surface gravity decreases when comparing with the measurements from APOGEE. A large discrepancy is found with the GAIA values of the effective temperature. The comparisons of radial velocities of LK-MRS to GAIA and LK-MRS to APOGEE nearly follow an Gaussian distribution with a mean $μ\sim1.10$ and $0.73$\,km\,s$^{-1}$, respectively.

astro-ph.SR↗

Self-similar solutions of the spherically symmetric Euler equations for general equations of state

The study of spherically symmetric motion is important for the theory of explosion waves. In this paper, we construct rigorously self-similar solutions to the Riemann problem of the spherically symmetric Euler equations for general equations of state. We used the assumption of self-similarity to reduce the spherically symmetric Euler equations to a system of nonlinear ordinary differential equations, from which we obtain detailed structures of solutions besides their existence.

math.AP↗

Radial velocity measurements from LAMOST medium-resolution spectroscopic observations: A pointing towards the Kepler field

Radial velocity is one of key measurements in understanding the fundamental properties of stars, stellar clusters and the Galaxy. A plate of stars in the Kepler field were observed in May of 2018 with the medium-resolution spectrographs of LAMOST, aiming to test the performance of this new system which is the upgraded equipment of LAMOST after the first five-year regular survey.We present our analysis on the radial velocity measurements (RVs) derived from these data. The results show that slight and significant systematic errors exist among the RVs obtained from the spectra collected by different spectrographs and exposures, respectively. After correcting the systematic errors with different techniques, the precision of RVs reaches ~1.3, ~1.0, ~0.5 and ~0.3 km/s at S/Nr = 10, 20, 50, and 100, respectively. Comparing with the RVs of the standard stars of the APOGEE survey, our RVs are calibrated with a zero-point shift of ~7 km/s. The results indicate that the LAMOST medium-resolution spectroscopic system may provide RVs in a reasonable accuracy and precision for the selected targets.

astro-ph.SR↗

Controlling Surface-plasmon-polariton Launching with Hot Spot Cylindrical Waves in a Metallic Slit Structure

Plasmonic nanostructures, which are used to generate surface plasmon polaritions (SPPs), always involve sharp corners where the charges can accumulate. This can result in strong localized electromagnetic fields at the metallic corners, forming hot spots. The influence of the hot spots on the propagating SPPs are investigated theoretically and experimentally in a metallic slit structure. It is found that the electromagnetic fields radiated from the hot spots, termed as the hot spot cylindrical wave (HSCW), can greatly manipulate the SPP launching in the slit structure. The physical mechanism behind the manipulation of the SPP launching with the HSCW is explicated by a semi-analytic model. By using the HSCW, unidirectional SPP launching is experimentally realized in an ultra-small metallic step-slit structure. The HSCW bridges the localized surface plasmons and the propagating surface plasmons in an integrated platform and thus may pave a new route to the design of plasmonic devices and circuits.

physics.optics↗

Polarization-Independent and High-Efficiency Dielectric Metasurfaces Spanning 600-800 nm Wavelengths

Artificial metasurfaces are capable of completely manipulating the phase, amplitude, and polarization of light with high spatial resolutions. The emerging design based on high-index and low-loss dielectrics has led to the realization of novel metasurfaces with high transmissions, but these devices usually operate at the limited bandwidth, and are sensitive to the incident polarization. Here, for the first time we report experimentally the polarization-independent and high-efficiency dielectric metasurfaces spanning the visible wavelengths about 200 nm, which are of importance for novel flat optical devices operating over a broad spectrum. The diffraction efficiencies of the gradient metasurfaces consisting of the multi-fold symmetric nano-crystalline silicon nanopillars are up to 93% at 670 nm, and exceed 75% at the wavelengths from 600 to 800 nm for the two orthogonally polarized incidences. These dielectric metasurfaces hold great potential to replace prisms, lenses and other conventional optical elements.

physics.optics↗