Searcharxiv⌕ Search

arXiv subjects

Wenhao Zheng

Publications and source records attributed to Wenhao Zheng.

34 records · Page 2Linked to original sources

Curved graphene nanoribbons derived from tetrahydropyrene-based polyphenylenes via one-pot K-region oxidation and Scholl cyclization

Precise synthesis of graphene nanoribbons (GNRs) is of great interest to chemists and materials scientists because of their unique opto-electronic properties and potential applications in carbon-based nanoelectronics and spintronics. In addition to the tunable edge structure and width, introducing curvature in GNRs is a powerful structural feature for their chemi-physical property modification. Here, we report an efficient solution synthesis of the first pyrene-based GNR (PyGNR) with curved geometry via one-pot K-region oxidation and Scholl cyclization of its corresponding well-soluble tetrahydropyrene-based polyphenylene precursor. The efficient A2B2-type Suzuki polymerization and subsequent Scholl reaction furnishes up to 35 nm long curved GNRs bearing cove- and armchair-edges. The construction of model compound, as a cutout of PyGNR, from a tetrahydropyrene-based oligophenylene precursor proves the concept and efficiency of the one-pot K-region oxidation and Scholl cyclization, which is clearly revealed by single crystal X-ray diffraction analysis. The structure and optical properties of PyGNR are investigated by Raman, FT-IR, solid-state NMR and UV-Vis analysis with the support of DFT calculations. PyGNR shows the absorption maximum at 680 nm, exhibiting a narrow optical bandgap of 1.4 eV, qualifying as a low-bandgap GNR. Moreover, THz spectroscopy on PyGNR estimates its macroscopic charge mobility of 3.6 cm2/Vs, outperforming other curved GNRs reported via conventional Scholl reaction.

physics.app-ph↗

Generalizing to Unseen Domains in Diabetic Retinopathy with Disentangled Representations

Diabetic Retinopathy (DR), induced by diabetes, poses a significant risk of visual impairment. Accurate and effective grading of DR aids in the treatment of this condition. Yet existing models experience notable performance degradation on unseen domains due to domain shifts. Previous methods address this issue by simulating domain style through simple visual transformation and mitigating domain noise via learning robust representations. However, domain shifts encompass more than image styles. They overlook biases caused by implicit factors such as ethnicity, age, and diagnostic criteria. In our work, we propose a novel framework where representations of paired data from different domains are decoupled into semantic features and domain noise. The resulting augmented representation comprises original retinal semantics and domain noise from other domains, aiming to generate enhanced representations aligned with real-world clinical needs, incorporating rich information from diverse domains. Subsequently, to improve the robustness of the decoupled representations, class and domain prototypes are employed to interpolate the disentangled representations while data-aware weights are designed to focus on rare classes and domains. Finally, we devise a robust pixel-level semantic alignment loss to align retinal semantics decoupled from features, maintaining a balance between intra-class diversity and dense class features. Experimental results on multiple benchmarks demonstrate the effectiveness of our method on unseen domains. The code implementations are accessible on https://github.com/richard-peng-xia/DECO.

cs.CV↗

Click-aware Structure Transfer with Sample Weight Assignment for Post-Click Conversion Rate Estimation

Post-click Conversion Rate (CVR) prediction task plays an essential role in industrial applications, such as recommendation and advertising. Conventional CVR methods typically suffer from the data sparsity problem as they rely only on samples where the user has clicked. To address this problem, researchers have introduced the method of multi-task learning, which utilizes non-clicked samples and shares feature representations of the Click-Through Rate (CTR) task with the CVR task. However, it should be noted that the CVR and CTR tasks are fundamentally different and may even be contradictory. Therefore, introducing a large amount of CTR information without distinction may drown out valuable information related to CVR. This phenomenon is called the curse of knowledge problem in this paper. To tackle this issue, we argue that a trade-off should be achieved between the introduction of large amounts of auxiliary information and the protection of valuable information related to CVR. Hence, we propose a Click-aware Structure Transfer model with sample Weight Assignment, abbreviated as CSTWA. It pays more attention to the latent structure information, which can filter the input information that is related to CVR, instead of directly sharing feature representations. Meanwhile, to capture the representation conflict between CTR and CVR, we calibrate the representation layer and reweight the discriminant layer to excavate the click bias information from the CTR tower. Moreover, it incorporates a sample weight assignment algorithm biased towards CVR modeling, to make the knowledge from CTR would not mislead the CVR. Extensive experiments on industrial and public datasets have demonstrated that CSTWA significantly outperforms widely used and competitive models.

cs.IR↗

STAN: Stage-Adaptive Network for Multi-Task Recommendation by Learning User Lifecycle-Based Representation

