Search arXiv⌕ Search

arXiv subjects

Xi Chen

Publications and source records attributed to Xi Chen.

At least 991 records · Page 55Linked to original sources

Autoregressive-Model-Based Methods for Online Time Series Prediction with Missing Values: an Experimental Evaluation

Time series prediction with missing values is an important problem of time series analysis since complete data is usually hard to obtain in many real-world applications. To model the generation of time series, autoregressive (AR) model is a basic and widely used one, which assumes that each observation in the time series is a noisy linear combination of some previous observations along with a constant shift. To tackle the problem of prediction with missing values, a number of methods were proposed based on various data models. For real application scenarios, how do these methods perform over different types of time series with different levels of data missing remains to be investigated. In this paper, we focus on online methods for AR-model-based time series prediction with missing values. We adapted five mainstream methods to fit in such a scenario. We make detailed discussion on each of them by introducing their core ideas about how to estimate the AR coefficients and their different strategies to deal with missing values. We also present algorithmic implementations for better understanding. In order to comprehensively evaluate these methods and do the comparison, we conduct experiments with various configurations of relative parameters over both synthetic and real data. From the experimental results, we derived several noteworthy conclusions and shows that imputation is a simple but reliable strategy to handle missing values in online prediction tasks.

stat.ML↗

A Lower Bound on Cycle-Finding in Sparse Digraphs

We consider the problem of finding a cycle in a sparse directed graph $G$ that is promised to be far from acyclic, meaning that the smallest feedback arc set in $G$ is large. We prove an information-theoretic lower bound, showing that for $N$-vertex graphs with constant outdegree any algorithm for this problem must make $\tildeΩ(N^{5/9})$ queries to an adjacency list representation of $G$. In the language of property testing, our result is an $\tildeΩ(N^{5/9})$ lower bound on the query complexity of one-sided algorithms for testing whether sparse digraphs with constant outdegree are far from acyclic. This is the first improvement on the $Ω(\sqrt{N})$ lower bound, implicit in Bender and Ron, which follows from a simple birthday paradox argument.

cs.DS↗

Lecture Notes of Tensor Network Contractions

Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum information science, statistical physics, and so on. In this lecture notes, we focus on the contraction algorithms of TN as well as some of the applications to the simulations of quantum many-body systems. Starting from basic concepts and definitions, we first explain the relations between TN and physical problems, including the TN representations of classical partition functions, quantum many-body states (by matrix product state, tree TN, and projected entangled pair state), time evolution simulations, etc. These problems, which are challenging to solve, can be transformed to TN contraction problems. We present then several paradigm algorithms based on the ideas of the numerical renormalization group and/or boundary states, including density matrix renormalization group, time-evolving block decimation, coarse-graining/corner tensor renormalization group, and several distinguished variational algorithms. Finally, we revisit the TN approaches from the perspective of multi-linear algebra (also known as tensor algebra or tensor decompositions) and quantum simulation. Despite the apparent differences in the ideas and strategies of different TN algorithms, we aim at revealing the underlying relations and resemblances in order to present a systematic picture to understand the TN contraction approaches.

physics.comp-ph↗

Nodal Curves on K3 Surfaces

In this paper, we study the Severi variety $V_{L,g}$ of genus $g$ curves in $|L|$ on a general polarized K3 surface $(X,L)$. We show that the closure of every component of $V_{L,g}$ contains a component of $V_{L,g-1}$. As a consequence, we see that the general members of every component of $V_{L,g}$ are nodal.

math.AG↗

Efficient average-case population recovery in the presence of insertions and deletions

