Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
30works
0followers
25topics
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

30 published item(s)

preprint2026arXiv

CONTRA: Conformal Prediction Region via Normalizing Flow Transformation

Density estimation and reliable prediction regions for outputs are crucial in supervised and unsupervised learning. While conformal prediction effectively generates coverage-guaranteed regions, it struggles with multi-dimensional outputs due to reliance on one-dimensional nonconformity scores. To address this, we introduce CONTRA: CONformal prediction region via normalizing flow TRAnsformation. CONTRA utilizes the latent spaces of normalizing flows to define nonconformity scores based on distances from the center. This allows for the mapping of high-density regions in latent space to sharp prediction regions in the output space, surpassing traditional hyperrectangular or elliptical conformal regions. Further, for scenarios where other predictive models are favored over flow-based models, we extend CONTRA to enhance any such model with a reliable prediction region by training a simple normalizing flow on the residuals. We demonstrate that both CONTRA and its extension maintain guaranteed coverage probability and outperform existing methods in generating accurate prediction regions across various datasets. We conclude that CONTRA is an effective tool for (conditional) density estimation, addressing the under-explored challenge of delivering multi-dimensional prediction regions.

preprint2026arXiv

RepFlow: Representation Enhanced Flow Matching for Causal Effect Estimation

Estimating causal effects from observational data has become increasingly critical in diverse fields including healthcare, economics, and social policy. The fundamental challenge in causal inference arises from the missing counterfactuals and the selection bias. Existing methods are largely limited to point estimates and lack the capacity for distribution modeling. In this work, we propose RepFlow, a novel framework that formulates causal effect estimation as a joint optimization problem integrating representation learning with Conditional Flow Matching (CFM). RepFlow mitigates selection bias by minimizing the entropically regularized Wasserstein distance between treated and control representations. To enhance numerical stability, we further introduce an $L_2$ normalization constraint on latent representations. This balanced representation enables the flow model to accurately capture the distribution of potential outcomes. Extensive experiments across a wide range of benchmarks demonstrate that RepFlow consistently outperforms existing methods in both point and distributional causal effect estimation.

preprint2026arXiv

Single-quark electromagnetic form factors of charmonium up to $J=2$

We calculate the single-quark electromagnetic form factors of a broad subset of charmonium, including $η_c(1S)$, $η_c(2S)$, $χ_{c0}(1P)$, $χ_{c0}(2P)$, $J/ψ(1S)$, $J/ψ(2S)$, $χ_{c1}(1P)$, $χ_{c1}(2P)$, $h_c(1P)$, $h_c(2P)$, $χ_{c2}(1P)$ and $χ_{c2}(2P)$, via a relativized quark model. The reference frame dependence of the results is estimated as the computational error. We compare our results with those of the lattice quantum chromodynamics (LQCD), the Dyson-Schwinger equation (DSE) and the basis light front quantization (BLFQ) approaches where available and we find that most of our results agree with the other results. We also predict the single-quark electromagnetic form factors of $χ_{c0}(2P)$, $χ_{c1}(2P)$, $h_c(1P)$, $h_c(2P)$, $χ_{c2}(1P)$ and $χ_{c2}(2P)$, where no direct comparisons are available.

preprint2026arXiv

TRACE: Transport Alignment Conformal Prediction via Diffusion and Flow Matching Models

Constructing valid and informative conformal prediction regions for multi-dimensional outputs remains a fundamental challenge. While conformal prediction provides finite-sample, distribution-free coverage guarantees, its practical performance critically depends on the choice of nonconformity score. Existing approaches often rely on restrictive geometric assumptions or require explicit likelihood evaluation and invertible transformations, limiting their applicability in complex generative settings. In this work, we introduce TRACE (TRansport Alignment Conformal Estimation), a conformal prediction framework that defines nonconformity through transport alignment in diffusion and flow matching models. Rather than evaluating likelihoods, we measure how well a candidate output aligns with the learned generative dynamics by averaging denoising or velocity-matching errors along stochastic transport trajectories. The resulting transport-based scores are scalar-valued and can be calibrated using split conformal prediction, yielding valid marginal coverage under exchangeability. We further analyze the statistical properties of the proposed scores and their sensitivity to computational budget. Experiments on synthetic and real datasets demonstrate valid coverage and show that the resulting regions adapt naturally to multimodal and non-convex conditional distributions.

