Searcharxiv⌕ Search

arXiv subjects

Yao Wu

Publications and source records attributed to Yao Wu.

35 records · Page 2Linked to original sources

Fusion-then-Distillation: Toward Cross-modal Positive Distillation for Domain Adaptive 3D Semantic Segmentation

In cross-modal unsupervised domain adaptation, a model trained on source-domain data (e.g., synthetic) is adapted to target-domain data (e.g., real-world) without access to target annotation. Previous methods seek to mutually mimic cross-modal outputs in each domain, which enforces a class probability distribution that is agreeable in different domains. However, they overlook the complementarity brought by the heterogeneous fusion in cross-modal learning. In light of this, we propose a novel fusion-then-distillation (FtD++) method to explore cross-modal positive distillation of the source and target domains for 3D semantic segmentation. FtD++ realizes distribution consistency between outputs not only for 2D images and 3D point clouds but also for source-domain and augment-domain. Specially, our method contains three key ingredients. First, we present a model-agnostic feature fusion module to generate the cross-modal fusion representation for establishing a latent space. In this space, two modalities are enforced maximum correlation and complementarity. Second, the proposed cross-modal positive distillation preserves the complete information of multi-modal input and combines the semantic content of the source domain with the style of the target domain, thereby achieving domain-modality alignment. Finally, cross-modal debiased pseudo-labeling is devised to model the uncertainty of pseudo-labels via a self-training manner. Extensive experiments report state-of-the-art results on several domain adaptive scenarios under unsupervised and semi-supervised settings. Code is available at https://github.com/Barcaaaa/FtD-PlusPlus.

cs.CV↗

CLIP3D-AD: Extending CLIP for 3D Few-Shot Anomaly Detection with Multi-View Images Generation

Few-shot anomaly detection methods can effectively address data collecting difficulty in industrial scenarios. Compared to 2D few-shot anomaly detection (2D-FSAD), 3D few-shot anomaly detection (3D-FSAD) is still an unexplored but essential task. In this paper, we propose CLIP3D-AD, an efficient 3D-FSAD method extended on CLIP. We successfully transfer strong generalization ability of CLIP into 3D-FSAD. Specifically, we synthesize anomalous images on given normal images as sample pairs to adapt CLIP for 3D anomaly classification and segmentation. For classification, we introduce an image adapter and a text adapter to fine-tune global visual features and text features. Meanwhile, we propose a coarse-to-fine decoder to fuse and facilitate intermediate multi-layer visual representations of CLIP. To benefit from geometry information of point cloud and eliminate modality and data discrepancy when processed by CLIP, we project and render point cloud to multi-view normal and anomalous images. Then we design multi-view fusion module to fuse features of multi-view images extracted by CLIP which are used to facilitate visual representations for further enhancing vision-language correlation. Extensive experiments demonstrate that our method has a competitive performance of 3D few-shot anomaly classification and segmentation on MVTec-3D AD dataset.

cs.CV↗

Anomaly Multi-classification in Industrial Scenarios: Transferring Few-shot Learning to a New Task

In industrial scenarios, it is crucial not only to identify anomalous items but also to classify the type of anomaly. However, research on anomaly multi-classification remains largely unexplored. This paper proposes a novel and valuable research task called anomaly multi-classification. Given the challenges in applying few-shot learning to this task, due to limited training data and unique characteristics of anomaly images, we introduce a baseline model that combines RelationNet and PatchCore. We propose a data generation method that creates pseudo classes and a corresponding proxy task, aiming to bridge the gap in transferring few-shot learning to industrial scenarios. Furthermore, we utilize contrastive learning to improve the vanilla baseline, achieving much better performance than directly fine-tune a ResNet. Experiments conducted on MvTec AD and MvTec3D AD demonstrate that our approach shows superior performance in this novel task.

cs.CV↗

Decoupling Representation and Knowledge for Few-Shot Intent Classification and Slot Filling

Few-shot intent classification and slot filling are important but challenging tasks due to the scarcity of finely labeled data. Therefore, current works first train a model on source domains with sufficiently labeled data, and then transfer the model to target domains where only rarely labeled data is available. However, experience transferring as a whole usually suffers from gaps that exist among source domains and target domains. For instance, transferring domain-specific-knowledge-related experience is difficult. To tackle this problem, we propose a new method that explicitly decouples the transferring of general-semantic-representation-related experience and the domain-specific-knowledge-related experience. Specifically, for domain-specific-knowledge-related experience, we design two modules to capture intent-slot relation and slot-slot relation respectively. Extensive experiments on Snips and FewJoint datasets show that our method achieves state-of-the-art performance. The method improves the joint accuracy metric from 27.72% to 42.20% in the 1-shot setting, and from 46.54% to 60.79% in the 5-shot setting.

