Searcharxiv⌕ Search

arXiv subjects

Xin Tong

Publications and source records attributed to Xin Tong.

At least 217 records · Page 12Linked to original sources

Strong Ferromagnetism Achieved via Breathing Lattices in Atomically Thin Cobaltites

Low-dimensional quantum materials that remain strongly ferromagnetic down to mono layer thickness are highly desired for spintronic applications. Although oxide materials are important candidates for next generation of spintronic, ferromagnetism decays severely when the thickness is scaled to the nano meter regime, leading to deterioration of device performance. Here we report a methodology for maintaining strong ferromagnetism in insulating LaCoO3 (LCO) layers down to the thickness of a single unit cell. We find that the magnetic and electronic states of LCO are linked intimately to the structural parameters of adjacent "breathing lattice" SrCuO2 (SCO). As the dimensionality of SCO is reduced, the lattice constant elongates over 10% along the growth direction, leading to a significant distortion of the CoO6 octahedra, and promoting a higher spin state and long-range spin ordering. For atomically thin LCO layers, we observe surprisingly large magnetic moment (0.5 uB/Co) and Curie temperature (75 K), values larger than previously reported for any mono layer oxide. Our results demonstrate a strategy for creating ultra thin ferromagnetic oxides by exploiting atomic hetero interface engineering,confinement-driven structural transformation, and spin-lattice entanglement in strongly correlated materials.

cond-mat.mtrl-sci↗

Strain-mediated high conductivity in ultrathin antiferromagnetic metallic nitrides

Strain engineering provides the ability to control the ground states and associated phase transition in the epitaxial films. However, the systematic study of intrinsic characters and their strain dependency in transition-metal nitrides remains challenging due to the difficulty in fabricating the stoichiometric and high-quality films. Here we report the observation of electronic state transition in highly crystalline antiferromagnetic CrN films with strain and reduced dimensionality. Shrinking the film thickness to a critical value of ~ 30 unit cells, a profound conductivity reduction accompanied by unexpected volume expansion is observed in CrN films. The electrical conductivity is observed surprisingly when the CrN layer as thin as single unit cell thick, which is far below the critical thickness of most metallic films. We found that the metallicity of an ultrathin CrN film recovers from an insulating behavior upon the removal of as-grown strain by fabrication of first-ever freestanding nitride films. Both first-principles calculations and linear dichroism measurements reveal that the strain-mediated orbital splitting effectively customizes the relatively small bandgap at the Fermi level, leading to exotic phase transition in CrN. The ability to achieve highly conductive nitride ultrathin films by harness strain-controlling over competing phases can be used for utilizing their exceptional characteristics.

cond-mat.mtrl-sci↗

Hodge-Iwasawa Theory II

We continue our study on the Hodge-Iwasawa theory which is a continuation of our previous work on Hodge-Iwasawa theory, which is aimed at higher dimensional deformation of higher dimensional Hodge structures over general analytic spaces or adic spaces. We still follow closely the approaches of Kedlaya-Liu to study our Frobenius modules over the different kinds of period rings including more generalized perfect period rings and the corresponding imperfect period rings. It is desirable that one can globalize the deformed information in order to organize the deformed period rings into the corresponding sheaves with respect to the coefficient sheaves, which will build up some foundations on further application to moduli of Frobenius sheaves.

math.AG↗

Intentional Control of Type I Error over Unconscious Data Distortion: a Neyman-Pearson Approach to Text Classification

This paper addresses the challenges in classifying textual data obtained from open online platforms, which are vulnerable to distortion. Most existing classification methods minimize the overall classification error and may yield an undesirably large type I error (relevant textual messages are classified as irrelevant), particularly when available data exhibit an asymmetry between relevant and irrelevant information. Data distortion exacerbates this situation and often leads to fallacious prediction. To deal with inestimable data distortion, we propose the use of the Neyman-Pearson (NP) classification paradigm, which minimizes type II error under a user-specified type I error constraint. Theoretically, we show that the NP oracle is unaffected by data distortion when the class conditional distributions remain the same. Empirically, we study a case of classifying posts about worker strikes obtained from a leading Chinese microblogging platform, which are frequently prone to extensive, unpredictable and inestimable censorship. We demonstrate that, even though the training and test data are susceptible to different distortion and therefore potentially follow different distributions, our proposed NP methods control the type I error on test data at the targeted level. The methods and implementation pipeline proposed in our case study are applicable to many other problems involving data distortion.

