Researcher profile

Xinyi Li

Xinyi Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
15works
0followers
14topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

15 published item(s)

preprint2026arXiv

CogRail: Benchmarking VLMs in Cognitive Intrusion Perception for Intelligent Railway Transportation Systems

Accurate and early perception of potential intrusion targets is essential for ensuring the safety of railway transportation systems. However, most existing systems focus narrowly on object classification within fixed visual scopes and apply rule-based heuristics to determine intrusion status, often overlooking targets that pose latent intrusion risks. Anticipating such risks requires the cognition of spatial context and temporal dynamics for the object of interest (OOI), which presents challenges for conventional visual models. To facilitate deep intrusion perception, we introduce a novel benchmark, CogRail, which integrates curated open-source datasets with cognitively driven question-answer annotations to support spatio-temporal reasoning and prediction. Building upon this benchmark, we conduct a systematic evaluation of state-of-the-art visual-language models (VLMs) using multimodal prompts to identify their strengths and limitations in this domain. Furthermore, we fine-tune VLMs for better performance and propose a joint fine-tuning framework that integrates three core tasks, position perception, movement prediction, and threat analysis, facilitating effective adaptation of general-purpose foundation models into specialized models tailored for cognitive intrusion perception. Extensive experiments reveal that current large-scale multimodal models struggle with the complex spatial-temporal reasoning required by the cognitive intrusion perception task, underscoring the limitations of existing foundation models in this safety-critical domain. In contrast, our proposed joint fine-tuning framework significantly enhances model performance by enabling targeted adaptation to domain-specific reasoning demands, highlighting the advantages of structured multi-task learning in improving both accuracy and interpretability. Code will be available at https://github.com/Hub-Tian/CogRail.

preprint2026arXiv

HeterSEED: Semantics-Structure Decoupling for Heterogeneous Graph Learning under Heterophily

Many real-world heterogeneous graphs exhibit pronounced heterophily, where connected nodes often have dissimilar labels or play different semantic roles. In such settings, standard heterogeneous graph neural networks that aggregate messages along metapaths or meta-relations primarily based on feature similarity can propagate misleading information, since feature similarity may be misaligned with underlying relational semantics. In this paper, we propose HeterSEED, a semantics-structure decoupling framework for heterogeneous graph learning under heterophily. HeterSEED decouples representation learning into a heterogeneous semantic channel that captures type- and relation-aware local semantics and a structure-aware heterophily channel that separates homophilic and heterophilic neighborhoods via pseudo-label-guided partitioning and aggregates them using metapath-based structural weights. A node-level adaptive fusion mechanism then combines the two channels to produce context-dependent node representations. Theoretically, we establish that, on heterogeneous graphs under heterophily, HeterSEED is strictly more expressive than standard heterogeneous graph neural networks that rely primarily on feature similarity and provably reduces the prediction bias introduced by heterophilic neighbors. Experiments on five real-world heterogeneous graphs, including two large-scale networks at the million-node and hundred-million-edge scale, demonstrate that HeterSEED consistently outperforms representative heterogeneous graph neural networks and recent heterophily-aware baselines, especially in strongly heterophilic regimes.

preprint2022arXiv

Discussion of Multiscale Fisher's Independence Test for Multivariate Dependence

The multiscale Fisher's independence test (MULTIFIT hereafter) proposed by Gorsky & Ma (2022) is a novel method to test independence between two random vectors. By its design, this test is particularly useful in detecting local dependence. Moreover, by adopting a resampling-free approach, it can easily accommodate massive sample sizes. Another benefit of the proposed method is its ability to interpret the nature of dependency. We congratulate the authors, Shai Gorksy and Li Ma, for their very interesting and elegant work. In this comment, we would like to discuss a general framework unifying the MULTIFIT and other tests and compare it with the binary expansion randomized ensemble test (BERET hereafter) proposed by Lee et al. (In press). We also would like to contribute our thoughts on potential extensions of the method.

