arXiv subjects

Gang Wang

Publications and source records attributed to Gang Wang.

At least 181 records · Page 10Linked to original sources

arXiv2024

ORCHID: Streaming Threat Detection over Versioned Provenance Graphs

While Endpoint Detection and Response (EDR) are able to efficiently monitor threats by comparing static rules to the event stream, their inability to incorporate past system context leads to high rates of false alarms. Recent work has demonstrated Provenance-based Intrusion Detection Systems (Prov-IDS) that can examine the causal relationships between abnormal behaviors to improve threat classification. However, employing these Prov-IDS in practical settings remains difficult -- state-of-the-art neural network based systems are only fast in a fully offline deployment model that increases attacker dwell time, while simultaneously using simplified and less accurate provenance graphs to reduce memory consumption. Thus, today's Prov-IDS cannot operate effectively in the real-time streaming setting required for commercial EDR viability. This work presents the design and implementation of ORCHID, a novel Prov-IDS that performs fine-grained detection of process-level threats over a real time event stream. ORCHID takes advantage of the unique immutable properties of a versioned provenance graphs to iteratively embed the entire graph in a sequential RNN model while only consuming a fraction of the computation and memory costs. We evaluate ORCHID on four public datasets, including DARPA TC, to show that ORCHID can provide competitive classification performance while eliminating detection lag and reducing memory consumption by two orders of magnitude.

cs.CR↗

arXiv2024

Chemical versus physical pressure effects on the structure transition of bilayer nickelates

The observation of high-$T_c$ superconductivity (HTSC) in concomitant with pressure-induced orthorhombic-tetragonal structural transition in the bilayer La$_{3}$Ni$_2$O$_7$ has sparked hopes of achieving HTSC by stabilizing the tetragonal phase at ambient pressure. To mimic the effect of external physical pressures, the application of chemical pressure via replacing La$^3$$^+$ with smaller rare-earth R$^3$$^+$ has been considered as a potential route. Here we clarify the distinct effects of chemical and physical pressures on the structural transition of bilayer nickelates through a combined experimental and theoretical investigation. Contrary to general expectations, we find that substitutions of smaller R$^3$$^+$ for La$^3$$^+$ in La$_{3-x}$R$_x$Ni$_2$O$_{7-δ}$, despite of an overall lattice contraction, produce stronger orthorhombic structural distortions and thus require higher pressures to induce the structural transition. We established a quantitative relationship between the critical pressure $P_c$ for structural transition and the average size of $A$-site cations. A linear extrapolation of $P_c$ versus <$r_A$> yields a putative critical value of <$r_A$>$_c$ ~ 1.23 angstrom for $P_c$ ~ 1 bar. The negative correlation between $P_c$ and <$r_A$> indicates that it is unlikely to reduce $P_c$ to ambient by replacing La$^3$$^+$ with smaller R$^3$$^+$ ions. Instead, partial substitution of La$^3$$^+$ with larger cations such as alkaline-earth Sr$^2$$^+$ or Ba$^2$$^+$ might be a feasible approach. Our results provide valuable guidelines in the quest of ambient-pressure HTSC in bilayer nickelates.

cond-mat.str-el↗

arXiv2024

Heavy-Ball Momentum Accelerated Actor-Critic With Function Approximation

By using an parametric value function to replace the Monte-Carlo rollouts for value estimation, the actor-critic (AC) algorithms can reduce the variance of stochastic policy gradient so that to improve the convergence rate. While existing works mainly focus on analyzing convergence rate of AC algorithms under Markovian noise, the impacts of momentum on AC algorithms remain largely unexplored. In this work, we first propose a heavy-ball momentum based advantage actor-critic (\mbox{HB-A2C}) algorithm by integrating the heavy-ball momentum into the critic recursion that is parameterized by a linear function. When the sample trajectory follows a Markov decision process, we quantitatively certify the acceleration capability of the proposed HB-A2C algorithm. Our theoretical results demonstrate that the proposed HB-A2C finds an $ε$-approximate stationary point with $\oo{ε^{-2}}$ iterations for reinforcement learning tasks with Markovian noise. Moreover, we also reveal the dependence of learning rates on the length of the sample trajectory. By carefully selecting the momentum factor of the critic recursion, the proposed HB-A2C can balance the errors introduced by the initialization and the stoschastic approximation.

cs.LG↗

arXiv2024

Guaranteeing Accuracy and Fairness under Fluctuating User Traffic: A Bankruptcy-Inspired Re-ranking Approach

