BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yun Li

Yun Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Computer VisionMachine Learningmath.PRApplicationsComputation and LanguageMethodologyArtificial Intelligencecond-mat.mes-halleess.SYphysics.soc-phSystems and Controlcond-mat.mtrl-scieess.IVeess.SPhep-exhep-phInformation Retrievalmath-phmath.MPmath.OCNetworking and Internet Architecturephysics.ao-phPopulations and Evolutionquant-ph

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
24works
0followers
24topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

24 published item(s)

preprint2026arXiv

Edge-Cloud Collaborative Reconstruction via Structure-Aware Latent Diffusion for Downstream Remote Sensing Perception

The exponential surge in high-resolution remote sensing data faces a severe bottleneck in satellite-to-ground transmission. Limited downlink bandwidth forces the use of extreme high-ratio compression, which irreversibly destroys high-frequency structural details essential for downstream machine perception tasks like object detection. While current super-resolution techniques attempt to recover these details, regression-based methods often yield over-smoothed textures, and generative diffusion models frequently introduce structural hallucinations that mislead detection systems. To address this trade-off, we propose the Structure-Aware Latent Diffusion (SALD) framework, an asymmetric edge-cloud collaborative SR system. At the resource-constrained edge, the system decouples imagery into a highly compressed low-frequency payload and a lightweight soft structural prior. Transmitting this decoupled representation minimizes bandwidth consumption. On the powerful cloud side, we introduce a Structure-Gated Large Kernel (SGLK) module and a Semantic-Guidance Engine (SGE) within the diffusion backbone. These modules leverage the transmitted structural priors to gate large-kernel convolutions, effectively capturing long-range dependencies inherent in aerial scenes while actively suppressing generative hallucinations. Extensive experiments on both the MSCM and UCMerced datasets demonstrate that, even under extreme bandwidth constraints, SALD achieves superior perceptual quality (LPIPS) and significantly enhances downstream performance in both scene classification and small-target detection.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Chinese Idiom Paraphrasing

Idioms, are a kind of idiomatic expression in Chinese, most of which consist of four Chinese characters. Due to the properties of non-compositionality and metaphorical meaning, Chinese Idioms are hard to be understood by children and non-native speakers. This study proposes a novel task, denoted as Chinese Idiom Paraphrasing (CIP). CIP aims to rephrase idioms-included sentences to non-idiomatic ones under the premise of preserving the original sentence's meaning. Since the sentences without idioms are easier handled by Chinese NLP systems, CIP can be used to pre-process Chinese datasets, thereby facilitating and improving the performance of Chinese NLP tasks, e.g., machine translation system, Chinese idiom cloze, and Chinese idiom embeddings. In this study, CIP task is treated as a special paraphrase generation task. To circumvent difficulties in acquiring annotations, we first establish a large-scale CIP dataset based on human and machine collaboration, which consists of 115,530 sentence pairs. We further deploy three baselines and two novel CIP approaches to deal with CIP problems. The results show that the proposed methods have better performances than the baselines based on the established CIP dataset.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Deep Learning-based Predictive Control of Battery Management for Frequency Regulation

This paper proposes a deep learning-based optimal battery management scheme for frequency regulation (FR) by integrating model predictive control (MPC), supervised learning (SL), reinforcement learning (RL), and high-fidelity battery models. By taking advantage of deep neural networks (DNNs), the derived DNN-approximated policy is computationally efficient in online implementation. The design procedure of the proposed scheme consists of two sequential processes: (1) the SL process, in which we first run a simulation with an MPC embedding a low-fidelity battery model to generate a training data set, and then, based on the generated data set, we optimize a DNN-approximated policy using SL algorithms; and (2) the RL process, in which we utilize RL algorithms to improve the performance of the DNN-approximated policy by balancing short-term economic incentives and long-term battery degradation. The SL process speeds up the subsequent RL process by providing a good initialization. By utilizing RL algorithms, one prominent property of the proposed scheme is that it can learn from the data generated by simulating the FR policy on the high-fidelity battery simulator to adjust the DNN-approximated policy, which is originally based on low-fidelity battery model. A case study using real-world data of FR signals and prices is performed. Simulation results show that, compared to conventional MPC schemes, the proposed deep learning-based scheme can effectively achieve higher economic benefits of FR participation while maintaining lower online computational cost.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Effects from Hadronic Structure of Photon on $B\toϕγ$ and $B_s\to(ρ^0,ω)γ$ Decays

