arXiv subjects

Xi Chen

Publications and source records attributed to Xi Chen.

At least 829 records · Page 46Linked to original sources

arXiv2021

Nonadiabatic control of quantum transport fidelity in dissipative cold media

We put forth a hitherto unexplored control strategy that enables finite-speed, high-fidelity transport of a quantum wavepacket through a low-temperature dissipative medium. The control consists in confining the wavepacket within a shallow anharmonic trap (tweezer), whose nonuniform velocity is steered so as to maximize the transfer fidelity between two locations. A relevant scenario is a quantum impurity moving through an ultracold gas. Unlike shortcuts to adiabaticity, our approach can simultaneously cope with wavepacket leakage via non-adiabatic and phonon-mediated processes, provided both act perturbatively. Nor does our approach require the application of compensating forces or counter-diabatic fields and thereby avoids the practical shortcomings of shortcut techniques. Instead, optimal (highest fidelity) transport is achieved here by minimizing the functional overlap of the varying velocity-spectrum of the chosen trajectory with the combined (bath-induced and non-adiabatic) leakage spectrum.

quant-ph↗

arXiv2021

Active Learning for the Optimal Design of Multinomial Classification in Physics

Optimal design for model training is a critical topic in machine learning. Active Learning aims at obtaining improved models by querying samples with maximum uncertainty according to the estimation model for artificially labeling; this has the additional advantage of achieving successful performances with a reduced number of labeled samples. We analyze its capability as an assistant for the design of experiments, extracting maximum information for learning with the minimal cost in fidelity loss, or reducing total operation costs of labeling in the laboratory. We present two typical applications as quantum information retrieval in qutrits and phase boundary prediction in many-body physics. For an equivalent multinomial classification problem, we achieve the correct rate of 99% with less than 2% samples labeled. We reckon that active-learning-inspired physics experiments will remarkably save budget without loss of accuracy.

quant-ph↗

arXiv2021

Deep Learning based Model-free Robust Load Restoration to Enhance Bulk System Resilience with Wind Power Penetration

This paper proposes a new deep learning (DL) based model-free robust method for bulk system on-line load restoration with high penetration of wind power. Inspired by the iterative calculation of the two-stage robust load restoration model, the deep neural network (DNN) and deep convolutional neural network (CNN) are respectively designed to find the worst-case system condition of a load pickup decision and evaluate the corresponding security. In order to find the optimal result within a limited number of checks, a load pickup checklist generation (LPCG) algorithm is developed to ensure the optimality. Then, the fast robust load restoration strategy acquisition is achieved based on the designed one-line strategy generation (OSG) algorithm. The proposed method finds the optimal result in a model-free way, holds the robustness to handle uncertainties, and provides real-time computation. It can completely replace conventional robust optimization and supports on-line robust load restoration which better satisfies the changeable restoration process. The effectiveness of the proposed method is validated using the IEEE 30-bus system and the IEEE 118-bus system, showing high computational efficiency and considerable accuracy.

eess.SY↗

arXiv2021

Predicting isocitrate dehydrogenase mutation status in glioma using structural brain networks and graph neural networks

Glioma is a common malignant brain tumor with distinct survival among patients. The isocitrate dehydrogenase (IDH) gene mutation provides critical diagnostic and prognostic value for glioma. It is of crucial significance to non-invasively predict IDH mutation based on pre-treatment MRI. Machine learning/deep learning models show reasonable performance in predicting IDH mutation using MRI. However, most models neglect the systematic brain alterations caused by tumor invasion, where widespread infiltration along white matter tracts is a hallmark of glioma. Structural brain network provides an effective tool to characterize brain organisation, which could be captured by the graph neural networks (GNN) to more accurately predict IDH mutation. Here we propose a method to predict IDH mutation using GNN, based on the structural brain network of patients. Specifically, we firstly construct a network template of healthy subjects, consisting of atlases of edges (white matter tracts) and nodes (cortical/subcortical brain regions) to provide regions of interest (ROIs). Next, we employ autoencoders to extract the latent multi-modal MRI features from the ROIs of edges and nodes in patients, to train a GNN architecture for predicting IDH mutation. The results show that the proposed method outperforms the baseline models using the 3D-CNN and 3D-DenseNet. In addition, model interpretation suggests its ability to identify the tracts infiltrated by tumor, corresponding to clinical prior knowledge. In conclusion, integrating brain networks with GNN offers a new avenue to study brain lesions using computational neuroscience and computer vision approaches.

