BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Xin Tong

Xin Tong contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Computer Visionmath.AGmath.NTGraphicsMachine LearningMethodologyApplicationsArtificial Intelligencecond-mat.mtrl-scimath.STStatistics Theorycond-mat.supr-coneess.SPHuman-Computer Interactionphysics.app-phComputation and LanguageComputational Geometrycond-mat.str-elecon.THmath.ATphysics.flu-dynphysics.med-phphysics.optics

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
49works
0followers
23topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

49 published item(s)

preprint2026arXiv

A Burden Shared is a Burden Halved: A Fairness-Adjusted Approach to Classification

We investigate the fairness issue in classification, where automated decisions are made for individuals from different protected groups. In high-consequence scenarios, decision errors can disproportionately affect certain protected groups, leading to unfair outcomes. To address this issue, we propose a fairness-adjusted selective inference (FASI) framework and develop data-driven algorithms that achieve statistical parity by controlling the false selection rate (FSR) among protected groups. Our FASI algorithm operates by converting the outputs of black-box classifiers into R-values, which are both intuitive and computationally efficient. These R-values serve as the basis for selection rules that are provably valid for FSR control in finite samples for protected groups, effectively mitigating the unfairness in group-wise error rates. We demonstrate the numerical performance of our approach using both simulated and real data.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

SQuadGen: Generating Simple Quad Layouts via Chart Distance Fields

3D shapes from scanning, reconstruction, or AI-generated content often lack simple quad mesh layouts -- critical for efficient editing and modeling. Existing quad-remeshing techniques typically produce complex layouts with irregular loops, leading to tedious manual cleanup and extensive algorithm tuning. We introduce SQuadGen, a diffusion-based generative framework that leverages Chart Distance Fields (CDF) to synthesize simple quad layouts on 3D shapes. Our approach addresses two key challenges: (1) the discrete nature of mesh connectivity, which hinders learning, and (2) the scarcity of large-scale datasets with simple quad meshes. To overcome the first, we propose CDF, a continuous surface-based representation enabling effective learning and synthesis of quad layouts. To address the second, we define loop-aware simplicity metrics and construct a large-scale dataset of high-quality quad layouts recovered from public 3D repositories through a robust quad-recovery pipeline. Extensive evaluations across diverse 3D inputs show that SQuadGen consistently outperforms existing methods, producing robust, artist-friendly simple quad layouts.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Degree-Weighted Social Learning

We study social learning in which agents weight neighbors' opinions differently based on their degrees, capturing situations in which agents place more trust in well-connected individuals or, conversely, discount their influence. We derive asymptotic properties of learning outcomes in large stochastic networks and analyze how the weighting rule affects societal wisdom and convergence speed. We find that assigning greater weight to higher-degree neighbors harms wisdom but has a non-monotonic effect on convergence speed, depending on the diversity of views within high- and low-degree groups, highlighting a potential trade-off between convergence speed and wisdom.

0 citations0 reviewsNo code linkedOpen access
preprint2024arXiv

Advanced Unstructured Data Processing for ESG Reports: A Methodology for Structured Transformation and Enhanced Analysis

In the evolving field of corporate sustainability, analyzing unstructured Environmental, Social, and Governance (ESG) reports is a complex challenge due to their varied formats and intricate content. This study introduces an innovative methodology utilizing the "Unstructured Core Library", specifically tailored to address these challenges by transforming ESG reports into structured, analyzable formats. Our approach significantly advances the existing research by offering high-precision text cleaning, adept identification and extraction of text from images, and standardization of tables within these reports. Emphasizing its capability to handle diverse data types, including text, images, and tables, the method adeptly manages the nuances of differing page layouts and report styles across industries. This research marks a substantial contribution to the fields of industrial ecology and corporate sustainability assessment, paving the way for the application of advanced NLP technologies and large language models in the analysis of corporate governance and sustainability. Our code is available at https://github.com/linancn/TianGong-AI-Unstructure.git.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

