arXiv subjects

Xin Lin

Publications and source records attributed to Xin Lin.

At least 109 records · Page 6Linked to original sources

arXiv2023

A Review on Machine Theory of Mind

Theory of Mind (ToM) is the ability to attribute mental states to others, the basis of human cognition. At present, there has been growing interest in the AI with cognitive abilities, for example in healthcare and the motoring industry. Beliefs, desires, and intentions are the early abilities of infants and the foundation of human cognitive ability, as well as for machine with ToM. In this paper, we review recent progress in machine ToM on beliefs, desires, and intentions. And we shall introduce the experiments, datasets and methods of machine ToM on these three aspects, summarize the development of different tasks and datasets in recent years, and compare well-behaved models in aspects of advantages, limitations and applicable conditions, hoping that this study can guide researchers to quickly keep up with latest trend in this field. Unlike other domains with a specific task and resolution framework, machine ToM lacks a unified instruction and a series of standard evaluation tasks, which make it difficult to formally compare the proposed models. We argue that, one method to address this difficulty is now to present a standard assessment criteria and dataset, better a large-scale dataset covered multiple aspects of ToM.

cs.AI↗

arXiv2023

Towards a Holistic Understanding of Mathematical Questions with Contrastive Pre-training

Understanding mathematical questions effectively is a crucial task, which can benefit many applications, such as difficulty estimation. Researchers have drawn much attention to designing pre-training models for question representations due to the scarcity of human annotations (e.g., labeling difficulty). However, unlike general free-format texts (e.g., user comments), mathematical questions are generally designed with explicit purposes and mathematical logic, and usually consist of more complex content, such as formulas, and related mathematical knowledge (e.g., Function). Therefore, the problem of holistically representing mathematical questions remains underexplored. To this end, in this paper, we propose a novel contrastive pre-training approach for mathematical question representations, namely QuesCo, which attempts to bring questions with more similar purposes closer. Specifically, we first design two-level question augmentations, including content-level and structure-level, which generate literally diverse question pairs with similar purposes. Then, to fully exploit hierarchical information of knowledge concepts, we propose a knowledge hierarchy-aware rank strategy (KHAR), which ranks the similarities between questions in a fine-grained manner. Next, we adopt a ranking contrastive learning task to optimize our model based on the augmented and ranked questions. We conduct extensive experiments on two real-world mathematical datasets. The experimental results demonstrate the effectiveness of our model.

cs.CL↗

arXiv2023

On inverted Kloosterman sums over finite fields

The classical $n$-variable Kloosterman sums over finite fields are well understood by Deligne's theorem from complex point of view and by Sperber's theorem from $p$-adic point of view. In this paper, we study the complex and $p$-adic estimates of inverted $n$-variable Kloosterman sums, addressing a question of N. Katz (1995). We shall give two complex estimates. The first one is elementary based on Gauss sums. The second estimate is deeper, depending on the cohomological results of Adolphson-Sperber, Denef-Loeser and Fu for twisted toric exponential sums. This deeper result assumes that the characteristic $p$ does not divide $n+1$. Combining with Dwork's $p$-adic theory, we also determine the exact $p$-adic valuations for zeros and poles of the L-function associated to inverted $n$-variable Kloosterman sums in the case $p \equiv 1 \mod (n+1)$. As we shall see, the inverted $n$-variable Kloosterman sum is more complicated than the classical $n$-variable Kloosterman sum in all aspects in the sense that our understanding is less complete, partly because the Hodge numbers are now mostly $2$ instead of $1$.

math.NT↗

arXiv2022

Strong Spin-Orbit Torque Induced by the Intrinsic Spin Hall Effect in Cr1-xPtx

We report on a spin-orbit torque study of the spin current generation in Cr1-xPtx alloy, using the light 3d ferromagnetic Co as the spin current detector. We find that the dampinglike spin-orbit torque of Cr1-xPtx/Co bilayers can be enhanced by tuning the Cr concentration in the Cr1-xPtx layer, with a maximal value of 0.31 at the optimal composition of Cr0.2Pt0.8. We find that the spin current generation in the Cr1-xPtx alloy can be fully understood by the characteristic trade-off between the intrinsic spin Hall conductivity of Pt and the carrier lifetime in the dirty limit. We find no evidence for the spin current generation by other mechanisms in this material, revealing that the role of Cr is found to be simply the same as other metals and oxides in previous studies. This work also establishes the low-resistivity Cr0.2Pt0.8 as an energy-efficient spin-orbit torque provider for magnetic memory and computing technologies.

cond-mat.mtrl-sci↗

arXiv2022

Evolutionary Multiparty Distance Minimization

