Pith. sign in

REVIEW 1 cited by

A Bargaining-based Approach for Feature Trading in Vertical Federated Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.15247 v1 pith:4V5TFHS5 submitted 2024-02-23 cs.LG cs.AIcs.MA

classification cs.LGcs.AIcs.MA
keywords datapartyperformancefeaturemodeltradingbargainingfeatures
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Vertical Federated Learning (VFL) has emerged as a popular machine learning paradigm, enabling model training across the data and the task parties with different features about the same user set while preserving data privacy. In production environment, VFL usually involves one task party and one data party. Fair and economically efficient feature trading is crucial to the commercialization of VFL, where the task party is considered as the data consumer who buys the data party's features. However, current VFL feature trading practices often price the data party's data as a whole and assume transactions occur prior to the performing VFL. Neglecting the performance gains resulting from traded features may lead to underpayment and overpayment issues. In this study, we propose a bargaining-based feature trading approach in VFL to encourage economically efficient transactions. Our model incorporates performance gain-based pricing, taking into account the revenue-based optimization objectives of both parties. We analyze the proposed bargaining model under perfect and imperfect performance information settings, proving the existence of an equilibrium that optimizes the parties' objectives. Moreover, we develop performance gain estimation-based bargaining strategies for imperfect performance information scenarios and discuss potential security issues and solutions. Experiments on three real-world datasets demonstrate the effectiveness of the proposed bargaining model.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Efficient Leave-one-out Approximation in LLM Multi-agent Debate Based on Introspection

    cs.MA 2025-05 reject novelty 6.0 of 10

    IntrospecLOO uses a single extra prompting round to approximate leave-one-out contribution in LLM debates, but the empirical evidence is weak and one case study contradicts the method's claimed behavior.

Pith tools