Reproducibility Companion Paper: Knowledge Enhanced Neural Fashion Trend Forecasting

• URL: http://arxiv.org/abs/2105.11826v1
• Date: Tue, 25 May 2021 10:53:11 GMT
• Title: Reproducibility Companion Paper: Knowledge Enhanced Neural Fashion Trend Forecasting
• Authors: Yunshan Ma, Yujuan Ding, Xun Yang, Lizi Liao, Wai Keung Wong, Tat-Seng Chua, Jinyoung Moon, Hong-Han Shuai
• Abstract summary: We provide an artifact that allows the replication of the experiments using a Python implementation. We reproduce the experiments conducted in the original paper and obtain similar performance as previously reported.
• Score: 78.046352507802
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This companion paper supports the replication of the fashion trend forecasting experiments with the KERN (Knowledge Enhanced Recurrent Network) method that we presented in the ICMR 2020. We provide an artifact that allows the replication of the experiments using a Python implementation. The artifact is easy to deploy with simple installation, training and evaluation. We reproduce the experiments conducted in the original paper and obtain similar performance as previously reported. The replication results of the experiments support the main claims in the original paper.

Related papers

• ReproHum #0087-01: Human Evaluation Reproduction Report for Generating Fact Checking Explanations [16.591822946975547]
  This paper reproduces the findings of NLP research regarding human evaluation. The results lend support to the original findings, with similar patterns seen between the original work and our reproduction.
  arXiv  Detail & Related papers  (2024-04-26T15:31:25Z)
• A Study on Reproducibility and Replicability of Table Structure Recognition Methods [3.8366337377024298]
  We examine both and replicability of a corpus of 16 papers on table structure recognition (TSR) We reproduce results consistent with the original in only four of the 16 papers studied. No paper is identified as replicable using the new dataset.
  arXiv  Detail & Related papers  (2023-04-20T16:30:58Z)
• PartMix: Regularization Strategy to Learn Part Discovery for Visible-Infrared Person Re-identification [76.40417061480564]
  We present a novel data augmentation technique, dubbed PartMix, for part-based Visible-Infrared person Re-IDentification (VI-ReID) models. We synthesize the augmented samples by mixing the part descriptors across the modalities to improve the performance of part-based VI-ReID models.
  arXiv  Detail & Related papers  (2023-04-04T05:21:23Z)
• A Scalable and Efficient Iterative Method for Copying Machine Learning Classifiers [0.802904964931021]
  This paper introduces a novel sequential approach that significantly reduces the amount of computational resources needed to train or maintain a copy of a machine learning model. The effectiveness of the sequential approach is demonstrated through experiments with synthetic and real-world datasets, showing significant reductions in time and resources, while maintaining or improving accuracy.
  arXiv  Detail & Related papers  (2023-02-06T10:07:41Z)
• Incorporating Relevance Feedback for Information-Seeking Retrieval using Few-Shot Document Re-Ranking [56.80065604034095]
  We introduce a kNN approach that re-ranks documents based on their similarity with the query and the documents the user considers relevant. To evaluate our different integration strategies, we transform four existing information retrieval datasets into the relevance feedback scenario.
  arXiv  Detail & Related papers  (2022-10-19T16:19:37Z)
• Benchopt: Reproducible, efficient and collaborative optimization benchmarks [67.29240500171532]
  Benchopt is a framework to automate, reproduce and publish optimization benchmarks in machine learning. Benchopt simplifies benchmarking for the community by providing an off-the-shelf tool for running, sharing and extending experiments.
  arXiv  Detail & Related papers  (2022-06-27T16:19:24Z)
• DeepZensols: Deep Natural Language Processing Framework [23.56171046067646]
  This work is a framework that is able to reproduce consistent results. It provides a means of easily creating, training, and evaluating natural language processing (NLP) deep learning (DL) models.
  arXiv  Detail & Related papers  (2021-09-08T01:16:05Z)
• On the Copying Behaviors of Pre-Training for Neural Machine Translation [63.914940899327966]
  Previous studies have shown that initializing neural machine translation (NMT) models with the pre-trained language models (LM) can speed up the model training and boost the model performance. In this work, we identify a critical side-effect of pre-training for NMT, which is due to the discrepancy between the training objectives of LM-based pre-training and NMT. We propose a simple and effective method named copying penalty to control the copying behaviors in decoding.
  arXiv  Detail & Related papers  (2021-07-17T10:02:30Z)
• A Replication Study of Dense Passage Retriever [32.192420072129636]
  We study the dense passage retriever (DPR) technique proposed by Karpukhin et al. ( 2020) for end-to-end open-domain question answering. We present a replication study of this work, starting with model checkpoints provided by the authors. We are able to improve end-to-end question answering effectiveness using exactly the same models as in the original work.
  arXiv  Detail & Related papers  (2021-04-12T18:10:39Z)
• Self-supervised Deep Reconstruction of Mixed Strip-shredded Text Documents [63.41717168981103]
  This work extends our previous deep learning method for single-page reconstruction to a more realistic/complex scenario. In our approach, the compatibility evaluation is modeled as a two-class (valid or invalid) pattern recognition problem. The proposed method outperforms the competing ones on complex scenarios, achieving accuracy superior to 90%.
  arXiv  Detail & Related papers  (2020-07-01T21:48:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.