arXiv subjects

Gang Chen

Publications and source records attributed to Gang Chen.

At least 217 records · Page 12Linked to original sources

arXiv2024

Thermal Hall effects in quantum magnets

In the recent years, the thermal Hall transport has risen as an important diagnosis of the physical properties of the elementary excitations in various quantum materials, especially among the Mott insulating systems where the electronic transports are often featureless. Here we review the recent development of thermal Hall effects in quantum magnets where all the relevant excitations are charge-neutral. In addition to summarizing the existing experiments, we pay a special attention to the underlying mechanisms of the thermal Hall effects in various magnetic systems, and clarify the connection between the microscopic physical variables and the emergent degrees of freedom in different quantum phases. The external magnetic field is shown to modify the intrinsic Berry curvature properties of various emergent and/or exotic quasiparticle excitations in distinct fashions for different quantum systems and quantum phases, contributing to the thermal Hall transports. These include, for example, the conventional ones like the magnons in ordered magnets, the triplons in dimerized magnets, the exotic and fractionalized quasiparticles such as the spinons and the magnetic monopoles in quantum spin liquids. We review their contribution and discuss their presence in the thermal Hall conductivity in different physical contexts. We expect this review to provide a useful guidance for the physical mechanism of the thermal Hall transports in quantum magnets.

cond-mat.str-el↗

arXiv2024

On LLMs-Driven Synthetic Data Generation, Curation, and Evaluation: A Survey

Within the evolving landscape of deep learning, the dilemma of data quantity and quality has been a long-standing problem. The recent advent of Large Language Models (LLMs) offers a data-centric solution to alleviate the limitations of real-world data with synthetic data generation. However, current investigations into this field lack a unified framework and mostly stay on the surface. Therefore, this paper provides an organization of relevant studies based on a generic workflow of synthetic data generation. By doing so, we highlight the gaps within existing research and outline prospective avenues for future study. This work aims to shepherd the academic and industrial communities towards deeper, more methodical inquiries into the capabilities and applications of LLMs-driven synthetic data generation.

cs.CL↗

arXiv2024

ADBA:Approximation Decision Boundary Approach for Black-Box Adversarial Attacks

Many machine learning models are susceptible to adversarial attacks, with decision-based black-box attacks representing the most critical threat in real-world applications. These attacks are extremely stealthy, generating adversarial examples using hard labels obtained from the target machine learning model. This is typically realized by optimizing perturbation directions, guided by decision boundaries identified through query-intensive exact search, significantly limiting the attack success rate. This paper introduces a novel approach using the Approximation Decision Boundary (ADB) to efficiently and accurately compare perturbation directions without precisely determining decision boundaries. The effectiveness of our ADB approach (ADBA) hinges on promptly identifying suitable ADB, ensuring reliable differentiation of all perturbation directions. For this purpose, we analyze the probability distribution of decision boundaries, confirming that using the distribution's median value as ADB can effectively distinguish different perturbation directions, giving rise to the development of the ADBA-md algorithm. ADBA-md only requires four queries on average to differentiate any pair of perturbation directions, which is highly query-efficient. Extensive experiments on six well-known image classifiers clearly demonstrate the superiority of ADBA and ADBA-md over multiple state-of-the-art black-box attacks. The source code is available at https://github.com/BUPTAIOC/ADBA.

cs.LG↗

arXiv2024

Data Contamination Calibration for Black-box LLMs

The rapid advancements of Large Language Models (LLMs) tightly associate with the expansion of the training data size. However, the unchecked ultra-large-scale training sets introduce a series of potential risks like data contamination, i.e. the benchmark data is used for training. In this work, we propose a holistic method named Polarized Augment Calibration (PAC) along with a new to-be-released dataset to detect the contaminated data and diminish the contamination effect. PAC extends the popular MIA (Membership Inference Attack) -- from machine learning community -- by forming a more global target at detecting training data to Clarify invisible training data. As a pioneering work, PAC is very much plug-and-play that can be integrated with most (if not all) current white- and black-box LLMs. By extensive experiments, PAC outperforms existing methods by at least 4.5%, towards data contamination detection on more 4 dataset formats, with more than 10 base LLMs. Besides, our application in real-world scenarios highlights the prominent presence of contamination and related issues.

cs.LG↗

arXiv2024

Cognitive Manipulation: Semi-supervised Visual Representation and Classroom-to-real Reinforcement Learning for Assembly in Semi-structured Environments

