Searcharxiv⌕ Search

arXiv subjects

Jian Huang

Publications and source records attributed to Jian Huang.

At least 217 records · Page 12Linked to original sources

Photo-Guided Exploration of Volume Data Features

In this work, we pose the question of whether, by considering qualitative information such as a sample target image as input, one can produce a rendered image of scientific data that is similar to the target. The algorithm resulting from our research allows one to ask the question of whether features like those in the target image exists in a given dataset. In that way, our method is one of imagery query or reverse engineering, as opposed to manual parameter tweaking of the full visualization pipeline. For target images, we can use real-world photographs of physical phenomena. Our method leverages deep neural networks and evolutionary optimization. Using a trained similarity function that measures the difference between renderings of a phenomenon and real-world photographs, our method optimizes rendering parameters. We demonstrate the efficacy of our method using a superstorm simulation dataset and images found online. We also discuss a parallel implementation of our method, which was run on NCSA's Blue Waters.

cs.GR↗

Evidence of a two-stage melting of Wigner solids in two dimensions

Two-dimensional (2D) solid-liquid transition (SLT)~\cite{Mermin1966Absence,Mermin1968Crystalline,Kosterlitz1972Long} concerns fundamental concepts of long-range correlations vital to magnetism, superconductivity, superfluidity, and topological matters. A long sought-after example is the melting of a Wigner Crystal (WC)~\cite{Wigner1934Interaction} of electrons. Detection efforts have targeted distinctive collective modes such as pinning by disorder, resonant-frequency absorption of Goldstone modes, and melting transition. However, only one-step second-order melting of softly-pinned modes was reported. Without the evidence of genuine pinning as exhibited in the charge density waves (CDWs)~\cite{PinningCDW}, these modes are likely intermediate phases which are only part of a complete SLT. To verify if there is a WC-intermediate phase transition will not only provide a solid proof of a WC, but will also unveil the nature of the SLT in relation to the two-stage Kosterlitz-Thouless (KT) model~\cite{Kosterlitz1972Long,Kosterlitz1973Ordering,Halperin1978Theory,Nelson1979Dislocation,hexatic_ceperley,hexatic_nelson, Young1979Melting}. %(or dislocation pairs) above a critical temperature $T_c$. Through transport studies of ultra-dilute high-purity 2D systems, this work presents evidence for not only a WC, but also for a two-stage WC-liquid SLT mediated by a first-order WC-intermediate phase transition.

cond-mat.str-el↗

Spin-orbit coupling and transport of strongly correlated two-dimensional systems

Measuring the magnetoresistance (MR) of ultraclean {\it GaAs} two-dimensional holes in a large $r_s$ range of 20-50, two striking behaviors in relation to the spin-orbit coupling (SOC) emerge in response to strong electron-electron interaction. First, in exact correspondence to the zero-field metal-to-insulator transition (MIT), the sign of the MR switches from being positive in the metallic regime to being negative in the insulating regime when the carrier density crosses the critical density $p_c$ of MIT ($r_s\sim 39$). Second, as the SOC-driven correction $Δρ$ to the MR decreases with reducing carrier density (or the in-plane wave vector), it exhibits an upturn in the close proximity just above $p_c$ where $r_s$ is beyond 30, indicating a substantially enhanced SOC effect. This peculiar behavior echoes with a trend of delocalization long suspected for the SOC-interaction interplay. Meanwhile, for $p 40$, in contrast to the common belief that a magnet field enhances Wigner crystallization, the negative MR is likely linked to enhanced interaction.

cond-mat.str-el↗

Multigrid Methods for A Mixed Finite Element Method of The Darcy-Forchheimer Model

An efficient nonlinear multigrid method for a mixed finite element method of the Darcy-Forchheimer model is constructed in this paper. A Peaceman-Rachford type iteration is used as a smoother to decouple the nonlinearity from the divergence constraint. The nonlinear equation can be solved element-wise with a closed formulae. The linear saddle point system for the constraint is reduced into a symmetric positive definite system of Poisson type. Furthermore an empirical choice of the parameter used in the splitting is proposed and the resulting multigrid method is robust to the so-called Forchheimer number which controls the strength of the nonlinearity. By comparing the number of iterations and CPU time of different solvers in several numerical experiments, our multigrid method is shown to convergent with a rate independent of the mesh size and the Forchheimer number and with a nearly linear computational cost.

math.NA↗

Multispectral computational ghost imaging with multiplexed illumination

