arXiv subjects

Jie Wang

Publications and source records attributed to Jie Wang.

At least 541 records · Page 30Linked to original sources

arXiv2020

Focal Loss Analysis of Nerve Fiber Layer Reflectance for Glaucoma Diagnosis

Purpose: To evaluate nerve fiber layer (NFL) reflectance for glaucoma diagnosis. Methods: Participants were imaged with 4.5X4.5-mm volumetric disc scans using spectral-domain optical coherence tomography (OCT). The normalized NFL reflectance map was processed by an azimuthal filter to reduce directional reflectance bias due to variation of beam incidence angle. The peripapillary area of the map was divided into 160 superpixels. Average reflectance was the mean of superpixel reflectance. Low-reflectance superpixels were identified as those with NFL reflectance below the 5 percentile normative cutoff. Focal reflectance loss was measure by summing loss in low-reflectance superpixels. Results: Thirty-five normal, 30 pre-perimetric and 35 perimetric glaucoma participants were enrolled. Azimuthal filtering improved the repeatability of the normalized NFL reflectance, as measured by the pooled superpixel standard deviation (SD), from 0.73 to 0.57 dB (p<0.001, paired t-test) and reduced the population SD from 2.14 to 1.78 dB (p<0.001, t-test). Most glaucomatous reflectance maps showed characteristic patterns of contiguous wedge or diffuse defects. Focal NFL reflectance loss had significantly higher diagnostic sensitivity than the best NFL thickness parameter (overall, inferior, or focal loss volume): 53% v. 23% (p=0.027) in PPG eyes and 100% v. 80% (p=0.023) in PG eyes, with the specificity fixed at 99%. Conclusions: Azimuthal filtering reduces the variability of NFL reflectance measurements. Focal NFL reflectance loss has excellent glaucoma diagnostic accuracy compared to the standard NFL thickness parameters. The reflectance map may be useful for localizing NFL defects.

eess.IV↗

arXiv2020

Automated segmentation of retinal fluid volumes from structural and angiographic optical coherence tomography using deep learning

Purpose: We proposed a deep convolutional neural network (CNN), named Retinal Fluid Segmentation Network (ReF-Net) to segment volumetric retinal fluid on optical coherence tomography (OCT) volume. Methods: 3 x 3-mm OCT scans were acquired on one eye by a 70-kHz OCT commercial AngioVue system (RTVue-XR; Optovue, Inc.) from 51 participants in a clinical diabetic retinopathy (DR) study (45 with retinal edema and 6 healthy controls). A CNN with U-Net-like architecture was constructed to detect and segment the retinal fluid. Cross-sectional OCT and angiography (OCTA) scans were used for training and testing ReF-Net. The effect of including OCTA data for retinal fluid segmentation was investigated in this study. Volumetric retinal fluid can be constructed using the output of ReF-Net. Area-under-Receiver-Operating-Characteristic-curve (AROC), intersection-over-union (IoU), and F1-score were calculated to evaluate the performance of ReF-Net. Results: ReF-Net shows high accuracy (F1 = 0.864 +/- 0.084) in retinal fluid segmentation. The performance can be further improved (F1 = 0.892 +/- 0.038) by including information from both OCTA and structural OCT. ReF-Net also shows strong robustness to shadow artifacts. Volumetric retinal fluid can provide more comprehensive information than the 2D area, whether cross-sectional or en face projections. Conclusions: A deep-learning-based method can accurately segment retinal fluid volumetrically on OCT/OCTA scans with strong robustness to shadow artifacts. OCTA data can improve retinal fluid segmentation. Volumetric representations of retinal fluid are superior to 2D projections. Translational Relevance: Using a deep learning method to segment retinal fluid volumetrically has the potential to improve the diagnostic accuracy of diabetic macular edema by OCT systems.

eess.IV↗

arXiv2020

Spectral Dynamic Causal Modelling of Resting-State fMRI: Relating Effective Brain Connectivity in the Default Mode Network to Genetics

