arXiv subjects

Fang Liu

Publications and source records attributed to Fang Liu.

At least 325 records · Page 18Linked to original sources

arXiv2019

Energy balancing using charge/discharge storages control and load forecasts in a renewable-energy-based grids

Renewable-energy-based grids development needs new methods to maintain the balance between the load and generation using the efficient energy storages models. Most of the available energy storages models do not take into account such important features as the nonlinear dependence of efficiency on lifetime and changes in capacity over time horizon, the distribution of load between several independent storages. In order to solve these problems the Volterra integral dynamical models are employed. Such models allow to determine the alternating power function for given/forecasted load and generation datasets. In order to efficiently solve this problem, the load forecasting models were proposed using deep learning and support vector regression models. Forecasting models use various features including average daily temperature, load values with time shift and moving averages. Effectiveness of the proposed energy balancing method using the state-of-the-art forecasting models is demonstrated on the real datasets of Germany's electric grid.

eess.SP↗

arXiv2019

Statistical Properties of Sanitized Results from Differentially Private Laplace Mechanism with Univariate Bounding Constraints

Protection of individual privacy is a common concern when releasing and sharing data and information. Differential privacy (DP) formalizes privacy in probabilistic terms without making assumptions about the background knowledge of data intruders, and thus provides a robust concept for privacy protection. Practical applications of DP involve development of differentially private mechanisms to generate sanitized results at a pre-specified privacy budget. For the sanitization of statistics with publicly known bounds such as proportions and correlation coefficients, the bounding constraints will need to be incorporated in the differentially private mechanisms. There has been little work on examining the consequences of the bounding constraints on the accuracy of sanitized results and the statistical inferences of the population parameters based on the sanitized results. In this paper, we formalize the differentially private truncated and boundary inflated truncated (BIT) procedures for releasing statistics with publicly known bounding constraints. The impacts of the truncated and BIT Laplace procedures on the statistical accuracy and validity of sanitized statistics are evaluated both theoretically and empirically via simulation studies.

stat.ME↗

arXiv2019

PANDA: AdaPtive Noisy Data Augmentation for Regularization of Undirected Graphical Models

We propose an AdaPtive Noise Augmentation (PANDA) technique to regularize the estimation and construction of undirected graphical models. PANDA iteratively optimizes the objective function given the noise augmented data until convergence to achieve regularization on model parameters. The augmented noises can be designed to achieve various regularization effects on graph estimation, such as the bridge (including lasso and ridge), elastic net, adaptive lasso, and SCAD penalization; it also realizes the group lasso and fused ridge. We examine the tail bound of the noise-augmented loss function and establish that the noise-augmented loss function and its minimizer converge almost surely to the expected penalized loss function and its minimizer, respectively. We derive the asymptotic distributions for the regularized parameters through PANDA in generalized linear models, based on which, inferences for the parameters can be obtained simultaneously with variable selection. We show the non-inferior performance of PANDA in constructing graphs of different types in simulation studies and apply PANDA to an autism spectrum disorder data to construct a mixed-node graph. We also show that the inferences based on the asymptotic distribution of regularized parameter estimates via PANDA achieve nominal or near-nominal coverage and are far more efficient, compared to some existing post-selection procedures. Computationally, PANDA can be easily programmed in software that implements (GLMs) without resorting to complicated optimization techniques.

stat.ML↗

arXiv2019

AdaPtive Noisy Data Augmentation (PANDA) for Simultaneous Construction of Multiple Graph Models

We extend the data augmentation technique PANDA by Li et al. (2018) that regularizes single graph estimation to jointly learning multiple graphical models with various node types in a unified framework. We design two types of noise to augment the observed data: the first type regularizes the estimation of each graph while the second type promotes either the structural similarity, referred as the \joint group lasso regularization, or the numerical similarity, referred as the joint fused ridge regularization, among the edges in the same position across graphs. The computation in PANDA is straightforward and only involves obtaining maximum likelihood estimator in generalized linear models in an iterative manner. The simulation studies demonstrate PANDA is non-inferior to existing joint estimation approaches for Gaussian graphical models, and significantly improves over the naive differencing approach for non-Gaussian graphical models. We apply PANDA to a real-life lung cancer microarray data to simultaneously construct four protein networks.