Assembling a slave object into a fixture-free master object represents a critical challenge in flexible manufacturing. Existing deep reinforcement learning-based methods, while benefiting from visual or operational priors, often struggle with small-batch precise assembly tasks due to their reliance on insufficient priors and high-costed model development. To address these limitations, this paper introduces a cognitive manipulation and learning approach that utilizes skill graphs to integrate learning-based object detection with fine manipulation models into a cohesive modular policy. This approach enables the detection of the master object from both global and local perspectives to accommodate positional uncertainties and variable backgrounds, and parametric residual policy to handle pose error and intricate contact dynamics effectively. Leveraging the skill graph, our method supports knowledge-informed learning of semi-supervised learning for object detection and classroom-to-real reinforcement learning for fine manipulation. Simulation experiments on a gear-assembly task have demonstrated that the skill-graph-enabled coarse-operation planning and visual attention are essential for efficient learning and robust manipulation, showing substantial improvements of 13$\%$ in success rate and 15.4$\%$ in number of completion steps over competing methods. Real-world experiments further validate that our system is highly effective for robotic assembly in semi-structured environments.

cs.RO↗

arXiv2024

Cycle-YOLO: A Efficient and Robust Framework for Pavement Damage Detection

With the development of modern society, traffic volume continues to increase in most countries worldwide, leading to an increase in the rate of pavement damage Therefore, the real-time and highly accurate pavement damage detection and maintenance have become the current need. In this paper, an enhanced pavement damage detection method with CycleGAN and improved YOLOv5 algorithm is presented. We selected 7644 self-collected images of pavement damage samples as the initial dataset and augmented it by CycleGAN. Due to a substantial difference between the images generated by CycleGAN and real road images, we proposed a data enhancement method based on an improved Scharr filter, CycleGAN, and Laplacian pyramid. To improve the target recognition effect on a complex background and solve the problem that the spatial pyramid pooling-fast module in the YOLOv5 network cannot handle multiscale targets, we introduced the convolutional block attention module attention mechanism and proposed the atrous spatial pyramid pooling with squeeze-and-excitation structure. In addition, we optimized the loss function of YOLOv5 by replacing the CIoU with EIoU. The experimental results showed that our algorithm achieved a precision of 0.872, recall of 0.854, and mean average precision@0.5 of 0.882 in detecting three main types of pavement damage: cracks, potholes, and patching. On the GPU, its frames per second reached 68, meeting the requirements for real-time detection. Its overall performance even exceeded the current more advanced YOLOv7 and achieved good results in practical applications, providing a basis for decision-making in pavement damage detection and prevention.

cs.CV↗

arXiv2024

Quantum Computing for Databases: Overview and Challenges

In the decades, the general field of quantum computing has experienced remarkable progress since its inception. A plethora of researchers not only proposed quantum algorithms showing the power of quantum computing but also constructed the prototype of quantum computers, making it walk into our tangible reality. Those remarkable advancements in quantum computing have opened doors for novel applications, one of which is quantum databases. Researchers are trying to use a paradigm brought by quantum computing to revolutionize various aspects of database management systems. In this paper, we envision the synergy between quantum computing and databases with two perspectives: Quantum computing-enabled technology, and quantum computing-inspired technology. Based on this classification, we present a detailed overview of the research attained in this area, aiming to show the landscape of the field and draw a road map of future directions.

cs.DB↗

arXiv2024

Draft & Verify: Lossless Large Language Model Acceleration via Self-Speculative Decoding

We present a novel inference scheme, self-speculative decoding, for accelerating Large Language Models (LLMs) without the need for an auxiliary model. This approach is characterized by a two-stage process: drafting and verification. The drafting stage generates draft tokens at a slightly lower quality but more quickly, which is achieved by selectively skipping certain intermediate layers during drafting. Subsequently, the verification stage employs the original LLM to validate those draft output tokens in one forward pass. This process ensures the final output remains identical to that produced by the unaltered LLM. Moreover, the proposed method requires no additional neural network training and no extra memory footprint, making it a plug-and-play and cost-effective solution for inference acceleration. Benchmarks with LLaMA-2 and its variants demonstrated a speedup up to 1.99$\times$.

cs.CL↗

arXiv2024

Hydrologic Cycle Weakening in Hothouse Climates

The hydrologic cycle has wide impacts on the ocean salinity and circulation, carbon and nitrogen cycles, and the ecosystem. Under anthropogenic global warming, previous studies showed that the intensification of the hydrologic cycle is a robust feature. Whether this trend persists in hothouse climates, however, is unknown. Here we show in climate models that mean precipitation first increases with rising surface temperature, but the precipitation trend reverses when the surface is hotter than ~320-330 K. This non-monotonic phenomenon is robust to the cause of warming, convection scheme, ocean dynamics, atmospheric mass, planetary rotation, gravity, and stellar spectrum. The weakening occurs because of the existence of an upper limitation of outgoing longwave emission and the continuously increasing shortwave absorption by H2O, and is consistent with atmospheric dynamics featuring the strong increase of atmospheric stratification and dramatic reduction of convective mass flux. These results have wide implications for the climate evolutions of Earth, Venus, and potentially habitable exoplanets.