We conduct an imaging genetics study to explore how effective brain connectivity in the default mode network (DMN) may be related to genetics within the context of Alzheimer's disease and mild cognitive impairment. We develop an analysis of longitudinal resting-state functional magnetic resonance imaging (rs-fMRI) and genetic data obtained from a sample of 111 subjects with a total of 319 rs-fMRI scans from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database. A Dynamic Causal Model (DCM) is fit to the rs-fMRI scans to estimate effective brain connectivity within the DMN and related to a set of single nucleotide polymorphisms (SNPs) contained in an empirical disease-constrained set which is obtained out-of-sample from 663 ADNI subjects having only genome-wide data. We examine longitudinal data in both a 4-region and an 6-region network and relate longitudinal effective brain connectivity networks estimated using spectral DCM to SNPs using both linear mixed effect (LME) models as well as function-on-scalar regression (FSR). In the former case we implement a parametric bootstrap for testing SNP coefficients and make comparisons with p-values obtained from the chi-squared null distribution. We also implement a parametric bootstrap approach for testing regression functions in FSR and we make comparisons between p-values obtained from the parametric bootstrap to p-values obtained using the F-distribution with degrees-of-freedom based on Satterthwaite's approximation. In both networks we report on exploratory patterns of associations with relatively high ranks that exhibit stability to the differing assumptions made by both FSR and LME.

q-bio.NC↗

arXiv2020

TSSOS: A Moment-SOS hierarchy that exploits term sparsity

This paper is concerned with polynomial optimization problems. We show how to exploit term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature) of such relaxations is to involve block-diagonal matrices obtained in an iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Our theoretical framework is then applied to compute lower bounds for polynomial optimization problems either randomly generated or coming from the networked systems literature.

math.OC↗

arXiv2020

An Unsupervised Semantic Sentence Ranking Scheme for Text Documents

This paper presents Semantic SentenceRank (SSR), an unsupervised scheme for automatically ranking sentences in a single document according to their relative importance. In particular, SSR extracts essential words and phrases from a text document, and uses semantic measures to construct, respectively, a semantic phrase graph over phrases and words, and a semantic sentence graph over sentences. It applies two variants of article-structure-biased PageRank to score phrases and words on the first graph and sentences on the second graph. It then combines these scores to generate the final score for each sentence. Finally, SSR solves a multi-objective optimization problem for ranking sentences based on their final scores and topic diversity through semantic subtopic clustering. An implementation of SSR that runs in quadratic time is presented, and it outperforms, on the SummBank benchmarks, each individual judge's ranking and compares favorably with the combined ranking of all judges.

cs.IR↗

arXiv2020

Two-dimensional metallic ferroelectricity in PbTe monolayer by electrostatic doping

Polar metals characterized by the simultaneous coexistence of ferroelectric distortions and metallicity have attracted tremendous attention. Developing such materials at low dimensions remains challenging since both conducting electrons and reduced dimensions are supposed to quench ferroelectricity. Here, based on first-principles calculations, we report the discovery of ferroelectric behavior in two-dimensional (2D) metallic materials with electrostatic doping, even though ferroelectricity is unconventional at the atomic scale. We reveal that PbTe monolayer is intrinsic ferroelectrics with pronounced out-of-plane electric polarization originated from its non-centrosymmetric buckled structure. The ferroelectric distortions can be preserved with carriers doping in the ferroelectric monolayer, which thus enables the doped PbTe monolayer to act as a 2D polar metal. With an effective Hamiltonian extracted from the parametrized energy space, we found that the elastic-polar mode interaction is of great importance for the existence of robust polar instability in the doped system. The application of this doping strategy is not specific to the present crystal, but is rather general to other 2D ferroelectrics to bring about the fascinating metallic ferroelectric properties. Our findings thus change conventional acknowledge in 2D materials and will facilitate the development of multifunctional material in low dimensions.

cond-mat.mtrl-sci↗

arXiv2020

Halo Spin from Primordial Inner Motions