cs.CL↗

Topology-inspired Cross-domain Network for Developmental Cervical Stenosis Quantification

Developmental Canal Stenosis (DCS) quantification is crucial in cervical spondylosis screening. Compared with quantifying DCS manually, a more efficient and time-saving manner is provided by deep keypoint localization networks, which can be implemented in either the coordinate or the image domain. However, the vertebral visualization features often lead to abnormal topological structures during keypoint localization, including keypoint distortion with edges and weakly connected structures, which cannot be fully suppressed in either the coordinate or image domain alone. To overcome this limitation, a keypoint-edge and a reparameterization modules are utilized to restrict these abnormal structures in a cross-domain manner. The keypoint-edge constraint module restricts the keypoints on the edges of vertebrae, which ensures that the distribution pattern of keypoint coordinates is consistent with those for DCS quantification. And the reparameterization module constrains the weakly connected structures in image-domain heatmaps with coordinates combined. Moreover, the cross-domain network improves spatial generalization by utilizing heatmaps and incorporating coordinates for accurate localization, which avoids the trade-off between these two properties in an individual domain. Comprehensive results of distinct quantification tasks show the superiority and generability of the proposed Topology-inspired Cross-domain Network (TCN) compared with other competing localization methods.

eess.IV↗

Unconventional polarization switching mechanism in (Hf, Zr)O2 ferroelectrics

HfO$_{2}$-based ferroelectric thin films are promising for their application in ferroelectric devices. Predicting the ultimate magnitude of polarization and understanding its switching mechanism are critical to realize the optimal performance of these devices. Here, a generalized solid-state variable cell nudged elastic band (VCNEB) method is employed to predict the switching pathway associated with domain-wall motion in (Hf, Zr)O$_{2}$ ferroelectrics. It is found that the polarization reversal pathway, where three-fold coordinated O atoms pass across the nominal unit-cell boundaries defined by the Hf/Zr atomic planes, is energetically more favorable than the conventional pathway where the O atoms do not pass through these planes. This finding implies that the polarization orientation in the orthorhombic Pca2$_{1}$ phase of HfO$_{2}$ nd its derivatives is opposite to that normally assumed, predicts the spontaneous polarization magnitude of about 70 $μ$C/cm$^{2}$ that is nearly 50% larger than the commonly accepted value, signifies a positive intrinsic longitudinal piezoelectric coefficient, and suggests growth of ferroelectric domains, in response to an applied electric field, structurally reversed to those usually anticipated. These results provide important insights into the understanding of ferroelectricity in HfO$_{2}$-based ferroelectrics.

cond-mat.mtrl-sci↗

Constraints for precise and accurate fluid inclusion stable isotope analysis using water-vapour saturated CRDS techniques

Hydrogen ($δ$2H) and oxygen ($δ$18O) isotopes of water extracted from speleothem fluid inclusions are important proxies used for paleoclimate reconstruction. In our study we use a cavity ring-down laser spectroscopy system for analysis and modified the approach of Affolter et al. (2014) for sample extraction. The method is based on crushing of small sub-gram speleothem samples in a heated and continuously water-vapour purged extraction line. The following points were identified: Injection of reference water shows a precision (1$σ$) of 0.4-0.5 permil for $δ$18O values and 1.1-1.9 permil for $δ$2H values for water amounts of 0.1-0.5 $μ$l, which improves with increasing water amount to 0.1-0.3 permil and 0.2-0.7 permil, respectively, above 1 $μ$l. The accuracy of measurements of water injections and water-filled glass capillaries crushed in the system is better than 0.08 permil for $δ$18O and 0.3 permil for $δ$2H values. The reproducibility (1$σ$) based on replicate analysis of speleothem fluid inclusion samples with water amounts > 0.2 $μ$l is 0.5 permil for $δ$18O and 1.2 permil for $δ$2H values, respectively. Isotopic differences between the water vapour background of the extraction system and the fluid inclusions have no significant impact on the measured fluid inclusion isotope values if they are within 10 permil for $δ$18O and 50 permil for $δ$2H values of the background. Tests of potential adsorption effects with inclusion free spar calcite confirm that the isotope values are unaffected by adsorption for water contents of about 1 $μ$l (fluid inclusion) water per g of carbonate or above. Fluid inclusion analysis on three different modern to late Holocene speleothems from caves in northwest Germany resulted ...

physics.geo-ph↗

Discrete effects on some boundary schemes of multiple-relaxation-time lattice Boltzmann model for convection-diffusion equations