Several recent works have considered the \emph{trace reconstruction problem}, in which an unknown source string $x\in\{0,1\}^n$ is transmitted through a probabilistic channel which may randomly delete coordinates or insert random bits, resulting in a \emph{trace} of $x$. The goal is to reconstruct the original string~$x$ from independent traces of $x$. While the best algorithms known for worst-case strings use $\exp(O(n^{1/3}))$ traces \cite{DOS17,NazarovPeres17}, highly efficient algorithms are known \cite{PZ17,HPP18} for the \emph{average-case} version, in which $x$ is uniformly random. We consider a generalization of this average-case trace reconstruction problem, which we call \emph{average-case population recovery in the presence of insertions and deletions}. In this problem, there is an unknown distribution $\cal{D}$ over $s$ unknown source strings $x^1,\dots,x^s \in \{0,1\}^n$, and each sample is independently generated by drawing some $x^i$ from $\cal{D}$ and returning an independent trace of $x^i$. Building on \cite{PZ17} and \cite{HPP18}, we give an efficient algorithm for this problem. For any support size $s \leq \smash{\exp(Θ(n^{1/3}))}$, for a $1-o(1)$ fraction of all $s$-element support sets $\{x^1,\dots,x^s\} \subset \{0,1\}^n$, for every distribution $\cal{D}$ supported on $\{x^1,\dots,x^s\}$, our algorithm efficiently recovers ${\cal D}$ up to total variation distance $ε$ with high probability, given access to independent traces of independent draws from $\cal{D}$. The algorithm runs in time poly$(n,s,1/ε)$ and its sample complexity is poly$(s,1/ε,\exp(\log^{1/3}n)).$ This polynomial dependence on the support size $s$ is in sharp contrast with the \emph{worst-case} version (when $x^1,\dots,x^s$ may be any strings in $\{0,1\}^n$), in which the sample complexity of the most efficient known algorithm \cite{BCFSS19} is doubly exponential in $s$.

cs.DS↗

Nearly optimal edge estimation with independent set queries

We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an independent set in $G$ or not. Our first main result is an algorithm that computes a $(1+ε)$-approximation of the number of edges $m$ of the graph using $\min(\sqrt{m},n / \sqrt{m})\cdot\textrm{poly}(\log n,1/ε)$ independent set queries. This improves the upper bound of $\min(\sqrt{m},n^2/m)\cdot\textrm{poly}(\log n,1/ε)$ by Beame et al. \cite{BHRRS18}. Our second main result shows that ${\min(\sqrt{m},n/\sqrt{m}))/\textrm{polylog}(n)}$ independent set queries are necessary, thus establishing that our algorithm is optimal up to a factor of $\textrm{poly}(\log n, 1/ε)$.

cs.DS↗

Freedericksz-like positional transition of a micro-droplet suspended in a nematic cell

In this paper, a Freedericksz-like positional transition is found for a spherical micro-droplet suspended in a nematic liquid crystal cell in the presence of an external electric field. Based on the numerical calculation of elastic energy using Green function method, the equilibrium position of micro-droplet is decided through a competition between the buoyant force and the effective force built by the elastic energy gradient existing inside the nematic liquid crystal(NLC) cell. It is shown that the elastic energy dominates the kinetics of micro-droplet until the external field applied reaches a critical value large enough to flatten the elastic energy contour in the central region, which enables the asymmetric buoyant force to drive the liquid droplet abruptly from the cell midplane to a new equilibrium position. It is also found that such a threshold value of external field, which triggers positional transition, depends on thickness $L$ and Frank elastic constant $K$, in a Freedericksz-like manner, but multiplied by a factor of $3\sqrtπ$. An explicit formula proposed for the critical electric field agrees extremely well with the numerical calculation.

cond-mat.soft↗

Evaluating Protein Transfer Learning with TAPE

Protein modeling is an increasingly popular area of machine learning research. Semi-supervised learning has emerged as an important paradigm in protein modeling due to the high cost of acquiring supervised protein labels, but the current literature is fragmented when it comes to datasets and standardized evaluation techniques. To facilitate progress in this field, we introduce the Tasks Assessing Protein Embeddings (TAPE), a set of five biologically relevant semi-supervised learning tasks spread across different domains of protein biology. We curate tasks into specific training, validation, and test splits to ensure that each task tests biologically relevant generalization that transfers to real-life scenarios. We benchmark a range of approaches to semi-supervised protein representation learning, which span recent work as well as canonical sequence learning techniques. We find that self-supervised pretraining is helpful for almost all models on all tasks, more than doubling performance in some cases. Despite this increase, in several cases features learned by self-supervised pretraining still lag behind features extracted by state-of-the-art non-neural techniques. This gap in performance suggests a huge opportunity for innovative architecture design and improved modeling paradigms that better capture the signal in biological sequences. TAPE will help the machine learning community focus effort on scientifically relevant problems. Toward this end, all data and code used to run these experiments are available at https://github.com/songlab-cal/tape.

