arXiv subjects

Tao Zhang

Publications and source records attributed to Tao Zhang.

At least 379 records · Page 21Linked to original sources

arXiv2024

Knowledge Enhanced Multi-intent Transformer Network for Recommendation

Incorporating Knowledge Graphs into Recommendation has attracted growing attention in industry, due to the great potential of KG in providing abundant supplementary information and interpretability for the underlying models. However, simply integrating KG into recommendation usually brings in negative feedback in industry, due to the ignorance of the following two factors: i) users' multiple intents, which involve diverse nodes in KG. For example, in e-commerce scenarios, users may exhibit preferences for specific styles, brands, or colors. ii) knowledge noise, which is a prevalent issue in Knowledge Enhanced Recommendation (KGR) and even more severe in industry scenarios. The irrelevant knowledge properties of items may result in inferior model performance compared to approaches that do not incorporate knowledge. To tackle these challenges, we propose a novel approach named Knowledge Enhanced Multi-intent Transformer Network for Recommendation (KGTN), comprising two primary modules: Global Intents Modeling with Graph Transformer, and Knowledge Contrastive Denoising under Intents. Specifically, Global Intents with Graph Transformer focuses on capturing learnable user intents, by incorporating global signals from user-item-relation-entity interactions with a graph transformer, meanwhile learning intent-aware user/item representations. Knowledge Contrastive Denoising under Intents is dedicated to learning precise and robust representations. It leverages intent-aware representations to sample relevant knowledge, and proposes a local-global contrastive mechanism to enhance noise-irrelevant representation learning. Extensive experiments conducted on benchmark datasets show the superior performance of our proposed method over the state-of-the-arts. And online A/B testing results on Alibaba large-scale industrial recommendation platform also indicate the real-scenario effectiveness of KGTN.

cs.IR↗

arXiv2024

Comprehensive Analysis of Network Robustness Evaluation Based on Convolutional Neural Networks with Spatial Pyramid Pooling

Connectivity robustness, a crucial aspect for understanding, optimizing, and repairing complex networks, has traditionally been evaluated through time-consuming and often impractical simulations. Fortunately, machine learning provides a new avenue for addressing this challenge. However, several key issues remain unresolved, including the performance in more general edge removal scenarios, capturing robustness through attack curves instead of directly training for robustness, scalability of predictive tasks, and transferability of predictive capabilities. In this paper, we address these challenges by designing a convolutional neural networks (CNN) model with spatial pyramid pooling networks (SPP-net), adapting existing evaluation metrics, redesigning the attack modes, introducing appropriate filtering rules, and incorporating the value of robustness as training data. The results demonstrate the thoroughness of the proposed CNN framework in addressing the challenges of high computational time across various network types, failure component types and failure scenarios. However, the performance of the proposed CNN model varies: for evaluation tasks that are consistent with the trained network type, the proposed CNN model consistently achieves accurate evaluations of both attack curves and robustness values across all removal scenarios. When the predicted network type differs from the trained network, the CNN model still demonstrates favorable performance in the scenario of random node failure, showcasing its scalability and performance transferability. Nevertheless, the performance falls short of expectations in other removal scenarios. This observed scenario-sensitivity in the evaluation of network features has been overlooked in previous studies and necessitates further attention and optimization. Lastly, we discuss important unresolved questions and further investigation.

cs.CV↗

arXiv2024

Cohomology of Hom-associative algebras in Loday-Pirashvili category with applications

We introduce the concept of Hom-associative algebra structures in Loday-Pirashvili category.The cohomology theory of Hom-associative algebras in this category is studied.Some applications on deformation and abelian extension theory are given. We also introduce the notion of Nijenhuis operators to describe trivial deformations. It is proved that equivalent classes of abelian extensions are one-to-one correspondence to the elements of the second cohomology groups.

math.RA↗

arXiv2024

Waveform Simulation in PandaX-4T

Signal reconstruction through software processing is a crucial component of the background and signal models in the PandaX-4T experiment, which is a multi-tonne dark matter direct search experiment. The accuracy of signal reconstruction is influenced by various detector artifacts, including noise, dark count of photomultiplier, impurity photoionization in the detector, and other relevant considerations. In this study, we present a detailed description of a semi-data-driven approach designed to simulate the signal waveform. This work provides a reliable model for the efficiency and bias of the signal reconstruction in the data analysis of PandaX-4T. By comparing critical variables which relate to the temporal shape and hit pattern of the signals, we demonstrate a good agreement between the simulation and data.

hep-ex↗

arXiv2024

Searching for Two-Neutrino and Neutrinoless Double Beta Decay of $^{134}$Xe with the PandaX-4T Experiment