preprint2026arXiv

Unveiling the Shortwave Absorption Spectra of Alumina Aerosols: Implications for Solar Radiation Modification

Alumina is proposed for Stratospheric Aerosol Injection (SAI)-based solar radiation modification due to its presumed ability to scatter sunlight strongly while absorbing weakly. Alumina is assigned negligible solar shortwave absorption in climate models; this assumption is not validated owing to technological challenges in quantifying its weak absorption signals. We report alumina's shortwave imaginary refractive index $k$, a determinant of its absorption strength, using sensitive in situ photoacoustic spectrometry, finding values ranging from $1.4 \times 10^{-4}$ to $1.2 \times 10^{-3}$. Particle-scale electron energy-loss spectroscopy provided independent validation and revealed that the non-ideal absorption arises from oxygen vacancy defects in the alumina's crystal structure. Aerosol chemistry climate model simulations to evaluate shortwave absorption radiative effects revealed insignificant impacts on radiative forcing and stratospheric warming. Our findings indicate that alumina's shortwave absorption, previously reported as a source of uncertainty, is unlikely to affect SAI impact calculations.

preprint2023arXiv

Deep Nonparametric Regression on Approximate Manifolds: Non-Asymptotic Error Bounds with Polynomial Prefactors

We study the properties of nonparametric least squares regression using deep neural networks. We derive non-asymptotic upper bounds for the prediction error of the empirical risk minimizer of feedforward deep neural regression. Our error bounds achieve minimax optimal rate and significantly improve over the existing ones in the sense that they depend polynomially on the dimension of the predictor, instead of exponentially on dimension. We show that the neural regression estimator can circumvent the curse of dimensionality under the assumption that the predictor is supported on an approximate low-dimensional manifold or a set with low Minkowski dimension. We also establish the optimal convergence rate under the exact manifold support assumption. We investigate how the prediction error of the neural regression estimator depends on the structure of neural networks and propose a notion of network relative efficiency between two types of neural networks, which provides a quantitative measure for evaluating the relative merits of different network structures. To establish these results, we derive a novel approximation error bound for the Hölder smooth functions with a positive smoothness index using ReLU activated neural networks, which may be of independent interest. Our results are derived under weaker assumptions on the data distribution and the neural network structure than those in the existing literature.

preprint2022arXiv

A Rapid and Large-Amplitude X-ray Dimming Event in a z ~ 2.6 Radio-Quiet Quasar

We report a dramatic fast X-ray dimming event in a z=2.627 radio-quiet type 1 quasar, which has an estimated supermassive black hole (SMBH) mass of $6.3\times 10^{9} M_\odot$. In the high X-ray state, it showed a typical level of X-ray emission relative to its UV/optical emission. Then its 0.5-2 keV (rest-frame 1.8-7.3 keV) flux dropped by a factor of $\approx7.6$ within two rest-frame days. The dimming is associated with spectral hardening, as the 2-7 keV (rest-frame 7.3-25.4 keV) flux dropped by only $17\%$ and the effective power-law photon index of the X-ray spectrum changed from $\approx2.3$ to $\approx0.9$. The quasar has an infrared (IR)-to-UV spectral energy distribution and a rest-frame UV spectrum similar to those of typical quasars, and it does not show any significant long-term variability in the IR and UV/optical bands. Such an extremely fast and large-amplitude X-ray variability event has not been reported before in luminous quasars with such massive SMBHs. The X-ray dimming is best explained by a fast-moving absorber crossing the line of sight and fully covering the X-ray emitting corona. Adopting a conservatively small size of $5 {G} M_{\rm BH}/c^2$ for the X-ray corona, the transverse velocity of the absorber is estimated to be $\approx 0.9c$. The quasar is likely accreting with a high or even super-Eddington accretion rate, and the high-velocity X-ray absorber is probably related to a powerful accretion-disk wind. Such an energetic wind may eventually evolve into a massive galactic-scale outflow, providing efficient feedback to the host galaxy.