physics.ao-ph↗

arXiv2024

Comparison of the high-order Runge-Kutta discontinuous Galerkin method and gas-kinetic scheme for inviscid compressible flow simulations

The Runge--Kutta discontinuous Galerkin (RKDG) method is a high-order technique for addressing hyperbolic conservation laws, which has been refined over recent decades and is effective in handling shock discontinuities. Despite its advancements, the RKDG method faces challenges, such as stringent constraints on the explicit time-step size and reduced robustness when dealing with strong discontinuities. On the other hand, the Gas-Kinetic Scheme (GKS) based on a high-order gas evolution model also delivers significant accuracy and stability in solving hyperbolic conservation laws through refined spatial and temporal discretizations. Unlike RKDG, GKS allows for more flexible CFL number constraints and features an advanced flow evolution mechanism at cell interfaces. Additionally, GKS' compact spatial reconstruction enhances the accuracy of the method and its ability to capture stable strong discontinuities effectively. In this study, we conduct a thorough examination of the RKDG method using various numerical fluxes and the GKS method employing both compact and non-compact spatial reconstructions. Both methods are applied under the framework of explicit time discretization and are tested solely in inviscid scenarios. We will present numerous numerical tests and provide a comparative analysis of the outcomes derived from these two computational approaches.

math.NA↗

arXiv2024

Covariant Compton Amplitudes in Gravity with Classical Spin

We develop a novel amplitude bootstrap technique manifestly free of unphysical poles for classically spinning particles interacting with gravitons utilizing only the double-copy and physical factorization limits. Combined with non-factorization polynomial contact contributions from physical data for Kerr black holes, we can address high-spin-order covariant gravitational Compton amplitudes, identifying a pattern for the amplitude that we believe could extend to all orders in spin. Finally, we outline applications and outstanding questions.

hep-th↗

arXiv2024

Decentralized Multi-Agent Trajectory Planning in Dynamic Environments with Spatiotemporal Occupancy Grid Maps

This paper proposes a decentralized trajectory planning framework for the collision avoidance problem of multiple micro aerial vehicles (MAVs) in environments with static and dynamic obstacles. The framework utilizes spatiotemporal occupancy grid maps (SOGM), which forecast the occupancy status of neighboring space in the near future, as the environment representation. Based on this representation, we extend the kinodynamic A* and the corridor-constrained trajectory optimization algorithms to efficiently tackle static and dynamic obstacles with arbitrary shapes. Collision avoidance between communicating robots is integrated by sharing planned trajectories and projecting them onto the SOGM. The simulation results show that our method achieves competitive performance against state-of-the-art methods in dynamic environments with different numbers and shapes of obstacles. Finally, the proposed method is validated in real experiments.

cs.RO↗

arXiv2024

Photomolecular Effect: Visible Light Absorption at Water-Vapor Interface

The evaporation of water is ubiquitous in nature and industrial technologies. The known mechanism for evaporation is "thermal evaporation" which highlights the energy input for evaporation is via heat. Due to the weak absorption of water to visible light, the first step to using solar energy to evaporate water is usually by converting it into thermal energy through photothermal processes via additional absorbing materials. Contrary to this conventional wisdom, we report here strong absorption of photons in the visible spectrum at the water-vapor interface by direct cleavage of water clusters via a process we call photomolecular effect. We show that this process happens at the water-vapor interface by measuring the dependence of the photomolecular evaporation rate on the wavelength, the angle of incidence, and the polarization of the incident light. The spectra signatures in the vapor phase further support the photomolecular effect. Despite the long propagation lengths of visible light in bulk water, we demonstrate that they can heat a thin layer of fog easily, suggesting that this process is ubiquitous. The photomolecular effect will have significant implications for the earth's water cycle, global warming, plant transpiration, as well as different technologies involving the evaporation of liquids from drying to power generation

physics.atm-clus↗

arXiv2024

Evaluating Dynamic Environment Difficulty for Obstacle Avoidance Benchmarking

Dynamic obstacle avoidance is a popular research topic for autonomous systems, such as micro aerial vehicles and service robots. Accurately evaluating the performance of dynamic obstacle avoidance methods necessitates the establishment of a metric to quantify the environment's difficulty, a crucial aspect that remains unexplored. In this paper, we propose four metrics to measure the difficulty of dynamic environments. These metrics aim to comprehensively capture the influence of obstacles' number, size, velocity, and other factors on the difficulty. We compare the proposed metrics with existing static environment difficulty metrics and validate them through over 1.5 million trials in a customized simulator. This simulator excludes the effects of perception and control errors and supports different motion and gaze planners for obstacle avoidance. The results indicate that the survivability metric outperforms and establishes a monotonic relationship between the success rate, with a Spearman's Rank Correlation Coefficient (SRCC) of over 0.9. Specifically, for every planner, lower survivability leads to a higher success rate. This metric not only facilitates fair and comprehensive benchmarking but also provides insights for refining collision avoidance methods, thereby furthering the evolution of autonomous systems in dynamic environments.