In the field of evolutionary multiobjective optimization, the decision maker (DM) concerns conflicting objectives. In the real-world applications, there usually exist more than one DM and each DM concerns parts of these objectives. Multiparty multiobjective optimization problems (MPMOPs) are proposed to depict the MOP with multiple decision makers involved, where each party concerns about certain some objectives of all. However, in the evolutionary computation field, there is not much attention paid on MPMOPs. This paper constructs a series of MPMOPs based on distance minimization problems (DMPs), whose Pareto optimal solutions can be vividly visualized. To address MPMOPs, the new proposed algorithm OptMPNDS3 uses the multiparty initializing method to initialize the population and takes JADE2 operator to generate the offsprings. OptMPNDS3 is compared with OptAll, OptMPNDS and OptMPNDS2 on the problem suite. The result shows that OptMPNDS3 is strongly comparable to other algorithms

cs.NE↗

arXiv2022

HL-Net: Heterophily Learning Network for Scene Graph Generation

Scene graph generation (SGG) aims to detect objects and predict their pairwise relationships within an image. Current SGG methods typically utilize graph neural networks (GNNs) to acquire context information between objects/relationships. Despite their effectiveness, however, current SGG methods only assume scene graph homophily while ignoring heterophily. Accordingly, in this paper, we propose a novel Heterophily Learning Network (HL-Net) to comprehensively explore the homophily and heterophily between objects/relationships in scene graphs. More specifically, HL-Net comprises the following 1) an adaptive reweighting transformer module, which adaptively integrates the information from different layers to exploit both the heterophily and homophily in objects; 2) a relationship feature propagation module that efficiently explores the connections between relationships by considering heterophily in order to refine the relationship representation; 3) a heterophily-aware message-passing scheme to further distinguish the heterophily and homophily between objects/relationships, thereby facilitating improved message passing in graphs. We conducted extensive experiments on two public datasets: Visual Genome (VG) and Open Images (OI). The experimental results demonstrate the superiority of our proposed HL-Net over existing state-of-the-art approaches. In more detail, HL-Net outperforms the second-best competitors by 2.1$\%$ on the VG dataset for scene graph classification and 1.2$\%$ on the IO dataset for the final score. Code is available at https://github.com/siml3/HL-Net.

cs.CV↗

arXiv2022

RU-Net: Regularized Unrolling Network for Scene Graph Generation

Scene graph generation (SGG) aims to detect objects and predict the relationships between each pair of objects. Existing SGG methods usually suffer from several issues, including 1) ambiguous object representations, as graph neural network-based message passing (GMP) modules are typically sensitive to spurious inter-node correlations, and 2) low diversity in relationship predictions due to severe class imbalance and a large number of missing annotations. To address both problems, in this paper, we propose a regularized unrolling network (RU-Net). We first study the relation between GMP and graph Laplacian denoising (GLD) from the perspective of the unrolling technique, determining that GMP can be formulated as a solver for GLD. Based on this observation, we propose an unrolled message passing module and introduce an $\ell_p$-based graph regularization to suppress spurious connections between nodes. Second, we propose a group diversity enhancement module that promotes the prediction diversity of relationships via rank maximization. Systematic experiments demonstrate that RU-Net is effective under a variety of settings and metrics. Furthermore, RU-Net achieves new state-of-the-arts on three popular databases: VG, VRD, and OI. Code is available at https://github.com/siml3/RU-Net.

cs.CV↗

arXiv2022

Harmonizing Pathological and Normal Pixels for Pseudo-healthy Synthesis

Synthesizing a subject-specific pathology-free image from a pathological image is valuable for algorithm development and clinical practice. In recent years, several approaches based on the Generative Adversarial Network (GAN) have achieved promising results in pseudo-healthy synthesis. However, the discriminator (i.e., a classifier) in the GAN cannot accurately identify lesions and further hampers from generating admirable pseudo-healthy images. To address this problem, we present a new type of discriminator, the segmentor, to accurately locate the lesions and improve the visual quality of pseudo-healthy images. Then, we apply the generated images into medical image enhancement and utilize the enhanced results to cope with the low contrast problem existing in medical image segmentation. Furthermore, a reliable metric is proposed by utilizing two attributes of label noise to measure the health of synthetic images. Comprehensive experiments on the T2 modality of BraTS demonstrate that the proposed method substantially outperforms the state-of-the-art methods. The method achieves better performance than the existing methods with only 30\% of the training data. The effectiveness of the proposed method is also demonstrated on the LiTS and the T1 modality of BraTS. The code and the pre-trained model of this study are publicly available at https://github.com/Au3C2/Generator-Versus-Segmentor.

eess.IV↗

arXiv2022