preprint2022arXiv

An error analysis of generative adversarial networks for learning distributions

This paper studies how well generative adversarial networks (GANs) learn probability distributions from finite samples. Our main results establish the convergence rates of GANs under a collection of integral probability metrics defined through Hölder classes, including the Wasserstein distance as a special case. We also show that GANs are able to adaptively learn data distributions with low-dimensional structures or have Hölder densities, when the network architectures are chosen properly. In particular, for distributions concentrated around a low-dimensional set, we show that the learning rates of GANs do not depend on the high ambient dimension, but on the lower intrinsic dimension. Our analysis is based on a new oracle inequality decomposing the estimation error into the generator and discriminator approximation error and the statistical error, which may be of independent interest.

preprint2022arXiv

Building A Trusted Execution Environment for In-Storage Computing

In-storage computing with modern solid-state drives (SSDs) enables developers to offload programs from the host to the SSD. It has been proven to be an effective approach to alleviating the I/O bottleneck. To facilitate in-storage computing, many frameworks have been proposed. However, few of them consider security as the priority for in-storage computing. Specifically, since modern SSD controllers do not have a trusted execution environment, an offloaded (malicious) program could steal, modify, and even destroy the data stored in the SSD. In this paper, we first investigate the attacks that could be conducted by offloaded in-storage programs. To defend against these attacks, we build IceClave, a lightweight trusted execution environment for in-storage computing. IceClave enables security isolation between in-storage programs and flash management functions. IceClave also achieves security isolation between in-storage programs and enforces memory encryption and integrity verification of in-storage DRAM with low overhead. To protect data loaded from flash chips, IceClave develops a lightweight data encryption/decryption mechanism in flash controllers. We develop IceClave with a full system simulator and evaluate IceClave with a variety of data-intensive applications. Compared to state-of-the-art in-storage computing approaches, IceClave introduces only 7.6% performance overhead, while enforcing security isolation in the SSD controller with minimal hardware cost. IceClave still keeps the performance benefit of in-storage computing by delivering up to 2.31$\times$ better performance than the conventional host-based trusted computing approach.

preprint2022arXiv

Deep Dimension Reduction for Supervised Representation Learning

The goal of supervised representation learning is to construct effective data representations for prediction. Among all the characteristics of an ideal nonparametric representation of high-dimensional complex data, sufficiency, low dimensionality and disentanglement are some of the most essential ones. We propose a deep dimension reduction approach to learning representations with these characteristics. The proposed approach is a nonparametric generalization of the sufficient dimension reduction method. We formulate the ideal representation learning task as that of finding a nonparametric representation that minimizes an objective function characterizing conditional independence and promoting disentanglement at the population level. We then estimate the target representation at the sample level nonparametrically using deep neural networks. We show that the estimated deep nonparametric representation is consistent in the sense that its excess risk converges to zero. Our extensive numerical experiments using simulated and real benchmark data demonstrate that the proposed methods have better performance than several existing dimension reduction methods and the standard deep learning models in the context of classification and regression.

preprint2022arXiv

Deep Generative Survival Analysis: Nonparametric Estimation of Conditional Survival Function

We propose a deep generative approach to nonparametric estimation of conditional survival and hazard functions with right-censored data. The key idea of the proposed method is to first learn a conditional generator for the joint conditional distribution of the observed time and censoring indicator given the covariates, and then construct the Kaplan-Meier and Nelson-Aalen estimators based on this conditional generator for the conditional hazard and survival functions. Our method combines ideas from the recently developed deep generative learning and classical nonparametric estimation in survival analysis. We analyze the convergence properties of the proposed method and establish the consistency of the generative nonparametric estimators of the conditional survival and hazard functions. Our numerical experiments validate the proposed method and demonstrate its superior performance in a range of simulated models. We also illustrate the applications of the proposed method in constructing prediction intervals for survival times with the PBC (Primary Biliary Cholangitis) and SUPPORT (Study to Understand Prognoses and Preferences for Outcomes and Risks of Treatments) datasets.