Using the perturbative QCD approach, we studied the effects from hadronic structure of photon on the pure annihilation rediative decays $B\toϕγ$ and $B_s\to(ρ^0,ω)γ$. These decays have small branching fractions due to the power suppression by the $Λ/m_B$, which make them very sensitive to the next-leading power corrections. The quark components and the related two-particle distribution amplitudes of a final state photon are introduced. The branching fractions can be enhanced remarkably by the factorizable and nonfactorizable emission diagrams. The branching fraction of $B\to ϕγ$ even increases by about 40 times, and those of $B_s \to ρ^0γ$ and $B_s \to ωγ$ are at the order of ${\cal O}(10^{-10})$. We also note that the ratio of branching fractions of $B_s \to ρ^0γ$ and $B_s \to ωγ$ is very sensitive to the effects from hadronic structure of photon. All above results could be tested in future.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Functional law of large numbers and central limit theorem for slow-fast McKean-Vlasov equations

In this paper, we study the asymptotic behavior of a fully-coupled slow-fast McKean-Vlasov stochastic system. Using the non-linear Poisson equation on Wasserstein space, we first establish the strong convergence in the averaging principle of the functional law of large numbers type. In particular, the diffusion coefficient of the slow process can depend on the distribution of the fast motion. Then we consider the stochastic fluctuations of the original system around its average, and prove that the normalized difference will converge weakly to a linear McKean-Vlasov Ornstein-Uhlenbeck type process, which can be viewed as a functional central limit theorem. Extra drift and diffusion coefficients involving the expectation are characterized explicitly. Furthermore, the optimal rates of the convergence are also obtained.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Generative Adversarial Learning for Intelligent Trust Management in 6G Wireless Networks

Emerging six generation (6G) is the integration of heterogeneous wireless networks, which can seamlessly support anywhere and anytime networking. But high Quality-of-Trust should be offered by 6G to meet mobile user expectations. Artificial intelligence (AI) is considered as one of the most important components in 6G. Then AI-based trust management is a promising paradigm to provide trusted and reliable services. In this article, a generative adversarial learning-enabled trust management method is presented for 6G wireless networks. Some typical AI-based trust management schemes are first reviewed, and then a potential heterogeneous and intelligent 6G architecture is introduced. Next, the integration of AI and trust management is developed to optimize the intelligence and security. Finally, the presented AI-based trust management method is applied to secure clustering to achieve reliable and real-time communications. Simulation results have demonstrated its excellent performance in guaranteeing network security and service quality.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Magnetotransport due to conductivity fluctuations in non-magnetic ZrTe2 nanoplates

Transition metal dichalcogenides with nontrivial band structures exhibit various fascinating physical properties and have sparked intensively research interest. Here, we performed systematic magnetotransport measurements on mechanical exfoliation prepared ZrTe2 nanoplates. We revealed that the negative longitudinal magnetoresistivity observed at high field region in the presence of parallel electric and magnetic fields could stem from the conductivity fluctuations due to the excess Zr in the nanoplates. In addition, the parametric plot, the planar Hall resistivity as function of the in-plane anisotropic magnetoresistivity, has an ellipse-shaped pattern with shifted orbital center, which further strengthen the evidence for the conductivity fluctuations. Our work provides some useful insights into transport phenomena in topological materials.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Near-real-time estimates of daily CO2 emissions from 1500 cities worldwide

