Search Results for author:
Found 11 papers, 3 papers with code
A Template-guided Hybrid Pointer Network for Knowledge-based Task-oriented Dialogue Systems
Most existing neural network based task-oriented dialog systems follow encoder-decoder paradigm, where the decoder purely depends on the source texts to generate a sequence of words, usually suffering from instability and poor readability.
Ranked #9 on
Task-Oriented Dialogue Systems
on KVRET
Can ChatGPT replace StackOverflow? A Study on Robustness and Reliability of Large Language Model Code Generation
Existing code evaluation benchmark and datasets focus on crafting small tasks such as programming questions in coding interviews, which however deviates from the problem that developers would ask LLM for real-world coding help.
Adaptive Services Function Chain Orchestration For Digital Health Twin Use Cases: Heuristic-boosted Q-Learning Approach
Digital Twin (DT) is a prominent technology to utilise and deploy within the healthcare sector.
A Template-guided Hybrid Pointer Network for Knowledge-basedTask-oriented Dialogue Systems
Most existing neural network based task-oriented dialogue systems follow encoder-decoder paradigm, where the decoder purely depends on the source texts to generate a sequence of words, usually suffering from instability and poor readability.
How does the Combined Risk Affect the Performance of Unsupervised Domain Adaptation Approaches?
Experiments show that the proxy can effectively curb the increase of the combined risk when minimizing the source risk and distribution discrepancy.
Container Orchestration on HPC Systems
Containerisation demonstrates its efficiency in application deployment in cloud computing.
Distributed, Parallel, and Cluster Computing
Bridging the Theoretical Bound and Deep Algorithms for Open Set Domain Adaptation
To achieve this aim, a previous study has proven an upper bound of the target-domain risk, and the open set difference, as an important term in the upper bound, is used to measure the risk on unknown target data.
A Critical Note on the Evaluation of Clustering Algorithms
Experimental evaluation is a major research methodology for investigating clustering algorithms and many other machine learning algorithms.
Confusionset-guided Pointer Networks for Chinese Spelling Check
This paper proposes Confusionset-guided Pointer Networks for Chinese Spell Check (CSC) task.
Restricted Connection Orthogonal Matching Pursuit For Sparse Subspace Clustering
In this paper, we propose a noise-robust algorithm, Restricted Connection Orthogonal Matching Pursuit for Sparse Subspace Clustering (RCOMP-SSC), to improve the clustering accuracy and maintain the low computational time by restricting the number of connections of each data point during the iteration of OMP.
A Reinforced Topic-Aware Convolutional Sequence-to-Sequence Model for Abstractive Text Summarization
In this paper, we propose a deep learning approach to tackle the automatic summarization tasks by incorporating topic information into the convolutional sequence-to-sequence (ConvS2S) model and using self-critical sequence training (SCST) for optimization.
Ranked #6 on
Text Summarization
on DUC 2004 Task 1
