arXiv subjects

Yan Zhu

Publications and source records attributed to Yan Zhu.

At least 91 records · Page 5Linked to original sources

arXiv2022

Sensitive Multi-beam Targeted SETI Observations towards 33 Exoplanet Systems with FAST

As a major approach to looking for life beyond the Earth, the search for extraterrestrial intelligence (SETI) is committed to detecting technosignatures such as engineered radio signals that are indicative of technologically capable life. In this paper, we report a targeted SETI campaign employing an observation strategy named multi-beam coincidence matching (MBCM) at the Five-hundred-meter Aperture Spherical radio Telescope (FAST) towards 33 known exoplanet systems, searching for ETI narrow-band drifting signals across 1.05-1.45 GHz in two orthogonal linear polarization directions separately. A signal at 1140.604 MHz detected from the observation towards Kepler-438 originally peaked our interest because its features are roughly consistent with assumed ETI technosignatures. However, evidences such as its polarization characteristics are almost able to eliminate the possibility of an extraterrestrial origin. Our observations achieve an unprecedented sensitivity since the minimum equivalent isotropic radiated power (EIRP) we are able to detect reaches 1.48 x10^9 W.

astro-ph.EP↗

arXiv2022

Flexible learning of quantum states with generative query neural networks

Deep neural networks are a powerful tool for the characterization of quantum states. Existing networks are typically trained with experimental data gathered from the specific quantum state that needs to be characterized. But is it possible to train a neural network offline and to make predictions about quantum states other than the ones used for the training? Here we introduce a model of network that can be trained with classically simulated data from a fiducial set of states and measurements, and can later be used to characterize quantum states that share structural similarities with the states in the fiducial set. With little guidance of quantum physics, the network builds its own data-driven representation of quantum states, and then uses it to predict the outcome statistics of quantum measurements that have not been performed yet. The state representation produced by the network can also be used for tasks beyond the prediction of outcome statistics, including clustering of quantum states and identification of different phases of matter. Our network model provides a flexible approach that can be applied to online learning scenarios, where predictions must be generated as soon as experimental data become available, and to blind learning scenarios where the learner has only access to an encrypted description of the quantum hardware.

quant-ph↗

arXiv2022

Quantum Causal Unravelling

Complex processes often arise from sequences of simpler interactions involving a few particles at a time. These interactions, however, may not be directly accessible to experiments. Here we develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process, under the assumption that the process has bounded information loss and induces causal dependencies whose strength is above a fixed (but otherwise arbitrary) threshold. Our method is based on a quantum algorithm whose complexity scales polynomially in the total number of input/output systems, in the dimension of the systems involved in each interaction, and in the inverse of the chosen threshold for the strength of the causal dependencies. Under additional assumptions, we also provide a second algorithm that has lower complexity and requires only local state preparation and local measurements. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography. Similarly, they can be used to identify useful communication channels in quantum networks, and to test the internal structure of uncharacterized quantum circuits.

quant-ph↗

arXiv2022

Explainable Fairness in Recommendation

Existing research on fairness-aware recommendation has mainly focused on the quantification of fairness and the development of fair recommendation models, neither of which studies a more substantial problem--identifying the underlying reason of model disparity in recommendation. This information is critical for recommender system designers to understand the intrinsic recommendation mechanism and provides insights on how to improve model fairness to decision makers. Fortunately, with the rapid development of Explainable AI, we can use model explainability to gain insights into model (un)fairness. In this paper, we study the problem of explainable fairness, which helps to gain insights about why a system is fair or unfair, and guides the design of fair recommender systems with a more informed and unified methodology. Particularly, we focus on a common setting with feature-aware recommendation and exposure unfairness, but the proposed explainable fairness framework is general and can be applied to other recommendation settings and fairness definitions. We propose a Counterfactual Explainable Fairness framework, called CEF, which generates explanations about model fairness that can improve the fairness without significantly hurting the performance.The CEF framework formulates an optimization problem to learn the "minimal" change of the input features that changes the recommendation results to a certain level of fairness. Based on the counterfactual recommendation result of each feature, we calculate an explainability score in terms of the fairness-utility trade-off to rank all the feature-based explanations, and select the top ones as fairness explanations.

cs.IR↗

arXiv2022

Controllable Production of Degenerate Fermi Gases of $^6$Li Atoms in the 2D-3D Crossover