Computational ghost imaging is a robust and compact system that has drawn wide attentions over the last two decades. Multispectral imaging possesses spatial and spectral resolving abilities, is very useful for surveying scenes and extracting detailed information. Existing multispectral imagers mostly utilize narrow band filters or dispersive optical devices to separate lights of different wavelengths, and then use multiple bucket detectors or an array detector to record them separately. Here, we propose a novel multispectral ghost imaging method that uses one single bucket detector with multiplexed illumination to produce colored image. The multiplexed illumination patterns are produced by three binary encoded matrices (corresponding to red, green, blue colored information, respectively) and random patterns. The results of simulation and experiment have verified that our method can be effective to recover the colored object. Our method has two major advantages: one is that the binary encoded matrices as cipher keys can protect the security of private contents; the other is that multispectral images are produced simultaneously by one single-pixel detector, which significantly reduces the amount of the data acquisition.

physics.optics↗

A Constructive Approach to High-dimensional Regression

We develop a constructive approach to estimating sparse, high-dimensional linear regression models. The approach is a computational algorithm motivated from the KKT conditions for the $\ell_0$-penalized least squares solutions. It generates a sequence of solutions iteratively, based on support detection using primal and dual information and root finding. We refer to the algorithm as SDAR for brevity. Under a sparse Rieze condition on the design matrix and certain other conditions, we show that with high probability, the $\ell_2$ estimation error of the solution sequence decays exponentially to the minimax error bound in $O(\sqrt{J}\log(R))$ steps; and under a mutual coherence condition and certain other conditions, the $\ell_{\infty}$ estimation error decays to the optimal error bound in $O(\log(R))$ steps, where $J$ is the number of important predictors, $R$ is the relative magnitude of the nonzero target coefficients. Computational complexity analysis shows that the cost of SDAR is $O(np)$ per iteration. Moreover the oracle least squares estimator can be exactly recovered with high probability at the same cost if we know the sparsity level. We also consider an adaptive version of SDAR to make it more practical in applications. Numerical comparisons with Lasso, MCP and greedy methods demonstrate that SDAR is competitive with or outperforms them in accuracy and efficiency.

stat.CO↗

Semismooth Newton Coordinate Descent Algorithm for Elastic-Net Penalized Huber Loss Regression and Quantile Regression

We propose an algorithm, semismooth Newton coordinate descent (SNCD), for the elastic-net penalized Huber loss regression and quantile regression in high dimensional settings. Unlike existing coordinate descent type algorithms, the SNCD updates each regression coefficient and its corresponding subgradient simultaneously in each iteration. It combines the strengths of the coordinate descent and the semismooth Newton algorithm, and effectively solves the computational challenges posed by dimensionality and nonsmoothness. We establish the convergence properties of the algorithm. In addition, we present an adaptive version of the "strong rule" for screening predictors to gain extra efficiency. Through numerical experiments, we demonstrate that the proposed algorithm is very efficient and scalable to ultra-high dimensions. We illustrate the application via a real data example.

stat.CO↗

A concave pairwise fusion approach to subgroup analysis

An important step in developing individualized treatment strategies is to correctly identify subgroups of a heterogeneous population, so that specific treatment can be given to each subgroup. In this paper, we consider the situation with samples drawn from a population consisting of subgroups with different means, along with certain covariates. We propose a penalized approach for subgroup analysis based on a regression model, in which heterogeneity is driven by unobserved latent factors and thus can be represented by using subject-specific intercepts. We apply concave penalty functions to pairwise differences of the intercepts. This procedure automatically divides the observations into subgroups. We develop an alternating direction method of multipliers algorithm with concave penalties to implement the proposed approach and demonstrate its convergence. We also establish the theoretical properties of our proposed estimator and determine the order requirement of the minimal difference of signals between groups in order to recover them. These results provide a sound basis for making statistical inference in subgroup analysis. Our proposed method is further illustrated by simulation studies and analysis of the Cleveland heart disease dataset.

stat.ME↗

Promoting Similarity of Sparsity Structures in Integrative Analysis with Penalization