eess.IV↗

arXiv2021

Differential Privacy in Personalized Pricing with Nonparametric Demand Models

In the recent decades, the advance of information technology and abundant personal data facilitate the application of algorithmic personalized pricing. However, this leads to the growing concern of potential violation of privacy due to adversarial attack. To address the privacy issue, this paper studies a dynamic personalized pricing problem with \textit{unknown} nonparametric demand models under data privacy protection. Two concepts of data privacy, which have been widely applied in practices, are introduced: \textit{central differential privacy (CDP)} and \textit{local differential privacy (LDP)}, which is proved to be stronger than CDP in many cases. We develop two algorithms which make pricing decisions and learn the unknown demand on the fly, while satisfying the CDP and LDP gurantees respectively. In particular, for the algorithm with CDP guarantee, the regret is proved to be at most $\tilde O(T^{(d+2)/(d+4)}+\varepsilon^{-1}T^{d/(d+4)})$. Here, the parameter $T$ denotes the length of the time horizon, $d$ is the dimension of the personalized information vector, and the key parameter $\varepsilon>0$ measures the strength of privacy (smaller $\varepsilon$ indicates a stronger privacy protection). On the other hand, for the algorithm with LDP guarantee, its regret is proved to be at most $\tilde O(\varepsilon^{-2/(d+2)}T^{(d+1)/(d+2)})$, which is near-optimal as we prove a lower bound of $Ω(\varepsilon^{-2/(d+2)}T^{(d+1)/(d+2)})$ for any algorithm with LDP guarantee.

stat.ML↗

arXiv2021

Risk-Adjusted Valuation for Real Option Decisions

We model investor heterogeneity using different required returns on an investment and evaluate the impact on the valuation of an investment. By assuming no disagreement on the cash flows, we emphasize how risk preferences in particular, but also the costs of capital, influence a subjective evaluation of the decision to invest now or retain the option to invest in future. We propose a risk-adjusted valuation model to facilitate investors' subjective decision making, in response to the market valuation of an investment opportunity. The investor's subjective assessment arises from their perceived misvaluation of the investment by the market, so projected cash flows are discounted using two different rates representing the investor's and the market's view. This liberates our model from perfect or imperfect hedging assumptions and instead, we are able to illustrate the hedging effect on the real option value when perceptions of risk premia diverge. During crises periods, delaying an investment becomes more valuable as the idiosyncratic risk of future cash flows increases, but the decision-maker may rush to invest too quickly when the risk level is exceptionally high. Our model verifies features established by classical real-option valuation models and provides many new insights about the importance of modelling divergences in decision-makers risk premia, especially during crisis periods. It also has many practical advantages because it requires no more parameter inputs than basic discounted cash flow approaches, such as the marketed asset disclaimer method, but the outputs are much richer. They allow for complex interactions between cost and revenue uncertainties as well as an easy exploration of the effects of hedgeable and un-hedgeable risks on the real option value. Furthermore, we provide fully-adjustable Python code in which all parameter values can be chosen by the user.

q-fin.GN↗

arXiv2021

Near-Optimal Average-Case Approximate Trace Reconstruction from Few Traces