preprint2022arXiv

Deep Sufficient Representation Learning via Mutual Information

We propose a mutual information-based sufficient representation learning (MSRL) approach, which uses the variational formulation of the mutual information and leverages the approximation power of deep neural networks. MSRL learns a sufficient representation with the maximum mutual information with the response and a user-selected distribution. It can easily handle multi-dimensional continuous or categorical response variables. MSRL is shown to be consistent in the sense that the conditional probability density function of the response variable given the learned representation converges to the conditional probability density function of the response variable given the predictor. Non-asymptotic error bounds for MSRL are also established under suitable conditions. To establish the error bounds, we derive a generalized Dudley's inequality for an order-two U-process indexed by deep neural networks, which may be of independent interest. We discuss how to determine the intrinsic dimension of the underlying data distribution. Moreover, we evaluate the performance of MSRL via extensive numerical experiments and real data analysis and demonstrate that MSRL outperforms some existing nonlinear sufficient dimension reduction methods.

preprint2022arXiv

Estimation of Non-Crossing Quantile Regression Process with Deep ReQU Neural Networks

We propose a penalized nonparametric approach to estimating the quantile regression process (QRP) in a nonseparable model using rectifier quadratic unit (ReQU) activated deep neural networks and introduce a novel penalty function to enforce non-crossing of quantile regression curves. We establish the non-asymptotic excess risk bounds for the estimated QRP and derive the mean integrated squared error for the estimated QRP under mild smoothness and regularity conditions. To establish these non-asymptotic risk and estimation error bounds, we also develop a new error bound for approximating $C^s$ smooth functions with $s >0$ and their derivatives using ReQU activated neural networks. This is a new approximation result for ReQU networks and is of independent interest and may be useful in other problems. Our numerical experiments demonstrate that the proposed method is competitive with or outperforms two existing methods, including methods using reproducing kernels and random forests, for nonparametric quantile regression.

preprint2022arXiv

Fast localization and single-pixel imaging of the moving object using time-division multiplexing

When imaging moving objects, single-pixel imaging produces motion blur. This paper proposes a new single-pixel imaging method, which can achieve anti-motion blur imaging of a fast-moving object. The geometric moment patterns and Hadamard patterns are used to alternately encode the position information and the image information of the object with time-division multiplexing. In the reconstruction process, the object position information is extracted independently and combining motion-compensation reconstruction algorithm to decouple the object motion from image information. As a result, the anti-motion blur image and the high frame rate object positions are obtained. Experimental results show that for a moving object with an angular velocity of up to 0.5rad/s relative to the imaging system, the proposed method achieves a localization frequency of 5.55kHz, and gradually reconstructs a clear image of the fast-moving object with a pseudo resolution of 512x512. The method has application prospects in single-pixel imaging of the fast-moving object.

preprint2022arXiv

LeaFTL: A Learning-Based Flash Translation Layer for Solid-State Drives

In modern solid-state drives (SSDs), the indexing of flash pages is a critical component in their storage controllers. It not only affects the data access performance, but also determines the efficiency of the precious in-device DRAM resource. A variety of address mapping schemes and optimization techniques have been proposed. However, most of them were developed with human-driven heuristics. They cannot automatically capture diverse data access patterns at runtime in SSD controllers, which leaves a large room for improvement. In this paper, we present a learning-based flash translation layer (FTL), named LeaFTL, which learns the address mapping to tolerate dynamic data access patterns via linear regression at runtime. By grouping a large set of mapping entries into a learned segment, it significantly reduces the memory footprint of the address mapping table, which further benefits the data caching in SSD controllers. LeaFTL also employs various optimization techniques, including out-of-band metadata verification to tolerate mispredictions, optimized flash allocation, and dynamic compaction of learned index segments. We implement LeaFTL with an SSD simulator and evaluate it with various storage workloads. LeaFTL saves the memory consumption of the mapping table by 2.9x on average and improves the storage performance by 1.4x on average, in comparison with state-of-the-art FTL schemes.