For data with high-dimensional covariates but small to moderate sample sizes, the analysis of single datasets often generates unsatisfactory results. The integrative analysis of multiple independent datasets provides an effective way of pooling information and outperforms single-dataset analysis and some alternative multi-datasets approaches including meta-analysis. Under certain scenarios, multiple datasets are expected to share common important covariates, that is, the multiple models have similarity in sparsity structures. However, the existing methods do not have a mechanism to {\it promote} the similarity of sparsity structures in integrative analysis. In this study, we consider penalized variable selection and estimation in integrative analysis. We develop an $L_0$-penalty based approach, which is the first to explicitly promote the similarity of sparsity structures. Computationally it is realized using a coordinate descent algorithm. Theoretically it has the much desired consistency properties. In simulation, it significantly outperforms the competing alternative when the models in multiple datasets share common important covariates. It has better or similar performance as the alternative when the sparsity structures share no similarity. Thus it provides a "safe" choice for data analysis. Applying the proposed method to three lung cancer datasets with gene expression measurements leads to models with significantly more similar sparsity structures and better prediction performance.

stat.ME↗

Penalized integrative analysis under the accelerated failure time model

For survival data with high-dimensional covariates, results generated in the analysis of a single dataset are often unsatisfactory because of the small sample size. Integrative analysis pools raw data from multiple independent studies with comparable designs, effectively increases sample size, and has better performance than meta-analysis and single-dataset analysis. In this study, we conduct integrative analysis of survival data under the accelerated failure time (AFT) model. The sparsity structures of multiple datasets are described using the homogeneity and heterogeneity models. For variable selection under the homogeneity model, we adopt group penalization approaches. For variable selection under the heterogeneity model, we use composite penalization and sparse group penalization approaches. As a major advancement from the existing studies, the asymptotic selection and estimation properties are rigorously established. Simulation study is conducted to compare different penalization methods and against alternatives. We also analyze four lung cancer prognosis datasets with gene expression measurements.

stat.ME↗

Semi-Penalized Inference with Direct False Discovery Rate Control in High-Dimensions

We propose a new method, semi-penalized inference with direct false discovery rate control (SPIDR), for variable selection and confidence interval construction in high-dimensional linear regression. SPIDR first uses a semi-penalized approach to constructing estimators of the regression coefficients. We show that the SPIDR estimator is ideal in the sense that it equals an ideal least squares estimator with high probability under a sparsity and other suitable conditions. Consequently, the SPIDR estimator is asymptotically normal. Based on this distributional result, SPIDR determines the selection rule by directly controlling false discovery rate. This provides an explicit assessment of the selection error. This also naturally leads to confidence intervals for the selected coefficients with a proper confidence statement. We conduct simulation studies to evaluate its finite sample performance and demonstrate its application on a breast cancer gene expression data set. Our simulation studies and data example suggest that SPIDR is a useful method for high-dimensional statistical inference in practice.

stat.ME↗

Evidence for A Two-dimensional Quantum Wigner Solid in Zero Magnetic Field

We report the first experimental observation of a characteristic nonlinear threshold behavior from dc dynamical response as an evidence for a Wigner crystallization in high-purity GaAs 2D hole systems in zero magnetic field. The system under increasing current drive exhibits voltage oscillations with negative differential resistance. They confirm the coexistence of a moving crystal along with striped edge states as observed for electrons on helium surfaces. However, the threshold is well below the typical classical levels due to a different pinning and depinning mechanism that is possibly related to a quantum process.

cond-mat.mes-hall↗

Group descent algorithms for nonconvex penalized linear and logistic regression models with grouped predictors

Penalized regression is an attractive framework for variable selection problems. Often, variables possess a grouping structure, and the relevant selection problem is that of selecting groups, not individual variables. The group lasso has been proposed as a way of extending the ideas of the lasso to the problem of group selection. Nonconvex penalties such as SCAD and MCP have been proposed and shown to have several advantages over the lasso; these penalties may also be extended to the group selection problem, giving rise to group SCAD and group MCP methods. Here, we describe algorithms for fitting these models stably and efficiently. In addition, we present simulation results and real data examples comparing and contrasting the statistical properties of these methods.

stat.CO↗

Characteristic Sign Change of the Magnetoresistance of Strongly Correlated GaAs Two-dimensional Holes

High quality strongly correlated two-dimensional (2D) electron systems at low temperatures $T\rightarrow 0$ exhibits an apparent metal-to-insulator transition (MIT) at a large $r_s$ value around 40. We have measured the magnetoresistance of 2D holes in weak perpendicular magnetic field in the vicinity of the transition for a series of carrier densities ranging from $0.2-1.5\times10^{10}$ $cm^{-2}$. The sign of the magnetoresistance is found to be charge density dependent: in the direction of decreasing density, the sign changes from being positive to negative across a characteristic value that coincides with the critical density of MIT.

cond-mat.mes-hall↗

