Searcharxiv⌕ Search

arXiv subjects

Ming Zhang

Publications and source records attributed to Ming Zhang.

At least 235 records · Page 13Linked to original sources
arXiv2023

TRIGO: Benchmarking Formal Mathematical Proof Reduction for Generative Language Models

Automated theorem proving (ATP) has become an appealing domain for exploring the reasoning ability of the recent successful generative language models. However, current ATP benchmarks mainly focus on symbolic inference, but rarely involve the understanding of complex number combination reasoning. In this work, we propose TRIGO, an ATP benchmark that not only requires a model to reduce a trigonometric expression with step-by-step proofs but also evaluates a generative LM's reasoning ability on formulas and its capability to manipulate, group, and factor number terms. We gather trigonometric expressions and their reduced forms from the web, annotate the simplification process manually, and translate it into the Lean formal language system. We then automatically generate additional examples from the annotated samples to expand the dataset. Furthermore, we develop an automatic generator based on Lean-Gym to create dataset splits of varying difficulties and distributions in order to thoroughly analyze the model's generalization ability. Our extensive experiments show our proposed TRIGO poses a new challenge for advanced generative LM's including GPT-4 which is pre-trained on a considerable amount of open-source formal theorem-proving language data, and provide a new tool to study the generative LM's ability on both formal and mathematical reasoning.

cs.CL↗
arXiv2023

Higher-dimensional symmetric informationally complete measurement via programmable photonic integrated optics

Symmetric informationally complete measurements are both important building blocks in many quantum information protocols and the seminal example of a generalised, non-orthogonal, quantum measurement. In higher-dimensional systems, these measurements become both increasingly interesting and increasingly complex to implement. Here, we demonstrate an integrated quantum photonic platform to realize such a measurement on three-level quantum systems. The device operates at the high fidelities necessary for verifying a genuine many-outcome quantum measurement, performing near-optimal quantum state discrimination, and beating the projective limit in quantum random number generation. Moreover, it is programmable and can readily implement other quantum measurements at similarly high quality. Our work paves the way for the implementation of sophisticated higher-dimensional quantum measurements that go beyond the traditional orthogonal projections.

quant-ph↗
arXiv2023

The Qitai Radio Telescope

This study presents a general outline of the Qitai radio telescope (QTT) project. Qitai, the site of the telescope, is a county of Xinjiang Uygur Autonomous Region of China, located in the east Tianshan Mountains at an elevation of about 1800 m. The QTT is a fully steerable, Gregorian type telescope with a standard parabolic main reflector of 110 m diameter. The QTT has adopted an um-brella support, homology-symmetric lightweight design. The main reflector is active so that the deformation caused by gravity can be corrected. The structural design aims to ultimately allow high-sensitivity observations from 150 MHz up to 115 GHz. To satisfy the requirements for early scientific goals, the QTT will be equipped with ultra-wideband receivers and large field-of-view mul-ti-beam receivers. A multi-function signal-processing system based on RFSoC and GPU processor chips will be developed. These will enable the QTT to operate in pulsar, spectral line, continuum and Very Long Baseline Interferometer (VLBI) observing modes. Electromagnetic compatibility (EMC) and radio frequency interference (RFI) control techniques are adopted throughout the system design. The QTT will form a world-class observational platform for the detection of low-frequency (nanoHertz) gravitational waves through pulsar timing array (PTA) techniques, pulsar surveys, the discovery of binary black-hole systems, and exploring dark matter and the origin of life in the universe.

astro-ph.IM↗
arXiv2023

Surface superconductor-insulator transition: Reduction of the critical electric field by Hartree-Fock potential