A Comparison of Full Information Maximum Likelihood and Machine Learning Missing Data Analytical Methods in Growth Curve Modeling

Missing data are inevitable in longitudinal studies. Traditional methods, such as the full information maximum likelihood (FIML), are commonly used to handle ignorable missing data. However, they may lead to biased model estimation due to missing not at random data that often appear in longitudinal studies. Recently, machine learning methods, such as random forests (RF) and K-nearest neighbors (KNN) imputation methods, have been proposed to cope with missing values. Although machine learning imputation methods have been gaining popularity, few studies have investigated the tenability and utility of these methods in longitudinal research. Through Monte Carlo simulations, this study evaluates and compares the performance of traditional and machine learning approaches (FIML, RF, and KNN) in growth curve modeling. The effects of sample size, the rate of missingness, and the missing data mechanism on model estimation are investigated. Results indicate that FIML is a better choice than the two machine learning imputation methods in terms of model estimation accuracy and efficiency.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

$\infty$-Categorical Perverse $p$-adic Differential Equations over Stacks

We will discuss $\infty$-categorical perverse $p$-adic differential equations over stacks. On one hand, we are going to study some $p$-adic analogous results of the Drinfeld's original lemma about the étale fundamental groups in the étale setting, in the context of $F$-isocrystals closely after Kedlaya and Kedlaya-Xu. We expect similar things could also be considered for diamonds after Scholze, in the context of Kedlaya-Liu's work namely the derived category of pseudocoherent Frobenius sheaves, which will induce some categorical form of Drinfeld's lemma for diamonds motivated by work of Carter-Kedlaya-Zábrádi and Pal-Zábrádi. On the other hand, we are going to establish the $\infty$-categorical theory of arithmetic $D$-modules after Abe and Gaitsgory-Lurie, which will allow one to construct the rigid Gross $G$-motives. And we are expecting to apply the whole machinery to revisit Weil's conjecture parallel to and after Gaitsgory-Lurie.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Antiferromagnetic structure and magnetic properties of Dy2O2Te: An isostructural analog of the rare-earth superconductors R2O2Bi

The rare-earth compounds R2O2Bi (R=Tb, Dy, Er, Lu, Y) are newly discovered superconductors in the vicinity of a rare-earth magnetic long-range order. In this work, we determine the magnetic order of the parent compound Dy2O2Te by neutron scattering as the A-type antiferromagnetic structure below the Néel temperature TN=9.7K. The large staggered magnetic moment 9.4(1) μB per Dy at T=3.5K lies in the basal ab plane. In a magnetic field, anomalous magnetic properties including the bifurcation between zero-field- and field-cooling magnetization, a butterfly-shaped magnetic hysteresis, and slow magnetic relaxation emerge, which are related to the field-induced metamagnetic transitions in Dy2O2Te. Our experimental findings could stimulate further research on the relation between antiferromagnetism and superconductivity in these rare-earth compounds.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

ComplexGen: CAD Reconstruction by B-Rep Chain Complex Generation

We view the reconstruction of CAD models in the boundary representation (B-Rep) as the detection of geometric primitives of different orders, i.e. vertices, edges and surface patches, and the correspondence of primitives, which are holistically modeled as a chain complex, and show that by modeling such comprehensive structures more complete and regularized reconstructions can be achieved. We solve the complex generation problem in two steps. First, we propose a novel neural framework that consists of a sparse CNN encoder for input point cloud processing and a tri-path transformer decoder for generating geometric primitives and their mutual relationships with estimated probabilities. Second, given the probabilistic structure predicted by the neural network, we recover a definite B-Rep chain complex by solving a global optimization maximizing the likelihood under structural validness constraints and applying geometric refinements. Extensive tests on large scale CAD datasets demonstrate that the modeling of B-Rep chain complex structure enables more accurate detection for learning and more constrained reconstruction for optimization, leading to structurally more faithful and complete CAD B-Rep models than previous results.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Deep Deformable 3D Caricatures with Learned Shape Control