$^{134}$Xe is a candidate isotope for neutrinoless double beta decay~($0νββ$) search. In addition, the two-neutrino case ($2νββ$) allowed by the Standard Model of particle physics has not yet been observed. Utilizing the 10.4% of $^{134}$Xe in the natural xenon in the PandaX-4T detector and its first 94.9-day exposure, we have established the most stringent constraints on $2νββ$ and $0νββ$ of $^{134}$Xe half-lives, with limits of $2.8\times10^{22}$ yr and $3.0\times10^{23}$ yr at 90% confidence level, respectively. The $2νββ$ ($0νββ$) limit surpasses the previously reported best result by a factor of 32 (2.7), highlighting the potential of large monolithic natural xenon detectors.

nucl-ex↗

arXiv2024

A Game-Theoretic Analysis of Auditing Differentially Private Algorithms with Epistemically Disparate Herd

Privacy-preserving AI algorithms are widely adopted in various domains, but the lack of transparency might pose accountability issues. While auditing algorithms can address this issue, machine-based audit approaches are often costly and time-consuming. Herd audit, on the other hand, offers an alternative solution by harnessing collective intelligence. Nevertheless, the presence of epistemic disparity among auditors, resulting in varying levels of expertise and access to knowledge, may impact audit performance. An effective herd audit will establish a credible accountability threat for algorithm developers, incentivizing them to uphold their claims. In this study, our objective is to develop a systematic framework that examines the impact of herd audits on algorithm developers using the Stackelberg game approach. The optimal strategy for auditors emphasizes the importance of easy access to relevant information, as it increases the auditors' confidence in the audit process. Similarly, the optimal choice for developers suggests that herd audit is viable when auditors face lower costs in acquiring knowledge. By enhancing transparency and accountability, herd audit contributes to the responsible development of privacy-preserving algorithms.

cs.CR↗

arXiv2024

Realization of two-qubit gates and multi-body entanglement states in an asymmetric superconducting circuits

In recent years, the tunable coupling scheme has become the mainstream scheme for designing superconducting quan tum circuits. By working in the dispersive regime, the ZZ coupling and high-energy level leakage can be effectively suppressed and realize a high fidelity quantum gate. We propose a tunable fluxonium-transmon-transmon (FTT) cou pling scheme. In our system, the coupler is a frequency tunable transmon qubit. Both qubits and coupler are capacitively coupled. The asymmetric structure composed of fluxonium and transmon will optimize the frequency space and form a high fidelity two-qubit quantum gate. By decoupling, the effective coupling strength can be easily adjusted to close to the net coupling between qubits. We numerical simulation the master equation to reduce the quantum noise to zero. We study the performance of this scheme by simulating the general single-qubit Xπ/2 gate and two-qubit (iSWAP) gate. In the bias point of the qubits, we achieve a single qubit gate with 99.99% fidelity and a two-qubit gate with 99.95% fidelity. By adjusting the nonlinear Kerr coefficient of fluxonium to an appropriate value, we can achieve a multi-body entanglement state. We consider the correlation between the two qubits and the coupler, and the magnetic flux passing through one qubit has an effect on the other qubit and the coupler. Finally, we analyze the quantum correlation of the two-body entanglement state.

quant-ph↗

arXiv2024

Enhanced extracellular matrix remodeling due to embedded spheroid fluidization

Tumor spheroids are in vitro three-dimensional, cellular collectives consisting of cancerous cells. Embedding these spheroids in an in vitro fibrous environment, such as a collagen network, to mimic the extracellular matrix (ECM) provides an essential platform to quantitatively investigate the biophysical mechanisms leading to tumor invasion of the ECM. To understand the mechanical interplay between tumor spheroids and the ECM, we computationally construct and study a three-dimensional vertex model for a tumor spheroid that is mechanically coupled to a cross-linked network of fibers. In such a vertex model, cells are represented as deformable polyhedrons that share faces. Some fraction of the boundary faces of the tumor spheroid contain linker springs connecting the center of the boundary face to the nearest node in the fiber network. As these linker springs actively contract, the fiber network remodels. By toggling between fluid-like and solid-like spheroids via changing the dimensionless cell shape index, we find that the spheroid rheology affects the remodeling of the fiber network. More precisely, fluid-like spheroids displace the fiber network more on average near the vicinity of the spheroid than solid-like spheroids. We also find more densification of the fiber network near the spheroid for the fluid-like spheroids. These spheroid rheology-dependent effects are the result of cellular motility due to active cellular rearrangements that emerge over time in the fluid-like spheroids to generate spheroid shape fluctuations. Our results uncover intricate morphological-mechanical interplay between an embedded spheroid and its surrounding fiber network with both spheroid contractile strength and spheroid shape fluctuations playing important roles in the pre-invasion stages of tumor invasion.

physics.bio-ph↗

arXiv2024

Efficient Learning Strategy for Predicting Glass Forming Ability in Imbalanced Datasets of Bulk Metallic Glasses