preprint2022arXiv

On large deviations and intersection of random interlacements

We investigate random interlacements on $\mathbb{Z}^d$ with $d \geq 3$, and derive the large deviation rate for the probability that the capacity of the interlacement set in a macroscopic box is much smaller than that of the box. As an application, we obtain the large deviation rate for the probability that two independent interlacements have empty intersections in a macroscopic box. We also prove that conditioning on this event, one of them will be sparse in the box in terms of capacity. This result is an example of the entropic repulsion phenomenon for random interlacements.

preprint2022arXiv

On Natural Measures of SLE- and CLE-Related Random Fractals

In this paper, we construct and then prove the up-to constants uniqueness of the natural measure on several random fractals, namely the SLE cut points, SLE boundary touching points, CLE pivotal points and the CLE carpet/gasket. As an application, we also show the equivalence between our natural measures defined in this paper (i.e. CLE pivotal and gasket measures) and their discrete analogs of counting measures in critical continuum planar Bernoulli percolation in [Garban-Pete-Schramm, J. Amer. Math. Soc.,2013]. Although the existence and uniqueness for the natural measure for CLE carpet/gasket have already been proved in [Miller-Schoug, arXiv:2201.01748], in this paper we provide with a different argument via the coupling of CLE and LQG.

preprint2022arXiv

Sharp asymptotics for arm probabilities in critical planar percolation

In this work, we consider critical planar site percolation on the triangular lattice and derive sharp estimates on the asymptotics of the probability of half-plane $j$-arm events for $j \geq 1$ and planar (polychromatic) $j$-arm events for $j>1$. These estimates greatly improve previous results and in particular answer (a large part of) a question of Schramm (ICM Proc., 2006).

preprint2021arXiv

Abstractive Opinion Tagging

In e-commerce, opinion tags refer to a ranked list of tags provided by the e-commerce platform that reflect characteristics of reviews of an item. To assist consumers to quickly grasp a large number of reviews about an item, opinion tags are increasingly being applied by e-commerce platforms. Current mechanisms for generating opinion tags rely on either manual labelling or heuristic methods, which is time-consuming and ineffective. In this paper, we propose the abstractive opinion tagging task, where systems have to automatically generate a ranked list of opinion tags that are based on, but need not occur in, a given set of user-generated reviews. The abstractive opinion tagging task comes with three main challenges: (1) the noisy nature of reviews; (2) the formal nature of opinion tags vs. the colloquial language usage in reviews; and (3) the need to distinguish between different items with very similar aspects. To address these challenges, we propose an abstractive opinion tagging framework, named AOT-Net, to generate a ranked list of opinion tags given a large number of reviews. First, a sentence-level salience estimation component estimates each review's salience score. Next, a review clustering and ranking component ranks reviews in two steps: first, reviews are grouped into clusters and ranked by cluster size; then, reviews within each cluster are ranked by their distance to the cluster center. Finally, given the ranked reviews, a rank-aware opinion tagging component incorporates an alignment feature and alignment loss to generate a ranked list of opinion tags. To facilitate the study of this task, we create and release a large-scale dataset, called eComTag, crawled from real-world e-commerce websites. Extensive experiments conducted on the eComTag dataset verify the effectiveness of the proposed AOT-Net in terms of various evaluation metrics.

preprint2021arXiv

Controlling Entity Integrity with Key Sets

Codd's rule of entity integrity stipulates that every table has a primary key. Hence, the attributes of the primary key carry unique and complete value combinations. In practice, data cannot always meet such requirements. Previous work proposed the superior notion of key sets for controlling entity integrity. We establish a linear-time algorithm for validating whether a given key set holds on a given data set, and demonstrate its efficiency on real-world data. We establish a binary axiomatization for the associated implication problem, and prove its coNP-completeness. However, the implication of unary by arbitrary key sets has better properties. The fragment enjoys a unary axiomatization and is decidable in quadratic time. Hence, we can minimize overheads before validating key sets. While perfect models do not always exist in general, we show how to compute them for any instance of our fragment. This provides computational support towards the acquisition of key sets.