Shifting More Attention to Visual Backbone: Query-modulated Refinement Networks for End-to-End Visual Grounding

Visual grounding focuses on establishing fine-grained alignment between vision and natural language, which has essential applications in multimodal reasoning systems. Existing methods use pre-trained query-agnostic visual backbones to extract visual feature maps independently without considering the query information. We argue that the visual features extracted from the visual backbones and the features really needed for multimodal reasoning are inconsistent. One reason is that there are differences between pre-training tasks and visual grounding. Moreover, since the backbones are query-agnostic, it is difficult to completely avoid the inconsistency issue by training the visual backbone end-to-end in the visual grounding framework. In this paper, we propose a Query-modulated Refinement Network (QRNet) to address the inconsistent issue by adjusting intermediate features in the visual backbone with a novel Query-aware Dynamic Attention (QD-ATT) mechanism and query-aware multiscale fusion. The QD-ATT can dynamically compute query-dependent visual attention at the spatial and channel levels of the feature maps produced by the visual backbone. We apply the QRNet to an end-to-end visual grounding framework. Extensive experiments show that the proposed method outperforms state-of-the-art methods on five widely used datasets.

cs.CV↗

arXiv2022

A Novel Architecture Slimming Method for Network Pruning and Knowledge Distillation

Network pruning and knowledge distillation are two widely-known model compression methods that efficiently reduce computation cost and model size. A common problem in both pruning and distillation is to determine compressed architecture, i.e., the exact number of filters per layer and layer configuration, in order to preserve most of the original model capacity. In spite of the great advances in existing works, the determination of an excellent architecture still requires human interference or tremendous experimentations. In this paper, we propose an architecture slimming method that automates the layer configuration process. We start from the perspective that the capacity of the over-parameterized model can be largely preserved by finding the minimum number of filters preserving the maximum parameter variance per layer, resulting in a thin architecture. We formulate the determination of compressed architecture as a one-step orthogonal linear transformation, and integrate principle component analysis (PCA), where the variances of filters in the first several projections are maximized. We demonstrate the rationality of our analysis and the effectiveness of the proposed method through extensive experiments. In particular, we show that under the same overall compression rate, the compressed architecture determined by our method shows significant performance gain over baselines after pruning and distillation. Surprisingly, we find that the resulting layer-wise compression rates correspond to the layer sensitivities found by existing works through tremendous experimentations.

cs.CV↗

arXiv2022

Benchmark Functions for CEC 2022 Competition on Seeking Multiple Optima in Dynamic Environments

Dynamic and multimodal features are two important properties and widely existed in many real-world optimization problems. The former illustrates that the objectives and/or constraints of the problems change over time, while the latter means there is more than one optimal solution (sometimes including the accepted local solutions) in each environment. The dynamic multimodal optimization problems (DMMOPs) have both of these characteristics, which have been studied in the field of evolutionary computation and swarm intelligence for years, and attract more and more attention. Solving such problems requires optimization algorithms to simultaneously track multiple optima in the changing environments. So that the decision makers can pick out one optimal solution in each environment according to their experiences and preferences, or quickly turn to other solutions when the current one cannot work well. This is very helpful for the decision makers, especially when facing changing environments. In this competition, a test suit about DMMOPs is given, which models the real-world applications. Specifically, this test suit adopts 8 multimodal functions and 8 change modes to construct 24 typical dynamic multimodal optimization problems. Meanwhile, the metric is also given to measure the algorithm performance, which considers the average number of optimal solutions found in all environments. This competition will be very helpful to promote the development of dynamic multimodal optimization algorithms.

cs.NE↗

arXiv2021

Inferring Substitutable and Complementary Products with Knowledge-Aware Path Reasoning based on Dynamic Policy Network

Inferring the substitutable and complementary products for a given product is an essential and fundamental concern for the recommender system. To achieve this, existing approaches take advantage of the knowledge graphs to learn more evidences for inference, whereas they often suffer from invalid reasoning for lack of elegant decision making strategies. Therefore, we propose a novel Knowledge-Aware Path Reasoning (KAPR) model which leverages the dynamic policy network to make explicit reasoning over knowledge graphs, for inferring the substitutable and complementary relationships. Our contributions can be highlighted as three aspects. Firstly, we model this inference scenario as a Markov Decision Process in order to accomplish a knowledge-aware path reasoning over knowledge graphs. Secondly,we integrate both structured and unstructured knowledge to provide adequate evidences for making accurate decision-making. Thirdly, we evaluate our model on a series of real-world datasets, achieving competitive performance compared with state-of-the-art approaches. Our code is released on https://gitee.com/yangzijing flower/kapr/tree/master.

cs.AI↗

arXiv2021

L-functions of certain exponential sums over finite fields II

