Search

DEtection TRansformer (DETR) becomes a dominant paradigm, mainly due to its common architecture with high accuracy and no post-processing. However, DETR suffers from unstable training dynamics. It consumes more data and epochs to converge compared with CNN-based detectors. This paper aims to stabilize DETR training through the online distillation. It utilizes a teacher model, accumulated by Exponential Moving Average (EMA), and distills its knowledge into the online model in following three aspects. First, the matching relation between object queries and ground truth (GT) boxes in the teacher is employed to guide the student, so queries within the student are not only assigned labels based on their own predictions, but also refer to the matching results from the teacher. Second, the teacher's initial query is given to the online student, and its prediction is directly constrained by the corresponding output from the teacher. Finally, the object queries from teacher's different decoding stages are used to build the auxiliary groups to accelerate the convergence. For each GT, two queries with the least matching costs are selected into this extra group, and they predict the GT box and participate the optimization. Extensive experiments show that the proposed OD-DETR successfully stabilizes the training, and significantly increases the performance without bringing in more parameters., Comment: IJCAI24

Information diffusion prediction is fundamental to understand the structure and organization of the online social networks, and plays a crucial role to blocking rumor spread, influence maximization, political propaganda, etc. So far, most existing solutions primarily predict the next user who will be informed with historical cascades, but ignore an important factor in the diffusion process - the time. Such limitation motivates us to pose the problem of the time-aware personalized information diffusion prediction for the first time, telling the time when the target user will be informed. In this paper, we address this problem from a fresh geometric perspective of Ricci curvature, and propose a novel Ricci-curvature regulated Ordinary Differential Equation (R-ODE). In the diffusion process, R-ODE considers that the inter-correlated users are organized in a dynamic system in the representation space, and the cascades give the observations sampled from the continuous realm. At each infection time, the message diffuses along the largest Ricci curvature, signifying less transportation effort. In the continuous realm, the message triggers users' movement, whose trajectory in the space is parameterized by an ODE with graph neural network. Consequently, R-ODE predicts the infection time of a target user by the movement trajectory learnt from the observations. Extensive experiments evaluate the personalized time prediction ability of R-ODE, and show R-ODE outperforms the state-of-the-art baselines., Comment: Accepted by SIGIR 2024

Graph clustering is a fundamental problem in machine learning. Deep learning methods achieve the state-of-the-art results in recent years, but they still cannot work without predefined cluster numbers. Such limitation motivates us to pose a more challenging problem of graph clustering with unknown cluster number. We propose to address this problem from a fresh perspective of graph information theory (i.e., structural information). In the literature, structural information has not yet been introduced to deep clustering, and its classic definition falls short of discrete formulation and modeling node features. In this work, we first formulate a differentiable structural information (DSI) in the continuous realm, accompanied by several theoretical results. By minimizing DSI, we construct the optimal partitioning tree where densely connected nodes in the graph tend to have the same assignment, revealing the cluster structure. DSI is also theoretically presented as a new graph clustering objective, not requiring the predefined cluster number. Furthermore, we design a neural LSEnet in the Lorentz model of hyperbolic space, where we integrate node features to structural information via manifold-valued graph convolution. Extensive empirical results on real graphs show the superiority of our approach., Comment: Accepted by ICML24, 26 pages

Connectionist temporal classification (CTC) models are known to have peaky output distributions. Such behavior is not a problem for automatic speech recognition (ASR), but it can cause inaccurate forced alignments (FA), especially at finer granularity, e.g., phoneme level. This paper aims at alleviating the peaky behavior for CTC and improve its suitability for forced alignment generation, by leveraging label priors, so that the scores of alignment paths containing fewer blanks are boosted and maximized during training. As a result, our CTC model produces less peaky posteriors and is able to more accurately predict the offset of the tokens besides their onset. It outperforms the standard CTC model and a heuristics-based approach for obtaining CTC's token offset timestamps by 12-40% in phoneme and word boundary errors (PBE and WBE) measured on the Buckeye and TIMIT data. Compared with the most widely used FA toolkit Montreal Forced Aligner (MFA), our method performs similarly on PBE/WBE on Buckeye, yet falls behind MFA on TIMIT. Nevertheless, our method has a much simpler training pipeline and better runtime efficiency. Our training recipe and pretrained model are released in TorchAudio., Comment: Accepted by ICASSP 2024. Github repo: https://github.com/huangruizhe/audio/tree/aligner_label_priors