The standard explanation for galaxy spin starts with the tidal-torque theory (TTT), in which an ellipsoidal dark-matter protohalo, which comes to host the galaxy, is torqued up by the tidal gravitational field around it. We discuss a complementary picture, using the relatively familiar velocity field, instead of the tidal field, whose intuitive connection to the surrounding, possibly faraway matter arrangement is more obscure. In this 'spin from primordial inner motions' (SPIM) concept, implicit in TTT derivations but not previously emphasized, the angular momentum from the gravity-sourced velocity field inside a protohalo largely cancels out, but has some excess from the aspherical outskirts. At first, the net spin scales according to linear theory, a sort of comoving conservation of familiar angular momentum. Then, at collapse, it is conserved in physical coordinates. Small haloes are then typically subject to secondary exchanges of angular momentum. The TTT is useful for analytic estimates. But a literal interpretation of the TTT is inaccurate in detail, without some implicit concepts about smoothing of the velocity and tidal fields. This could lead to misconceptions, for those first learning about how galaxies come to spin. Protohaloes are not perfectly ellipsoidal and do not uniformly torque up, as in a naive interpretation of the TTT; their inner velocity fields retain substantial dispersion. Furthermore, quantitatively, given initial conditions and protohalo boundaries, SPIM is more direct and accurate than the TTT to predict halo spins. We also discuss how SPIM applies to rotating filaments, and the relation between halo mass and spin, in which the total spin of a halo can be thought of as a sum of random contributions.

astro-ph.CO↗

arXiv2020

Chordal-TSSOS: a moment-SOS hierarchy that exploits term sparsity with chordal extension

This work is a follow-up and a complement to arXiv:1912.08899 [math.OC] for solving polynomial optimization problems (POPs). The chordal-TSSOS hierarchy that we propose is a new sparse moment-SOS framework based on term-sparsity and chordal extension. By exploiting term-sparsity of the input polynomials we obtain a two-level hierarchy of semidefinite programming relaxations. The novelty and distinguishing feature of such relaxations is to obtain quasi block-diagonal matrices obtained in an iterative procedure that performs chordal extension of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Various numerical examples demonstrate the efficiency and the scalability of this new hierarchy for both unconstrained and constrained POPs. The two hierarchies are complementary. While the former TSSOS arXiv:1912.08899 [math.OC] has a theoretical convergence guarantee, the chordal-TSSOS has superior performance but lacks this theoretical guarantee.

math.OC↗

arXiv2020

A second order cone characterization for sums of nonnegative circuits

The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a representation using second-order cones, given that they have a strong expressive ability. In this paper, we prove constructively that the cone of sums of nonnegative circuits (SONC) admits a second-order cone representation. Based on this, we give a new algorithm to compute SONC decompositions for certain classes of nonnegative polynomials via second-order cone programming. Numerical experiments demonstrate the efficiency of our algorithm for polynomials with a fairly large size.

math.OC↗

arXiv2020

Simulating Kilonovae in the ΛCDM Universe

Kilonovae are optical flashes produced in the aftermath of neutron star-neutron star mergers (NNMs) or neutron star-black hole mergers (NBMs). In this work, we use the Millennium Simulation, combined with a semi-analytic galaxy formation model--GABE (Galaxy Assembly with Binary Evolution) which adopts binary stellar population synthesis models, to explore the cosmic event rate of kilonovae, and the properties of their host galaxies in a cosmological context. We find that model with supernova kick velocity of 0 km/s fits the observation best, in agreement with the exception of some formation channels of binary neutron star. This indicates that NNMs prefer to originate from binary systems with low kick velocities. With V$_{\rm kick}$=0 km/s, the cosmic event rate of NNMs and NBMs at z=0 are 283 Gpc$^{-3}$yr$^{-1}$ and 91 Gpc$^{-3}$yr$^{-1}$, respectively, marginally consistent with the constraint from LVC GWTC-1. For Milky Way-mass galaxies, we predict the NNM rate is $25.7^{+59.6}_{-7.1}$ Myr$^{-1}$, which is also in good agreement with the observed properties of binary neutron stars in the Milky Way. Taking all the NNMs into account in the history of Milky Way-mass galaxies, we find that the averaged r-process elements yield with A>79 in a NNM and NBM event should be 0.01 M$_{\odot}$ to be consistent with observation. We conclude that NGC 4993, the host galaxy of GW170817, is a typical host galaxy for NNMs. However, generally NNMs and NBMs tend to reside in young, blue, star-forming, late-type galaxies, with stellar mass and gaseous metallicity distribution peaking at $10^{10.65}$ M$_{\odot}$ and 8.72-8.85, respectively. By studying kilonovae host galaxies in the cosmological background, it is promising to constrain model details better when we have more events in the forthcoming future. (abridged)