The many-body physics in the dimensional crossover regime attracts much attention in cold atom experiments, but yet to explore systematically. One of the technical difficulties existed in the experiments is the lack of the experimental technique to quantitatively tune the atom occupation ratio of the different lattice bands. In this letter, we report such techniques in a process of transferring a 3D Fermi gas into a 1D optical lattice, where the capability of tuning the occupation of the energy band is realized by varying the trapping potentials of the optical dipole trap (ODT) and the lattice, respectively. We could tune a Fermi gas with the occupation in the lowest band from unity to 50$\%$ quantitatively. This provides a route to experimentally study the dependence of many-body interaction on the dimensionality in a Fermi gas.

cond-mat.quant-gas↗

arXiv2022

Block designs with $\gcd(r,λ)=1$ admitting flag-transitive automorphism groups

In this paper, we present a classification of $2$-designs with $\gcd(r,λ)=1$ admitting flag-transitive automorphism groups. If $G$ is a flag-transitive automorphism group of a non-trivial $2$-design $\mathcal{D}$ with $\gcd(r,λ)=1$, then either $(\mathcal{D},G)$ is one of the known examples described in this paper, or $\mathcal{D}$ has $q = p^{d}$ points with $p$ prime and $G$ is a subgroup of $AΓL_{1}(q)$.

math.GR↗

arXiv2022

RawlsGCN: Towards Rawlsian Difference Principle on Graph Convolutional Network

Graph Convolutional Network (GCN) plays pivotal roles in many real-world applications. Despite the successes of GCN deployment, GCN often exhibits performance disparity with respect to node degrees, resulting in worse predictive accuracy for low-degree nodes. We formulate the problem of mitigating the degree-related performance disparity in GCN from the perspective of the Rawlsian difference principle, which is originated from the theory of distributive justice. Mathematically, we aim to balance the utility between low-degree nodes and high-degree nodes while minimizing the task-specific loss. Specifically, we reveal the root cause of this degree-related unfairness by analyzing the gradients of weight matrices in GCN. Guided by the gradients of weight matrices, we further propose a pre-processing method RawlsGCN-Graph and an in-processing method RawlsGCN-Grad that achieves fair predictive accuracy in low-degree nodes without modification on the GCN architecture or introduction of additional parameters. Extensive experiments on real-world graphs demonstrate the effectiveness of our proposed RawlsGCN methods in significantly reducing degree-related bias while retaining comparable overall performance.

cs.LG↗

arXiv2021

Quantum autoencoders for communication-efficient quantum cloud computing

In the model of quantum cloud computing, the server executes a computation on the quantum data provided by the client. In this scenario, it is important to reduce the amount of quantum communication between the client and the server. A possible approach is to transform the desired computation into a compressed version that acts on a smaller number of qubits, thereby reducing the amount of data exchanged between the client and the server. Here we propose quantum autoencoders for quantum gates (QAEGate) as a method for compressing quantum computations. We illustrate it in concrete scenarios of single-round and multi-round communication and validate it through numerical experiments. A bonus of our method is it does not reveal any information about the server's computation other than the information present in the output.

quant-ph↗

arXiv2021

Efficient Dynamic Graph Representation Learning at Scale

Dynamic graphs with ordered sequences of events between nodes are prevalent in real-world industrial applications such as e-commerce and social platforms. However, representation learning for dynamic graphs has posed great computational challenges due to the time and structure dependency and irregular nature of the data, preventing such models from being deployed to real-world applications. To tackle this challenge, we propose an efficient algorithm, Efficient Dynamic Graph lEarning (EDGE), which selectively expresses certain temporal dependency via training loss to improve the parallelism in computations. We show that EDGE can scale to dynamic graphs with millions of nodes and hundreds of millions of temporal events and achieve new state-of-the-art (SOTA) performance.

cs.LG↗

arXiv2021

Efficient Algorithms for Causal Order Discovery in Quantum Networks

Given black-box access to the input and output systems, we develop the first efficient quantum causal order discovery algorithm with polynomial query complexity with respect to the number of systems. We model the causal order with quantum combs, and our algorithms output the order of inputs and outputs that the given process is compatible with. Our algorithm searches for the last input and the last output in the causal order, removes them, and iteratively repeats the above procedure until we get the order of all inputs and outputs. Our method guarantees a polynomial running time for quantum combs with a low Kraus rank, namely processes with low noise and little information loss. For special cases where the causal order can be inferred from local observations, we also propose algorithms that have lower query complexity and only require local state preparation and local measurements. Our algorithms will provide efficient ways to detect and optimize available transmission paths in quantum communication networks, as well as methods to verify quantum circuits and to discover the latent structure of multipartite quantum systems.