cs.LG↗

Thermal expansion coefficient and lattice anharmonicity of cubic boron arsenide

Recent measurements of an unusual high thermal conductivity of around 1000 W m-1 K-1 at room temperature in cubic boron arsenide (BAs) confirm predictions from theory and suggest potential applications of this semiconductor compound for thermal management applications. Knowledge of the thermal expansion coefficient and Grüneisen parameter of a material contributes both to the fundamental understanding of its lattice anharmonicity and to assessing its utility as a thermal-management material. However, previous theoretical calculations of the thermal expansion coefficient and Grüneisen parameter of BAs yield inconsistent results. Here we report the linear thermal expansion coefficient of BAs obtained from the X-ray diffraction measurements from 300 K to 773 K. The measurement results are in good agreement with our ab initio calculations that account for atomic interactions up to fifth nearest neighbours. With the measured thermal expansion coefficient and specific heat, a Grüneisen parameter of BAs of 0.84 +/- 0.09 is obtained at 300 K, in excellent agreement with the value of 0.82 calculated from first principles and much lower than prior theoretical results. Our results confirm that BAs exhibits a better thermal expansion coefficient match with commonly used semiconductors than other high-thermal conductivity materials such as diamond and cubic boron nitride.

cond-mat.mtrl-sci↗

A 6.7 GHz Methanol Maser Survey II. Low Galactic Latitudes

We report the results of our systematic survey for Galactic 6.7 GHz Class II CH$_3$OH maser emission toward a sample of young stellar objects. The survey was conducted with the Shanghai Tianma Radio Telescope (TMRT). The sample consists of 3348 sources selected from the all-sky \emph{Wide-Field Infrared Survey Explorer (WISE)} point source catalog. We have discussed the selection criteria in detail and the detection results of those at high Galactic latitudes (i.e. $|b|>$ 2$^\circ$) in a previous paper (paper I). Here, we present the results from the survey of those at low Galactic latitudes, i.e. $|b|<2^\circ$. Of 1875 selected \emph{WISE} point sources, 291 positions that were actually associated with 224 sources were detected with CH$_3$OH maser emission. Among them, 32 are newly detected. Majority of the newly detected sources are associated with bright WISE sources. The majority of the detected sources (209/224 = 93.3\%) are quite close to the Galactic Plane ($|b|<1^\circ$) and lie on the inner spiral arms with positive LSR velocities. Detection rate and the color-color distribution of our detection are all matched with our anticipation. Combining with detections from previous surveys, we compile a catalogue of 1085 sources with 6.7 GHz CH$_3$OH maser emission in our Galaxy.

astro-ph.GA↗

ZAIGA: Zhaoshan Long-baseline Atom Interferometer Gravitation Antenna

The Zhaoshan long-baseline Atom Interferometer Gravitation Antenna (ZAIGA) is a new type of underground laser-linked interferometer facility, and is currently under construction. It is in the 200-meter-on-average underground of a mountain named Zhaoshan which is about 80 km southeast to Wuhan. ZAIGA will be equipped with long-baseline atom interferometers, high-precision atom clocks, and large-scale gyros. ZAIGA facility will take an equilateral triangle configuration with two 1-km-apart atom interferometers in each arm, a 300-meter vertical tunnel with atom fountain and atom clocks mounted, and a tracking-and-ranging 1-km-arm-length prototype with lattice optical clocks linked by locked lasers. The ZAIGA facility will be used for experimental research on gravitation and related problems including gravitational wave detection, high-precision test of the equivalence principle of micro-particles, clock based gravitational red-shift measurement, rotation measurement and gravito-magnetic effect.

physics.atom-ph↗

Sequence Modeling of Temporal Credit Assignment for Episodic Reinforcement Learning