A 3D caricature is an exaggerated 3D depiction of a human face. The goal of this paper is to model the variations of 3D caricatures in a compact parameter space so that we can provide a useful data-driven toolkit for handling 3D caricature deformations. To achieve the goal, we propose an MLP-based framework for building a deformable surface model, which takes a latent code and produces a 3D surface. In the framework, a SIREN MLP models a function that takes a 3D position on a fixed template surface and returns a 3D displacement vector for the input position. We create variations of 3D surfaces by learning a hypernetwork that takes a latent code and produces the parameters of the MLP. Once learned, our deformable model provides a nice editing space for 3D caricatures, supporting label-based semantic editing and point-handle-based deformation, both of which produce highly exaggerated and natural 3D caricature shapes. We also demonstrate other applications of our deformable model, such as automatic 3D caricature creation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Dual Octree Graph Networks for Learning Adaptive Volumetric Shape Representations

We present an adaptive deep representation of volumetric fields of 3D shapes and an efficient approach to learn this deep representation for high-quality 3D shape reconstruction and auto-encoding. Our method encodes the volumetric field of a 3D shape with an adaptive feature volume organized by an octree and applies a compact multilayer perceptron network for mapping the features to the field value at each 3D position. An encoder-decoder network is designed to learn the adaptive feature volume based on the graph convolutions over the dual graph of octree nodes. The core of our network is a new graph convolution operator defined over a regular grid of features fused from irregular neighboring octree nodes at different levels, which not only reduces the computational and memory cost of the convolutions over irregular neighboring octree nodes, but also improves the performance of feature learning. Our method effectively encodes shape details, enables fast 3D shape reconstruction, and exhibits good generality for modeling 3D shapes out of training categories. We evaluate our method on a set of reconstruction tasks of 3D shapes and scenes and validate its superiority over other existing approaches. Our code, data, and trained models are available at https://wang-ps.github.io/dualocnn.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Environment Sensing Considering the Occlusion Effect: A Multi-View Approach

In this paper, we consider the problem of sensing the environment within a wireless cellular framework. Specifically, multiple user equipments (UEs) send sounding signals to one or multiple base stations (BSs) and then a centralized processor retrieves the environmental information from all the channel information obtained at the BS(s). Taking into account the occlusion effect that is common in the wireless context, we make full use of the different views of the environment from different users and/or BS(s), and propose an effective sensing algorithm called GAMP-MVSVR (generalized-approximate-message-passing-based multi-view sparse vector reconstruction). In the proposed algorithm, a multi-layer factor graph is constructed to iteratively estimate the scattering coefficients of the cloud points and their occlusion relationship. In each iteration, the occlusion relationship between the cloud points of the sparse environment is recalculated according to a simple occlusion detection rule, and in turn, used to estimate the scattering coefficients of the cloud points. Our proposed algorithm can achieve improved sensing performance with multi-BS collaboration in addition to the multi-views from the UEs. The simulation results verify its convergence and effectiveness.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Generative Deformable Radiance Fields for Disentangled Image Synthesis of Topology-Varying Objects

3D-aware generative models have demonstrated their superb performance to generate 3D neural radiance fields (NeRF) from a collection of monocular 2D images even for topology-varying object categories. However, these methods still lack the capability to separately control the shape and appearance of the objects in the generated radiance fields. In this paper, we propose a generative model for synthesizing radiance fields of topology-varying objects with disentangled shape and appearance variations. Our method generates deformable radiance fields, which builds the dense correspondence between the density fields of the objects and encodes their appearances in a shared template field. Our disentanglement is achieved in an unsupervised manner without introducing extra labels to previous 3D-aware GAN training. We also develop an effective image inversion scheme for reconstructing the radiance field of an object in a real monocular image and manipulating its shape and appearance. Experiments show that our method can successfully learn the generative model from unstructured monocular images and well disentangle the shape and appearance for objects (e.g., chairs) with large topological variance. The model trained on synthetic data can faithfully reconstruct the real object in a given single image and achieve high-quality texture and shape editing results.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Geometric and Representation Theoretic Aspects of $p$-adic Motives