quant-ph↗

arXiv2021

Contactless Series Resistance Imaging of Perovskite Solar Cells via Inhomogeneous Illumination

A contactless effective series resistance imaging method for large area perovskite solar cells that is based on photoluminescence imaging with non-uniform illumination is introduced and demonstrated experimentally. The proposed technique is applicable to partially and fully processed perovskite solar cells if laterally conductive layers are present. The capability of the proposed contactless method to detect features with high effective series resistance is validated by comparison with various contacted mode luminescence imaging techniques. The method can reliably provide information regarding the severeness of the detected series resistance through photo-excitation pattern manipulation. Application of the method to sub-cells in monolithic tandem devices, without the need for electrical contacting the terminals, appears feasible.

physics.app-ph↗

arXiv2021

The FAST Galactic Plane Pulsar Snapshot survey: I. Project design and pulsar discoveries

Discovery of pulsars is one of the main goals for large radio telescopes. The Five-hundred-meter Aperture Spherical radio Telescope (FAST), that incorporates an L-band 19-beam receiver with a system temperature of about 20~K, is the most sensitive radio telescope utilized for discovering pulsars. We designed the {\it snapshot} observation mode for a FAST key science project, the Galactic Plane Pulsar Snapshot (GPPS) survey, in which every four nearby pointings can observe {\it a cover} of a sky patch of 0.1575 square degrees through beam-switching of the L-band 19-beam receiver. The integration time for each pointing is 300 seconds so that the GPPS observations for a cover can be made in 21 minutes. The goal of the GPPS survey is to discover pulsars within the Galactic latitude of $\pm10^{\circ}$ from the Galactic plane, and the highest priority is given to the inner Galaxy within $\pm5^{\circ}$. Up to now, the GPPS survey has discovered 201 pulsars, including currently the faintest pulsars which cannot be detected by other telescopes, pulsars with extremely high dispersion measures (DMs) which challenge the currently widely used models for the Galactic electron density distribution, pulsars coincident with supernova remnants, 40 millisecond pulsars, 16 binary pulsars, some nulling and mode-changing pulsars and rotating radio transients (RRATs). The follow-up observations for confirmation of new pulsars have polarization-signals recorded for polarization profiles of the pulsars. Re-detection of previously known pulsars in the survey data also leads to significant improvements in parameters for 64 pulsars. The GPPS survey discoveries are published and will be updated at http://zmtt.bao.ac.cn/GPPS/ .

astro-ph.HE↗

arXiv2020

VALMOD: A Suite for Easy and Exact Detection of Variable Length Motifs in Data Series

Data series motif discovery represents one of the most useful primitives for data series mining, with applications to many domains, such as robotics, entomology, seismology, medicine, and climatology, and others. The state-of-the-art motif discovery tools still require the user to provide the motif length. Yet, in several cases, the choice of motif length is critical for their detection. Unfortunately, the obvious brute-force solution, which tests all lengths within a given range, is computationally untenable, and does not provide any support for ranking motifs at different resolutions (i.e., lengths). We demonstrate VALMOD, our scalable motif discovery algorithm that efficiently finds all motifs in a given range of lengths, and outputs a length-invariant ranking of motifs. Furthermore, we support the analysis process by means of a newly proposed meta-data structure that helps the user to select the most promising pattern length. This demo aims at illustrating in detail the steps of the proposed approach, showcasing how our algorithm and corresponding graphical insights enable users to efficiently identify the correct motifs. (Paper published in ACM Sigmod Conference 2018.)

cs.DB↗

arXiv2020

Matrix Profile Goes MAD: Variable-Length Motif And Discord Discovery in Data Series

In the last fifteen years, data series motif and discord discovery have emerged as two useful and well-used primitives for data series mining, with applications to many domains, including robotics, entomology, seismology, medicine, and climatology. Nevertheless, the state-of-the-art motif and discord discovery tools still require the user to provide the relative length. Yet, in several cases, the choice of length is critical and unforgiving. Unfortunately, the obvious brute-force solution, which tests all lengths within a given range, is computationally untenable. In this work, we introduce a new framework, which provides an exact and scalable motif and discord discovery algorithm that efficiently finds all motifs and discords in a given range of lengths. We evaluate our approach with five diverse real datasets, and demonstrate that it is up to 20 times faster than the state-of-the-art. Our results also show that removing the unrealistic assumption that the user knows the correct length, can often produce more intuitive and actionable results, which could have otherwise been missed. (Paper published in Data Mining and Knowledge Discovery Journal - 2020)