Out of sustainable and economical considerations, two-sided recommendation platforms must satisfy the needs of both users and providers. Previous studies often show that the two sides' needs show different urgency: providers need a relatively long-term exposure demand while users want more short-term and accurate service. However, our empirical study reveals that previous methods for trading off fairness-accuracy often fail to guarantee long-term fairness and short-term accuracy simultaneously in real applications of fluctuating user traffic. Especially, when user traffic is low, the user experience often drops a lot. Our theoretical analysis also confirms that user traffic is a key factor in such a trade-off problem. How to guarantee accuracy and fairness under fluctuating user traffic remains a problem. Inspired by the bankruptcy problem in economics, we propose a novel fairness-aware re-ranking approach named BankFair. Intuitively, BankFair employs the Talmud rule to leverage periods of abundant user traffic to offset periods of user traffic scarcity, ensuring consistent user service at every period while upholding long-term fairness. Specifically, BankFair consists of two modules: (1) employing the Talmud rule to determine the required fairness degree under varying periods of user traffic; and (2) conducting an online re-ranking algorithm based on the fairness degree determined by the Talmud rule. Experiments on two real-world recommendation datasets show that BankFair outperforms all baselines regarding accuracy and provider fairness.

cs.IR↗

arXiv2024

Neural Retrievers are Biased Towards LLM-Generated Content

Recently, the emergence of large language models (LLMs) has revolutionized the paradigm of information retrieval (IR) applications, especially in web search, by generating vast amounts of human-like texts on the Internet. As a result, IR systems in the LLM era are facing a new challenge: the indexed documents are now not only written by human beings but also automatically generated by the LLMs. How these LLM-generated documents influence the IR systems is a pressing and still unexplored question. In this work, we conduct a quantitative evaluation of IR models in scenarios where both human-written and LLM-generated texts are involved. Surprisingly, our findings indicate that neural retrieval models tend to rank LLM-generated documents higher. We refer to this category of biases in neural retrievers towards the LLM-generated content as the \textbf{source bias}. Moreover, we discover that this bias is not confined to the first-stage neural retrievers, but extends to the second-stage neural re-rankers. Then, in-depth analyses from the perspective of text compression indicate that LLM-generated texts exhibit more focused semantics with less noise, making it easier for neural retrieval models to semantic match. To mitigate the source bias, we also propose a plug-and-play debiased constraint for the optimization objective, and experimental results show its effectiveness. Finally, we discuss the potential severe concerns stemming from the observed source bias and hope our findings can serve as a critical wake-up call to the IR community and beyond. To facilitate future explorations of IR in the LLM era, the constructed two new benchmarks are available at https://github.com/KID-22/Source-Bias.

cs.IR↗

arXiv2024

Time-Sensitive Networking (TSN) for Industrial Automation: Current Advances and Future Directions

With the introduction of Cyber-Physical Systems (CPS) and Internet of Things (IoT) technologies, the automation industry is undergoing significant changes, particularly in improving production efficiency and reducing maintenance costs. Industrial automation applications often need to transmit time- and safety-critical data to closely monitor and control industrial processes. Several Ethernet-based fieldbus solutions, such as PROFINET IRT, EtherNet/IP, and EtherCAT, are widely used to ensure real-time communications in industrial automation systems. These solutions, however, commonly incorporate additional mechanisms to provide latency guarantees, making their interoperability a grand challenge. The IEEE 802.1 Time Sensitive Networking (TSN) task group was formed to enhance and optimize IEEE 802.1 network standards, particularly for Ethernet-based networks. These solutions can be evolved and adapted for cross-industry scenarios, such as large-scale distributed industrial plants requiring multiple industrial entities to work collaboratively. This paper provides a comprehensive review of current advances in TSN standards for industrial automation. It presents the state-of-the-art IEEE TSN standards and discusses the opportunities and challenges of integrating TSN into the automation industry. Some promising research directions are also highlighted for applying TSN technologies to industrial automation applications.

cs.NI↗

arXiv2024

Bulk high-temperature superconductivity in the high-pressure tetragonal phase of bilayer La2PrNi2O7