In this dissertation, we discuss mainly the corresponding geometric and representation theoretic aspects of relative $p$-adic Hodge theory and $p$-adic motives. To be more precise, we study the corresponding analytic geometry of the corresponding spaces over and attached to period rings in the relative $p$-adic Hodge theory, including derived topological de Rham complexes and derived topological logarithmic de Rham complexes after Bhatt, Gabber, Guo and Illusie which is in some sense equivalent to the derived prismatic cohomology of Bhatt-Scholze as shown in the work of Li-Liu, $\mathcal{O}\mathbb{B}_\mathrm{dR}$-sheaves after Scholze, $φ$-$\widetilde{C}_X$-sheaves and relative-$B$-pairs after Kedlaya-Liu, multidimensional rings after Carter-Kedlaya-Zábrádi and Pal-Zábrádi and many other possible general universal motivic rings or sheaves. Many contexts are expected to be sheafified, such as over Scholze's pro-étale sites of the considered analytic spaces by using perfectoids or the quasisyntomic sites by using quasiregular semiperfectoids as in the work of Bhatt-Morrow-Scholze and Bhatt-Scholze.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

GRAM: Generative Radiance Manifolds for 3D-Aware Image Generation

3D-aware image generative modeling aims to generate 3D-consistent images with explicitly controllable camera poses. Recent works have shown promising results by training neural radiance field (NeRF) generators on unstructured 2D images, but still can not generate highly-realistic images with fine details. A critical reason is that the high memory and computation cost of volumetric representation learning greatly restricts the number of point samples for radiance integration during training. Deficient sampling not only limits the expressive power of the generator to handle fine details but also impedes effective GAN training due to the noise caused by unstable Monte Carlo sampling. We propose a novel approach that regulates point sampling and radiance field learning on 2D manifolds, embodied as a set of learned implicit surfaces in the 3D volume. For each viewing ray, we calculate ray-surface intersections and accumulate their radiance generated by the network. By training and rendering such radiance manifolds, our generator can produce high quality images with realistic fine details and strong visual 3D consistency.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

MPS-NeRF: Generalizable 3D Human Rendering from Multiview Images

There has been rapid progress recently on 3D human rendering, including novel view synthesis and pose animation, based on the advances of neural radiance fields (NeRF). However, most existing methods focus on person-specific training and their training typically requires multi-view videos. This paper deals with a new challenging task -- rendering novel views and novel poses for a person unseen in training, using only multiview images as input. For this task, we propose a simple yet effective method to train a generalizable NeRF with multiview images as conditional input. The key ingredient is a dedicated representation combining a canonical NeRF and a volume deformation scheme. Using a canonical space enables our method to learn shared properties of human and easily generalize to different people. Volume deformation is used to connect the canonical space with input and target images and query image features for radiance and density prediction. We leverage the parametric 3D human model fitted on the input images to derive the deformation, which works quite well in practice when combined with our canonical NeRF. The experiments on both real and synthetic data with the novel view synthesis and pose animation tasks collectively demonstrate the efficacy of our method.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Non-splitting Neyman-Pearson Classifiers

The Neyman-Pearson (NP) binary classification paradigm constrains the more severe type of error (e.g., the type I error) under a preferred level while minimizing the other (e.g., the type II error). This paradigm is suitable for applications such as severe disease diagnosis, fraud detection, among others. A series of NP classifiers have been developed to guarantee the type I error control with high probability. However, these existing classifiers involve a sample splitting step: a mixture of class 0 and class 1 observations to construct a scoring function and some left-out class 0 observations to construct a threshold. This splitting enables classifier construction built upon independence, but it amounts to insufficient use of data for training and a potentially higher type II error. Leveraging a canonical linear discriminant analysis model, we derive a quantitative CLT for a certain functional of quadratic forms of the inverse of sample and population covariance matrices, and based on this result, develop for the first time NP classifiers without splitting the training sample. Numerical experiments have confirmed the advantages of our new non-splitting parametric strategy.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