astro-ph.GA↗

arXiv2020

Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks

The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes, called batched codes, is studied for line networks. Batched codes enable a range of buffer size constraints, and are general enough to include special coding schemes studied in the literature for line networks. Existing works have characterized the achievable rates of batched codes for several classes of parameter sets, but leave the cut-set bound as the best existing general upper bound. In this paper, we provide upper bounds on the achievable rates of batched codes as functions of line network length for these parameter sets. Our upper bounds are tight in order of the network length compared with the existing achievability results.

cs.IT↗

arXiv2019

An Efficient Pre-processing Method to Eliminate Adversarial Effects

Deep Neural Networks (DNNs) are vulnerable to adversarial examples generated by imposing subtle perturbations to inputs that lead a model to predict incorrect outputs. Currently, a large number of researches on defending adversarial examples pay little attention to the real-world applications, either with high computational complexity or poor defensive effects. Motivated by this observation, we develop an efficient preprocessing method to defend adversarial images. Specifically, before an adversarial example is fed into the model, we perform two image transformations: WebP compression, which is utilized to remove the small adversarial noises. Flip operation, which flips the image once along one side of the image to destroy the specific structure of adversarial perturbations. Finally, a de-perturbed sample is obtained and can be correctly classified by DNNs. Experimental results on ImageNet show that our method outperforms the state-of-the-art defense methods. It can effectively defend adversarial attacks while ensure only very small accuracy drop on normal images.

cs.CV↗

arXiv2019

Further evidence for a population of dark-matter-deficient dwarf galaxies

In the standard cosmological model, dark matter drives the structure formation and constructs potential wells within which galaxies may form. The baryon fraction in dark halos can reach the universal value (15.7%) in massive clusters and decreases rapidly as the mass of the system decreases. The formation of dwarf galaxies is sensitive both to baryonic processes and the properties of dark matter owing to the shallow potential wells in which they form. In dwarf galaxies in the Local Group, dark matter dominates the mass content even within their optical-light half-radii (r_e ~ 1 kpc). However, recently it has been argued that not all dwarf galaxies are dominated by dark matter. Here we report 19 dwarf galaxies that could consist mainly of baryons up to radii well beyond r_e, at which point they are expected to be dominated by dark matter. Of these, 14 are isolated dwarf galaxies, free from the influence of nearby bright galaxies and high dense environments. This result provides observational evidence that could challenge the formation theory of low-mass galaxies within the framework of standard cosmology. Further observations, in particular deep imaging and spatially-resolved kinematics, are needed to constrain the baryon fraction better in such galaxies.

astro-ph.GA↗

arXiv2019

An Iterative Polishing Framework based on Quality Aware Masked Language Model for Chinese Poetry Generation

Owing to its unique literal and aesthetical characteristics, automatic generation of Chinese poetry is still challenging in Artificial Intelligence, which can hardly be straightforwardly realized by end-to-end methods. In this paper, we propose a novel iterative polishing framework for highly qualified Chinese poetry generation. In the first stage, an encoder-decoder structure is utilized to generate a poem draft. Afterwards, our proposed Quality-Aware Masked Language Model (QAMLM) is employed to polish the draft towards higher quality in terms of linguistics and literalness. Based on a multi-task learning scheme, QA-MLM is able to determine whether polishing is needed based on the poem draft. Furthermore, QAMLM is able to localize improper characters of the poem draft and substitute with newly predicted ones accordingly. Benefited from the masked language model structure, QAMLM incorporates global context information into the polishing process, which can obtain more appropriate polishing results than the unidirectional sequential decoding. Moreover, the iterative polishing process will be terminated automatically when QA-MLM regards the processed poem as a qualified one. Both human and automatic evaluation have been conducted, and the results demonstrate that our approach is effective to improve the performance of encoder-decoder structure.

cs.CL↗