Recently, a surface superconductor-insulator transition has been predicted for a bulk superconductor in an electric field applied perpendicular to its surface. The related calculations were performed within a one-dimensional Hubbard model by numerically solving the Bogoliubov-de Gennes (BdG) equations without the Hartree-Fock (HF) interaction potential. The phase diagram of the surface superconducting, metallic, and insulating states was obtained as dependent on the electric field and temperature. This diagram was found to be in agreement with experimental results reported previously for (Li,Fe)OHFeSe thin flakes. In the present work, by taking into account the HF potential, we find that the latter acts as a kind of an extra electrostatic potential that enhances the electric-field effects on the surface states. The qualitative features of the phase diagram remain the same but the surface superconductor-insulator transition occurs at significantly lower electric fields, which supports prospects of its experimental observation in bulk samples.

cond-mat.supr-con↗
arXiv2023

ALEX: Towards Effective Graph Transfer Learning with Noisy Labels

Graph Neural Networks (GNNs) have garnered considerable interest due to their exceptional performance in a wide range of graph machine learning tasks. Nevertheless, the majority of GNN-based approaches have been examined using well-annotated benchmark datasets, leading to suboptimal performance in real-world graph learning scenarios. To bridge this gap, the present paper investigates the problem of graph transfer learning in the presence of label noise, which transfers knowledge from a noisy source graph to an unlabeled target graph. We introduce a novel technique termed Balance Alignment and Information-aware Examination (ALEX) to address this challenge. ALEX first employs singular value decomposition to generate different views with crucial structural semantics, which help provide robust node representations using graph contrastive learning. To mitigate both label shift and domain shift, we estimate a prior distribution to build subgraphs with balanced label distributions. Building on this foundation, an adversarial domain discriminator is incorporated for the implicit domain alignment of complex multi-modal distributions. Furthermore, we project node representations into a different space, optimizing the mutual information between the projected features and labels. Subsequently, the inconsistency of similarity structures is evaluated to identify noisy samples with potential overfitting. Comprehensive experiments on various benchmark datasets substantiate the outstanding superiority of the proposed ALEX in different settings.

cs.LG↗
arXiv2023

Dynamic Hypergraph Structure Learning for Traffic Flow Forecasting

This paper studies the problem of traffic flow forecasting, which aims to predict future traffic conditions on the basis of road networks and traffic conditions in the past. The problem is typically solved by modeling complex spatio-temporal correlations in traffic data using spatio-temporal graph neural networks (GNNs). However, the performance of these methods is still far from satisfactory since GNNs usually have limited representation capacity when it comes to complex traffic networks. Graphs, by nature, fall short in capturing non-pairwise relations. Even worse, existing methods follow the paradigm of message passing that aggregates neighborhood information linearly, which fails to capture complicated spatio-temporal high-order interactions. To tackle these issues, in this paper, we propose a novel model named Dynamic Hypergraph Structure Learning (DyHSL) for traffic flow prediction. To learn non-pairwise relationships, our DyHSL extracts hypergraph structural information to model dynamics in the traffic networks, and updates each node representation by aggregating messages from its associated hyperedges. Additionally, to capture high-order spatio-temporal relations in the road network, we introduce an interactive graph convolution block, which further models the neighborhood interaction for each node. Finally, we integrate these two views into a holistic multi-scale correlation extraction module, which conducts temporal pooling with different scales to model different temporal patterns. Extensive experiments on four popular traffic benchmark datasets demonstrate the effectiveness of our proposed DyHSL compared with a broad range of competing baselines.

cs.LG↗
arXiv2023

The Rise and Potential of Large Language Model Based Agents: A Survey

For a long time, humanity has pursued artificial intelligence (AI) equivalent to or surpassing the human level, with AI agents considered a promising vehicle for this pursuit. AI agents are artificial entities that sense their environment, make decisions, and take actions. Many efforts have been made to develop intelligent agents, but they mainly focus on advancement in algorithms or training strategies to enhance specific capabilities or performance on particular tasks. Actually, what the community lacks is a general and powerful model to serve as a starting point for designing AI agents that can adapt to diverse scenarios. Due to the versatile capabilities they demonstrate, large language models (LLMs) are regarded as potential sparks for Artificial General Intelligence (AGI), offering hope for building general AI agents. Many researchers have leveraged LLMs as the foundation to build AI agents and have achieved significant progress. In this paper, we perform a comprehensive survey on LLM-based agents. We start by tracing the concept of agents from its philosophical origins to its development in AI, and explain why LLMs are suitable foundations for agents. Building upon this, we present a general framework for LLM-based agents, comprising three main components: brain, perception, and action, and the framework can be tailored for different applications. Subsequently, we explore the extensive applications of LLM-based agents in three aspects: single-agent scenarios, multi-agent scenarios, and human-agent cooperation. Following this, we delve into agent societies, exploring the behavior and personality of LLM-based agents, the social phenomena that emerge from an agent society, and the insights they offer for human society. Finally, we discuss several key topics and open problems within the field. A repository for the related papers at https://github.com/WooooDyy/LLM-Agent-Paper-List.