SDF-StyleGAN: Implicit SDF-Based StyleGAN for 3D Shape Generation

We present a StyleGAN2-based deep learning approach for 3D shape generation, called SDF-StyleGAN, with the aim of reducing visual and geometric dissimilarity between generated shapes and a shape collection. We extend StyleGAN2 to 3D generation and utilize the implicit signed distance function (SDF) as the 3D shape representation, and introduce two novel global and local shape discriminators that distinguish real and fake SDF values and gradients to significantly improve shape geometry and visual quality. We further complement the evaluation metrics of 3D generative models with the shading-image-based Fréchet inception distance (FID) scores to better assess visual quality and shape distribution of the generated shapes. Experiments on shape generation demonstrate the superior performance of SDF-StyleGAN over the state-of-the-art. We further demonstrate the efficacy of SDF-StyleGAN in various tasks based on GAN inversion, including shape reconstruction, shape completion from partial point clouds, single-view image-based shape generation, and shape style editing. Extensive ablation studies justify the efficacy of our framework design. Our code and trained models are available at https://github.com/Zhengxinyang/SDF-StyleGAN.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Semantic Segmentation-Assisted Instance Feature Fusion for Multi-Level 3D Part Instance Segmentation

Recognizing 3D part instances from a 3D point cloud is crucial for 3D structure and scene understanding. Several learning-based approaches use semantic segmentation and instance center prediction as training tasks and fail to further exploit the inherent relationship between shape semantics and part instances. In this paper, we present a new method for 3D part instance segmentation. Our method exploits semantic segmentation to fuse nonlocal instance features, such as center prediction, and further enhances the fusion scheme in a multi- and cross-level way. We also propose a semantic region center prediction task to train and leverage the prediction results to improve the clustering of instance points. Our method outperforms existing methods with a large-margin improvement in the PartNet benchmark. We also demonstrate that our feature fusion scheme can be applied to other existing methods to improve their performance in indoor scene instance segmentation tasks.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Semi-supervised 3D shape segmentation with multilevel consistency and part substitution

The lack of fine-grained 3D shape segmentation data is the main obstacle to developing learning-based 3D segmentation techniques. We propose an effective semi-supervised method for learning 3D segmentations from a few labeled 3D shapes and a large amount of unlabeled 3D data. For the unlabeled data, we present a novel multilevel consistency loss to enforce consistency of network predictions between perturbed copies of a 3D shape at multiple levels: point-level, part-level, and hierarchical level. For the labeled data, we develop a simple yet effective part substitution scheme to augment the labeled 3D shapes with more structural variations to enhance training. Our method has been extensively validated on the task of 3D object semantic segmentation on PartNet and ShapeNetPart, and indoor scene semantic segmentation on ScanNet. It exhibits superior performance to existing semi-supervised and unsupervised pre-training 3D approaches. Our code and trained models are publicly available at https://github.com/isunchy/semi_supervised_3d_segmentation.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Skilled Mutual Fund Selection: False Discovery Control under Dependence

Selecting skilled mutual funds through the multiple testing framework has received increasing attention from finance researchers and statisticians. The intercept $α$ of Carhart four-factor model is commonly used to measure the true performance of mutual funds, and positive $α$'s are considered as skilled. We observe that the standardized OLS estimates of $α$'s across the funds possess strong dependence and nonnormality structures, indicating that the conventional multiple testing methods are inadequate for selecting the skilled funds. We start from a decision theoretic perspective, and propose an optimal testing procedure to minimize a combination of false discovery rate and false non-discovery rate. Our proposed testing procedure is constructed based on the probability of each fund not being skilled conditional on the information across all of the funds in our study. To model the distribution of the information used for the testing procedure, we consider a mixture model under dependence and propose a new method called "approximate empirical Bayes" to fit the parameters. Empirical studies show that our selected skilled funds have superior long-term and short-term performance, e.g., our selection strongly outperforms the S\&P 500 index during the same period.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Topologization and Functional Analytification II: $\infty$-Categorical Motivic Constructions for Homotopical Contexts