stat.ME↗

Disentangled and Controllable Face Image Generation via 3D Imitative-Contrastive Learning

We propose DiscoFaceGAN, an approach for face image generation of virtual people with disentangled, precisely-controllable latent representations for identity of non-existing people, expression, pose, and illumination. We embed 3D priors into adversarial learning and train the network to imitate the image formation of an analytic 3D face deformation and rendering process. To deal with the generation freedom induced by the domain gap between real and rendered faces, we further introduce contrastive learning to promote disentanglement by comparing pairs of generated images. Experiments show that through our imitative-contrastive learning, the factor variations are very well disentangled and the properties of a generated face can be precisely controlled. We also analyze the learned latent space and present several meaningful properties supporting factor disentanglement. Our method can also be used to embed real images into the disentangled latent space. We hope our method could provide new understandings of the relationship between physical properties and deep image synthesis.

cs.CV↗

Statistical hypothesis testing versus machine-learning binary classification: distinctions and guidelines

Making binary decisions is a common data analytical task in scientific research and industrial applications. In data sciences, there are two related but distinct strategies: hypothesis testing and binary classification. In practice, how to choose between these two strategies can be unclear and rather confusing. Here we summarize key distinctions between these two strategies in three aspects and list five practical guidelines for data analysts to choose the appropriate strategy for specific analysis needs. We demonstrate the use of those guidelines in a cancer driver gene prediction example.

stat.AP↗

Object-based Illumination Estimation with Rendering-aware Neural Networks

We present a scheme for fast environment light estimation from the RGBD appearance of individual objects and their local image areas. Conventional inverse rendering is too computationally demanding for real-time applications, and the performance of purely learning-based techniques may be limited by the meager input data available from individual objects. To address these issues, we propose an approach that takes advantage of physical principles from inverse rendering to constrain the solution, while also utilizing neural networks to expedite the more computationally expensive portions of its processing, to increase robustness to noisy input data as well as to improve temporal and spatial stability. This results in a rendering-aware system that estimates the local illumination distribution at an object with high accuracy and in real time. With the estimated lighting, virtual objects can be rendered in AR scenarios with shading that is consistent to the real scene, leading to improved realism.

cs.CV↗

A Closer Look at Local Aggregation Operators in Point Cloud Analysis

Recent advances of network architecture for point cloud processing are mainly driven by new designs of local aggregation operators. However, the impact of these operators to network performance is not carefully investigated due to different overall network architecture and implementation details in each solution. Meanwhile, most of operators are only applied in shallow architectures. In this paper, we revisit the representative local aggregation operators and study their performance using the same deep residual architecture. Our investigation reveals that despite the different designs of these operators, all of these operators make surprisingly similar contributions to the network performance under the same network input and feature numbers and result in the state-of-the-art accuracy on standard benchmarks. This finding stimulate us to rethink the necessity of sophisticated design of local aggregation operator for point cloud processing. To this end, we propose a simple local aggregation operator without learnable weights, named Position Pooling (PosPool), which performs similarly or slightly better than existing sophisticated operators. In particular, a simple deep residual network with PosPool layers achieves outstanding performance on all benchmarks, which outperforms the previous state-of-the methods on the challenging PartNet datasets by a large margin (7.4 mIoU). The code is publicly available at https://github.com/zeliu98/CloserLook3D

cs.CV↗

Generalized Pearson correlation squares for capturing mixtures of bivariate linear dependences

Motivated by the pressing needs for capturing complex but interpretable variable relationships in scientific research, here we generalize the squared Pearson correlation to capture a mixture of linear dependences between two real-valued random variables, with or without an index variable that specifies the line memberships. We construct generalized Pearson correlation squares by focusing on three aspects: the exchangeability of the two variables, the independence of parametric model assumptions, and the availability of population-level parameters. For the computation of the generalized Pearson correlation square from a sample without line-membership specification, we develop a K-lines clustering algorithm, where K, the number of lines, can be chosen in a data-adaptive way. With our defined population-level generalized Pearson correlation squares, we derive the asymptotic distributions of the sample-level statistics to enable efficient statistical inference. Simulation studies verify the theoretical results and compare the generalized Pearson correlation squares with other widely-used association measures in terms of power. Gene expression data analysis demonstrates the effectiveness of the generalized Pearson correlation squares in capturing interpretable gene-gene relationships missed by other measures. We implement the estimation and inference procedures in an R package gR2.