preprint2022arXiv

Multimode optomechanical cooling via general dark-mode control

The dark-mode effect is a stubborn obstacle for ground-state cooling of multiple degenerate mechanical modes optomechanically coupled to a common cavity-field mode. Here we propose an auxiliary-cavity-mode method for simultaneous ground-state cooling of two degenerate or near-degenerate mechanical modes by breaking the dark mode. We find that the introduction of the auxiliary cavity mode not only breaks the dark-mode effect, but also provides a new cooling channel to extract the thermal excitations stored in the dark mode. Moreover, we study the general physical-coupling configurations for breaking the dark mode in a generalized networkcoupled four-mode optomechanical system consisting of two cavity modes and two mechanical modes. We find the analytical dark-mode-breaking condition in this system. This method is general and it can be generalized to break the dark-mode effect and to realize the simultaneous ground-state cooling in a multiple-mechanicalmode optomechanical system. We also demonstrate the physical mechanism behind the dark-mode breaking by studying the breaking of dark-state effect in the N-type four-level atomic system. Our results not only provide a general method to control various dark-mode and dark-state effects in physics, but also present an opportunity to the study of macroscopic quantum phenomena and applications in multiple-mechanical-resonator systems.

preprint2022arXiv

NuSTAR Observations of Intrinsically X-ray Weak Quasar Candidates: An Obscuration-Only Scenario

We utilize recent NuSTAR observations (co-added depth $\approx55$-120 ks) of PG $1001+054$, PG $1254+047$, and PHL 1811 to constrain their hard X-ray ($\gtrsim5$ keV) weakness and spectral shapes, and thus to investigate the nature of their extreme X-ray weakness. These quasars showed very weak soft X-ray emission, and they were proposed to be intrinsically X-ray weak, with the X-ray coronae producing weak continuum emission relative to their optical/UV emission. However, the new observations suggest an alternative explanation. The NuSTAR 3-24 keV spectral shapes for PG $1001+054$ and PHL 1811 are likely flat (effective power-law photon indices $Γ_{\rm eff}=1.0^{+0.5}_{-0.6}$ and $Γ_{\rm eff}=1.4^{+0.8}_{-0.7}$, respectively), while the shape is nominal for PG $1254+047$ ($Γ_{\rm eff}=1.8\pm0.3$). PG $1001+054$ and PHL 1811 are significantly weak at hard X-ray energies (by factors of $\approx26$-74 at rest-frame 8 keV) compared to the expectations from their optical/UV emission, while PG $1254+047$ is only hard X-ray weak by a factor of $\approx3$. We suggest that X-ray obscuration is present in all three quasars. We propose that, as an alternative to the intrinsic X-ray weakness + X-ray obscuration scenario, the soft and hard X-ray weakness of these quasars can be uniformly explained under an obscuration-only scenario. This model provides adequate descriptions of the multi-epoch soft and hard X-ray data of these quasars, with variable column density and leaked fraction of the partial-covering absorber. We suggest that the absorber is the clumpy dust-free wind launched from the accretion disk. These quasars probably have super-Eddington accretion rates that drive powerful and high-density winds.

preprint2022arXiv

The Security War in File Systems: An Empirical Study from A Vulnerability-Centric Perspective

This paper presents a systematic study on the security of modern file systems, following a vulnerability-centric perspective. Specifically, we collected 377 file system vulnerabilities committed to the CVE database in the past 20 years. We characterize them from four dimensions that include why the vulnerabilities appear, how the vulnerabilities can be exploited, what consequences can arise, and how the vulnerabilities are fixed. This way, we build a deep understanding of the attack surfaces faced by file systems, the threats imposed by the attack surfaces, and the good and bad practices in mitigating the attacks in file systems. We envision that our study will bring insights towards the future development of file systems, the enhancement of file system security, and the relevant vulnerability mitigating solutions.

preprint2022arXiv

UniHeap: Managing Persistent Objects Across Managed Runtimes for Non-Volatile Memory