This is our second scope of the consideration on the corresponding topologization and the corresponding functional analytification. We will focus on the corresponding functorial and motivic constructions in our current consideration. We consider topological motivic derived $I$-adic and derived $(p,I)$-adic cohomologies through derived de Rham complexes of Bhatt, Guo, Illusie, Morrow, Scholze, Frobenius sheaves over Robba rings of Kedlaya-Liu in certain derived $I$-adic and derived $(p,I)$-adic geometric context as what we defined for Bambozzi-Ben-Bassat-Kremnizer $\infty$-prestacks in our previous work in this series. The foundation we will work on will be based on the work of Bambozzi-Ben-Bassat-Kremnizer, Ben-Bassat-Mukherjee, Clausen-Scholze and Kelly-Kremnizer-Mukherjee, in order to promote the construction to even more general homotopical and $\infty$-categorical contexts. This gives us the chance to construct the functional analytic derived prismatic cohomology and derived preperfectoidizations, as well as the functional analytic derived logarithmic prismatic cohomology and derived logarithmic preperfectoidizations after Bhatt-Scholze and Koshikawa, in the framework of Bambozzi-Ben-Bassat-Kremnizer, Ben-Bassat-Mukherjee, Clausen-Scholze and Kelly-Kremnizer-Mukherjee.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Transcranial photoacoustic computed tomography of human brain function

Herein we report the first in-human transcranial imaging of brain function using photoacoustic computed tomography. Functional responses to benchmark motor tasks were imaged on both the skull-less and the skull-intact hemispheres of a hemicraniectomy patient. The observed brain responses in these preliminary results demonstrate the potential of photoacoustic computed tomography for achieving transcranial functional imaging.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Visualizing Gender Gap in Film Industry over the Past 100 Years

Visualizing big data can provide valuable insights into social science research. In this project, we focused on visualizing the potential gender gap in the global film industry over the past 100 years. We profiled the differences both for the actors/actresses and male/female movie audiences and analyzed the IMDb data of the most popular 10,000 movies (the composition and importance of casts of different genders, the cooperation network of the actors/actresses, the movie genres, the movie descriptions, etc.) and audience ratings (the differences between male's and female's ratings). Findings suggest that the gender gap has been distinct in many aspects, but a recent trend is that this gap narrows down and women are gaining discursive power in the film industry. Our study presented rich data, vivid illustrations, and novel perspectives that can serve as the foundation for further studies on related topics and their social implications.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Visualizing Non-Fungible Token Ethics: A Case Study On CryptoPunks

As a blockchain-based application, Non-Fungible Token (NFT) has received worldwide attention over the past few years. Digital artwork is the main form of NFT that can be stored on different blockchains. Although the NFT market is rapidly developing, we observed potential ethical and racial fairness issues in the design of NFT artworks due to a lack of ethical guidelines or censorship. Therefore, we investigated CryptoPunks, the most famous collection in the NFT market, to explore and visualize its potential ethical issues. We explored the ethical issues from three aspects: design, trading transactions, and related topics on Twitter. We scraped data from Twitter and Dune Analytics using python libraries, Twitter crawler, and sentiment analysis tools. Our five visualizations implied that 1.6 times more male punks were created in the initial design process than the female ones. And the male ones have a higher average selling price than females; lighter-skinned punks tend to sell for higher prices. The results of our study and visualizations provide a preliminary exploration of CryptoPunks and further inspire future ethical-related investigation and research in the NFT domain.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Analytic Geometry and Hodge-Frobenius Structure Continued

This is our sequel to our previous work on the corresponding generalized Frobenius modules over some big multivariate Robba rings. We will go beyond our previous discussion where we focused on the corresponding analytic functions on polydiscs and polyannuli in the strictly affinoid situation, and general Hodge-Frobenius structures which are admissible in the corresponding context in our previous work.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Marangoni Convection-Driven Laser Fountains and Waves on Free Surfaces of Liquids