Recent advances in deep reinforcement learning algorithms have shown great potential and success for solving many challenging real-world problems, including Go game and robotic applications. Usually, these algorithms need a carefully designed reward function to guide training in each time step. However, in real world, it is non-trivial to design such a reward function, and the only signal available is usually obtained at the end of a trajectory, also known as the episodic reward or return. In this work, we introduce a new algorithm for temporal credit assignment, which learns to decompose the episodic return back to each time-step in the trajectory using deep neural networks. With this learned reward signal, the learning efficiency can be substantially improved for episodic reinforcement learning. In particular, we find that expressive language models such as the Transformer can be adopted for learning the importance and the dependency of states in the trajectory, therefore providing high-quality and interpretable learned reward signals. We have performed extensive experiments on a set of MuJoCo continuous locomotive control tasks with only episodic returns and demonstrated the effectiveness of our algorithm.

cs.LG↗

Carbon-Chain Molecules in Molecular Outflows and Lupus I Region--New Producing Region and New Forming Mechanism

Using the new equipment of the Shanghai Tian Ma Radio Telescope, we have searched for carbon-chain molecules (CCMs) towards five outflow sources and six Lupus I starless dust cores, including one region known to be characterized by warm carbon-chain chemistry (WCCC), Lupus I-1 (IRAS 15398-3359), and one TMC-1 like cloud, Lupus I-6 (Lupus-1A). Lines of HC3N J=2-1, HC5N J=6-5, HC7N J=14-13, 15-14, 16-15 and C3S J=3-2 were detected in all the targets except in the outflow source L1660 and the starless dust core Lupus I-3/4. The column densities of nitrogen-bearing species range from 10$^{12}$ to 10$^{14}$ cm$^{-2}$ and those of C$_3$S are about 10$^{12}$ cm$^{-2}$. Two outflow sources, I20582+7724 and L1221, could be identified as new carbon-chain--producing regions. Four of the Lupus I dust cores are newly identified as early quiescent and dark carbon-chain--producing regions similar to Lup I-6, which together with the WCCC source, Lup I-1, indicate that carbon-chain-producing regions are popular in Lupus I which can be regard as a Taurus like molecular cloud complex in our Galaxy. The column densities of C3S are larger than those of HC7N in the three outflow sources I20582, L1221 and L1251A. Shocked carbon-chain chemistry (SCCC) is proposed to explain the abnormal high abundances of C3S compared with those of nitrogen-bearing CCMs. Gas-grain chemical models support the idea that shocks can fuel the environment of those sources with enough $S^+$ thus driving the generation of S-bearing CCMs.

astro-ph.SR↗

CLEAR: Coverage-based Limiting-cell Experiment Analysis for RNA-seq

Direct cDNA preamplification protocols developed for single-cell RNA-seq have enabled transcriptome profiling of precious clinical samples and rare cells without sample pooling or RNA extraction. Currently, there is no algorithm optimized to reveal and remove noisy transcripts in limiting-cell RNA-seq (lcRNA-seq) data for downstream analyses. Herein, we present CLEAR, a workflow that identifies reliably quantifiable transcripts in lcRNA-seq data for differentially expressed gene (DEG) analysis. Libraries at three input amounts of FACS-derived CD5+ and CD5- cells from a chronic lymphocytic leukemia patient were used to develop CLEAR. When using CLEAR transcripts vs. using all transcripts, downstream analyses revealed more shared transcripts across different input RNA amounts, improved Principal Component Analysis (PCA) separation, and yielded more DEGs between cell types. As proof-of-principle, CLEAR was applied to an in-house lcRNA-seq dataset and two public datasets. When imputation is used, CLEAR is also adaptable to large clinical studies and for single cell analyses.

q-bio.GN↗

Experimental Cryptographic Verification for Near-Term Quantum Cloud Computing