cs.DB↗

arXiv2020

Time-based Sequence Model for Personalization and Recommendation Systems

In this paper we develop a novel recommendation model that explicitly incorporates time information. The model relies on an embedding layer and TSL attention-like mechanism with inner products in different vector spaces, that can be thought of as a modification of multi-headed attention. This mechanism allows the model to efficiently treat sequences of user behavior of different length. We study the properties of our state-of-the-art model on statistically designed data set. Also, we show that it outperforms more complex models with longer sequence length on the Taobao User Behavior dataset.

cs.IR↗

arXiv2020

Tight relative $t$-designs on two shells in hypercubes, and Hahn and Hermite polynomials

Relative $t$-designs in the $n$-dimensional hypercube $\mathcal{Q}_n$ are equivalent to weighted regular $t$-wise balanced designs, which generalize combinatorial $t$-$(n,k,λ)$ designs by allowing multiple block sizes as well as weights. Partly motivated by the recent study on tight Euclidean $t$-designs on two concentric spheres, in this paper we discuss tight relative $t$-designs in $\mathcal{Q}_n$ supported on two shells. We show under a mild condition that such a relative $t$-design induces the structure of a coherent configuration with two fibers. Moreover, from this structure we deduce that a polynomial from the family of the Hahn hypergeometric orthogonal polynomials must have only integral simple zeros. The Terwilliger algebra is the main tool to establish these results. By explicitly evaluating the behavior of the zeros of the Hahn polynomials when they degenerate to the Hermite polynomials under an appropriate limit process, we prove a theorem which gives a partial evidence that the non-trivial tight relative $t$-designs in $\mathcal{Q}_n$ supported on two shells are rare for large $t$.

math.CO↗

arXiv2020

A Fast Radio Burst discovered in FAST drift scan survey

We report the discovery of a highly dispersed fast radio burst, FRB~181123, from an analysis of $\sim$1500~hr of drift-scan survey data taken using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The pulse has three distinct emission components, which vary with frequency across our 1.0--1.5~GHz observing band. We measure the peak flux density to be $>0.065$~Jy and the corresponding fluence $>0.2$~Jy~ms. Based on the observed dispersion measure of 1812~cm$^{-3}$~pc, we infer a redshift of $\sim 1.9$. From this, we estimate the peak luminosity and isotropic energy to be $\lesssim 2\times10^{43}$~erg~s$^{-1}$ and $\lesssim 2\times10^{40}$~erg, respectively. With only one FRB from the survey detected so far, our constraints on the event rate are limited. We derive a 95\% confidence lower limit for the event rate of 900 FRBs per day for FRBs with fluences $>0.025$~Jy~ms. We performed follow-up observations of the source with FAST for four hours and have not found a repeated burst. We discuss the implications of this discovery for our understanding of the physical mechanisms of FRBs.

astro-ph.HE↗

arXiv2020

First SETI Observations with China's Five-hundred-meter Aperture Spherical radio Telescope (FAST)

The Search for Extraterrestrial Intelligence (SETI) attempts to address the possibility of the presence of technological civilizations beyond the Earth. Benefiting from high sensitivity, large sky coverage, an innovative feed cabin for China's Five-hundred-meter Aperture Spherical radio Telescope (FAST), we performed the SETI first observations with FAST's newly commisioned 19-beam receiver; we report preliminary results in this paper. Using the data stream produced by the SERENDIP VI realtime multibeam SETI spectrometer installed at FAST, as well as its off-line data processing pipelines, we identify and remove four kinds of radio frequency interference(RFI): zone, broadband, multi-beam, and drifting, utilizing the Nebula SETI software pipeline combined with machine learning algorithms. After RFI mitigation, the Nebula pipeline identifies and ranks interesting narrow band candidate ET signals, scoring candidates by the number of times candidate signals have been seen at roughly the same sky position and same frequency, signal strength, proximity to a nearby star or object of interest, along with several other scoring criteria. We show four example candidates groups that demonstrate these RFI mitigation and candidate selection. This preliminary testing on FAST data helps to validate our SETI instrumentation techniques as well as our data processing pipeline.

astro-ph.IM↗