stat.ME↗

arXiv2019

Data Poisoning Attacks on Stochastic Bandits

Stochastic multi-armed bandits form a class of online learning problems that have important applications in online recommendation systems, adaptive medical treatment, and many others. Even though potential attacks against these learning algorithms may hijack their behavior, causing catastrophic loss in real-world applications, little is known about adversarial attacks on bandit algorithms. In this paper, we propose a framework of offline attacks on bandit algorithms and study convex optimization based attacks on several popular bandit algorithms. We show that the attacker can force the bandit algorithm to pull a target arm with high probability by a slight manipulation of the rewards in the data. Then we study a form of online attacks on bandit algorithms and propose an adaptive attack strategy against any bandit algorithm without the knowledge of the bandit algorithm. Our adaptive attack strategy can hijack the behavior of the bandit algorithm to suffer a linear regret with only a logarithmic cost to the attacker. Our results demonstrate a significant security threat to stochastic bandits.

cs.LG↗

arXiv2019

Electronic Structure Topology Associated Domain is Useful to Minimize the Uncertainty of QM/MM Boundary Charge Transfer Effects

The charge transfer effect is an important component in the physical description of realistic proteins. In the hybrid quantum mechanical-molecular mechanical (QM/MM) simulations, the significant charge transfer between the QM/MM boundaries could lead to the slow convergence problem with very large QM regions. In this work, we will discuss how community structure in complex network (electronic structure topology associated domain) can be used to measure QM/MM boundary effects and how it can provide a different perspective on well established concepts in available QM/MM simulations. The graph theory is employed to provide an useful solution to distinguish the significant charge transfer regions between the core active site and the surrounding protein environment in the QM/MM simulations. According to community detection algorithm for complex network, the charge transfer topology associated domain (ctTAD) is suggested to provide an alternative tool for systematically minimizing the charge transfer effects of QM/MM boundary with minor computational costs.

physics.chem-ph↗

arXiv2019

Quantum Tomography of the Photon-Plasmon Conversion Process in a Metal Hole Array

In the past decades, quantum plasmonics has become an active area due to its potential applications in on-chip plasmonic devices for quantum information processing. However, the fundamental physical process, i.e., how a quantum state of light evolves in the photon-plasmon conversion process, has not been clearly understood. Here, we report a complete characterization of the plasmon-assisted extraordinary optical transmission process through quantum process tomography. By inputting various coherent states to interact with the plasmonic structure and detecting the output states with a homodyne detector, we reconstruct the process tensor of the photon-plasmon conversion process. Both the amplitude and phase information of the process are extracted, which explains the evolution of the quantum-optical state after the coupling with plasmons. Our experimental demonstration constitutes a fundamental block for future on-chip applications of quantum plasmonic circuits.

quant-ph↗

arXiv2019

Data Driven Charge Transfer Atlas Provides Topological View of Electronic Structure Properties for Arbitrary Proteins Complexes

Due to the highly complex chemical structure of biomolecules, the extensive understanding of the electronic information for proteomics can be challenging. Here, we constructed a charge transfer database at residue level derived from millions of electronic structure calculations among 20x20 possible amino acid side-chains combinations, which were extracted from available high-quality structures of thousands of protein complexes. Then, the data driven network (D2Net) analysis was proposed to quickly identify the critical residue or residue groups for any possible protein complex. As an initial evaluation, we applied this model to scrutinize the charge transfer networks for two randomly selected proteins, which highlighted the most critical residues with large node degrees as network hubs. This work may provide us a promising computional protocol for topologically understanding the electronic structure information in the growing number of high-quality experimental proteins structures, with minor computational costs.