In the standard trace reconstruction problem, the goal is to \emph{exactly} reconstruct an unknown source string $\mathsf{x} \in \{0,1\}^n$ from independent "traces", which are copies of $\mathsf{x}$ that have been corrupted by a $δ$-deletion channel which independently deletes each bit of $\mathsf{x}$ with probability $δ$ and concatenates the surviving bits. We study the \emph{approximate} trace reconstruction problem, in which the goal is only to obtain a high-accuracy approximation of $\mathsf{x}$ rather than an exact reconstruction. We give an efficient algorithm, and a near-matching lower bound, for approximate reconstruction of a random source string $\mathsf{x} \in \{0,1\}^n$ from few traces. Our main algorithmic result is a polynomial-time algorithm with the following property: for any deletion rate $0 < δ< 1$ (which may depend on $n$), for almost every source string $\mathsf{x} \in \{0,1\}^n$, given any number $M \leq Θ(1/δ)$ of traces from $\mathrm{Del}_δ(\mathsf{x})$, the algorithm constructs a hypothesis string $\widehat{\mathsf{x}}$ that has edit distance at most $n \cdot (δM)^{Ω(M)}$ from $\mathsf{x}$. We also prove a near-matching information-theoretic lower bound showing that given $M \leq Θ(1/δ)$ traces from $\mathrm{Del}_δ(\mathsf{x})$ for a random $n$-bit string $\mathsf{x}$, the smallest possible expected edit distance that any algorithm can achieve, regardless of its running time, is $n \cdot (δM)^{O(M)}$.

cs.DS↗

arXiv2021

Speed-up Quantum Perceptron via Shortcuts to Adiabaticity

The quantum perceptron is a fundamental building block for quantum machine learning. This is a multidisciplinary field that incorporates abilities of quantum computing, such as state superposition and entanglement, to classical machine learning schemes. Motivated by the techniques of shortcuts to adiabaticity, we propose a speed-up quantum perceptron where a control field on the perceptron is inversely engineered leading to a rapid nonlinear response with a sigmoid activation function. This results in faster overall perceptron performance compared to quasi-adiabatic protocols, as well as in enhanced robustness against imperfections in the controls.

quant-ph↗

arXiv2021

Adaptive unsupervised learning with enhanced feature representation for intra-tumor partitioning and survival prediction for glioblastoma

Glioblastoma is profoundly heterogeneous in regional microstructure and vasculature. Characterizing the spatial heterogeneity of glioblastoma could lead to more precise treatment. With unsupervised learning techniques, glioblastoma MRI-derived radiomic features have been widely utilized for tumor sub-region segmentation and survival prediction. However, the reliability of algorithm outcomes is often challenged by both ambiguous intermediate process and instability introduced by the randomness of clustering algorithms, especially for data from heterogeneous patients. In this paper, we propose an adaptive unsupervised learning approach for efficient MRI intra-tumor partitioning and glioblastoma survival prediction. A novel and problem-specific Feature-enhanced Auto-Encoder (FAE) is developed to enhance the representation of pairwise clinical modalities and therefore improve clustering stability of unsupervised learning algorithms such as K-means. Moreover, the entire process is modelled by the Bayesian optimization (BO) technique with a custom loss function that the hyper-parameters can be adaptively optimized in a reasonably few steps. The results demonstrate that the proposed approach can produce robust and clinically relevant MRI sub-regions and statistically significant survival predictions.

cs.LG↗

arXiv2021

PRASEMap: A Probabilistic Reasoning and Semantic Embedding based Knowledge Graph Alignment System

Knowledge Graph (KG) alignment aims at finding equivalent entities and relations (i.e., mappings) between two KGs. The existing approaches utilize either reasoning-based or semantic embedding-based techniques, but few studies explore their combination. In this demonstration, we present PRASEMap, an unsupervised KG alignment system that iteratively computes the Mappings with both Probabilistic Reasoning (PR) And Semantic Embedding (SE) techniques. PRASEMap can support various embedding-based KG alignment approaches as the SE module, and enables easy human computer interaction that additionally provides an option for users to feed the mapping annotations back to the system for better results. The demonstration showcases these features via a stand-alone Web application with user friendly interfaces. The demo is available at https://prasemap.qizhy.com.

cs.CL↗

arXiv2021

Machine learning force fields based on local parametrization of dispersion interactions: Application to the phase diagram of C$_{60}$