Byte-addressable, non-volatile memory (NVM) is emerging as a promising technology. To facilitate its wide adoption, employing NVM in managed runtimes like JVM has proven to be an effective approach (i.e., managed NVM). However, such an approach is runtime specific, which lacks a generic abstraction across different managed languages. Similar to the well-known filesystem primitives that allow diverse programs to access same files via the block I/O interface, managed NVM deserves the same system-wide property for persistent objects across managed runtimes with low overhead. In this paper, we present UniHeap, a new NVM framework for managing persistent objects. It proposes a unified persistent object model that supports various managed languages, and manages NVM within a shared heap that enables cross-language persistent object sharing. UniHeap reduces the object persistence overhead by managing the shared heap in a log-structured manner and coalescing object updates during the garbage collection. We implement UniHeap as a generic framework and extend it to different managed runtimes that include HotSpot JVM, cPython, and JavaScript engine SpiderMonkey. We evaluate UniHeap with a variety of applications, such as key-value store and transactional database. Our evaluation shows that UniHeap significantly outperforms state-of-the-art object sharing approaches, while introducing negligible overhead to the managed runtimes.

preprint2021arXiv

Dynamic sensitivity of quantum Rabi model with quantum criticality

We study the dynamic sensitivity of the quantum Rabi model, which exhibits quantum criticality in the finite-component-system case. This dynamic sensitivity can be detected by introducing an auxiliary two-level atom far-off-resonantly coupled to the cavity field of the quantum Rabi model. We find that when the quantum Rabi model goes through the critical point, the auxiliary atom experiences a sudden decoherence, which can be characterised by a sharp decay of the Loschmidt echo. Our scheme will provide a reliable way to observe quantum phase transition in ultrastrongly coupled quantum systems.

preprint2020arXiv

$\ell_0$-Regularized High-dimensional Accelerated Failure Time Model

We develop a constructive approach for $\ell_0$-penalized estimation in the sparse accelerated failure time (AFT) model with high-dimensional covariates. Our proposed method is based on Stute's weighted least squares criterion combined with $\ell_0$-penalization. This method is a computational algorithm that generates a sequence of solutions iteratively, based on active sets derived from primal and dual information and root finding according to the KKT conditions. We refer to the proposed method as AFT-SDAR (for support detection and root finding). An important aspect of our theoretical results is that we directly concern the sequence of solutions generated based on the AFT-SDAR algorithm. We prove that the estimation errors of the solution sequence decay exponentially to the optimal error bound with high probability, as long as the covariate matrix satisfies a mild regularity condition which is necessary and sufficient for model identification even in the setting of high-dimensional linear regression. We also proposed an adaptive version of AFT-SDAR, or AFT-ASDAR, which determines the support size of the estimated coefficient in a data-driven fashion. We conduct simulation studies to demonstrate the superior performance of the proposed method over the lasso and MCP in terms of accuracy and speed. We also apply the proposed method to a real data set to illustrate its application.

preprint2020arXiv

A Support Detection and Root Finding Approach for Learning High-dimensional Generalized Linear Models

Feature selection is important for modeling high-dimensional data, where the number of variables can be much larger than the sample size. In this paper, we develop a support detection and root finding procedure to learn the high dimensional sparse generalized linear models and denote this method by GSDAR. Based on the KKT condition for $\ell_0$-penalized maximum likelihood estimations, GSDAR generates a sequence of estimators iteratively. Under some restricted invertibility conditions on the maximum likelihood function and sparsity assumption on the target coefficients, the errors of the proposed estimate decays exponentially to the optimal order. Moreover, the oracle estimator can be recovered if the target signal is stronger than the detectable level. We conduct simulations and real data analysis to illustrate the advantages of our proposed method over several existing methods, including Lasso and MCP.

preprint2020arXiv

Efficient Use of heuristics for accelerating XCS-based Policy Learning in Markov Games