cs.RO↗

arXiv2024

Physical formula enhanced multi-task learning for pharmacokinetics prediction

Artificial intelligence (AI) technology has demonstrated remarkable potential in drug dis-covery, where pharmacokinetics plays a crucial role in determining the dosage, safety, and efficacy of new drugs. A major challenge for AI-driven drug discovery (AIDD) is the scarcity of high-quality data, which often requires extensive wet-lab work. A typical example of this is pharmacokinetic experiments. In this work, we develop a physical formula enhanced mul-ti-task learning (PEMAL) method that predicts four key parameters of pharmacokinetics simultaneously. By incorporating physical formulas into the multi-task framework, PEMAL facilitates effective knowledge sharing and target alignment among the pharmacokinetic parameters, thereby enhancing the accuracy of prediction. Our experiments reveal that PEMAL significantly lowers the data demand, compared to typical Graph Neural Networks. Moreover, we demonstrate that PEMAL enhances the robustness to noise, an advantage that conventional Neural Networks do not possess. Another advantage of PEMAL is its high flexibility, which can be potentially applied to other multi-task machine learning scenarios. Overall, our work illustrates the benefits and potential of using PEMAL in AIDD and other scenarios with data scarcity and noise.

q-bio.QM↗

arXiv2024

An Incremental SVD Method for Non-Fickian Flows in Porous Media: Addressing Storage and Computational Challenges

It is well known that the numerical solution of the Non-Fickian flows at the current stage depends on all previous time instances. Consequently, the storage requirement increases linearly, while the computational complexity grows quadratically with the number of time steps. This presents a significant challenge for numerical simulations. While numerous existing methods address this issue, our proposed approach stems from a data science perspective and maintains uniformity. Our method relies solely on the rank of the solution data, dissociating itself from dependency on any specific partial differential equation (PDE). In this paper, we make the assumption that the solution data exhibits approximate low rank. Here, we present a memory-free algorithm, based on the incremental SVD technique, that exhibits only linear growth in computational complexity as the number of time steps increases. We prove that the error between the solutions generated by the conventional algorithm and our innovative approach lies within the scope of machine error. Numerical experiments are showcased to affirm the accuracy and efficiency gains in terms of both memory usage and computational expenses.

math.NA↗

arXiv2024

Learning to Optimise Climate Sensor Placement using a Transformer

The optimal placement of sensors for environmental monitoring and disaster management is a challenging problem due to its NP-hard nature. Traditional methods for sensor placement involve exact, approximation, or heuristic approaches, with the latter being the most widely used. However, heuristic methods are limited by expert intuition and experience. Deep learning (DL) has emerged as a promising approach for generating heuristic algorithms automatically. In this paper, we introduce a novel sensor placement approach focused on learning improvement heuristics using deep reinforcement learning (RL) methods. Our approach leverages an RL formulation for learning improvement heuristics, driven by an actor-critic algorithm for training the policy network. We compare our method with several state-of-the-art approaches by conducting comprehensive experiments, demonstrating the effectiveness and superiority of our proposed approach in producing high-quality solutions. Our work presents a promising direction for applying advanced DL and RL techniques to challenging climate sensor placement problems.

cs.LG↗

arXiv2024

Kinematic Hopf algebra for amplitudes from higher-derivative operators

Recently it has been shown that Bern-Carrasco-Johansson (BCJ) numerators of colour-kinematic duality for tree-level scattering amplitudes in Yang-Mills theory (coupled with scalars) can be determined using a quasi-shuffle Hopf algebra. In this paper we consider the same theory, but with higher-derivative corrections of the forms $α' F^3$ and $α'^2 F^4$, where $F$ is the field strength. In the heavy mass limit of the scalars, we show that the BCJ numerators of these higher-derivative theories are governed by the same Hopf algebra. In particular, the kinematic algebraic structure is unaltered and the derivative corrections only arise when mapping the abstract algebraic generators to physical BCJ numerators. The underlying kinematic Hopf algebra enables us to obtain a compact expression for the BCJ numerators of any number of gluons and two heavy scalars for amplitudes with higher-derivative operators. The pure gluon BCJ numerators can also be obtained from our results by a simple factorisation limit where the massive particles decouple.

hep-th↗