cs.AI↗
arXiv2023

DisenPOI: Disentangling Sequential and Geographical Influence for Point-of-Interest Recommendation

Point-of-Interest (POI) recommendation plays a vital role in various location-aware services. It has been observed that POI recommendation is driven by both sequential and geographical influences. However, since there is no annotated label of the dominant influence during recommendation, existing methods tend to entangle these two influences, which may lead to sub-optimal recommendation performance and poor interpretability. In this paper, we address the above challenge by proposing DisenPOI, a novel Disentangled dual-graph framework for POI recommendation, which jointly utilizes sequential and geographical relationships on two separate graphs and disentangles the two influences with self-supervision. The key novelty of our model compared with existing approaches is to extract disentangled representations of both sequential and geographical influences with contrastive learning. To be specific, we construct a geographical graph and a sequential graph based on the check-in sequence of a user. We tailor their propagation schemes to become sequence-/geo-aware to better capture the corresponding influences. Preference proxies are extracted from check-in sequence as pseudo labels for the two influences, which supervise the disentanglement via a contrastive loss. Extensive experiments on three datasets demonstrate the superiority of the proposed model.

cs.IR↗
arXiv2023

Redundancy-Free Self-Supervised Relational Learning for Graph Clustering

Graph clustering, which learns the node representations for effective cluster assignments, is a fundamental yet challenging task in data analysis and has received considerable attention accompanied by graph neural networks in recent years. However, most existing methods overlook the inherent relational information among the non-independent and non-identically distributed nodes in a graph. Due to the lack of exploration of relational attributes, the semantic information of the graph-structured data fails to be fully exploited which leads to poor clustering performance. In this paper, we propose a novel self-supervised deep graph clustering method named Relational Redundancy-Free Graph Clustering (R$^2$FGC) to tackle the problem. It extracts the attribute- and structure-level relational information from both global and local views based on an autoencoder and a graph autoencoder. To obtain effective representations of the semantic information, we preserve the consistent relation among augmented nodes, whereas the redundant relation is further reduced for learning discriminative embeddings. In addition, a simple yet valid strategy is utilized to alleviate the over-smoothing issue. Extensive experiments are performed on widely used benchmark datasets to validate the superiority of our R$^2$FGC over state-of-the-art baselines. Our codes are available at https://github.com/yisiyu95/R2FGC.

cs.LG↗
arXiv2023

RAHNet: Retrieval Augmented Hybrid Network for Long-tailed Graph Classification

Graph classification is a crucial task in many real-world multimedia applications, where graphs can represent various multimedia data types such as images, videos, and social networks. Previous efforts have applied graph neural networks (GNNs) in balanced situations where the class distribution is balanced. However, real-world data typically exhibit long-tailed class distributions, resulting in a bias towards the head classes when using GNNs and limited generalization ability over the tail classes. Recent approaches mainly focus on re-balancing different classes during model training, which fails to explicitly introduce new knowledge and sacrifices the performance of the head classes. To address these drawbacks, we propose a novel framework called Retrieval Augmented Hybrid Network (RAHNet) to jointly learn a robust feature extractor and an unbiased classifier in a decoupled manner. In the feature extractor training stage, we develop a graph retrieval module to search for relevant graphs that directly enrich the intra-class diversity for the tail classes. Moreover, we innovatively optimize a category-centered supervised contrastive loss to obtain discriminative representations, which is more suitable for long-tailed scenarios. In the classifier fine-tuning stage, we balance the classifier weights with two weight regularization techniques, i.e., Max-norm and weight decay. Experiments on various popular benchmarks verify the superiority of the proposed method against state-of-the-art approaches.