The prediction of glass forming ability (GFA) and various properties in bulk metallic glasses (BMGs) pose a challenge due to the unique disordered atomic structure in this type of materials. Machine learning shows the potential ability to find a way out. However, the training set from the experimental data of BMGs faces the issue of data imbalance, including the distribution of data related to elements, the range of performance data, and the distribution of sparse and dense data area in each specific system. In this work, the origin of the data imbalance and its impact on the GFA prediction ability of machine learning models are analyzed. We propose the solutions by training the model using the pruned dataset to mitigate the imbalance and by performing an active experimental iterative learning to compensate for the information loss resulting from data reduction. The strategy is proved in Zr-Al-Cu system, and the automated workflow has been established. It effectively avoids the prediction results from trapping into the intensive training data area or from inducing by the data distribution of similar element systems. This approach will expedite the development of new BMGs compositions especially for unexplored systems.

cond-mat.mtrl-sci↗

arXiv2024

SpaceOctopus: An Octopus-inspired Motion Planning Framework for Multi-arm Space Robot

Space robots have played a critical role in autonomous maintenance and space junk removal. Multi-arm space robots can efficiently complete the target capture and base reorientation tasks due to their flexibility and the collaborative capabilities between the arms. However, the complex coupling properties arising from both the multiple arms and the free-floating base present challenges to the motion planning problems of multi-arm space robots. We observe that the octopus elegantly achieves similar goals when grabbing prey and escaping from danger. Inspired by the distributed control of octopuses' limbs, we develop a multi-level decentralized motion planning framework to manage the movement of different arms of space robots. This motion planning framework integrates naturally with the multi-agent reinforcement learning (MARL) paradigm. The results indicate that our method outperforms the previous method (centralized training). Leveraging the flexibility of the decentralized framework, we reassemble policies trained for different tasks, enabling the space robot to complete trajectory planning tasks while adjusting the base attitude without further learning. Furthermore, our experiments confirm the superior robustness of our method in the face of external disturbances, changing base masses, and even the failure of one arm.

cs.RO↗

arXiv2024

Compositional Generative Inverse Design

Inverse design, where we seek to design input variables in order to optimize an underlying objective function, is an important problem that arises across fields such as mechanical engineering to aerospace engineering. Inverse design is typically formulated as an optimization problem, with recent works leveraging optimization across learned dynamics models. However, as models are optimized they tend to fall into adversarial modes, preventing effective sampling. We illustrate that by instead optimizing over the learned energy function captured by the diffusion model, we can avoid such adversarial examples and significantly improve design performance. We further illustrate how such a design system is compositional, enabling us to combine multiple different diffusion models representing subcomponents of our desired system to design systems with every specified component. In an N-body interaction task and a challenging 2D multi-airfoil design task, we demonstrate that by composing the learned diffusion model at test time, our method allows us to design initial states and boundary shapes that are more complex than those in the training data. Our method generalizes to more objects for N-body dataset and discovers formation flying to minimize drag in the multi-airfoil design task. Project website and code can be found at https://github.com/AI4Science-WestlakeU/cindm.

cs.LG↗

arXiv2024

Detecting Neutrinos from Supernova Bursts in PandaX-4T

Neutrinos from core-collapse supernovae are essential for the understanding of neutrino physics and stellar evolution. The dual-phase xenon dark matter detectors can provide a way to track explosions of galactic supernovae by detecting neutrinos through coherent elastic neutrino-nucleus scatterings. In this study, a variation of progenitor masses as well as explosion models are assumed to predict the neutrino fluxes and spectra, which result in the number of expected neutrino events ranging from 6.6 to 13.7 at a distance of 10 kpc over a 10-second duration with negligible backgrounds at PandaX-4T. Two specialized triggering alarms for monitoring supernova burst neutrinos are built. The efficiency of detecting supernova explosions at various distances in the Milky Way is estimated. These alarms will be implemented in the real-time supernova monitoring system at PandaX-4T in the near future, providing the astronomical communities with supernova early warnings.

hep-ex↗

arXiv2024

Highly stable power control for chip-based continuous-variable quantum key distribution system

Quantum key distribution allows secret key generation with information theoretical security. It can be realized with photonic integrated circuits to benefit the tiny footprints and the large-scale manufacturing capacity. Continuous-variable quantum key distribution is suitable for chip-based integration due to its compatibility with mature optical communication devices. However, the quantum signal power control compatible with the mature photonic integration process faces difficulties on stability, which limits the system performance and causes the overestimation of secret key rate that opens practical security loopholes. Here, a highly stable chip-based quantum signal power control scheme based on a biased Mach-Zehnder interferometer structure is proposed, theoretically analyzed and experimentally implemented with standard silicon photonic techniques. Simulations and experimental results show that the proposed scheme significantly improves the system stability, where the standard deviation of the secret key rate is suppressed by an order of magnitude compared with the system using traditional designs, showing a promising and practicable way to realize highly stable continuous-variable quantum key distribution system on chip.