Social Event Detection (SED) aims to identify significant events from social streams, and has a wide application ranging from public opinion analysis to risk management. In recent years, Graph Neural Network (GNN) based solutions have achieved state-of-the-art performance. However, GNN-based methods often struggle with noisy and missing edges between messages, affecting the quality of learned message embedding. Moreover, these methods statically initialize node embedding before training, which, in turn, limits the ability to learn from message texts and relations simultaneously. In this paper, we approach social event detection from a new perspective based on Pre-trained Language Models (PLMs), and present RPLM_SED (Relational prompt-based Pre-trained Language Models for Social Event Detection). We first propose a new pairwise message modeling strategy to construct social messages into message pairs with multi-relational sequences. Secondly, a new multi-relational prompt-based pairwise message learning mechanism is proposed to learn more comprehensive message representation from message pairs with multi-relational prompts using PLMs. Thirdly, we design a new clustering constraint to optimize the encoding process by enhancing intra-cluster compactness and inter-cluster dispersion, making the message representation more distinguishable. We evaluate the RPLM_SED on three real-world datasets, demonstrating that the RPLM_SED model achieves state-of-the-art performance in offline, online, low-resource, and long-tail distribution scenarios for social event detection tasks., Comment: ACM TOIS Under Review

Aims. We aim to investigate the molecular environment of the supernova remnant (SNR) G150.3+4.5, and explore its association with ambient molecular clouds (MCs). Methods. We present large-field CO (J=1-0) molecular line observations toward SNR G150.3+4.5, using the 13.7 m millimeter telescope of the Purple Mountain Observatory. The observations have an angular resolution of $\sim 55 ''$. We analyzed the spatial distribution of MCs in relation to the SNR shell detected in previous Urumqi $\lambda$ 6 cm radio observations and examined the CO spectra for kinematics information. Results. We find that MCs at the velocity range of [-14, -2] km s$^{-1}$ are spatially distributed along the radio shell of the SNR. Line broadening and asymmetries are observed in the CO spectra of the clouds. Moreover, we find that the molecular clouds around the shell have systematic velocity gradients in the position-velocity (PV) diagrams. Both morphology alignment and gas kinematics suggest that the SNR is associated with the ambient MCs at $\sim$ 740 pc. Based on the CO gas distance, the dimension and the age of the SNR is estimated to be 40 pc $\times$ 33 pc and 3.8 $ \times 10^4$ years, respectively. The very high energy emission of 1LHAASO J0428+5531 toward the SNR may originate from the interaction between the SNR and the surrounding MCs., Comment: 17 pages, 13 figures. Accepted by A&A 2024 March 28

We perform a comprehensive CO study toward the Monoceros OB1 (Mon OB1) region based on the MWISP survey at an angular resolution of about $50''$. The high-sensitivity data, together with the high dynamic range, shows that molecular gas in the $\rm 8^{\circ}\times4^{\circ}$ region displays complicated hierarchical structures and various morphology (e.g., filamentary, cavity-like, shell-like, and other irregular structures). Based on Gaussian decomposition and clustering for $\mathrm{^{13}CO}$ data, a total of 263 $\mathrm{^{13}CO}$ structures are identified in the whole region, and 88% of raw data flux is recovered. The dense gas with relatively high column density from the integrated CO emission is mainly concentrated in the region where multiple $\rm ^{13}CO$ structures are overlapped. Combining the results of 32 large $\mathrm{^{13}CO}$ structures with distances from Gaia DR3, we estimate an average distance of $\rm 729^{+45}_{-45}~pc$ for the GMC complex. The total mass of the GMC Complex traced by $\mathrm{^{12}CO}$, $\mathrm{^{13}CO}$, and $\mathrm{C^{18}O}$ are $1.1\times10^5~M_\odot$, $4.3\times10^4~M_\odot$, and $8.4\times10^3~M_\odot$, respectively. The dense gas fraction shows a clear difference between Mon OB1 GMC East (12.4%) and Mon OB1 GMC West (3.3%). Our results show that the dense gas environment is closely linked to the nearby star-forming regions. On the other hand, star-forming activities have a great influence on the physical properties of the surrounding molecular gas (e.g., greater velocity dispersion, higher temperatures, and more complex velocity structures, etc.). We also discuss the distribution/kinematics of molecular gas associated with nearby star-forming activities., Comment: 28 pages, 17 figures, match to the version of APJ, 966, 202. The dataset has been released on https://doi.org/10.57760/sciencedb.17451