In Markov games, playing against non-stationary opponents with learning ability is still challenging for reinforcement learning (RL) agents, because the opponents can evolve their policies concurrently. This increases the complexity of the learning task and slows down the learning speed of the RL agents. This paper proposes efficient use of rough heuristics to speed up policy learning when playing against concurrent learners. Specifically, we propose an algorithm that can efficiently learn explainable and generalized action selection rules by taking advantages of the representation of quantitative heuristics and an opponent model with an eXtended classifier system (XCS) in zero-sum Markov games. A neural network is used to model the opponent from their behaviors and the corresponding policy is inferred for action selection and rule evolution. In cases of multiple heuristic policies, we introduce the concept of Pareto optimality for action selection. Besides, taking advantages of the condition representation and matching mechanism of XCS, the heuristic policies and the opponent model can provide guidance for situations with similar feature representation. Furthermore, we introduce an accuracy-based eligibility trace mechanism to speed up rule evolution, i.e., classifiers that can match the historical traces are reinforced according to their accuracy. We demonstrate the advantages of the proposed algorithm over several benchmark algorithms in a soccer and a thief-and-hunter scenarios.

preprint2020arXiv

Learning Implicit Generative Models with Theoretical Guarantees

We propose a \textbf{uni}fied \textbf{f}ramework for \textbf{i}mplicit \textbf{ge}nerative \textbf{m}odeling (UnifiGem) with theoretical guarantees by integrating approaches from optimal transport, numerical ODE, density-ratio (density-difference) estimation and deep neural networks. First, the problem of implicit generative learning is formulated as that of finding the optimal transport map between the reference distribution and the target distribution, which is characterized by a totally nonlinear Monge-Ampère equation. Interpreting the infinitesimal linearization of the Monge-Ampère equation from the perspective of gradient flows in measure spaces leads to the continuity equation or the McKean-Vlasov equation. We then solve the McKean-Vlasov equation numerically using the forward Euler iteration, where the forward Euler map depends on the density ratio (density difference) between the distribution at current iteration and the underlying target distribution. We further estimate the density ratio (density difference) via deep density-ratio (density-difference) fitting and derive explicit upper bounds on the estimation error. Experimental results on both synthetic datasets and real benchmark datasets support our theoretical findings and demonstrate the effectiveness of UnifiGem.

preprint2020arXiv

On the relation between hard X-ray photon index versus accretion rate for super-Eddington accreting quasars

We investigate whether the hard X-ray photon index ($Γ$) versus accretion rate correlation for super-Eddington accreting quasars is different from that for sub-Eddington accreting quasars. We construct a sample of 113 bright quasars from the Sloan Digital Sky Survey Data Release 14 quasar catalog, including 38 quasars as the super-Eddington subsample and 75 quasars as the sub-Eddington subsample. We derive black-hole masses using a simple-epoch virial mass formula based on the ${\rm Hβ}$ lines, and we use the standard thin disk model to derive the dimensionless accretion rates ($\dot{\mathscr{M}}$) for our sample. The X-ray data for these quasars are collected from the Chandra and XMM-Newton archives. We fit the hard X-ray spectra using a single power-law model to obtain $Γ$ values. We find a statistically significant ($R_{\rm S}=0.43$, $p=7.75\times{10}^{-3}$) correlation between $Γ$ and $\dot{\mathscr{M}}$ for the super-Eddington subsample. The $Γ$-$\dot{\mathscr{M}}$ correlation for the sub-Eddington subsample is also significant, but weaker ($R_{\rm S}=0.30$, $p=9.98\times{10}^{-3}$). Linear regression analysis shows that ${\rm Γ}=(0.34\pm0.11){\rm log}{\dot{\mathscr{M}}}+(1.71\pm0.17)$ and ${\rm Γ}=(0.09\pm0.04){\rm log}{\dot{\mathscr{M}}}+(1.93\pm0.04)$ for the super- and sub-Eddington subsamples, respectively. The $Γ$-$\dot{\mathscr{M}}$ correlations of the two subsamples are different, suggesting different disk-corona connections in these two types of systems. We propose one qualitative explanation of the steeper $Γ$-$\dot{\mathscr{M}}$ correlation in the super-Eddington regime that involves larger seed photon fluxes received by the compact coronae from the thick disks in super-Eddington accreting quasars.