Recommendation systems play a vital role in many online platforms, with their primary objective being to satisfy and retain users. As directly optimizing user retention is challenging, multiple evaluation metrics are often employed. Existing methods generally formulate the optimization of these evaluation metrics as a multitask learning problem, but often overlook the fact that user preferences for different tasks are personalized and change over time. Identifying and tracking the evolution of user preferences can lead to better user retention. To address this issue, we introduce the concept of "user lifecycle", consisting of multiple stages characterized by users' varying preferences for different tasks. We propose a novel Stage-Adaptive Network (STAN) framework for modeling user lifecycle stages. STAN first identifies latent user lifecycle stages based on learned user preferences, and then employs the stage representation to enhance multi-task learning performance. Our experimental results using both public and industrial datasets demonstrate that the proposed model significantly improves multi-task prediction performance compared to state-of-the-art methods, highlighting the importance of considering user lifecycle stages in recommendation systems. Furthermore, online A/B testing reveals that our model outperforms the existing model, achieving a significant improvement of 3.05% in staytime per user and 0.88% in CVR. These results indicate that our approach effectively improves the overall efficiency of the multi-task recommendation system.

cs.IR↗

Robust Image Ordinal Regression with Controllable Image Generation

Image ordinal regression has been mainly studied along the line of exploiting the order of categories. However, the issues of class imbalance and category overlap that are very common in ordinal regression were largely overlooked. As a result, the performance on minority categories is often unsatisfactory. In this paper, we propose a novel framework called CIG based on controllable image generation to directly tackle these two issues. Our main idea is to generate extra training samples with specific labels near category boundaries, and the sample generation is biased toward the less-represented categories. To achieve controllable image generation, we seek to separate structural and categorical information of images based on structural similarity, categorical similarity, and reconstruction constraints. We evaluate the effectiveness of our new CIG approach in three different image ordinal regression scenarios. The results demonstrate that CIG can be flexibly integrated with off-the-shelf image encoders or ordinal regression models to achieve improvement, and further, the improvement is more significant for minority categories.

cs.CV↗

Transiently delocalized states enhance hole mobility in organic molecular semiconductors

There is compelling evidence that charge carriers in organic semiconductors (OSs) self-localize in nano-scale space because of dynamic disorder. Yet, some OSs, in particular recently emerged high-mobility organic molecular crystals, feature reduced mobility at increasing temperature, a hallmark for delocalized band transport. Here we present the temperature-dependent mobility in two record-mobility OSs: DNTT (dinaphtho[2,3-b:2',3'-f]thieno[3,2-b]-thiophene), and its alkylated derivative, C8-DNTT-C8. By combining terahertz photoconductivity measurements with fully atomistic non-adiabatic molecular dynamics simulations, we show that while both crystals display a power-law decrease of the mobility (μ) with temperature (T, following: μ\propto T^(-n)), the exponent n differs substantially. Modelling provides n values in good agreement with experiments and reveals that the differences in the falloff parameter between the two chemically closely related semiconductors can be traced to the delocalization of the different states thermally accessible by charge carriers, which in turn depends on the specific electronic band structure of the two systems. The emerging picture is that of holes surfing on a dynamic manifold of vibrationally-dressed extended states with a temperature-dependent mobility that provides a sensitive fingerprint for the underlying density of states.

cond-mat.soft↗

CTT-Net: A Multi-view Cross-token Transformer for Cataract Postoperative Visual Acuity Prediction

Surgery is the only viable treatment for cataract patients with visual acuity (VA) impairment. Clinically, to assess the necessity of cataract surgery, accurately predicting postoperative VA before surgery by analyzing multi-view optical coherence tomography (OCT) images is crucially needed. Unfortunately, due to complicated fundus conditions, determining postoperative VA remains difficult for medical experts. Deep learning methods for this problem were developed in recent years. Although effective, these methods still face several issues, such as not efficiently exploring potential relations between multi-view OCT images, neglecting the key role of clinical prior knowledge (e.g., preoperative VA value), and using only regression-based metrics which are lacking reference. In this paper, we propose a novel Cross-token Transformer Network (CTT-Net) for postoperative VA prediction by analyzing both the multi-view OCT images and preoperative VA. To effectively fuse multi-view features of OCT images, we develop cross-token attention that could restrict redundant/unnecessary attention flow. Further, we utilize the preoperative VA value to provide more information for postoperative VA prediction and facilitate fusion between views. Moreover, we design an auxiliary classification loss to improve model performance and assess VA recovery more sufficiently, avoiding the limitation by only using the regression metrics. To evaluate CTT-Net, we build a multi-view OCT image dataset collected from our collaborative hospital. A set of extensive experiments validate the effectiveness of our model compared to existing methods in various metrics. Code is available at: https://github.com/wjh892521292/Cataract OCT.

eess.IV↗