We present CO ($J = 1-0$) multi-line observations toward the L914 dark cloud in the vicinity of the Cygnus X region, using the 13.7 m millimeter telescope of the Purple Mountain Observatory (PMO). The CO observations reveal in the L914 cloud a long filament with an angular length of $\sim 3.\!\!^\circ 6$, corresponding to approximately $\rm 50~pc$ at the measured distance of $\sim\rm 760~pc$. Furthermore, a group of hair-like striations are discovered in the two subregions of the L914 cloud, which are connected with the dense ridge of the filament. These striations display quasi-periodic characteristics in both the CO intensity images and position-velocity diagrams. Two of the striations also show increasing velocity gradients and dispersions toward the dense ridge, which could be fitted by accretion flows under gravity. Based on the $Planck$ 353 GHz dust polarization data, we find that the striations are well aligned with the magnetic fields. Moreover, both the striations and magnetic fields are perpendicular to the dense ridge, which constructs a bimodal configuration. Using the classic method, we estimate the strength of magnetic field, and further evaluate the relative importance of gravity, turbulence and magnetic field, and find that the L914 cloud is strongly magnetized. Our results suggest that magnetic fields play an important role in the formation of filamentary structures by channelling the material along the striations toward the dense ridge. The comparison between the observations and simulations suggests that striations could be a product of the magnetohydrodynamic (MHD) process., Comment: 25 pages, 17 figures, 2 tables. Accepted for publication in AJ

Link prediction typically studies the probability of future interconnection among nodes with the observation in a single social network. More often than not, real scenario is presented as a multiplex network with common (anchor) users active in multiple social networks. In the literature, most existing works study either the intra-link prediction in a single network or inter-link prediction among networks (a.k.a. network alignment), and consider two learning tasks are independent from each other, which is still away from the fact. On the representation space, the vast majority of existing methods are built upon the traditional Euclidean space, unaware of the inherent geometry of social networks. The third issue is on the scarce anchor users. Annotating anchor users is laborious and expensive, and thus it is impractical to work with quantities of anchor users. Herein, in light of the issues above, we propose to study a challenging yet practical problem of Geometry-aware Collective Link Prediction across Multiplex Network. To address this problem, we present a novel contrastive model, RCoCo, which collaborates intra- and inter-network behaviors in Riemannian spaces. In RCoCo, we design a curvature-aware graph attention network ($\kappa-$GAT), conducting attention mechanism in Riemannian manifold whose curvature is estimated by the Ricci curvatures over the network. Thereafter, we formulate intra- and inter-contrastive loss in the manifolds, in which we augment graphs by exploring the high-order structure of community and information transfer on anchor users. Finally, we conduct extensive experiments with 14 strong baselines on 8 real-world datasets, and show the effectiveness of RCoCo., Comment: Accepted by Springer International Journal of Machine Learning and Cybernetics (JMLC), 2024

Due to the inability to receive signals from the Global Navigation Satellite System (GNSS) in extreme conditions, achieving accurate and robust navigation for Unmanned Aerial Vehicles (UAVs) is a challenging task. Recently emerged, vision-based navigation has been a promising and feasible alternative to GNSS-based navigation. However, existing vision-based techniques are inadequate in addressing flight deviation caused by environmental disturbances and inaccurate position predictions in practical settings. In this paper, we present a novel angle robustness navigation paradigm to deal with flight deviation in point-to-point navigation tasks. Additionally, we propose a model that includes the Adaptive Feature Enhance Module, Cross-knowledge Attention-guided Module and Robust Task-oriented Head Module to accurately predict direction angles for high-precision navigation. To evaluate the vision-based navigation methods, we collect a new dataset termed as UAV_AR368. Furthermore, we design the Simulation Flight Testing Instrument (SFTI) using Google Earth to simulate different flight environments, thereby reducing the expenses associated with real flight testing. Experiment results demonstrate that the proposed model outperforms the state-of-the-art by achieving improvements of 26.0% and 45.6% in the success rate of arrival under ideal and disturbed circumstances, respectively., Comment: 9 pages, 4 figures