The Ruddlesden-Popper (R-P) bilayer nickelate, La3Ni2O7, was recently found to show signatures of high-temperature superconductivity (HTSC) at pressures above 14 GPa. Subsequent investigations achieved zero resistance in single- and poly-crystalline samples under hydrostatic pressure conditions. Yet, obvious diamagnetic signals, the other hallmark of superconductors, are still lacking owing to the filamentary nature with low superconducting volume fraction. The presence of a novel "1313" polymorph and competing R-P phases obscured proper identification of the phase for HTSC. Thus, achieving bulk HTSC and identifying the phase at play are the most prominent tasks at present. Here, we address these issues in the praseodymium (Pr)-doped La2PrNi2O7 polycrystalline samples. We find that the substitutions of Pr for La effectively inhibits the intergrowth of different R-P phases, resulting in nearly pure bilayer structure. For La2PrNi2O7, pressure-induced orthorhombic-to-tetragonal structural transition takes place at Pc ~ 11 GPa, above which HTSC emerges gradually upon further compression. The superconducting transition temperatures at 18-20 GPa reach Tconset = 82.5 K and Tczero = 60 K, which are the highest values among known nickelate superconductors. More importantly, bulk HTSC was testified by detecting clear diamagnetic signals below ~75 K corresponding to an estimated superconducting volume fraction ~ 57(5)% at 20 GPa. Our results not only resolve the existing controversies but also illuminate directions for exploring bulk HTSC in the bilayer nickelates.

cond-mat.supr-con↗

arXiv2024

Cocktail: A Comprehensive Information Retrieval Benchmark with LLM-Generated Documents Integration