Probing Carrier Dynamics in sp$^{3}$-Functionalized Single-Walled Carbon Nanotubes with Time-Resolved Terahertz Spectroscopy

The controlled introduction of covalent sp$^{3}$ defects into semiconducting single-walled carbon nanotubes (SWCNTs) gives rise to exciton localization and red-shifted near-infrared luminescence. The single-photon emission characteristics of these functionalized SWCNTs make them interesting candidates for electrically driven quantum light sources. However, the impact of sp$^{3}$ defects on the carrier dynamics and charge transport in carbon nanotubes remains an open question. Here, we use ultrafast, time-resolved optical-pump terahertz-probe spectroscopy as a direct and quantitative technique to investigate the microscopic and temperature-dependent charge transport properties of pristine and functionalized (6,5) SWCNTs in dispersions and thin films. We find that sp$^{3}$ functionalization increases charge carrier scattering, thus reducing the intra-nanotube carrier mobility. In combination with electrical measurements of SWCNT network field-effect transistors, these data enable us to distinguish between contributions of intra-nanotube band transport, sp$^{3}$ defect scattering and inter-nanotube carrier hopping to the overall charge transport properties of nanotube networks.

cond-mat.mtrl-sci↗

PNM: Pixel Null Model for General Image Segmentation

A major challenge in image segmentation is classifying object boundaries. Recent efforts propose to refine the segmentation result with boundary masks. However, models are still prone to misclassifying boundary pixels even when they correctly capture the object contours. In such cases, even a perfect boundary map is unhelpful for segmentation refinement. In this paper, we argue that assigning proper prior weights to error-prone pixels such as object boundaries can significantly improve the segmentation quality. Specifically, we present the \textit{pixel null model} (PNM), a prior model that weights each pixel according to its probability of being correctly classified by a random segmenter. Empirical analysis shows that PNM captures the misclassification distribution of different state-of-the-art (SOTA) segmenters. Extensive experiments on semantic, instance, and panoptic segmentation tasks over three datasets (Cityscapes, ADE20K, MS COCO) confirm that PNM consistently improves the segmentation quality of most SOTA methods (including the vision transformers) and outperforms boundary-based methods by a large margin. We also observe that the widely-used mean IoU (mIoU) metric is insensitive to boundaries of different sharpness. As a byproduct, we propose a new metric, \textit{PNM IoU}, which perceives the boundary sharpness and better reflects the model segmentation performance in error-prone regions.

cs.CV↗

A Deep Learning Approach to Predicting Ventilator Parameters for Mechanically Ventilated Septic Patients

We develop a deep learning approach to predicting a set of ventilator parameters for a mechanically ventilated septic patient using a long and short term memory (LSTM) recurrent neural network (RNN) model. We focus on short-term predictions of a set of ventilator parameters for the septic patient in emergency intensive care unit (EICU). The short-term predictability of the model provides attending physicians with early warnings to make timely adjustment to the treatment of the patient in the EICU. The patient specific deep learning model can be trained on any given critically ill patient, making it an intelligent aide for physicians to use in emergent medical situations.

q-bio.QM↗

Modeling Heterogeneous Statistical Patterns in High-dimensional Data by Adversarial Distributions: An Unsupervised Generative Framework

Since the label collecting is prohibitive and time-consuming, unsupervised methods are preferred in applications such as fraud detection. Meanwhile, such applications usually require modeling the intrinsic clusters in high-dimensional data, which usually displays heterogeneous statistical patterns as the patterns of different clusters may appear in different dimensions. Existing methods propose to model the data clusters on selected dimensions, yet globally omitting any dimension may damage the pattern of certain clusters. To address the above issues, we propose a novel unsupervised generative framework called FIRD, which utilizes adversarial distributions to fit and disentangle the heterogeneous statistical patterns. When applying to discrete spaces, FIRD effectively distinguishes the synchronized fraudsters from normal users. Besides, FIRD also provides superior performance on anomaly detection datasets compared with SOTA anomaly detection methods (over 5% average AUC improvement). The significant experiment results on various datasets verify that the proposed method can better model the heterogeneous statistical patterns in high-dimensional data and benefit downstream applications.

cs.LG↗

Long-Lived Charge Separation Following Pump-Energy Dependent Ultrafast Charge Transfer in Graphene/WS$_2$ Heterostructures

Van der Waals heterostructures consisting of graphene and transition metal dichalcogenides (TMDCs) have recently shown great promise for high-performance optoelectronic applications. However, an in-depth understanding of the critical processes for device operation, namely interfacial charge transfer (CT) and recombination, has so far remained elusive. Here, we investigate these processes in graphene-WS$_2$ heterostructures, by complementarily probing the ultrafast terahertz photoconductivity in graphene and the transient absorption dynamics in WS$_2$ following photoexcitation. We find that CT across graphene-WS$_2$ interfaces occurs via photo-thermionic emission for sub-A-exciton excitation, and direct hole transfer from WS$_2$ to the valence band of graphene for above-A-exciton excitation. Remarkably, we observe that separated charges in the heterostructure following CT live extremely long: beyond 1 ns, in contrast to ~1 ps charge separation reported in previous studies. This leads to efficient photogating of graphene. These findings provide relevant insights to optimize further the performance of optoelectronic devices, in particular photodetection.