physics.chem-ph↗

arXiv2019

An End-to-End Joint Unsupervised Learning of Deep Model and Pseudo-Classes for Remote Sensing Scene Representation

This work develops a novel end-to-end deep unsupervised learning method based on convolutional neural network (CNN) with pseudo-classes for remote sensing scene representation. First, we introduce center points as the centers of the pseudo classes and the training samples can be allocated with pseudo labels based on the center points. Therefore, the CNN model, which is used to extract features from the scenes, can be trained supervised with the pseudo labels. Moreover, a pseudo-center loss is developed to decrease the variance between the samples and the corresponding pseudo center point. The pseudo-center loss is important since it can update both the center points with the training samples and the CNN model with the center points in the training process simultaneously. Finally, joint learning of the pseudo-center loss and the pseudo softmax loss which is formulated with the samples and the pseudo labels is developed for unsupervised remote sensing scene representation to obtain discriminative representations from the scenes. Experiments are conducted over two commonly used remote sensing scene datasets to validate the effectiveness of the proposed method and the experimental results show the superiority of the proposed method when compared with other state-of-the-art methods.

cs.CV↗

arXiv2019

Direct Determination of Band Gap Renormalization in Photo-Excited Monolayer MoS2

A key feature of monolayer semiconductors, such as transition-metal dichalcogenides, is the poorly screened Coulomb potential, which leads to large exciton binding energy (Eb) and strong renormalization of the quasiparticle bandgap (Eg) by carriers. The latter has been difficult to determine due to cancellation in changes of Eb and Eg, resulting in little change in optical transition energy at different carrier densities. Here we quantify bandgap renormalization in macroscopic single crystal MoS2 monolayers on SiO2 using time and angle resolved photoemission spectroscopy (TR-ARPES). At excitation density above the Mott threshold, Eg decreases by as much as 360 meV. We compare the carrier density dependent Eg with previous theoretical calculations and show the necessity of knowing both doping and excitation densities in quantifying the bandgap.

cond-mat.str-el↗

arXiv2019

Three-dimensional laser printing of macro-scale glass objects at a micro-scale resolution

Three-dimensional (3D) printing has allowed for production of geometrically complex 3D objects with extreme flexibility, which is currently undergoing rapid expansions in terms of materials, functionalities, as well as areas of application. When attempting to print 3D microstructures in glass, femtosecond laser induced chemical etching (FLICE) has proved itself a powerful approach. Here, we demonstrate fabrication of macro-scale 3D glass objects of large heights up to ~3.8 cm with a well-balanced (i.e., lateral vs longitudinal) spatial resolution of ~20 μm. The remarkable accomplishment is achieved by revealing an unexplored regime in the interaction of ultrafast laser pulses with fused silica which results in aberration-free focusing of the laser pulses deeply inside fused silica.

physics.app-ph↗

arXiv2019

Comparative Study of Differentially Private Data Synthesis Methods

When sharing data among researchers or releasing data for public use, there is a risk of exposing sensitive information of individuals in the data set. Data synthesis (DS) is a statistical disclosure limitation technique for releasing synthetic data sets with pseudo individual records. Traditional DS techniques often rely on strong assumptions of a data intruder's behaviors and background knowledge to assess disclosure risk. Differential privacy (DP) formulates a theoretical approach for a strong and robust privacy guarantee in data release without having to model intruders' behaviors. Efforts have been made aiming to incorporate the DP concept in the DS process. In this paper, we examine current DIfferentially Private Data Synthesis (DIPS) techniques for releasing individual-level surrogate data for the original data, compare the techniques conceptually, and evaluate the statistical utility and inferential properties of the synthetic data via each DIPS technique through extensive simulation studies. Our work sheds light on the practical feasibility and utility of the various DIPS approaches, and suggests future research directions for DIPS.

stat.ME↗