Recently, there are more and more organizations offering quantum-cloud services, where any client can access a quantum computer remotely through the internet. In the near future, these cloud servers may claim to offer quantum computing power out of reach of classical devices. An important task is to make sure that there is a real quantum computer running, instead of a simulation by a classical device. Here we explore the applicability of a cryptographic verification scheme that avoids the need of implementing a full quantum algorithm or requiring the clients to communicate with quantum resources. In this scheme, the client encodes a secret string in a scrambled IQP (instantaneous quantum polynomial) circuit sent to the quantum cloud in the form of classical message, and verify the computation by checking the probability bias of a class of output strings generated by the server. We provided a theoretical extension and implemented the scheme on a 5-qubit NMR quantum processor in the laboratory and a 5-qubit and 16-qubit processors of the IBM quantum cloud. We found that the experimental results of the NMR processor can be verified by the scheme with about $2.5\%$ error, after noise compensation by standard techniques. However, the fidelity of the IBM quantum cloud is currently too low to pass the test (about $42\%$ error). This verification scheme shall become practical when servers claim to offer quantum-computing resources that can achieve quantum supremacy.

quant-ph↗

A particular carbon-chain-producing region: L1489 starless core

We detected carbon-chain molecules (CCMs) HC2n+1N (n=1-3) and C3S in Ku band as well as {high-energy excitation lines including C4H N=9-8, J=17/2-15/2, 19/2-17/2, and CH3CCH J=5-4, K=2 in the 3 mm band toward a starless core called the eastern molecular core (EMC) of L1489 IRS. Maps of all the observed lines were also obtained. Comparisons with a number of early starless cores and WCCC source L1527 show that the column densities of C4H and CH3CCH are close to those of L1527, and the CH3CCH column densities of the EMC and L1527 are slightly higher than those of TMC-1. The EMC and L1527 have similar C3S column densities, but they are much lower than those of all the starless cores, with only 6.5% and 10% of the TMC-1 value, respectively. The emissions of the N-bearing species of the EMC and L1527 are at the medium level of the starless cores. These comparisons show that the CCM emissions in the EMC are similar to those of L1527, though L1527 contains a protostar. Although dark and quiescent, the EMC is warmer and at a later evolutionary stage than classical carbon-chain--producing regions in the cold, dark, quiescent early phase. The PACS, SPIRE, and SCUBA maps evidently show that the L1489 IRS seems to be the heating source of the EMC. Although it is located at the margins of the EMC, its bolometric luminosity and bolometric temperature are relatively high. Above all, the EMC is a rather particular carbon-chain-producing region and is quite significant for CCM science.

astro-ph.SR↗

Input Modeling and Uncertainty Quantification for Improving Volatile Residential Load Forecasting

Load forecasting has long been recognized as an important building block for all utility operational planning efforts. Over the recent years, it has become ever more challenging to make accurate forecasts due to the proliferation of distributed energy resources, despite the abundance of existing load forecasting methods. In this paper, we identify one drawback suffered by most load forecasting methods: neglect to thoroughly address the impact of input errors on load forecasts. As a potential solution, we propose to incorporate input modeling and uncertainty quantification to improve load forecasting performance via a two-stage approach. The proposed two-stage approach has the following merits. (1) It provides input modeling and quantifies the impact of input errors, rather than neglecting or mitigating the impact, a prevalent practice of existing methods. (2) It propagates the impact of input errors into the ultimate point and interval predictions for the target customer's load to improve predictive performance. (3) A variance-based global sensitivity analysis method is further proposed for input-space dimensionality reduction in both stages to enhance the computational efficiency. Numerical experiments show that the proposed two-stage approach outperforms competing load forecasting methods in terms of both point predictive accuracy and coverage ability of the predictive intervals.

eess.SY↗

Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Design

Flow-based generative models are powerful exact likelihood models with efficient sampling and inference. Despite their computational efficiency, flow-based models generally have much worse density modeling performance compared to state-of-the-art autoregressive models. In this paper, we investigate and improve upon three limiting design choices employed by flow-based models in prior work: the use of uniform noise for dequantization, the use of inexpressive affine flows, and the use of purely convolutional conditioning networks in coupling layers. Based on our findings, we propose Flow++, a new flow-based model that is now the state-of-the-art non-autoregressive model for unconditional density estimation on standard image benchmarks. Our work has begun to close the significant performance gap that has so far existed between autoregressive models and flow-based models. Our implementation is available at https://github.com/aravindsrinivas/flowpp

cs.LG↗