cs.LG↗
arXiv2023

Towards Long-Tailed Recognition for Graph Classification via Collaborative Experts

Graph classification, aiming at learning the graph-level representations for effective class assignments, has received outstanding achievements, which heavily relies on high-quality datasets that have balanced class distribution. In fact, most real-world graph data naturally presents a long-tailed form, where the head classes occupy much more samples than the tail classes, it thus is essential to study the graph-level classification over long-tailed data while still remaining largely unexplored. However, most existing long-tailed learning methods in visions fail to jointly optimize the representation learning and classifier training, as well as neglect the mining of the hard-to-classify classes. Directly applying existing methods to graphs may lead to sub-optimal performance, since the model trained on graphs would be more sensitive to the long-tailed distribution due to the complex topological characteristics. Hence, in this paper, we propose a novel long-tailed graph-level classification framework via Collaborative Multi-expert Learning (CoMe) to tackle the problem. To equilibrate the contributions of head and tail classes, we first develop balanced contrastive learning from the view of representation learning, and then design an individual-expert classifier training based on hard class mining. In addition, we execute gated fusion and disentangled knowledge distillation among the multiple experts to promote the collaboration in a multi-expert framework. Comprehensive experiments are performed on seven widely-used benchmark datasets to demonstrate the superiority of our method CoMe over state-of-the-art baselines.

cs.LG↗
arXiv2023

Kinematic topologies of black holes

We investigate the kinematic topologies of light rings (LRs) and massive particle rings (PRs) encircling spherical and axisymmetric black holes. Our results demonstrate that the global topology number of LRs is consistently -1 for asymptotically flat and (Anti-)de Sitter spacetime. Additionally, we show that the global topology of PRs varies, with a value of 0 in asymptotically flat and Anti-de Sitter spacetime but -1 in asymptotic de Sitter spacetime.

gr-qc↗
arXiv2023

Analytical approximations to charged black hole solutions in Einstein-Maxwell-Weyl gravity

The Homotopy Analysis Method (HAM) is a useful method to derive analytical approximate solutions of black holes in modified gravity theories. In this paper, we study the Einstein-Weyl gravity coupled with Maxwell field, and obtain analytical approximation solutions for charged black holes by using the HAM. It is found that the analytical approximate solutions are sufficiently accurate in the entire spacetime outside the black hole's event horizon, and also consistent with numerical ones for charged black holes in the Einstein-Maxwell-Weyl gravity.

gr-qc↗
arXiv2023

Criterion-based Heterogeneous Collaborative Filtering for Multi-behavior Implicit Recommendation

Recent years have witnessed the explosive growth of interaction behaviors in multimedia information systems, where multi-behavior recommender systems have received increasing attention by leveraging data from various auxiliary behaviors such as tip and collect. Among various multi-behavior recommendation methods, non-sampling methods have shown superiority over negative sampling methods. However, two observations are usually ignored in existing state-of-the-art non-sampling methods based on binary regression: (1) users have different preference strengths for different items, so they cannot be measured simply by binary implicit data; (2) the dependency across multiple behaviors varies for different users and items. To tackle the above issue, we propose a novel non-sampling learning framework named Criterion-guided Heterogeneous Collaborative Filtering (CHCF). CHCF introduces both upper and lower thresholds to indicate selection criteria, which will guide user preference learning. Besides, CHCF integrates criterion learning and user preference learning into a unified framework, which can be trained jointly for the interaction prediction of the target behavior. We further theoretically demonstrate that the optimization of Collaborative Metric Learning can be approximately achieved by the CHCF learning framework in a non-sampling form effectively. Extensive experiments on three real-world datasets show the effectiveness of CHCF in heterogeneous scenarios.