Light-induced long-ranged disorder effect in ultra-dilute two-dimensional holes in GaAs heterojunction-insulated-gate field-effect-transistors

Comparing the results of transport measurements of strongly correlated two-dimensional holes in a GaAs heterojunction-insulated-gate field-effect-transistor obtained before and after a brief photo-illumination, the light-induced disorder is found to cause qualitative changes suggesting altered carrier states. For charge concentrations ranging from $3\times10^{10}$ $cm^{-2}$ down to $7\times10^{8}$ cm$^{-2}$, the post-illumination hole mobility exhibits a severe suppression for charge densities below $2\times10^{10}$ cm$^{-2}$, while almost no change for densities above. The long-ranged nature of the disorder is identified. The temperature dependence of the conductivity is also drastically modified by the disorder reconfiguration from being nonactivated to activated.

cond-mat.mes-hall↗

Oracle inequalities for the lasso in the Cox model

We study the absolute penalized maximum partial likelihood estimator in sparse, high-dimensional Cox proportional hazards regression models where the number of time-dependent covariates can be larger than the sample size. We establish oracle inequalities based on natural extensions of the compatibility and cone invertibility factors of the Hessian matrix at the true regression coefficients. Similar results based on an extension of the restricted eigenvalue can be also proved by our method. However, the presented oracle inequalities are sharper since the compatibility and cone invertibility factors are always greater than the corresponding restricted eigenvalue. In the Cox regression model, the Hessian matrix is based on time-dependent covariates in censored risk sets, so that the compatibility and cone invertibility factors, and the restricted eigenvalue as well, are random variables even when they are evaluated for the Hessian at the true regression coefficients. Under mild conditions, we prove that these quantities are bounded from below by positive constants for time-dependent covariates, including cases where the number of covariates is of greater order than the sample size. Consequently, the compatibility and cone invertibility factors can be treated as positive constants in our oracle inequalities.

math.ST↗

A Penalized Multi-trait Mixed Model for Association Mapping in Pedigree-based GWAS

In genome-wide association studies (GWAS), penalization is an important approach for identifying genetic markers associated with trait while mixed model is successful in accounting for a complicated dependence structure among samples. Therefore, penalized linear mixed model is a tool that combines the advantages of penalization approach and linear mixed model. In this study, a GWAS with multiple highly correlated traits is analyzed. For GWAS with multiple quantitative traits that are highly correlated, the analysis using traits marginally inevitably lose some essential information among multiple traits. We propose a penalized-MTMM, a penalized multivariate linear mixed model that allows both the within-trait and between-trait variance components simultaneously for multiple traits. The proposed penalized-MTMM estimates variance components using an AI-REML method and conducts variable selection and point estimation simultaneously using group MCP and sparse group MCP. Best linear unbiased predictor (BLUP) is used to find predictive values and the Pearson's correlations between predictive values and their corresponding observations are used to evaluate prediction performance. Both prediction and selection performance of the proposed approach and its comparison with the uni-trait penalized-LMM are evaluated through simulation studies. We apply the proposed approach to a GWAS data from Genetic Analysis Workshop (GAW) 18.

stat.ME↗

Integrative Analysis of Prognosis Data on Multiple Cancer Subtypes using Penalization

In cancer research, profiling studies have been extensively conducted, searching for genes/SNPs associated with prognosis. Cancer is a heterogeneous disease. Examining similarity and difference in the genetic basis of multiple subtypes of the same cancer can lead to better understanding of their connections and distinctions. Classic meta-analysis approaches analyze each subtype separately and then compare analysis results across subtypes. Integrative analysis approaches, in contrast, analyze the raw data on multiple subtypes simultaneously and can outperform meta-analysis. In this study, prognosis data on multiple subtypes of the same cancer are analyzed. An AFT (accelerated failure time) model is adopted to describe survival. The genetic basis of multiple subtypes is described using the heterogeneity model, which allows a gene/SNP to be associated with the prognosis of some subtypes but not the others. A compound penalization approach is developed to conduct gene-level analysis and identify genes that contain important SNPs associated with prognosis. The proposed approach has an intuitive formulation and can be realized using an iterative algorithm. Asymptotic properties are rigorously established. Simulation shows that the proposed approach has satisfactory performance and outperforms meta-analysis using penalization. An NHL (non-Hodgkin lymphoma) prognosis study with SNP measurements is analyzed. Genes associated with the three major subtypes, namely DLBCL, FL, and CLL/SLL, are identified. The proposed approach identifies genes different from alternative analysis and has reasonable prediction performance.

stat.ME↗