paper-with-me

Papers

Gradient-Boosted Decision Tree for Listwise Context Model in Multimodal Review Helpfulness Prediction

2023-05-22 · Thong Nguyen, Xiaobao Wu, Xinshuai Dong, Anh Tuan Luu, Cong-Duy Nguyen, Zhen Hai, Lidong Bing

Multimodal Review Helpfulness Prediction (MRHP) aims to rank product reviews based on predicted helpfulness scores and has been widely applied in e-commerce via presenting customers with useful reviews. Previous studies commonly employ fully-connected neural networks (FCNNs) as the final score predictor and pairwise loss as the training objective. However, FCNNs have been shown to perform inefficient splitting for review features, making the model difficult to clearly differentiate helpful from unhelpful reviews. Furthermore, pairwise objective, which works on review pairs, may not completely capture the MRHP goal to produce the ranking for the entire review list, and possibly induces low generalization during testing. To address these issues, we propose a listwise attention network that clearly captures the MRHP ranking context and a listwise optimization objective that enhances model generalization. We further propose gradient-boosted decision tree as the score predictor to efficaciously partition product reviews' representations. Extensive experiments demonstrate that our method achieves state-of-the-art results and polished generalization performance on two large-scale MRHP benchmark datasets.

📄 PDF Abstract BibTeX arXiv:2305.12678

Code (1)

nguyentthong/gbdt_listwise_mrhp 공식 구현 pytorch

Similar Papers 제목 키워드 기반

Gradient Boosted Filters For Signal Processing

2024-05-15 · Jose A. Lopez, Georg Stemmer, Hector A. Cordourier

Gradient boosted decision trees have achieved remarkable success in several domains, particularly those that work with static tabular data. However, the application of gradient boosted models to signal processing is unde…

Tree-Structured Boosting: Connections Between Gradient Boosted Stumps and Full Decision Trees

2017-11-18 · José Marcio Luna, Eric Eaton, Lyle H. Ungar, Eric Diffenderfer 외

Additive models, such as produced by gradient boosting, and full interaction models, such as classification and regression trees (CART), are widely used algorithms that have been investigated largely in isolation. We sho…

Additive modelsGeneral Classification

Gradient Boosted Decision Tree Neural Network

2019-10-17 · Mohammad Saberian, Pablo Delgado, Yves Raimond

In this paper we propose a method to build a neural network that is similar to an ensemble of decision trees. We first illustrate how to convert a learned ensemble of decision trees to a single neural network with one hi…

Improving Neural Ranking via Lossless Knowledge Distillation

2021-09-30 · Zhen Qin, Le Yan, Yi Tay, Honglei Zhuang 외

We explore a novel perspective of knowledge distillation (KD) for learning to rank (LTR), and introduce Self-Distilled neural Rankers (SDR), where student rankers are parameterized identically to their teachers. Unlike t…

Knowledge DistillationLearning-To-Rank

Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded

2018-03-02 · Miten Mistry, Dimitrios Letsios, Gerhard Krennrich, Robert M. Lee 외

Decision trees usefully represent sparse, high dimensional and noisy data. Having learned a function from this data, we may want to thereafter integrate the function into a larger decision-making problem, e.g., for picki…

Chemical ProcessDecision Making