We present a comprehensive methodology to enable addition of van der Waals (vdW) corrections to machine learning (ML) atomistic force fields. Using a Gaussian approximation potential (GAP) [Bartók et al., Phys. Rev. Lett. 104, 136403 (2010)] as baseline, we accurately machine learn a local model of atomic polarizabilities based on Hirshfeld volume partitioning of the charge density [Tkatchenko and Scheffler, Phys. Rev. Lett. 102, 073005 (2009)]. These environment-dependent polarizabilities are then used to parametrize a screened London-dispersion approximation to the vdW interactions. Our ML vdW model only needs to learn the charge density partitioning implicitly, by learning the reference Hirshfeld volumes from density functional theory (DFT). In practice, we can predict accurate Hirshfeld volumes from the knowledge of the local atomic environment (atomic positions) alone, making the model highly computationally efficient. For additional efficiency, our ML model of atomic polarizabilities reuses the same many-body atomic descriptors used for the underlying GAP learning of bonded interatomic interactions. We also show how the method enables straightforward computation of gradients of the observables, even when these remain challenging for the reference method (e.g., calculating gradients of the Hirshfeld volumes in DFT). Finally, we demonstrate the approach by studying the phase diagram of C$_{60}$, where vdW effects are important. The need for a highly accurate vdW-inclusive reactive force field is highlighted by modeling the decomposition of the C$_{60}$ molecules taking place at high pressures and temperatures.

cond-mat.mtrl-sci↗

arXiv2021

Privacy-Preserving Dynamic Personalized Pricing with Demand Learning

The prevalence of e-commerce has made detailed customers' personal information readily accessible to retailers, and this information has been widely used in pricing decisions. When involving personalized information, how to protect the privacy of such information becomes a critical issue in practice. In this paper, we consider a dynamic pricing problem over $T$ time periods with an \emph{unknown} demand function of posted price and personalized information. At each time $t$, the retailer observes an arriving customer's personal information and offers a price. The customer then makes the purchase decision, which will be utilized by the retailer to learn the underlying demand function. There is potentially a serious privacy concern during this process: a third party agent might infer the personalized information and purchase decisions from price changes from the pricing system. Using the fundamental framework of differential privacy from computer science, we develop a privacy-preserving dynamic pricing policy, which tries to maximize the retailer revenue while avoiding information leakage of individual customer's information and purchasing decisions. To this end, we first introduce a notion of \emph{anticipating} $(\varepsilon, δ)$-differential privacy that is tailored to dynamic pricing problem. Our policy achieves both the privacy guarantee and the performance guarantee in terms of regret. Roughly speaking, for $d$-dimensional personalized information, our algorithm achieves the expected regret at the order of $\tilde{O}(\varepsilon^{-1} \sqrt{d^3 T})$, when the customers' information is adversarially chosen. For stochastic personalized information, the regret bound can be further improved to $\tilde{O}(\sqrt{d^2T} + \varepsilon^{-2} d^2)$

cs.CR↗

arXiv2021

BrainNetGAN: Data augmentation of brain connectivity using generative adversarial network for dementia classification

Alzheimer's disease (AD) is the most common age-related dementia. It remains a challenge to identify the individuals at risk of dementia for precise management. Brain MRI offers a noninvasive biomarker to detect brain aging. Previous evidence shows that the brain structural change detected by diffusion MRI is associated with dementia. Mounting studies has conceptualised the brain as a complex network, which has shown the utility of this approach in characterising various neurological and psychiatric disorders. Therefore, the structural connectivity shows promise in dementia classification. The proposed BrainNetGAN is a generative adversarial network variant to augment the brain structural connectivity matrices for binary dementia classification tasks. Structural connectivity matrices between separated brain regions are constructed using tractography on diffusion MRI data. The BrainNetGAN model is trained to generate fake brain connectivity matrices, which are expected to reflect latent distribution of the real brain network data. Finally, a convolutional neural network classifier is proposed for binary dementia classification. Numerical results show that the binary classification performance in the testing set was improved using the BrainNetGAN augmented dataset. The proposed methodology allows quick synthesis of an arbitrary number of augmented connectivity matrices and can be easily transferred to similar classification tasks.

cs.LG↗

arXiv2021

Superconvergent pseudostress-velocity finite element methods for the Oseen and Navier-Stokes equations