stat.ME↗

Establishing the carrier scattering phase diagram for ZrNiSn-based half-Heusler thermoelectric materials

Chemical doping is one of the most important strategies for tuning electrical properties of semiconductors, particularly thermoelectric materials. Generally, the main role of chemical doping lies in optimizing the carrier concentration, but there can potentially be other important effects. Here, we show that chemical doping plays multiple roles for both electron and phonon transport properties in half-Heusler thermoelectric materials. With ZrNiSn-based half-Heusler materials as an example, we use high-quality single and polycrystalline crystals, various probes, including electrical transport measurements, inelastic neutron scattering measurement, and first-principles calculations, to investigate the underlying electron-phonon interaction. We find that chemical doping brings strong screening effects to ionized impurities, grain boundary, and polar optical phonon scattering, but has negligible influence on lattice thermal conductivity. Furthermore, it is possible to establish a carrier scattering phase diagram, which can be used to select reasonable strategies for optimization of the thermoelectric performance.

cond-mat.mtrl-sci↗

PFCNN: Convolutional Neural Networks on 3D Surfaces Using Parallel Frames

Surface meshes are widely used shape representations and capture finer geometry data than point clouds or volumetric grids, but are challenging to apply CNNs directly due to their non-Euclidean structure. We use parallel frames on surface to define PFCNNs that enable effective feature learning on surface meshes by mimicking standard convolutions faithfully. In particular, the convolution of PFCNN not only maps local surface patches onto flat tangent planes, but also aligns the tangent planes such that they locally form a flat Euclidean structure, thus enabling recovery of standard convolutions. The alignment is achieved by the tool of locally flat connections borrowed from discrete differential geometry, which can be efficiently encoded and computed by parallel frame fields. In addition, the lack of canonical axis on surface is handled by sampling with the frame directions. Experiments show that for tasks including classification, segmentation and registration on deformable geometric domains, as well as semantic scene segmentation on rigid domains, PFCNNs achieve robust and superior performances without using sophisticated input features than state-of-the-art surface based CNNs.

cs.CV↗

Eigen selection in spectral clustering: a theory guided practice

Based on a Gaussian mixture type model , we derive an eigen selection procedure that improves the usual spectral clustering in high-dimensional settings. Concretely, we derive the asymptotic expansion of the spiked eigenvalues under eigenvalue multiplicity and eigenvalue ratio concentration results, giving rise to the first theory-backed eigen selection procedure in spectral clustering. The resulting eigen-selected spectral clustering (ESSC) algorithm enjoys better stability and compares favorably against canonical alternatives. We demonstrate the advantages of ESSC using extensive simulation and multiple real data studies.

math.ST↗

Deep Octree-based CNNs with Output-Guided Skip Connections for 3D Shape and Scene Completion

Acquiring complete and clean 3D shape and scene data is challenging due to geometric occlusion and insufficient views during 3D capturing. We present a simple yet effective deep learning approach for completing the input noisy and incomplete shapes or scenes. Our network is built upon the octree-based CNNs (O-CNN) with U-Net like structures, which enjoys high computational and memory efficiency and supports to construct a very deep network structure for 3D CNNs. A novel output-guided skip-connection is introduced to the network structure for better preserving the input geometry and learning geometry prior from data effectively. We show that with these simple adaptions -- output-guided skip-connection and deeper O-CNN (up to 70 layers), our network achieves state-of-the-art results in 3D shape completion and semantic scene computation.

cs.CV↗

Hodge-Iwasawa Theory I

In this paper, we are going to establish a simultaneous generalization of the relative Iwasawa theory proposed by Kedlaya-Pottharst and the relative $p$-adic Hodge theory after Kedlaya-Liu. We call this Hodge-Iwasawa theory in the sense that one could apply the theory to study noncommutative Iwasawa cohomology and noncommutative Iwasawa theories in families and meanwhile one could apply the theory to study the deformation theory of étale local systems or families of representations of fundamental groups or the equivariant constructible $p$-adic sheaves, with more sophisticated point of view coming from Kato, Fukaya-Kato. We follow closely the approach of Kedlaya-Liu to study the corresponding modules and sheaves over the corresponding deformed version of the period rings and period sheaves.

math.NT↗

Deep 3D Portrait from a Single Image