In this paper, we perform a more general analysis on the discrete effects of some boundary schemes of the popular one- to three-dimensional DnQq multiple-relaxation-time lattice Boltzmann model for convection-diffusion equation (CDE). Investigated boundary schemes include anti-bounce-back(ABB) boundary scheme, bounce-back(BB) boundary scheme and non-equilibrium extrapolation(NEE) boundary scheme. In the analysis, we adopt a transform matrix $\textbf{M}$ constructed by natural moments in the evolution equation, and the result of ABB boundary scheme is consistent with the existing work of orthogonal matrix $\textbf{M}$. We also find that the discrete effect does not rely on the choice of transform matrix, and obtain a relation to determine some of the relaxation-time parameters which can be used to eliminate the numerical slip completely under some assumptions. In this relation, the weight coefficient is considered as an adjustable parameter which makes the parameter adjustment more flexible. The relaxation factors associated with second moments can be used to eliminate the numerical slip of ABB boundary scheme and BB boundary scheme while the numerical slip can not be eliminated of NEE boundary scheme. Furthermore, we extend the relations to complex-valued CDE, several numerical examples are used to test the relations.

physics.comp-ph↗

TFROM: A Two-sided Fairness-Aware Recommendation Model for Both Customers and Providers

At present, most research on the fairness of recommender systems is conducted either from the perspective of customers or from the perspective of product (or service) providers. However, such a practice ignores the fact that when fairness is guaranteed to one side, the fairness and rights of the other side are likely to reduce. In this paper, we consider recommendation scenarios from the perspective of two sides (customers and providers). From the perspective of providers, we consider the fairness of the providers' exposure in recommender system. For customers, we consider the fairness of the reduced quality of recommendation results due to the introduction of fairness measures. We theoretically analyzed the relationship between recommendation quality, customers fairness, and provider fairness, and design a two-sided fairness-aware recommendation model (TFROM) for both customers and providers. Specifically, we design two versions of TFROM for offline and online recommendation. The effectiveness of the model is verified on three real-world data sets. The experimental results show that TFROM provides better two-sided fairness while still maintaining a higher level of personalization than the baseline algorithms.

cs.AI↗

Multi-Task Representation Learning with Multi-View Graph Convolutional Networks

Link prediction and node classification are two important downstream tasks of network representation learning. Existing methods have achieved acceptable results but they perform these two tasks separately, which requires a lot of duplication of work and ignores the correlations between tasks. Besides, conventional models suffer from the identical treatment of information of multiple views, thus they fail to learn robust representation for downstream tasks. To this end, we tackle link prediction and node classification problems simultaneously via multi-task multi-view learning in this paper. We first explain the feasibility and advantages of multi-task multi-view learning for these two tasks. Then we propose a novel model named as MT-MVGCN to perform link prediction and node classification tasks simultaneously. More specifically, we design a multi-view graph convolutional network to extract abundant information of multiple views in a network, which is shared by different tasks. We further apply two attention mechanisms: view attention mechanism and task attention mechanism to make views and tasks adjust the view fusion process. Moreover, view reconstruction can be introduced as an auxiliary task to boost the performance of the proposed model. Experiments on real-world network datasets demonstrate that our model is efficient yet effective, and outperforms advanced baselines in these two tasks.

cs.SI↗

FAST: A Fairness Assured Service Recommendation Strategy Considering Service Capacity Constraint

An excessive number of customers often leads to a degradation in service quality. However, the capacity constraints of services are ignored by recommender systems, which may lead to unsatisfactory recommendation. This problem can be solved by limiting the number of users who receive the recommendation for a service, but this may be viewed as unfair. In this paper, we propose a novel metric Top-N Fairness to measure the individual fairness of multi-round recommendations of services with capacity constraints. By considering the fact that users are often only affected by top-ranked items in a recommendation, Top-N Fairness only considers a sub-list consisting of top N services. Based on the metric, we design FAST, a Fairness Assured service recommendation STrategy. FAST adjusts the original recommendation list to provide users with recommendation results that guarantee the long-term fairness of multi-round recommendations. We prove the convergence property of the variance of Top-N Fairness of FAST theoretically. FAST is tested on the Yelp dataset and synthetic datasets. The experimental results show that FAST achieves better recommendation fairness while still maintaining high recommendation quality.

cs.IR↗

A block triple-relaxation-time lattice Boltzmann model for nonlinear anisotropic convection-diffusion equations