quant-ph↗

arXiv2024

Search Intenion Network for Personalized Query Auto-Completion in E-Commerce

Query Auto-Completion(QAC), as an important part of the modern search engine, plays a key role in complementing user queries and helping them refine their search intentions.Today's QAC systems in real-world scenarios face two major challenges:1)intention equivocality(IE): during the user's typing process,the prefix often contains a combination of characters and subwords, which makes the current intention ambiguous and difficult to model.2)intention transfer (IT):previous works make personalized recommendations based on users' historical sequences, but ignore the search intention transfer.However, the current intention extracted from prefix may be contrary to the historical preferences.

cs.IR↗

arXiv2024

i-Octree: A Fast, Lightweight, and Dynamic Octree for Proximity Search

Establishing the correspondences between newly acquired points and historically accumulated data (i.e., map) through nearest neighbors search is crucial in numerous robotic applications. However, static tree data structures are inadequate to handle large and dynamically growing maps in real-time. To address this issue, we present the i-Octree, a dynamic octree data structure that supports both fast nearest neighbor search and real-time dynamic updates, such as point insertion, deletion, and on-tree down-sampling. The i-Octree is built upon a leaf-based octree and has two key features: a local spatially continuous storing strategy that allows for fast access to points while minimizing memory usage, and local on-tree updates that significantly reduce computation time compared to existing static or dynamic tree structures. The experiments show that i-Octree outperforms contemporary state-of-the-art approaches by achieving, on average, a 19% reduction in runtime on realworld open datasets.

cs.RO↗

arXiv2024

A Quick Framework for Evaluating Worst Robustness of Complex Networks

Robustness is pivotal for comprehending, designing, optimizing, and rehabilitating networks, with simulation attacks being the prevailing evaluation method. Simulation attacks are often time-consuming or even impractical, however, a more crucial yet persistently overlooked drawback is that any attack strategy merely provides a potential paradigm of disintegration. The key concern is: in the worst-case scenario or facing the most severe attacks, what is the limit of robustness, referred to as ``Worst Robustness'', for a given system? Understanding a system's worst robustness is imperative for grasping its reliability limits, accurately evaluating protective capabilities, and determining associated design and security maintenance costs. To address these challenges, we introduce the concept of Most Destruction Attack (MDA) based on the idea of knowledge stacking. MDA is employed to assess the worst robustness of networks, followed by the application of an adapted CNN algorithm for rapid worst robustness prediction. We establish the logical validity of MDA and highlight the exceptional performance of the adapted CNN algorithm in predicting the worst robustness across diverse network topologies, encompassing both model and empirical networks.

cs.SI↗

arXiv2024

Supervised and unsupervised learning of directed percolation

Machine learning (ML) has been well applied to studying equilibrium phase transition models, by accurately predicating critical thresholds and some critical exponents. Difficulty will be raised, however, for integrating ML into non-equilibrium phase transitions. The extra dimension in a given non-equilibrium system, namely time, can greatly slow down the procedure towards the steady state. In this paper we find that by using some simple techniques of ML, non-steady state configurations of directed percolation (DP) suffice to capture its essential critical behaviors in both (1+1) and (2+1) dimensions. With the supervised learning method, the framework of our binary classification neural networks can identify the phase transition threshold, as well as the spatial and temporal correlation exponents. The characteristic time $t_{c}$, specifying the transition from active phases to absorbing ones, is also a major product of the learning. Moreover, we employ the convolutional autoencoder, an unsupervised learning technique, to extract dimensionality reduction representations and cluster configurations of (1+1) bond DP. It is quite appealing that such a method can yield a reasonable estimation of the critical point.

cond-mat.stat-mech↗

arXiv2024

SENet: A Spectral Filtering Approach to Represent Exemplars for Few-shot Learning

Prototype is widely used to represent internal structure of category for few-shot learning, which was proposed as a simple inductive bias to address the issue of overfitting. However, since prototype representation is normally averaged from individual samples, it can appropriately to represent some classes but with underfitting to represent some others that can be batter represented by exemplars. To address this problem, in this work, we propose Shrinkage Exemplar Networks (SENet) for few-shot classification. In SENet, categories are represented by the embedding of samples that shrink towards their mean via spectral filtering. Furthermore, a shrinkage exemplar loss is proposed to replace the widely used cross entropy loss for capturing the information of individual shrinkage samples. Several experiments were conducted on miniImageNet, tiered-ImageNet and CIFAR-FS datasets. The experimental results demonstrate the effectiveness of our proposed method.

cs.CV↗