In this paper, we compute the $q$-adic slopes of the L-functions of an important class of exponential sums arising from analytic number theory. Our main tools include Adolphson-Sperber's work on toric exponential sums and Wan's decomposition theorems.

math.NT↗

arXiv2021

L-functions of Certain Exponential Sums over Finite Fields

In this paper, we completely determine the slopes and weights of the L-functions of an important class of exponential sums arising from analytic number theory. Our main tools include Adolphson-Sperber's work on toric exponential sums and Wan's decomposition theorems. One consequence of our main result is a sharp estimate of these exponential sums. Another consequence is to obtain an explicit counterexample of Adolphson-Sperber's conjecture on weights of toric exponential sums.

math.NT↗

arXiv2021

Ultra strong and ductile eutectic high entropy alloy fabricated by selective laser melting

With important application prospects, eutectic high entropy alloys have received extensive attention for their excellent strength and ductility in a large temperature range. The excellent casting characteristics of eutectic high entropy alloys make it possible to achieve well manufacturability of selective laser melting. For the first time, we have achieved crack-free eutectic high entropy alloy fabricated by selective laser melting, which has excellent mechanical properties in a wide temperature range of -196 degrees Celsius~760 degrees Celsius due to ultra-fine eutectic lamellar spacing of 150 ~ 200nm and lamellar colony of 2 ~ 6 μm. Specifically, the room temperature tensile strength exceeds 1400MPa and the elongation is more than 20%, significantly improved compared with those manufactured by other techniques with lower cooling rate.

physics.app-ph↗

arXiv2021

A knowledge transfer model for COVID-19 predicting and non-pharmaceutical intervention simulation

Since December 2019, A novel coronavirus (2019-nCoV) has been breaking out in China, which can cause respiratory diseases and severe pneumonia. Mathematical and empirical models relying on the epidemic situation scale for forecasting disease outbreaks have received increasing attention. Given its successful application in the evaluation of infectious diseases scale, we propose a Susceptible-Undiagnosed-Infected-Removed (SUIR) model to offer the effective prediction, prevention, and control of infectious diseases. Our model is a modified susceptible-infected-recovered (SIR) model that injects undiagnosed state and offers pre-training effective reproduction number. Our SUIR model is more precise than the traditional SIR model. Moreover, we combine domain knowledge of the epidemic to estimate effective reproduction number, which addresses the initial susceptible population of the infectious disease model approach to the ground truth. These findings have implications for the forecasting of epidemic trends in COVID-19 as these could help the growth of estimating epidemic situation.

q-bio.PE↗

arXiv2020

ECNU-SenseMaker at SemEval-2020 Task 4: Leveraging Heterogeneous Knowledge Resources for Commonsense Validation and Explanation

This paper describes our system for SemEval-2020 Task 4: Commonsense Validation and Explanation (Wang et al., 2020). We propose a novel Knowledge-enhanced Graph Attention Network (KEGAT) architecture for this task, leveraging heterogeneous knowledge from both the structured knowledge base (i.e. ConceptNet) and unstructured text to better improve the ability of a machine in commonsense understanding. This model has a powerful commonsense inference capability via utilizing suitable commonsense incorporation methods and upgraded data augmentation techniques. Besides, an internal sharing mechanism is cooperated to prohibit our model from insufficient and excessive reasoning for commonsense. As a result, this model performs quite well in both validation and explanation. For instance, it achieves state-of-the-art accuracy in the subtask called Commonsense Explanation (Multi-Choice). We officially name the system as ECNU-SenseMaker. Code is publicly available at https://github.com/ECNU-ICA/ECNU-SenseMaker.

cs.CL↗

arXiv2020

The short-term seasonal analyses between atmospheric environment and COVID-19 in epidemic areas of Cities in Australia, South Korea, and Italy

The impact of the outbreak of COVID-19 on health has been widely concerned. Disease risk assessment, prediction, and early warning have become a significant research field. Previous research suggests that there is a relationship between air quality and the disease. This paper investigated the impact of the atmospheric environment on the basic reproduction number (R$_0$) in Australia, South Korea, and Italy by using atmospheric environment data, confirmed case data, and the distributed lag non-linear model (DLNM) model based on Quasi-Poisson regression. The results show that the air temperature and humidity have lag and persistence on short-term R$_0$, and seasonal factors have an apparent decorating effect on R$_0$. PM$_{10}$ is the primary pollutant that affects the excess morbidity rate. Moreover, O$_3$, PM$_{2.5}$, and SO$_2$ as perturbation factors have an apparent cumulative effect. These results present beneficial knowledge for correlation between environment and COVID-19, which guiding prospective analyses of disease data.

q-bio.PE↗