preprint2021arXiv

On the Robustness of Multi-View Rotation Averaging

Rotation averaging is a synchronization process on single or multiple rotation groups, and is a fundamental problem in many computer vision tasks such as multi-view structure from motion (SfM). Specifically, rotation averaging involves the recovery of an underlying pose-graph consistency from pairwise relative camera poses. Specifically, given pairwise motion in rotation groups, especially 3-dimensional rotation groups (\eg, $\mathbb{SO}(3)$), one is interested in recovering the original signal of multiple rotations with respect to a fixed frame. In this paper, we propose a robust framework to solve multiple rotation averaging problem, especially in the cases that a significant amount of noisy measurements are present. By introducing the $ε$-cycle consistency term into the solver, we enable the robust initialization scheme to be implemented into the IRLS solver. Instead of conducting the costly edge removal, we implicitly constrain the negative effect of erroneous measurements by weight reducing, such that IRLS failures caused by poor initialization can be effectively avoided. Experiment results demonstrate that our proposed approach outperforms state of the arts on various benchmarks.

preprint2021arXiv

Towards Entity Alignment in the Open World: An Unsupervised Approach

Entity alignment (EA) aims to discover the equivalent entities in different knowledge graphs (KGs). It is a pivotal step for integrating KGs to increase knowledge coverage and quality. Recent years have witnessed a rapid increase of EA frameworks. However, state-of-the-art solutions tend to rely on labeled data for model training. Additionally, they work under the closed-domain setting and cannot deal with entities that are unmatchable. To address these deficiencies, we offer an unsupervised framework that performs entity alignment in the open world. Specifically, we first mine useful features from the side information of KGs. Then, we devise an unmatchable entity prediction module to filter out unmatchable entities and produce preliminary alignment results. These preliminary results are regarded as the pseudo-labeled data and forwarded to the progressive learning framework to generate structural representations, which are integrated with the side information to provide a more comprehensive view for alignment. Finally, the progressive learning framework gradually improves the quality of structural embeddings and enhances the alignment performance by enriching the pseudo-labeled data with alignment results from the previous round. Our solution does not require labeled data and can effectively filter out unmatchable entities. Comprehensive experimental evaluations validate its superiority.

preprint2020arXiv

Approximating the Geometric Edit Distance

Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as signal analysis, bioinformatics, etc., need to be solved in a geometric space. Therefore, the geometric edit distance (GED) has been studied. In this paper, we describe the first strictly sublinear approximate near-linear time algorithm for computing the GED of two point sequences in constant dimensional Euclidean space. Specifically, we present a randomized (O(n\log^2n)) time (O(\sqrt n))-approximation algorithm. Then, we generalize our result to give a randomized $α$-approximation algorithm for any $α\in [\sqrt{\log n}, \sqrt{n / \log n}]$, running in time $O(n^2/α^2 \log n)$. Both algorithms are Monte Carlo and return approximately optimal solutions with high probability.

preprint2020arXiv

Characterizing Reading Time on Enterprise Emails

Email is an integral part of people's work and life, enabling them to perform activities such as communicating, searching, managing tasks and storing information. Modern email clients take a step forward and help improve users' productivity by automatically creating reminders, tasks or responses. The act of reading is arguably the only activity that is in common in most -- if not all -- of the interactions that users have with their emails. In this paper, we characterize how users read their enterprise emails, and reveal the various contextual factors that impact reading time. Our approach starts with a reading time analysis based on the reading events from a major email platform, followed by a user study to provide explanations for some discoveries. We identify multiple temporal and user contextual factors that are correlated with reading time. For instance, email reading time is correlated with user devices: on desktop reading time increases through the morning and peaks at noon but on mobile it increases through the evening till midnight. The reading time is also negatively correlated with the screen size. We have established the connection between user status and reading time: users spend more time reading emails when they have fewer meetings and busy hours during the day. In addition, we find that users also reread emails across devices. Among the cross-device reading events, 76% of reread emails are first visited on mobile and then on desktop. Overall, our study is the first to characterize enterprise email reading time on a very large scale. The findings provide insights to develop better metrics and user models for understanding and improving email interactions.