It is well accepted that an outward Marangoni convection from a low surface tension region will make the surface depressed. Here, we report that this established perception is only valid for thin liquid films. Using surface laser heating, we show that in deep liquids a laser beam actually pulls up the fluid above the free surface generating fountains with different shapes. Whereas with decreasing liquid depth a transition from fountain to indentation with fountain in-indentation is observed. Further, high-speed imaging reveals a transient surface process before steady elevation is formed, and this dynamic deformation is subsequently utilized to resonantly excite giant surface waves by a modulated laser beam. Computational fluid dynamics models reveal the underlying flow patterns and quantify the depth-dependent and time-resolved surface deformations. Our discoveries and techniques have upended the century-old perception and opened up a new regime of interdisciplinary research and applications of Marangoni-induced interface phenomena and optocapillary fluidic surfaces-the control of fluids with light.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Period Rings with Big Coefficients and Application II

We continue our study on the corresponding noncommutative deformation of the relative $p$-adic Hodge structures of Kedlaya-Liu along our previous work. In this paper, we are going to initiate the study of the corresponding descent of pseudocoherent modules carrying large noncommutative coefficients. And also we are going to more systematically study the corresponding noncommutative geometric aspects of noncommutative deformation of Hodge structures, which will definitely also provide the insights not only for noncommutative Iwasawa theory but also for noncommutative analytic geometry. The noncommutative Hodge-Iwasawa theory is now improved along some very well-defined direction (we will expect many well-targeted applications to noncommutative Tamagawa number conjectures from the modern perspectives of Burns-Flach-Fukaya-Kato), while the corresponding Kedlaya-Liu glueing of pseudocoherent Banach modules with certain stability is also generalized to the large noncommutative coefficient case.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Period Rings with Big Coefficients and Applications III

We continue our study on the corresponding period rings with big coefficients, with the corresponding application in mind on relative $p$-adic Hodge theory and noncommutative analytic geometry. In this article, we extend the discussion of the corresponding noncommutative descent over étale topology to the corresponding noncommutative descent over pro-étale topology in both Tate and analytic setting.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Topics on Geometric and Representation Theoretic Aspects of Period Rings I

We consider more general framework than the corresponding one considered in our previous work on the Hodge-Iwasawa theory. In our current consideration we consider the corresponding more general base spaces, namely the analytic adic spaces and analytic perfectoid spaces in Kedlaya's AWS Lecture notes. We hope our discussion will also shed some light on further generalization to even more general spaces such as those considered by Gabber-Ramero namely one just considers certain topological rings which satisfy the Fontaine-Wintenberger idempotent correspondence and calls them perfectoid generalizing the notions from Scholze, Fontaine, Kedlaya-Liu and Kedlaya (AWS Lecture notes). Actually some of the discussion we presented here is already in some more general form for this purpose (although we have not made enough efforts to write all the things).

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Topologization and Functional Analytification I: Intrinsic Morphisms of Commutative Algebras

Eventually after Dieudonné-Grothendieck, we give intrinsic definitions of étale, lisse and non-ramifié morphisms for general adic rings and general locally convex rings. And we investigate the corresponding étale-like, lisse-like and non-ramifié-like morphisms for general $\infty$-Banach, $\infty$-Borné and $\infty$-ind-Fréchet $\infty$-rings and $\infty$-functors into $\infty$-groupoid (as in the work of Bambozzi-Ben-Bassat-Kremnizer) in some intrinsic way by using the corresponding infinitesimal stacks and crystalline stacks. The two directions of generalization will intersect at Huber's book in the strongly noetherian situation.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Ultrasensitive barocaloric material for room-temperature solid-state refrigeration