arXiv2018

SANTIS: Sampling-Augmented Neural neTwork with Incoherent Structure for MR image reconstruction

Deep learning holds great promise in the reconstruction of undersampled Magnetic Resonance Imaging (MRI) data, providing new opportunities to escalate the performance of rapid MRI. In existing deep learning-based reconstruction methods, supervised training is performed using artifact-free reference images and their corresponding undersampled pairs. The undersampled images are generated by a fixed undersampling pattern in the training, and the trained network is then applied to reconstruct new images acquired with the same pattern in the inference. While such a training strategy can maintain a favorable reconstruction for a pre-selected undersampling pattern, the robustness of the trained network against any discrepancy of undersampling schemes is typically poor. We developed a novel deep learning-based reconstruction framework called SANTIS for efficient MR image reconstruction with improved robustness against sampling pattern discrepancy. SANTIS uses a data cycle-consistent adversarial network combining efficient end-to-end convolutional neural network mapping, data fidelity enforcement and adversarial training for reconstructing accelerated MR images more faithfully. A training strategy employing sampling augmentation with extensive variation of undersampling patterns was further introduced to promote the robustness of the trained network. Compared to conventional reconstruction and standard deep learning methods, SANTIS achieved consistent better reconstruction performance, with lower errors, greater image sharpness and higher similarity with respect to the reference regardless of the undersampling patterns during inference. This novel concept behind SANTIS can particularly be useful towards improving the robustness of deep learning-based image reconstruction against discrepancy between training and evaluation, which is currently an important but less studied open question.

cs.CV↗

arXiv2018

SUSAN: Segment Unannotated image Structure using Adversarial Network

Segmentation of magnetic resonance (MR) images is a fundamental step in many medical imaging-based applications. The recent implementation of deep convolutional neural networks (CNNs) in image processing has been shown to have significant impacts on medical image segmentation. Network training of segmentation CNNs typically requires images and paired annotation data representing pixel-wise tissue labels referred to as masks. However, the supervised training of highly efficient CNNs with deeper structure and more network parameters requires a large number of training images and paired tissue masks. Thus, there is great need to develop a generalized CNN-based segmentation method which would be applicable for a wide variety of MR image datasets with different tissue contrasts. The purpose of this study was to develop and evaluate a generalized CNN-based method for fully-automated segmentation of different MR image datasets using a single set of annotated training data. A technique called cycle-consistent generative adversarial network (CycleGAN) is applied as the core of the proposed method to perform image-to-image translation between MR image datasets with different tissue contrasts. A joint segmentation network is incorporated into the adversarial network to obtain additional segmentation functionality. The proposed method was evaluated for segmenting bone and cartilage on two clinical knee MR image datasets acquired at our institution using only a single set of annotated data from a publicly available knee MR image dataset. The new technique may further improve the applicability and efficiency of CNN-based segmentation of medical images while eliminating the need for large amounts of annotated training data.

cs.CV↗

arXiv2018

Solving multiple-criteria R&D project selection problems with a data-driven evidential reasoning rule

In this paper, a likelihood based evidence acquisition approach is proposed to acquire evidence from experts'assessments as recorded in historical datasets. Then a data-driven evidential reasoning rule based model is introduced to R&D project selection process by combining multiple pieces of evidence with different weights and reliabilities. As a result, the total belief degrees and the overall performance can be generated for ranking and selecting projects. Finally, a case study on the R&D project selection for the National Science Foundation of China is conducted to show the effectiveness of the proposed model. The data-driven evidential reasoning rule based model for project evaluation and selection (1) utilizes experimental data to represent experts' assessments by using belief distributions over the set of final funding outcomes, and through this historic statistics it helps experts and applicants to understand the funding probability to a given assessment grade, (2) implies the mapping relationships between the evaluation grades and the final funding outcomes by using historical data, and (3) provides a way to make fair decisions by taking experts' reliabilities into account. In the data-driven evidential reasoning rule based model, experts play different roles in accordance with their reliabilities which are determined by their previous review track records, and the selection process is made interpretable and fairer. The newly proposed model reduces the time-consuming panel review work for both managers and experts, and significantly improves the efficiency and quality of project selection process. Although the model is demonstrated for project selection in the NSFC, it can be generalized to other funding agencies or industries.