Building on near-real-time and spatially explicit estimates of daily carbon dioxide (CO2) emissions, here we present and analyze a new city-level dataset of fossil fuel and cement emissions. Carbon Monitor Cities provides daily, city-level estimates of emissions from January 2019 through December 2021 for 1500 cities in 46 countries, and disaggregates five sectors: power generation, residential (buildings), industry, ground transportation, and aviation. The goal of this dataset is to improve the timeliness and temporal resolution of city-level emission inventories and includes estimates for both functional urban areas and city administrative areas that are consistent with global and regional totals. Comparisons with other datasets (i.e. CEADs, MEIC, Vulcan, and CDP) were performed, and we estimate the overall uncertainty to be 21.7%. Carbon Monitor Cities is a near-real-time, city-level emission dataset that includes cities around the world, including the first estimates for many cities in low-income countries. A more complete description of this dataset is published in Scientific Data (https://doi.org/10.1038/s41597-022-01657-z).

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Poisson equation on Wasserstein space and diffusion approximations for McKean-Vlasov equation

We consider the fully-coupled McKean-Vlasov equation with multi-time-scale potentials, and all the coefficients depend on the distributions of both the slow component and the fast motion. By studying the smoothness of the solution of the non-linear Poisson equation on Wasserstein space, we derive the asymptotic limit as well as the quantitative error estimate of the convergence for the slow process. Extra homogenized drift term containing derivative in the measure argument of the solution of the Poisson equation appears in the limit, which seems to be new and is unique for systems involving the fast distribution.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Prompt-Learning for Short Text Classification

In the short text, the extremely short length, feature sparsity, and high ambiguity pose huge challenges to classification tasks. Recently, as an effective method for tuning Pre-trained Language Models for specific downstream tasks, prompt-learning has attracted a vast amount of attention and research. The main intuition behind the prompt-learning is to insert the template into the input and convert the text classification tasks into equivalent cloze-style tasks. However, most prompt-learning methods expand label words manually or only consider the class name for knowledge incorporating in cloze-style prediction, which will inevitably incur omissions and bias in short text classification tasks. In this paper, we propose a simple short text classification approach that makes use of prompt-learning based on knowledgeable expansion. Taking the special characteristics of short text into consideration, the method can consider both the short text itself and class name during expanding label words space. Specifically, the top $N$ concepts related to the entity in the short text are retrieved from the open Knowledge Graph like Probase, and we further refine the expanded label words by the distance calculation between selected concepts and class labels. Experimental results show that our approach obtains obvious improvement compared with other fine-tuning, prompt-learning, and knowledgeable prompt-tuning methods, outperforming the state-of-the-art by up to 6 Accuracy points on three well-known datasets.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Side-aware Meta-Learning for Cross-Dataset Listener Diagnosis with Subjective Tinnitus

With the development of digital technology, machine learning has paved the way for the next generation of tinnitus diagnoses. Although machine learning has been widely applied in EEG-based tinnitus analysis, most current models are dataset-specific. Each dataset may be limited to a specific range of symptoms, overall disease severity, and demographic attributes; further, dataset formats may differ, impacting model performance. This paper proposes a side-aware meta-learning for cross-dataset tinnitus diagnosis, which can effectively classify tinnitus in subjects of divergent ages and genders from different data collection processes. Owing to the superiority of meta-learning, our method does not rely on large-scale datasets like conventional deep learning models. Moreover, we design a subject-specific training process to assist the model in fitting the data pattern of different patients or healthy people. Our method achieves a high accuracy of 73.8\% in the cross-dataset classification. We conduct an extensive analysis to show the effectiveness of side information of ears in enhancing model performance and side-aware meta-learning in improving the quality of the learned features.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Weight-dependent Gates for Network Pruning

In this paper, a simple yet effective network pruning framework is proposed to simultaneously address the problems of pruning indicator, pruning ratio, and efficiency constraint. This paper argues that the pruning decision should depend on the convolutional weights, and thus proposes novel weight-dependent gates (W-Gates) to learn the information from filter weights and obtain binary gates to prune or keep the filters automatically. To prune the network under efficiency constraints, a switchable Efficiency Module is constructed to predict the hardware latency or FLOPs of candidate pruned networks. Combined with the proposed Efficiency Module, W-Gates can perform filter pruning in an efficiency-aware manner and achieve a compact network with a better accuracy-efficiency trade-off. We have demonstrated the effectiveness of the proposed method on ResNet34, ResNet50, and MobileNet V2, respectively achieving up to 1.33/1.28/1.1 higher Top-1 accuracy with lower hardware latency on ImageNet. Compared with state-of-the-art methods, W-Gates also achieves superior performance.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Generative Adversarial U-Net for Domain-free Medical Image Augmentation

The shortage of annotated medical images is one of the biggest challenges in the field of medical image computing. Without a sufficient number of training samples, deep learning based models are very likely to suffer from over-fitting problem. The common solution is image manipulation such as image rotation, cropping, or resizing. Those methods can help relieve the over-fitting problem as more training samples are introduced. However, they do not really introduce new images with additional information and may lead to data leakage as the test set may contain similar samples which appear in the training set. To address this challenge, we propose to generate diverse images with generative adversarial network. In this paper, we develop a novel generative method named generative adversarial U-Net , which utilizes both generative adversarial network and U-Net. Different from existing approaches, our newly designed model is domain-free and generalizable to various medical images. Extensive experiments are conducted over eight diverse datasets including computed tomography (CT) scan, pathology, X-ray, etc. The visualization and quantitative results demonstrate the efficacy and good generalization of the proposed method on generating a wide array of high-quality medical images.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Task Aligned Generative Meta-learning for Zero-shot Learning

Zero-shot learning (ZSL) refers to the problem of learning to classify instances from the novel classes (unseen) that are absent in the training set (seen). Most ZSL methods infer the correlation between visual features and attributes to train the classifier for unseen classes. However, such models may have a strong bias towards seen classes during training. Meta-learning has been introduced to mitigate the basis, but meta-ZSL methods are inapplicable when tasks used for training are sampled from diverse distributions. In this regard, we propose a novel Task-aligned Generative Meta-learning model for Zero-shot learning (TGMZ). TGMZ mitigates the potentially biased training and enables meta-ZSL to accommodate real-world datasets containing diverse distributions. TGMZ incorporates an attribute-conditioned task-wise distribution alignment network that projects tasks into a unified distribution to deliver an unbiased model. Our comparisons with state-of-the-art algorithms show the improvements of 2.1%, 3.0%, 2.5%, and 7.6% achieved by TGMZ on AWA1, AWA2, CUB, and aPY datasets, respectively. TGMZ also outperforms competitors by 3.6% in generalized zero-shot learning (GZSL) setting and 7.9% in our proposed fusion-ZSL setting.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Agglomerative Neural Networks for Multi-view Clustering

Conventional multi-view clustering methods seek for a view consensus through minimizing the pairwise discrepancy between the consensus and subviews. However, the pairwise comparison cannot portray the inter-view relationship precisely if some of the subviews can be further agglomerated. To address the above challenge, we propose the agglomerative analysis to approximate the optimal consensus view, thereby describing the subview relationship within a view structure. We present Agglomerative Neural Network (ANN) based on Constrained Laplacian Rank to cluster multi-view data directly while avoiding a dedicated postprocessing step (e.g., using K-means). We further extend ANN with learnable data space to handle data of complex scenarios. Our evaluations against several state-of-the-art multi-view clustering approaches on four popular datasets show the promising view-consensus analysis ability of ANN. We further demonstrate ANN's capability in analyzing complex view structures and extensibility in our case study and explain its robustness and effectiveness of data-driven modifications.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Conductive Domain Walls in Non-Oxide Ferroelectrics Sn2P2S6

The conductive domain wall (CDW) is extensively investigated in ferroelectrics, which can be considered as a quasi-two-dimensional reconfigurable conducting channel embedded into an insulating material. Therefore, it is highly important for the application of ferroelectric nanoelectronics. Hitherto, most CDW investigations are restricted in oxides, and limited work has been reported in non-oxides to the contrary. Here, by successfully synthesizing the non-oxide ferroelectric Sn2P2S6 single crystal, we observed and confirmed the domain wall conductivity by using different scanning probe techniques which origins from the nature of inclined domain walls. Moreover, the domains separated by CDW also exhibit distinguishable electrical conductivity due to the interfacial polarization charge with opposite signs. The result provides a novel platform for understanding electrical conductivity behavior of the domains and domain walls in non-oxide ferroelectrics.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

LSBert: A Simple Framework for Lexical Simplification

Lexical simplification (LS) aims to replace complex words in a given sentence with their simpler alternatives of equivalent meaning, to simplify the sentence. Recently unsupervised lexical simplification approaches only rely on the complex word itself regardless of the given sentence to generate candidate substitutions, which will inevitably produce a large number of spurious candidates. In this paper, we propose a lexical simplification framework LSBert based on pretrained representation model Bert, that is capable of (1) making use of the wider context when both detecting the words in need of simplification and generating substitue candidates, and (2) taking five high-quality features into account for ranking candidates, including Bert prediction order, Bert-based language model, and the paraphrase database PPDB, in addition to the word frequency and word similarity commonly used in other LS methods. We show that our system outputs lexical simplifications that are grammatically correct and semantically appropriate, and obtains obvious improvement compared with these baselines, outperforming the state-of-the-art by 29.8 Accuracy points on three well-known benchmarks.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Matching methods for obtaining survival functions to estimate the effect of a time-dependent treatment

In observational studies of survival time featuring a binary time-dependent treatment, the hazard ratio (an instantaneous measure) is often used to represent the treatment effect. However, investigators are often more interested in the difference in survival functions. We propose semiparametric methods to estimate the causal effect of treatment among the treated with respect to survival probability. The objective is to compare post-treatment survival with the survival function that would have been observed in the absence of treatment. For each patient, we compute a prognostic score (based on the pre-treatment death hazard) and a propensity score (based on the treatment hazard). Each treated patient is then matched with an alive, uncensored and not-yet-treated patient with similar prognostic and/or propensity scores. The experience of each treated and matched patient is weighted using a variant of Inverse Probability of Censoring Weighting to account for the impact of censoring. We propose estimators of the treatment-specific survival functions (and their difference), computed through weighted Nelson-Aalen estimators. Closed-form variance estimators are proposed which take into consideration the potential replication of subjects across matched sets. The proposed methods are evaluated through simulation, then applied to estimate the effect of kidney transplantation on survival among end-stage renal disease patients using data from a national organ failure registry.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Operator level hard-to-soft transition for $β$-ensembles

The soft and hard edge scaling limits of $β$-ensembles can be characterized as the spectra of certain random Sturm-Liouville operators. It has been shown that by tuning the parameter of the hard edge process one can obtain the soft edge process as a scaling limit. We prove that this limit can be realized on the level of the corresponding random operators. More precisely, the random operators can be coupled in a way so that the scaled versions of the hard edge operators converge to the soft edge operator a.s. in the norm resolvent sense.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Taking the pulse of COVID-19: A spatiotemporal perspective

The sudden outbreak of the Coronavirus disease (COVID-19) swept across the world in early 2020, triggering the lockdowns of several billion people across many countries, including China, Spain, India, the U.K., Italy, France, Germany, and most states of the U.S. The transmission of the virus accelerated rapidly with the most confirmed cases in the U.S., and New York City became an epicenter of the pandemic by the end of March. In response to this national and global emergency, the NSF Spatiotemporal Innovation Center brought together a taskforce of international researchers and assembled implemented strategies to rapidly respond to this crisis, for supporting research, saving lives, and protecting the health of global citizens. This perspective paper presents our collective view on the global health emergency and our effort in collecting, analyzing, and sharing relevant data on global policy and government responses, geospatial indicators of the outbreak and evolving forecasts; in developing research capabilities and mitigation measures with global scientists, promoting collaborative research on outbreak dynamics, and reflecting on the dynamic responses from human societies.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

The Impact of Unmeasured Within- and Between-Cluster Confounding on the Bias of Effect Estimators from Fixed Effect, Mixed effect and Instrumental Variable Models

Instrumental variable methods are popular choices in combating unmeasured confounding to obtain less biased effect estimates. However, we demonstrate that alternative methods may give less biased estimates depending on the nature of unmeasured confounding. Treatment preferences of clusters (e.g., physician practices) are the most f6requently used instruments in instrumental variable analyses (IVA). These preference-based IVAs are usually conducted on data clustered by region, hospital/facility, or physician, where unmeasured confounding often occurs within or between clusters. We aim to quantify the impact of unmeasured confounding on the bias of effect estimators in IVA, as well as alternative methods including ordinary least squares regression, linear mixed models (LMM) and fixed effect models (FE) to study the effect of a continuous exposure (e.g., treatment dose). We derive bias formulae of estimators from these four methods in the presence of unmeasured within- and/or between-cluster confounders. We show that IVAs can provide consistent estimates when unmeasured within-cluster confounding exists, but not when between-cluster confounding exists. On the other hand, FEs and LMMs can provide consistent estimates when unmeasured between-cluster confounding exits, but not for within-cluster confounding. Whether IVAs are advantageous in reducing bias over FEs and LMMs depends on the extent of unmeasured within-cluster confounding relative to between-cluster confounding. Furthermore, the impact of unmeasured between-cluster confounding on IVA estimates is larger than the impact of unmeasured within-cluster confounding on FE and LMM estimates. We illustrate these methods through data applications. Our findings provide guidance for choosing appropriate methods to combat the dominant types of unmeasured confounders and help interpret statistical results in the context of unmeasured confounding

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Using Multiple Imputation to Classify Potential Outcomes Subgroups

With medical tests becoming increasingly available, concerns about over-testing and over-treatment dramatically increase. Hence, it is important to understand the influence of testing on treatment selection in general practice. Most statistical methods focus on average effects of testing on treatment decisions. However, this may be ill-advised, particularly for patient subgroups that tend not to benefit from such tests. Furthermore, missing data are common, representing large and often unaddressed threats to the validity of statistical methods. Finally, it is desirable to conduct analyses that can be interpreted causally. We propose to classify patients into four potential outcomes subgroups, defined by whether or not a patient's treatment selection is changed by the test result and by the direction of how the test result changes treatment selection. This subgroup classification naturally captures the differential influence of medical testing on treatment selections for different patients, which can suggest targets to improve the utilization of medical tests. We can then examine patient characteristics associated with patient potential outcomes subgroup memberships. We used multiple imputation methods to simultaneously impute the missing potential outcomes as well as regular missing values. This approach can also provide estimates of many traditional causal quantities. We find that explicitly incorporating causal inference assumptions into the multiple imputation process can improve the precision for some causal estimates of interest. We also find that bias can occur when the potential outcomes conditional independence assumption is violated; sensitivity analyses are proposed to assess the impact of this violation. We applied the proposed methods to examine the influence of 21-gene assay, the most commonly used genomic test, on chemotherapy selection among breast cancer patients.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Bound state and non-Markovian dynamics of a quantum emitter around a surface plasmonic nanostructure

A bound state between a quantum emitter (QE) and surface plasmon polaritons (SPPs) can be formed, where the QE is partially stabilized in its excited state. We put forward a general approach for calculating the energy level shift at a negative frequency $ω$, which is just the negative of the nonresonant part for the energy level shift at positive frequency $-ω$. We also propose an efficient formalism for obtaining the long-time value of the excited-state population without calculating the eigenfrequency of the bound state or performing a time evolution of the system, in which the probability amplitude for the excited state in the steady limit is equal to one minus the integral of the evolution spectrum over the positive frequency range. With the above two quantities obtained, we show that the non-Markovian decay dynamics in the presence of a bound state can be obtained by the method based on the Green's function expression for the evolution operator. A general criterion for identifying the existence of a bound state is presented. These are numerically demonstrated for a QE located around a nanosphere and in a gap plasmonic nanocavity. These findings are instructive in the fields of coherent light-matter interactions.

0 citations0 reviewsNo code linkedOpen access