In this paper, we present a learning-based approach for recovering the 3D geometry of human head from a single portrait image. Our method is learned in an unsupervised manner without any ground-truth 3D data. We represent the head geometry with a parametric 3D face model together with a depth map for other head regions including hair and ear. A two-step geometry learning scheme is proposed to learn 3D head reconstruction from in-the-wild face images, where we first learn face shape on single images using self-reconstruction and then learn hair and ear geometry using pairs of images in a stereo-matching fashion. The second step is based on the output of the first to not only improve the accuracy but also ensure the consistency of overall head geometry. We evaluate the accuracy of our method both in 3D and with pose manipulation tasks on 2D images. We alter pose based on the recovered geometry and apply a refinement network trained with adversarial learning to ameliorate the reprojected images and translate them to the real image domain. Extensive evaluations and comparison with previous methods show that our new method can produce high-fidelity 3D head geometry and head pose manipulation results.

cs.CV↗

Accurate 3D Face Reconstruction with Weakly-Supervised Learning: From Single Image to Image Set

Recently, deep learning based 3D face reconstruction methods have shown promising results in both quality and efficiency.However, training deep neural networks typically requires a large volume of data, whereas face images with ground-truth 3D face shapes are scarce. In this paper, we propose a novel deep 3D face reconstruction approach that 1) leverages a robust, hybrid loss function for weakly-supervised learning which takes into account both low-level and perception-level information for supervision, and 2) performs multi-image face reconstruction by exploiting complementary information from different images for shape aggregation. Our method is fast, accurate, and robust to occlusion and large pose. We provide comprehensive experiments on three datasets, systematically comparing our method with fifteen recent methods and demonstrating its state-of-the-art performance.

cs.CV↗

Neyman-Pearson classification: parametrics and sample size requirement

The Neyman-Pearson (NP) paradigm in binary classification seeks classifiers that achieve a minimal type II error while enforcing the prioritized type I error controlled under some user-specified level $α$. This paradigm serves naturally in applications such as severe disease diagnosis and spam detection, where people have clear priorities among the two error types. Recently, Tong, Feng and Li (2018) proposed a nonparametric umbrella algorithm that adapts all scoring-type classification methods (e.g., logistic regression, support vector machines, random forest) to respect the given type I error upper bound $α$ with high probability, without specific distributional assumptions on the features and the responses. Universal the umbrella algorithm is, it demands an explicit minimum sample size requirement on class $0$, which is often the more scarce class, such as in rare disease diagnosis applications. In this work, we employ the parametric linear discriminant analysis (LDA) model and propose a new parametric thresholding algorithm, which does not need the minimum sample size requirements on class $0$ observations and thus is suitable for small sample applications such as rare disease diagnosis. Leveraging both the existing nonparametric and the newly proposed parametric thresholding rules, we propose four LDA-based NP classifiers, for both low- and high-dimensional settings. On the theoretical front, we prove NP oracle inequalities for one proposed classifier, where the rate for excess type II error benefits from the explicit parametric model assumption. Furthermore, as NP classifiers involve a sample splitting step of class $0$ observations, we construct a new adaptive sample splitting scheme that can be applied universally to NP classifiers, and this adaptive strategy reduces the type II error of these classifiers.

stat.ME↗

Evolution of superconductivity and antiferromagnetic order in Ba(Fe$_{0.92-x}$Co$_{0.08}$V$_x$)$_2$As$_2$

The vanadium doping effects on superconductivity and magnetism of iron pnictides are investigated in Ba(Fe$_{0.92-x}$Co$_{0.08}$V$_x$)$_2$As$_2$ by transport, susceptibility and neutron scattering measurements. The doping of magnetic impurity V causes a fast suppression of superconductivity with T$_c$ reduced at a rate of 7.4~K/1\%V. On the other hand, the long-range commensurate $C$-type antiferromagnetic order is recovered upon the V doping. The value of ordered magnetic moments of Ba(Fe$_{0.92-x}$Co$_{0.08}$V$_x$)$_2$As$_2$ follows a dome-like evolution versus doping concentration x. A possible Griffiths-type antiferromagnetic region of multiple coexisting phases in the phase diagram of Ba(Fe$_{0.92-x}$Co$_{0.08}$V$_x$)$_2$As$_2$ is identified, in accordance with previous theoretical predictions based on a cooperative behavior of the magnetic impurities and the conduction electrons mediating the Ruderman-Kittel-Kasuya-Yosida interactions between them.

cond-mat.supr-con↗