Graph Neural Networks (GNNs) have shown great power for learning and mining on graphs, and Graph Structure Learning (GSL) plays an important role in boosting GNNs with a refined graph. In the literature, most GSL solutions either primarily focus on structure refinement with task-specific supervision (i.e., node classification), or overlook the inherent weakness of GNNs themselves (e.g., over-squashing), resulting in suboptimal performance despite sophisticated designs. In light of these limitations, we propose to study self-supervised graph structure-feature co-refinement for effectively alleviating the issue of over-squashing in typical GNNs. In this paper, we take a fundamentally different perspective of the Ricci curvature in Riemannian geometry, in which we encounter the challenges of modeling, utilizing and computing Ricci curvature. To tackle these challenges, we present a self-supervised Riemannian model, DeepRicci. Specifically, we introduce a latent Riemannian space of heterogeneous curvatures to model various Ricci curvatures, and propose a gyrovector feature mapping to utilize Ricci curvature for typical GNNs. Thereafter, we refine node features by geometric contrastive learning among different geometric views, and simultaneously refine graph structure by backward Ricci flow based on a novel formulation of differentiable Ricci curvature. Finally, extensive experiments on public datasets show the superiority of DeepRicci, and the connection between backward Ricci flow and over-squashing. Codes of our work are given in https://github.com/RiemanGraph/., Comment: Accepted by IEEE ICDM 2023, Full paper, 10 pages

Due to its significant application in reducing algorithm depth, fSim gates have attracted a lot of attention. However, during the implementation of quantum gates, fluctuations in control parameters and decoherence caused by the environment may lead to a decrease in the fidelity of the gate. Implementing the fSim gate that is robust to these factors in one step remains an unresolved issue. In this manuscript, we propose a one-step implementation of the nonadiabatic geometric fSim gate composed of a nonadiabatic holonomic controlled phase (CP) gate and a nonadiabatic noncyclic geometric iSWAP gate with parallel paths in a tunable superconducting circuit. Compared to the composite nonadiabatic geometric fSim gate composed of a nonadiabatic holonomic CP gate and a nonadiabatic geometric iSWAP gate, our scheme only takes half the time and demonstrates robustness to parameter fluctuations, as well as to environmental impacts. Moreover, the scheme does not require complex controls, making it very easy to implement in experiments, and can be achieved in various circuit structures. Our scheme may provide a promising path toward quantum computation and simulation.

The sequential interaction network usually find itself in a variety of applications, e.g., recommender system. Herein, inferring future interaction is of fundamental importance, and previous efforts are mainly focused on the dynamics in the classic zero-curvature Euclidean space. Despite the promising results achieved by previous methods, a range of significant issues still largely remains open: On the bipartite nature, is it appropriate to place user and item nodes in one identical space regardless of their inherent difference? On the network dynamics, instead of a fixed curvature space, will the representation spaces evolve when new interactions arrive continuously? On the learning paradigm, can we get rid of the label information costly to acquire? To address the aforementioned issues, we propose a novel Contrastive model for Sequential Interaction Network learning on Co-Evolving RiEmannian spaces, CSINCERE. To the best of our knowledge, we are the first to introduce a couple of co-evolving representation spaces, rather than a single or static space, and propose a co-contrastive learning for the sequential interaction network. In CSINCERE, we formulate a Cross-Space Aggregation for message-passing across representation spaces of different Riemannian geometries, and design a Neural Curvature Estimator based on Ricci curvatures for modeling the space evolvement over time. Thereafter, we present a Reweighed Co-Contrast between the temporal views of the sequential network, so that the couple of Riemannian spaces interact with each other for the interaction prediction without labels. Empirical results on 5 public datasets show the superiority of CSINCERE over the state-of-the-art methods., Comment: The extension of ACM WebConf23 (WWW)

Graphs are typical non-Euclidean data of complex structures. In recent years, Riemannian graph representation learning has emerged as an exciting alternative to Euclidean ones. However, Riemannian methods are still in an early stage: most of them present a single curvature (radius) regardless of structural complexity, suffer from numerical instability due to the exponential/logarithmic map, and lack the ability to capture motif regularity. In light of the issues above, we propose the problem of \emph{Motif-aware Riemannian Graph Representation Learning}, seeking a numerically stable encoder to capture motif regularity in a diverse-curvature manifold without labels. To this end, we present a novel Motif-aware Riemannian model with Generative-Contrastive learning (MotifRGC), which conducts a minmax game in Riemannian manifold in a self-supervised manner. First, we propose a new type of Riemannian GCN (D-GCN), in which we construct a diverse-curvature manifold by a product layer with the diversified factor, and replace the exponential/logarithmic map by a stable kernel layer. Second, we introduce a motif-aware Riemannian generative-contrastive learning to capture motif regularity in the constructed manifold and learn motif-aware node representation without external labels. Empirical results show the superiority of MofitRGC., Comment: Accepted by AAAI24