cs.IR↗
arXiv2023

Collisional Penrose process of extended test particles near an extremal Kerr black hole

We investigate the collisional Penrose process of extended test particles near extremal Kerr black holes using the pole-dipole-quadrupole approximation. We analyze the motion of the test particles and examine the dynamics and maximum efficiency of energy extraction in this process. Our results demonstrate that the maximum extracted energy in the collisional Penrose process is influenced by the spin s and quadrupolar parameter CES2 of the test particles. Specifically, we observe that, at a fixed collisional position, the energy extraction efficiency decreases as the spin increases for either the pole-dipole or the pole-dipole-quadrupole approximation case. Furthermore, for a fixed spin, the energy extraction efficiency is higher in the pole-dipole-quadrupole approximation compared to the pole-dipole approximation. These findings provide insight into the role of the internal structures of the test particles in the collisional Penrose process.

gr-qc↗
arXiv2023

Tracking Berry curvature effect in molecular dynamics by ultrafast magnetic x-ray scattering

The spin-dependent Berry force is a genuine effect of Berry curvature in molecular dynamics, which can dramatically result in spatial spin separation and change of reaction pathways. However, the way to probe the effect of Berry force remains challenging, because the time-reversal (TR) symmetry required for opposite Berry forces conflicts with TR symmetry breaking spin alignment needed to observe the effect, and the net effect could be transient for a molecular wave packet. We demonstrate that in molecular photodissociation, the dissociation rates can be different for molecules with opposite initial spin directions due to Berry force. We showcase that the spatially separated spin density, which is transiently induced by Berry force as the molecular wave packet passes through conical intersection, can be reconstructed from the circular dichroism (CD) of ultrafast non-resonant magnetic x-ray scattering using free electron lasers.

physics.atom-ph↗
arXiv2023

Strong Cosmic Censorship in accelerating spacetime

It has been established that Strong Cosmic Censorship Conjecture (SCCC) is respected by an asymptotically flat black hole with charge, but violated by a charged asymptotically de Sitter black hole. We studied the instability of the Cauchy horizon for an accelerating black hole in Einstein theory conformally coupled with a scalar field. The black hole is uncharged while having inner, outer, and acceleration horizons. In the limit of vanishing acceleration, denoted by $A \to 0$, it becomes asymptotically flat and extremal, with its acceleration horizon vanishing as well. By exploring the perturbation of the massless scalar field upon the accelerating black hole, whose decay rate is governed by the quasinormal mode spectra, we show that the SCCC is violated in the near-extremal regime and also in the $A\to 0^+$ limit. Our result is the first observation of a black hole violating the SCCC in an almost asymptotically Minkowskian flat regime, as well as the first example of a black hole violating the SCCC with neither charge nor rotation.

gr-qc↗
arXiv2023

HI intensity mapping with MeerKAT: forecast for delay power spectrum measurement using interferometer mode

Neutral hydrogen (HI) intensity mapping (IM) surveys are considered a promising tool for investigating the expansion history of the Universe. In this work, we explore the potential of MeerKAT HI IM observations in interferometer mode to estimate the power spectrum and constrain cosmological parameters within typical dark energy models. We employ an approach called the "delay spectrum," which allows us to separate the weak HI signal from foreground contamination in the frequency domain. Our findings indicate that the choice of survey fields significantly impacts the fractional errors on the power spectrum ($ΔP/P$) within a limited observational time of 10 hours. As the integration time increases from 10 hours to 10,000 hours, $ΔP/P$ progressively decreases until cosmic variance begins to dominate. For a total observation time of 10,000 hours, the lowest $ΔP/P$ at low $k$ can be achieved by tracking 100 points for MeerKAT L-band (900-1200 MHz) and 10 points for MeerKAT UHF-band (580-1000 MHz). Next, we assess the performance of HI IM in constraining typical dark energy models. We find that MeerKAT HI IM survey in interferometer mode demonstrates limited capability in constraining the dark-energy equation of state, even when combined with Planck data.

astro-ph.CO↗