A block triple-relaxation-time (B-TriRT) lattice Boltzmann model for general nonlinear anisotropic convection-diffusion equations (NACDEs) is proposed, and the Chapman-Enskog analysis shows that the present B-TriRT model can recover the NACDEs correctly. There are some striking features of the present B-TriRT model: firstly, the relaxation matrix of B-TriRT model is partitioned into three relaxation parameter blocks, rather than a diagonal matrix in general multiple-relaxation-time (MRT) model; secondly, based on the analysis of half-way bounce-back (HBB) scheme for Dirichlet boundary conditions, we obtain an expression to determine the relaxation parameters; thirdly, the anisotropic diffusion tensor can be recovered by the relaxation parameter block that corresponds to the first-order moment of non-equilibrium distribution function. A number of simulations of isotropic and anisotropic convection-diffusion equations are conducted to validate the present B-TriRT model. The results indicate that the present model has a second-order accuracy in space, and is also more accurate and more stable than some available lattice Boltzmann models.

physics.comp-ph↗

Lattice Boltzmann simulations of melting in a rectangular cavity heated locally from below at high Rayleigh number

This work presented a block triple-relaxation-time (B-TriRT) lattice Boltzmann model for simulating melting in a rectangular cavity heated from below at high Rayleigh (Ra) number (Ra = 108). The test of benchmark problem shows that present B-TriRT can dramatically reduce the numerical diffusion across the phase interface. In addition, the influences of the location of the heated region are investigated. The results indicate that the location of heated region plays an essential role in melting rate and the full melting occur earliest when the heated region is located in the middle region.

physics.comp-ph↗

biggy: An Implementation of Unified Framework for Big Data Management System

Various tools, softwares and systems are proposed and implemented to tackle the challenges in big data on different emphases, e.g., data analysis, data transaction, data query, data storage, data visualization, data privacy. In this paper, we propose datar, a new prospective and unified framework for Big Data Management System (BDMS) from the point of system architecture by leveraging ideas from mainstream computer structure. We introduce five key components of datar by reviewing the cur- rent status of BDMS. Datar features with configuration chain of pluggable engines, automatic dataflow on job pipelines, intelligent self-driving system management and interactive user interfaces. Moreover, we present biggy as an implementation of datar with manipulation details demonstrated by four running examples. Evaluations on efficiency and scalability are carried out to show the performance. Our work argues that the envisioned datar is a feasible solution to the unified framework of BDMS, which can manage big data pluggablly, automatically and intelligently with specific functionalities, where specific functionalities refer to input, storage, computation, control and output of big data.

cs.DB↗

HelPal: A Search System for Mobile Crowd Service

Proliferation of ubiquitous mobile devices makes location based services prevalent. Mobile users are able to volunteer as providers of specific services and in the meanwhile to search these services. For example, drivers may be interested in tracking available nearby users who are willing to help with motor repair or are willing to provide travel directions or first aid. With the diffusion of mobile users, it is necessary to provide scalable means of enabling such users to connect with other nearby users so that they can help each other with specific services. Motivated by these observations, we design and implement a general location based system HelPal for mobile users to provide and enjoy instant service, which is called mobile crowd service. In this demo, we introduce a mobile crowd service system featured with several novel techniques. We sketch the system architecture and illustrate scenarios via several cases. Demonstration shows the user-friendly search interface for users to conveniently find skilled and qualified nearby service providers.

cs.IR↗

Structural Analysis of User Choices for Mobile App Recommendation

Advances in smartphone technology have promoted the rapid development of mobile apps. However, the availability of a huge number of mobile apps in application stores has imposed the challenge of finding the right apps to meet the user needs. Indeed, there is a critical demand for personalized app recommendations. Along this line, there are opportunities and challenges posed by two unique characteristics of mobile apps. First, app markets have organized apps in a hierarchical taxonomy. Second, apps with similar functionalities are competing with each other. While there are a variety of approaches for mobile app recommendations, these approaches do not have a focus on dealing with these opportunities and challenges. To this end, in this paper, we provide a systematic study for addressing these challenges. Specifically, we develop a Structural User Choice Model (SUCM) to learn fine-grained user preferences by exploiting the hierarchical taxonomy of apps as well as the competitive relationships among apps. Moreover, we design an efficient learning algorithm to estimate the parameters for the SUCM model. Finally, we perform extensive experiments on a large app adoption data set collected from Google Play. The results show that SUCM consistently outperforms state-of-the-art top-N recommendation methods by a significant margin.

cs.IR↗

Efficient Multicore Collaborative Filtering

This paper describes the solution method taken by LeBuSiShu team for track1 in ACM KDD CUP 2011 contest (resulting in the 5th place). We identified two main challenges: the unique item taxonomy characteristics as well as the large data set size.To handle the item taxonomy, we present a novel method called Matrix Factorization Item Taxonomy Regularization (MFITR). MFITR obtained the 2nd best prediction result out of more then ten implemented algorithms. For rapidly computing multiple solutions of various algorithms, we have implemented an open source parallel collaborative filtering library on top of the GraphLab machine learning framework. We report some preliminary performance results obtained using the BlackLight supercomputer.

cs.LG↗