preprint2020arXiv

QoS-Based Source and Relay Secure Optimization Design with Presence of Channel Uncertainty

In this letter, we study relay-aided networks with presence of single eavesdropper. We provide joint beamforming design of the source and relay that can minimize the overall power consumption while satisfying our predefined quality-of-service (QoS) requirements. Additionally, we investigate the case that the channel between relay and eavesdropper suffers from channel uncertainty. Finally, simulation results are provided to verify the effectiveness of our algorithm.

preprint2020arXiv

Supervised Discriminative Sparse PCA with Adaptive Neighbors for Dimensionality Reduction

Dimensionality reduction is an important operation in information visualization, feature extraction, clustering, regression, and classification, especially for processing noisy high dimensional data. However, most existing approaches preserve either the global or the local structure of the data, but not both. Approaches that preserve only the global data structure, such as principal component analysis (PCA), are usually sensitive to outliers. Approaches that preserve only the local data structure, such as locality preserving projections, are usually unsupervised (and hence cannot use label information) and uses a fixed similarity graph. We propose a novel linear dimensionality reduction approach, supervised discriminative sparse PCA with adaptive neighbors (SDSPCAAN), to integrate neighborhood-free supervised discriminative sparse PCA and projected clustering with adaptive neighbors. As a result, both global and local data structures, as well as the label information, are used for better dimensionality reduction. Classification experiments on nine high-dimensional datasets validated the effectiveness and robustness of our proposed SDSPCAAN.

preprint2019arXiv

Deep levels analysis in wavelength extended InGaAsBi photodetector

InP based dilute Bismide InGaAsBi material is emerging as a promising candidate for extending short wavelength infrared detection. One critical factor to limit the performance of these InGaAsBi photodiodes is dark current caused by defects within the material. In this work, low frequency noise spectroscopy (LFNS) and temperature varied photoluminescence was used to characterize the defect levels in the devices. Three deep levels located at Ec -0.33 eV, Ev +0.14 eV, and Ec -0.51 eV were identified from the LFNS spectra, which are consistent with emission peak energy found by photoluminescence spectra of InGaAsBi.

preprint2019arXiv

Generation of macroscopic entangled cat states in a molecular cavity-QED system

Macroscopic entangled cat states not only are significant in the demonstration of the fundamentals of quantum physics, but also have wide applications in modern quantum technologies such as continuous-variable quantum information processing and quantum metrology. Here we propose a scheme for generation of macroscopic entangled cat states in a molecular cavity-QED system, which is composed of an organic molecule (including electronic and vibrational states) coupled to a single-mode cavity field. By simultaneously modulating the resonance frequencies of the molecular vibration and the cavity field, the molecular vibrational displacement can be enhanced significantly and hence macroscopic entangled cat states between the molecular vibrational mode and the cavity mode can be created. We also study quantum coherence effects in the generated states by calculating the joint Wigner function and the degree of entanglement. The dissipation effects are included by considering the state generation in the open-system case. Our results will pave the way to the study of quantum physics and quantum chemistry in molecular cavity-QED systems.

preprint2019arXiv

Towards Commercializing Vanadium Dioxide Films: Investigation of the Impact of Different Interface on the Deterioration Process for Largely Extended Service Life

Long term stability is the most pressing issue that impedes commercialization of Vanadium Dioxide (VO2) based functional films, which show a gradual loss of relative phase transition performance, especially in humid conditions when serving as smart windows. Here, we investigated the impact of different interface on the deterioration process of VO2 films and proposed a novel encapsulation structure for largely extended service life. Hydrophobic and stable hafnium dioxide (HfO2) layers have been incorporated with VO2 films for encapsulated surfaces and cross sections. With modified thickness and structure of HfO2 layers, the degradation process of VO2 can be effectively suppressed. The proposed films can retain stable phase transition performances under high relative humidity (90%) and temperature (60 Celsius) over 100 days, which is equal to about 16 years in the real environment. Improving the stability of VO2 materials is a necessary step towards commercializing production of high performance films for long term use.