preprint2020arXiv

Discovery of A candidate Hypervelocity star originated from the Sagittarius Dwarf Spheroidal galaxy

In this letter, we report the discovery of an intriguing HVS (J1443+1453) candidate that is probably from the Sagittarius Dwarf Spheroidal galaxy (Sgr dSph). The star is an old and very metal-poor low-mass main-sequence turn-off star (age $\sim14.0$ Gyr and [Fe/H] $= -2.23$ dex) and has a total velocity of $559.01^{+135.07}_{-87.40}$ km s$^{-1}$ in the Galactic rest-frame and a heliocentric distance of $2.90^{+0.72}_{-0.48}$ kpc. The velocity of J1443+1453 is larger than the escape speed at its position, suggesting it a promising HVS candidate. By reconstructing its trajectory in the Galactic potential, we find that the orbit of J1443+1453 intersects closely with that of the Sgr dSph $37.8^{+4.6}_{-6.0}$ Myr ago, when the latter has its latest pericentric passage through the Milky Way. The encounter occurs at a distance $2.42^{+1.80}_{-0.77}$ kpc from the centre of Sgr dSph, smaller than the size of the Sgr dSph. Chemical properties of this star are also consistent with those of one Sgr dSph associated globular cluster or of the Sgr stream member stars. Our finding suggests that J1443+1453 is an HVS either tidally stripped from the Sgr dSph or ejected from the Sgr dSph by the gravitational slingshot effect, requiring a (central) massive/intermediate-mass black hole or a (central) massive primordial black hole in the Sgr dSph.

preprint2020arXiv

Mapping the Galactic disk with the LAMOST and Gaia Red clump sample: I: precise distances, masses, ages and 3D velocities of $\sim$ 140000 red clump stars

We present a sample of $\sim$ 140,000 primary red clump (RC) stars of spectral signal-to-noise ratios higher than 20 from the LAMOST Galactic spectroscopic surveys, selected based on their positions in the metallicity-dependent effective temperature--surface gravity and color--metallicity diagrams, supervised by high-quality $Kepler$ asteroseismology data. The stellar masses and ages of those stars are further determined from the LAMOST spectra, using the Kernel Principal Component Analysis method, trained with thousands of RCs in the LAMOST-$Kepler$ fields with accurate asteroseismic mass measurements. The purity and completeness of our primary RC sample are generally higher than 80 per cent. For the mass and age, a variety of tests show typical uncertainties of 15 and 30 per cent, respectively. Using over ten thousand primary RCs with accurate distance measurements from the parallaxes of Gaia DR2, we re-calibrate the $K_{\rm s}$ absolute magnitudes of primary RCs by, for the first time, considering both the metallicity and age dependencies. With the the new calibration, distances are derived for all the primary RCs, with a typical uncertainty of 5--10 per cent, even better than the values yielded by the Gaia parallax measurements for stars beyond 3--4 kpc. The sample covers a significant volume of the Galactic disk of $4 \leq R \leq 16$ kpc, $|Z| \leq 5$ kpc, and $-20 \leq ϕ\leq 50^{\circ}$. Stellar atmospheric parameters, line-of-sight velocities and elemental abundances derived from the LAMOST spectra and proper motions of Gaia DR2 are also provided for the sample stars. Finally, the selection function of the sample is carefully evaluated in the color-magnitude plane for different sky areas. The sample is publicly available.