Search Results for author:
Found 17 papers, 7 papers with code
HQA-Attack: Toward High Quality Black-Box Hard-Label Adversarial Attack on Text
Black-box hard-label adversarial attack on text is a practical and challenging task, as the text data space is inherently discrete and non-differentiable, and only the predicted label is accessible.
Boosting Decision-Based Black-Box Adversarial Attack with Gradient Priors
Decision-based methods have shown to be effective in black-box adversarial attacks, as they can obtain satisfactory performance and only require to access the final model prediction.
Enhanced Human-Robot Collaboration using Constrained Probabilistic Human-Motion Prediction
We propose a novel human motion prediction framework that incorporates human joint constraints and scene constraints in a Gaussian Process Regression (GPR) model to predict human motion over a set time horizon.
Boosting Few-Shot Text Classification via Distribution Estimation
Distribution estimation has been demonstrated as one of the most effective approaches in dealing with few-shot image classification, as the low-level patterns and underlying representations can be easily transferred across different tasks in computer vision domain.
Few-Shot Image Classification
Few-Shot Text Classification
+1
Label-enhanced Prototypical Network with Contrastive Learning for Multi-label Few-shot Aspect Category Detection
Multi-label aspect category detection allows a given review sentence to contain multiple aspect categories, which is shown to be more practical in sentiment analysis and attracting increasing attention.
A Simple Meta-learning Paradigm for Zero-shot Intent Classification with Mixture Attention Mechanism
Zero-shot intent classification is a vital and challenging task in dialogue systems, which aims to deal with numerous fast-emerging unacquainted intents without annotated training data.
Modeling User Behavior with Graph Convolution for Personalized Product Search
Our approach can be seamlessly integrated with existing latent space based methods and be potentially applied in any product retrieval method that uses purchase history to model user preferences.
An Explicit-Joint and Supervised-Contrastive Learning Framework for Few-Shot Intent Classification and Slot Filling
Intent classification (IC) and slot filling (SF) are critical building blocks in task-oriented dialogue systems.
Posterior Promoted GAN With Distribution Discriminator for Unsupervised Image Synthesis
In this paper, we propose a novel variant of GAN, Posterior Promoted GAN (P2GAN), which promotes generator with the real information in the posterior distribution produced by discriminator.
Pruning and Quantization for Deep Neural Network Acceleration: A Survey
We discuss trade-offs in element-wise, channel-wise, shape-wise, filter-wise, layer-wise and even network-wise pruning.
Unknown Intent Detection Using Gaussian Mixture Model with an Application to Zero-shot Intent Classification
User intent classification plays a vital role in dialogue systems.
Reconstructing Capsule Networks for Zero-shot Intent Classification
With the burgeoning of conversational AI, existing systems are not capable of handling numerous fast-emerging intents, which motivates zero-shot intent classification.
Clustering Uncertain Data via Representative Possible Worlds with Consistency Learning
However, there are two issues in existing possible world based algorithms: (1) They rely on all the possible worlds and treat them equally, but some marginal possible worlds may cause negative effects.
Dimensionwise Separable 2-D Graph Convolution for Unsupervised and Semi-Supervised Learning on Graphs
Graph convolutional neural networks (GCN) have been the model of choice for graph representation learning, which is mainly due to the effective design of graph convolution that computes the representation of a node by aggregating those of its neighbors.
Attributed Graph Learning with 2-D Graph Convolution
Graph convolutional neural networks have demonstrated promising performance in attributed graph learning, thanks to the use of graph convolution that effectively combines graph structures and node features for learning node representations.
Attributed Graph Clustering via Adaptive Graph Convolution
Attributed graph clustering is challenging as it requires joint modelling of graph structures and node attributes.
Ranked #3 on
Graph Clustering
on Cora
Label Efficient Semi-Supervised Learning via Graph Filtering
However, existing graph-based methods either are limited in their ability to jointly model graph structures and data features, such as the classical label propagation methods, or require a considerable amount of labeled data for training and validation due to high model complexity, such as the recent neural-network-based methods.