The proliferation of Large Language Models (LLMs) has led to an influx of AI-generated content (AIGC) on the internet, transforming the corpus of Information Retrieval (IR) systems from solely human-written to a coexistence with LLM-generated content. The impact of this surge in AIGC on IR systems remains an open question, with the primary challenge being the lack of a dedicated benchmark for researchers. In this paper, we introduce Cocktail, a comprehensive benchmark tailored for evaluating IR models in this mixed-sourced data landscape of the LLM era. Cocktail consists of 16 diverse datasets with mixed human-written and LLM-generated corpora across various text retrieval tasks and domains. Additionally, to avoid the potential bias from previously included dataset information in LLMs, we also introduce an up-to-date dataset, named NQ-UTD, with queries derived from recent events. Through conducting over 1,000 experiments to assess state-of-the-art retrieval models against the benchmarked datasets in Cocktail, we uncover a clear trade-off between ranking performance and source bias in neural retrieval models, highlighting the necessity for a balanced approach in designing future IR systems. We hope Cocktail can serve as a foundational resource for IR research in the LLM era, with all data and code publicly available at \url{https://github.com/KID-22/Cocktail}.

cs.IR↗

arXiv2024

Time-optimal Flight in Cluttered Environments via Safe Reinforcement Learning

This paper addresses the problem of guiding a quadrotor through a predefined sequence of waypoints in cluttered environments, aiming to minimize the flight time while avoiding collisions. Previous approaches either suffer from prolonged computational time caused by solving complex non-convex optimization problems or are limited by the inherent smoothness of polynomial trajectory representations, thereby restricting the flexibility of movement. In this work, we present a safe reinforcement learning approach for autonomous drone racing with time-optimal flight in cluttered environments. The reinforcement learning policy, trained using safety and terminal rewards specifically designed to enforce near time-optimal and collision-free flight, outperforms current state-of-the-art algorithms. Additionally, experimental results demonstrate the efficacy of the proposed approach in achieving both minimum flight time and obstacle avoidance objectives in complex environments, with a commendable $66.7\%$ success rate in unseen, challenging settings.

cs.RO↗

arXiv2024

Time delay interferometry with minimal null frequencies

Time delay interferometry (TDI) is a key technique employed in gravitational wave (GW) space missions to mitigate laser frequency noise by combining multiple laser links and establishing an equivalent equal arm interferometry. The null frequencies will be introduced in noise spectra and GW response when the periodical signal/noise is canceled in synthesized laser links. These frequencies are characteristic frequencies (CFs) of a TDI which related to its geometry of combination. In this work, we implement a second-generation TDI configuration referred to as hybrid Relay to perform noise suppressions and data analysis, whose CFs are only one-quarter that of the fiducial second-generation Michelson observables. We examine the performance of TDI configuration in laser noise cancellation and clock noise suppression and justify its essential capabilities. To assess its robustness for signal extraction, we simulate data containing GW signals from massive black hole binaries and perform parameter inferences with comparisons against the fiducial Michelson TDI configuration. The results demonstrate that the alternative TDI solution could be more robust than Michelson in fulfilling data analysis.

gr-qc↗

arXiv2024

RoMe: Towards Large Scale Road Surface Reconstruction via Mesh Representation

In autonomous driving applications, accurate and efficient road surface reconstruction is paramount. This paper introduces RoMe, a novel framework designed for the robust reconstruction of large-scale road surfaces. Leveraging a unique mesh representation, RoMe ensures that the reconstructed road surfaces are accurate and seamlessly aligned with semantics. To address challenges in computational efficiency, we propose a waypoint sampling strategy, enabling RoMe to reconstruct vast environments by focusing on sub-areas and subsequently merging them. Furthermore, we incorporate an extrinsic optimization module to enhance the robustness against inaccuracies in extrinsic calibration. Our extensive evaluations of both public datasets and wild data underscore RoMe's superiority in terms of speed, accuracy, and robustness. For instance, it costs only 2 GPU hours to recover a road surface of 600*600 square meters from thousands of images. Notably, RoMe's capability extends beyond mere reconstruction, offering significant value for autolabeling tasks in autonomous driving applications. All related data and code are available at https://github.com/DRosemei/RoMe.

cs.CV↗

arXiv2024

Time-Delay Interferometry for ASTROD-GW

In the detection of gravitational waves in space, the arm lengths between spacecraft are not equal due to their orbital motion. Consequently, the equal arm length Michelson interferometer used in Earth laboratories is not suitable for space. To achieve the necessary sensitivity for space gravitational wave detectors, laser frequency noise must be suppressed below secondary noise sources such as optical path noise and acceleration noise. To suppress laser frequency noise, time-delay interferometry (TDI) is employed to match the two optical paths and retain gravitational wave signals. Since planets and other solar system bodies perturb the orbits of spacecraft and affect TDI performance, we simulate the time delay numerically using the CGC2.7 ephemeris framework. To examine the feasibility of TDI for the ASTROD-GW mission, we devised a set of 10-year and a set of 20-year optimized mission orbits for the three spacecraft starting on June 21, 2028, and calculated the path mismatches in the first- and second-generation TDI channels. The results demonstrate that all second-generation TDI channels meet the ASTROD-GW requirements. A geometric approach is used in the analysis and synthesis of both first-generation and second-generation TDI to clearly illustrate the construction process.

gr-qc↗

arXiv2024

RICE: Breaking Through the Training Bottlenecks of Reinforcement Learning with Explanation

Deep reinforcement learning (DRL) is playing an increasingly important role in real-world applications. However, obtaining an optimally performing DRL agent for complex tasks, especially with sparse rewards, remains a significant challenge. The training of a DRL agent can be often trapped in a bottleneck without further progress. In this paper, we propose RICE, an innovative refining scheme for reinforcement learning that incorporates explanation methods to break through the training bottlenecks. The high-level idea of RICE is to construct a new initial state distribution that combines both the default initial states and critical states identified through explanation methods, thereby encouraging the agent to explore from the mixed initial states. Through careful design, we can theoretically guarantee that our refining scheme has a tighter sub-optimality bound. We evaluate RICE in various popular RL environments and real-world applications. The results demonstrate that RICE significantly outperforms existing refining schemes in enhancing agent performance.

cs.LG↗

arXiv2024

Data-driven Control Against False Data Injection Attacks

The rise of cyber-security concerns has brought significant attention to the analysis and design of cyber-physical systems (CPSs). Among the various types of cyberattacks, denial-of-service (DoS) attacks and false data injection (FDI) attacks can be easily launched and have become prominent threats. While resilient control against DoS attacks has received substantial research efforts, countermeasures developed against FDI attacks have been relatively limited, particularly when explicit system models are not available. To address this gap, the present paper focuses on the design of data-driven controllers for unknown linear systems subject to FDI attacks on the actuators, utilizing input-state data. To this end, a general FDI attack model is presented, which imposes minimally constraints on the switching frequency of attack channels and the magnitude of attack matrices. A dynamic state feedback control law is designed based on offline and online input-state data, which adapts to the channel switching of FDI attacks. This is achieved by solving two data-based semi-definite programs (SDPs) on-the-fly to yield a tight approximation of the set of subsystems consistent with both offline clean data and online attack-corrupted data. It is shown that under mild conditions on the attack, the proposed SDPs are recursively feasible and controller achieves exponential stability. Numerical examples showcase its effectiveness in mitigating the impact of FDI attacks.

eess.SY↗

arXiv2024

Federated Model Heterogeneous Matryoshka Representation Learning

Model heterogeneous federated learning (MHeteroFL) enables FL clients to collaboratively train models with heterogeneous structures in a distributed fashion. However, existing MHeteroFL methods rely on training loss to transfer knowledge between the client model and the server model, resulting in limited knowledge exchange. To address this limitation, we propose the Federated model heterogeneous Matryoshka Representation Learning (FedMRL) approach for supervised learning tasks. It adds an auxiliary small homogeneous model shared by clients with heterogeneous local models. (1) The generalized and personalized representations extracted by the two models' feature extractors are fused by a personalized lightweight representation projector. This step enables representation fusion to adapt to local data distribution. (2) The fused representation is then used to construct Matryoshka representations with multi-dimensional and multi-granular embedded representations learned by the global homogeneous model header and the local heterogeneous model header. This step facilitates multi-perspective representation learning and improves model learning capability. Theoretical analysis shows that FedMRL achieves a $O(1/T)$ non-convex convergence rate. Extensive experiments on benchmark datasets demonstrate its superior model accuracy with low communication and computational costs compared to seven state-of-the-art baselines. It achieves up to 8.48% and 24.94% accuracy improvement compared with the state-of-the-art and the best same-category baseline, respectively.

cs.LG↗

arXiv2024

Methodology for Analyzing Proton Multiplicity Fluctuations with Azimuthal Partitions in Heavy-Ion Collisions

A primary objective in high-energy heavy-ion collisions is to investigate the phase transition between confined and deconfined color matter. Complementary to the cumulants of conserved charges integrated over the full azimuth, we introduce a novel experimental approach to explore particle fluctuations in azimuthal partitions, which are potentially sensitive to the first-order phase transition in heavy-ion collisions. We evaluate proton multiplicity ($N_w$) fluctuations in azimuthal partitions of width $w$ to quantitatively estimate the clustering tendency among these protons. The $Δσ^2$ observable is defined as the normalized difference between the variance of the $N_w$ distribution and the binomial baseline. We demonstrate the feasibility and characteristics of this observable through simulations using the AMPT and MUSIC+FIST models. We also use a Gaussian correlation model to illustrate that the dependence of $Δσ^2$ on $w$ can be parameterized to accurately extract the strength and the range of the input interaction among protons.

nucl-th↗

arXiv2024

CCTNet: A Circular Convolutional Transformer Network for LiDAR-based Place Recognition Handling Movable Objects Occlusion

Place recognition is a fundamental task for robotic application, allowing robots to perform loop closure detection within simultaneous localization and mapping (SLAM), and achieve relocalization on prior maps. Current range image-based networks use single-column convolution to maintain feature invariance to shifts in image columns caused by LiDAR viewpoint change.However, this raises the issues such as "restricted receptive fields" and "excessive focus on local regions", degrading the performance of networks. To address the aforementioned issues, we propose a lightweight circular convolutional Transformer network denoted as CCTNet, which boosts performance by capturing structural information in point clouds and facilitating crossdimensional interaction of spatial and channel information. Initially, a Circular Convolution Module (CCM) is introduced, expanding the network's perceptual field while maintaining feature consistency across varying LiDAR perspectives. Then, a Range Transformer Module (RTM) is proposed, which enhances place recognition accuracy in scenarios with movable objects by employing a combination of channel and spatial attention mechanisms. Furthermore, we propose an Overlap-based loss function, transforming the place recognition task from a binary loop closure classification into a regression problem linked to the overlap between LiDAR frames. Through extensive experiments on the KITTI and Ford Campus datasets, CCTNet surpasses comparable methods, achieving Recall@1 of 0.924 and 0.965, and Recall@1% of 0.990 and 0.993 on the test set, showcasing a superior performance. Results on the selfcollected dataset further demonstrate the proposed method's potential for practical implementation in complex scenarios to handle movable objects, showing improved generalization in various datasets.

cs.RO↗

arXiv2024

Unsteady aerodynamic prediction using limited samples based on transfer learning

In this study, a method for predicting unsteady aerodynamic forces under different initial conditions using a limited number of samples based on transfer learning is proposed, aiming to avoid the need for large-scale high-fidelity aerodynamic simulations. First, a large number of training samples are acquired through high-fidelity simulation under the initial condition for the baseline, followed by the establishment of a pre-trained network as the source model using a long short-term memory (LSTM) network. When unsteady aerodynamic forces are predicted under the new initial conditions, a limited number of training samples are collected by high-fidelity simulations. Then, the parameters of the source model are transferred to the new prediction model, which is further fine-tuned and trained with limited samples. The new prediction model can be used to predict the unsteady aerodynamic forces of the entire process under the new initial conditions. The proposed method is validated by predicting the aerodynamic forces of free flight of a high-spinning projectile with a large extension of initial angular velocity and pitch angle. The results indicatethat the proposed method can predict unsteady aerodynamic forces under different initial conditions using 1/3 of the sample size of the source model. Compared with direct modeling using the LSTM networks, the proposed method shows improved accuracy and efficiency.

physics.flu-dyn↗