cs.DL↗

arXiv2018

Identifying orbital angular momentum of vectorial vortices with Pancharatnam phase and Stokes parameters

In this work, an explicit formula is deduced for identifying the orbital angular moment (OAM) of vectorial vortex with space-variant state of polarization (SOP). Different to scalar vortex, the OAM of vectorial vortex can be attributed to two parts: the azimuthal gradient of Pancharatnam phase and the product of the azimuthal gradient of orientation angle of SOP and relevant solid angle on the Poincaré sphere. With our formula, a geometrical description for OAM of light beams can be achieved under the framework of the traditional Poincaré sphere. Numerical simulations for two types of vectorial vortices have been carried on to confirm our presented formula and demonstrate the geometrical description of OAM. Furthermore, the finding will pave the way for precise characterization of OAM charge of vectorial vortices.

physics.optics↗

arXiv2018

MANTIS: Model-Augmented Neural neTwork with Incoherent k-space Sampling for efficient MR T2 mapping

Quantitative mapping of magnetic resonance (MR) parameters have been shown as valuable methods for improved assessment of a range of diseases. Due to the need to image an anatomic structure multiple times, parameter mapping usually requires long scan times compared to conventional static imaging. Therefore, accelerated parameter mapping is highly-desirable and remains a topic of great interest in the MR research community. While many recent deep learning methods have focused on highly efficient image reconstruction for conventional static MR imaging, applications of deep learning for dynamic imaging and in particular accelerated parameter mapping have been limited. The purpose of this work was to develop and evaluate a novel deep learning-based reconstruction framework called Model-Augmented Neural neTwork with Incoherent k-space Sampling (MANTIS) for efficient MR parameter mapping. Our approach combines end-to-end CNN mapping with k-space consistency using the concept of cyclic loss to further enforce data and model fidelity. Incoherent k-space sampling is used to improve reconstruction performance. A physical model is incorporated into the proposed framework, so that the parameter maps can be efficiently estimated directly from undersampled images. The performance of MANTIS was demonstrated for the spin-spin relaxation time (T2) mapping of the knee joint. Compared to conventional reconstruction approaches that exploited image sparsity, MANTIS yielded lower errors and higher similarity with respect to the reference in the T2 estimation. Our study demonstrated that the proposed MANTIS framework, with a combination of end-to-end CNN mapping, signal model-augmented data consistency, and incoherent k-space sampling, represents a promising approach for efficient MR parameter mapping. MANTIS can potentially be extended to other types of parameter mapping with appropriate models.

cs.CV↗

arXiv2018

Analysis of Thompson Sampling for Graphical Bandits Without the Graphs

We study multi-armed bandit problems with graph feedback, in which the decision maker is allowed to observe the neighboring actions of the chosen action, in a setting where the graph may vary over time and is never fully revealed to the decision maker. We show that when the feedback graphs are undirected, the original Thompson Sampling achieves the optimal (within logarithmic factors) regret $\tilde{O}\left(\sqrt{β_0(G)T}\right)$ over time horizon $T$, where $β_0(G)$ is the average independence number of the latent graphs. To the best of our knowledge, this is the first result showing that the original Thompson Sampling is optimal for graphical bandits in the undirected setting. A slightly weaker regret bound of Thompson Sampling in the directed setting is also presented. To fill this gap, we propose a variant of Thompson Sampling, that attains the optimal regret in the directed setting within a logarithmic factor. Both algorithms can be implemented efficiently and do not require the knowledge of the feedback graphs at any time.

stat.ML↗