arXiv2019

Deep Model-Based Reinforcement Learning via Estimated Uncertainty and Conservative Policy Optimization

Model-based reinforcement learning algorithms tend to achieve higher sample efficiency than model-free methods. However, due to the inevitable errors of learned models, model-based methods struggle to achieve the same asymptotic performance as model-free methods. In this paper, We propose a Policy Optimization method with Model-Based Uncertainty (POMBU)---a novel model-based approach---that can effectively improve the asymptotic performance using the uncertainty in Q-values. We derive an upper bound of the uncertainty, based on which we can approximate the uncertainty accurately and efficiently for model-based methods. We further propose an uncertainty-aware policy optimization algorithm that optimizes the policy conservatively to encourage performance improvement with high probability. This can significantly alleviate the overfitting of policy to inaccurate models. Experiments show POMBU can outperform existing state-of-the-art policy optimization algorithms in terms of sample efficiency and asymptotic performance. Moreover, the experiments demonstrate the excellent robustness of POMBU compared to previous model-based approaches.

cs.LG↗

arXiv2019

D-SPIDER-SFO: A Decentralized Optimization Algorithm with Faster Convergence Rate for Nonconvex Problems

Decentralized optimization algorithms have attracted intensive interests recently, as it has a balanced communication pattern, especially when solving large-scale machine learning problems. Stochastic Path Integrated Differential Estimator Stochastic First-Order method (SPIDER-SFO) nearly achieves the algorithmic lower bound in certain regimes for nonconvex problems. However, whether we can find a decentralized algorithm which achieves a similar convergence rate to SPIDER-SFO is still unclear. To tackle this problem, we propose a decentralized variant of SPIDER-SFO, called decentralized SPIDER-SFO (D-SPIDER-SFO). We show that D-SPIDER-SFO achieves a similar gradient computation cost---that is, $\mathcal{O}(ε^{-3})$ for finding an $ε$-approximate first-order stationary point---to its centralized counterpart. To the best of our knowledge, D-SPIDER-SFO achieves the state-of-the-art performance for solving nonconvex optimization problems on decentralized networks in terms of the computational cost. Experiments on different network configurations demonstrate the efficiency of the proposed method.

cs.LG↗

arXiv2019

Distributional Robustness and Uncertainty Quantification for Rare Events

Rare events, and more general risk-sensitive quantities-of-interest (QoIs), are significantly impacted by uncertainty in the tail behavior of a distribution. Uncertainty in the tail can take many different forms, each of which leads to a particular ambiguity set of alternative models. Distributional robustness bounds over such an ambiguity set constitute a stress-test of the model. In this paper we develop a method, utilizing Rényi-divergences, of constructing the ambiguity set that captures a user-specified form of tail-perturbation. We then obtain distributional robustness bounds (performance guarantees) for risk-sensitive QoIs over these ambiguity sets, using the known connection between Rényi-divergences and robustness for risk-sensitive QoIs. We also expand on this connection in several ways, including a generalization of the Donsker-Varadhan variational formula to Rényi divergences, and various tightness results. These ideas are illustrated through applications to uncertainty quantification in a model of lithium-ion battery failure, robustness of large deviations rate functions, and risk-sensitive distributionally robust optimization for option pricing.

math.PR↗

arXiv2019

AIM 2019 Challenge on Image Demoireing: Methods and Results

This paper reviews the first-ever image demoireing challenge that was part of the Advances in Image Manipulation (AIM) workshop, held in conjunction with ICCV 2019. This paper describes the challenge, and focuses on the proposed solutions and their results. Demoireing is a difficult task of removing moire patterns from an image to reveal an underlying clean image. A new dataset, called LCDMoire was created for this challenge, and consists of 10,200 synthetically generated image pairs (moire and clean ground truth). The challenge was divided into 2 tracks. Track 1 targeted fidelity, measuring the ability of demoire methods to obtain a moire-free image compared with the ground truth, while Track 2 examined the perceptual quality of demoire methods. The tracks had 60 and 39 registered participants, respectively. A total of eight teams competed in the final testing phase. The entries span the current the state-of-the-art in the image demoireing problem.

eess.IV↗