We present a priori and superconvergence error estimates of mixed finite element methods for the pseudostress-velocity formulation of the Oseen equation. In particular, we derive superconvergence estimates for the velocity and a priori error estimates under unstructured grids, and obtain superconvergence results for the pseudostress under certain structured grids. A variety of numerical experiments validate the theoretical results and illustrate the effectiveness of the superconvergent recovery-based adaptive mesh refinement. It is also numerically shown that the proposed postprocessing yields apparent superconvergence in a benchmark problem for the incompressible Navier--Stokes equation.

math.NA↗

arXiv2021

On-chip optical levitation with a metalens in vacuum

Optical levitation of dielectric particles in vacuum is a powerful technique for precision measurements, testing fundamental physics, and quantum information science. Conventional optical tweezers require bulky optical components for trapping and detection. Here we design and fabricate an ultrathin dielectric metalens with a high numerical aperture of 0.88 at 1064 nm in vacuum. It consists of 500 nm-thick silicon nano-antennas, which are compatible with ultrahigh vacuum. We demonstrate optical levitation of nanoparticles in vacuum with a single metalens. The trapping frequency can be tuned by changing the laser power and polarization. We also transfer a levitated nanoparticle between two separated optical tweezers. Optical levitation with an ultrathin metalens in vacuum provides opportunities for a wide range of applications including on-chip sensing. Such metalenses will also be useful for trapping ultacold atoms and molecules.

physics.optics↗

arXiv2021

Effective Scaling Approach to Frictionless Quantum Quenches in Trapped Bose Gases

We work out the effective scaling approach to frictionless quantum quenches in a one-dimensional Bose gas trapped in a harmonic trap. The effective scaling approach produces an auxiliary equation for the scaling parameter interpolating between the noninteracting and the Thomas-Fermi limits. This allows us to implement a frictionless quench by engineering inversely the smooth trap frequency, as compared to the two-jump trajectory. Our result is beneficial to design the shortcut-to-adiabaticity expansion of trapped Bose gases for arbitrary values of interaction, and can be directly extended to the three-dimensional case.

cond-mat.quant-gas↗

arXiv2021

Expectation-Maximization Regularized Deep Learning for Weakly Supervised Tumor Segmentation for Glioblastoma

We present an Expectation-Maximization (EM) Regularized Deep Learning (EMReDL) model for weakly supervised tumor segmentation. The proposed framework is tailored to glioblastoma, a type of malignant tumor characterized by its diffuse infiltration into the surrounding brain tissue, which poses significant challenge to treatment target and tumor burden estimation using conventional structural MRI. Although physiological MRI provides more specific information regarding tumor infiltration, the relatively low resolution hinders a precise full annotation. This has motivated us to develop a weakly supervised deep learning solution that exploits the partial labelled tumor regions. EMReDL contains two components: a physiological prior prediction model and EM-regularized segmentation model. The physiological prior prediction model exploits the physiological MRI by training a classifier to generate a physiological prior map. This map is passed to the segmentation model for regularization using the EM algorithm. We evaluated the model on a glioblastoma dataset with the pre-operative multiparametric and recurrence MRI available. EMReDL showed to effectively segment the infiltrated tumor from the partially labelled region of potential infiltration. The segmented core tumor and infiltrated tumor demonstrated high consistency with the tumor burden labelled by experts. The performance comparisons showed that EMReDL achieved higher accuracy than published state-of-the-art models. On MR spectroscopy, the segmented region displayed more aggressive features than other partial labelled region. The proposed model can be generalized to other segmentation tasks that rely on partial labels, with the CNN architecture flexible in the framework.

eess.IV↗

arXiv2021

Computational Hardness of the Hylland-Zeckhauser Scheme

We study the complexity of the classic Hylland-Zeckhauser scheme [HZ'79] for one-sided matching markets. We show that the problem of finding an $ε$-approximate equilibrium in the HZ scheme is PPAD-hard, and this holds even when $ε$ is polynomially small and when each agent has no more than four distinct utility values. Our hardness result, when combined with the PPAD membership result of [VY'21], resolves the approximation complexity of the HZ scheme. We also show that the problem of approximating the optimal social welfare (the weight of the matching) achievable by HZ equilibria within a certain constant factor is NP-hard.

cs.GT↗