cond-mat.mtrl-sci↗

Multi-label Zero-shot Classification by Learning to Transfer from External Knowledge

Multi-label zero-shot classification aims to predict multiple unseen class labels for an input image. It is more challenging than its single-label counterpart. On one hand, the unconstrained number of labels assigned to each image makes the model more easily overfit to those seen classes. On the other hand, there is a large semantic gap between seen and unseen classes in the existing multi-label classification datasets. To address these difficult issues, this paper introduces a novel multi-label zero-shot classification framework by learning to transfer from external knowledge. We observe that ImageNet is commonly used to pretrain the feature extractor and has a large and fine-grained label space. This motivates us to exploit it as external knowledge to bridge the seen and unseen classes and promote generalization. Specifically, we construct a knowledge graph including not only classes from the target dataset but also those from ImageNet. Since ImageNet labels are not available in the target dataset, we propose a novel PosVAE module to infer their initial states in the extended knowledge graph. Then we design a relational graph convolutional network (RGCN) to propagate information among classes and achieve knowledge transfer. Experimental results on two benchmark datasets demonstrate the effectiveness of the proposed approach.

cs.CV↗

Distributed Deep Forest and its Application to Automatic Detection of Cash-out Fraud

Internet companies are facing the need for handling large-scale machine learning applications on a daily basis and distributed implementation of machine learning algorithms which can handle extra-large scale tasks with great performance is widely needed. Deep forest is a recently proposed deep learning framework which uses tree ensembles as its building blocks and it has achieved highly competitive results on various domains of tasks. However, it has not been tested on extremely large scale tasks. In this work, based on our parameter server system, we developed the distributed version of deep forest. To meet the need for real-world tasks, many improvements are introduced to the original deep forest model, including MART (Multiple Additive Regression Tree) as base learners for efficiency and effectiveness consideration, the cost-based method for handling prevalent class-imbalanced data, MART based feature selection for high dimension data and different evaluation metrics for automatically determining of the cascade level. We tested the deep forest model on an extra-large scale task, i.e., automatic detection of cash-out fraud, with more than 100 millions of training samples. Experimental results showed that the deep forest model has the best performance according to the evaluation metrics from different perspectives even with very little effort for parameter tuning. This model can block fraud transactions in a large amount of money each day. Even compared with the best-deployed model, the deep forest model can additionally bring into a significant decrease in economic loss each day.

cs.LG↗

Deep Time-Stream Framework for Click-Through Rate Prediction by Tracking Interest Evolution

Click-through rate (CTR) prediction is an essential task in industrial applications such as video recommendation. Recently, deep learning models have been proposed to learn the representation of users' overall interests, while ignoring the fact that interests may dynamically change over time. We argue that it is necessary to consider the continuous-time information in CTR models to track user interest trend from rich historical behaviors. In this paper, we propose a novel Deep Time-Stream framework (DTS) which introduces the time information by an ordinary differential equations (ODE). DTS continuously models the evolution of interests using a neural network, and thus is able to tackle the challenge of dynamically representing users' interests based on their historical behaviors. In addition, our framework can be seamlessly applied to any existing deep CTR models by leveraging the additional Time-Stream Module, while no changes are made to the original CTR models. Experiments on public dataset as well as real industry dataset with billions of samples demonstrate the effectiveness of proposed approaches, which achieve superior performance compared with existing methods.

cs.LG↗

Code Attention: Translating Code to Comments by Exploiting Domain Features

Appropriate comments of code snippets provide insight for code functionality, which are helpful for program comprehension. However, due to the great cost of authoring with the comments, many code projects do not contain adequate comments. Automatic comment generation techniques have been proposed to generate comments from pieces of code in order to alleviate the human efforts in annotating the code. Most existing approaches attempt to exploit certain correlations (usually manually given) between code and generated comments, which could be easily violated if the coding patterns change and hence the performance of comment generation declines. In this paper, we first build C2CGit, a large dataset from open projects in GitHub, which is more than 20$\times$ larger than existing datasets. Then we propose a new attention module called Code Attention to translate code to comments, which is able to utilize the domain features of code snippets, such as symbols and identifiers. We make ablation studies to determine effects of different parts in Code Attention. Experimental results demonstrate that the proposed module has better performance over existing approaches in both BLEU and METEOR.

cs.AI↗