Solid-state refrigeration based on caloric effects is an energetically efficient and environmentally friendly technology, which is deemed as a potential alternative to the conventional vapor-compression technology. One of the greatest obstacles to the real application is the huge driving fields. Here, we report a giant barocaloric effect in inorganic NH4I with maximum entropy changes of ΔS_BCE^max ~89 J K-1 kg-1 around room temperature, associated with the orientationally order-disorder phase transition. The phase transition temperature, Tt, varies dramatically with pressure in a rate of dTt/dP ~0.81 K MPa-1, which leads to a very much small saturation driving pressure of ΔP ~20 MPa, an unprecedentedly large caloric strength of |ΔS_BCE^max/ΔP| ~4.45 J K-1 kg-1 MPa-1, as well as a broad temperature window of ~68 K under an 80 MPa driving pressure. Comprehensive characterization of the crystal structure and dynamics by neutron scattering measurements reveals a strong reorientation-vibration coupling that is responsible for the large pressure sensitivity of Tt. This work is expected to advance the practical application of barocaloric refrigeration.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Bridging Cost-sensitive and Neyman-Pearson Paradigms for Asymmetric Binary Classification

Asymmetric binary classification problems, in which the type I and II errors have unequal severity, are ubiquitous in real-world applications. To handle such asymmetry, researchers have developed the cost-sensitive and Neyman-Pearson paradigms for training classifiers to control the more severe type of classification error, say the type I error. The cost-sensitive paradigm is widely used and has straightforward implementations that do not require sample splitting; however, it demands an explicit specification of the costs of the type I and II errors, and an open question is what specification can guarantee a high-probability control on the population type I error. In contrast, the Neyman-Pearson paradigm can train classifiers to achieve a high-probability control of the population type I error, but it relies on sample splitting that reduces the effective training sample size. Since the two paradigms have complementary strengths, it is reasonable to combine their strengths for classifier construction. In this work, we for the first time study the methodological connections between the two paradigms, and we develop the TUBE-CS algorithm to bridge the two paradigms from the perspective of controlling the population type I error.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

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.

0 citations0 reviewsNo code linkedOpen access
preprint2019arXiv

Broadband mid-infrared perfect absorber using fractal Gosper curve

Designing broadband metamaterial perfect absorbers is challenging due to the intrinsically narrow bandwidth of surface plasmon resonances. Here, the paper reports an ultra-broadband metamaterial absorber by using space filling Gosper curve. The optimized result shows an average absorptivity of 95.78% from 2.64 to 9.79 μm across the entire mid-infrared region. Meanwhile, the absorber shows insensitivity to the polarization angle and the incident angle of the incident light. The underlying physical principles, used in our broadband absorber, involve a fractal geometry with multiple scales and a dissipative plasmonic crystal. The broadband perfect absorption can be attributed to multiple electric resonances at different wavelengths supported by a few segments in the defined Gosper curve.

0 citations0 reviewsNo code linkedOpen access
preprint2018arXiv

Adaptive O-CNN: A Patch-based Deep Representation of 3D Shapes

We present an Adaptive Octree-based Convolutional Neural Network (Adaptive O-CNN) for efficient 3D shape encoding and decoding. Different from volumetric-based or octree-based CNN methods that represent a 3D shape with voxels in the same resolution, our method represents a 3D shape adaptively with octants at different levels and models the 3D shape within each octant with a planar patch. Based on this adaptive patch-based representation, we propose an Adaptive O-CNN encoder and decoder for encoding and decoding 3D shapes. The Adaptive O-CNN encoder takes the planar patch normal and displacement as input and performs 3D convolutions only at the octants at each level, while the Adaptive O-CNN decoder infers the shape occupancy and subdivision status of octants at each level and estimates the best plane normal and displacement for each leaf octant. As a general framework for 3D shape analysis and generation, the Adaptive O-CNN not only reduces the memory and computational cost, but also offers better shape generation capability than the existing 3D-CNN approaches. We validate Adaptive O-CNN in terms of efficiency and effectiveness on different shape analysis and generation tasks, including shape classification, 3D autoencoding, shape prediction from a single image, and shape completion for noisy and incomplete point clouds.

0 citations0 reviewsNo code linkedOpen access