A novel online weighted aggregation mechanism for truthful preference feedback in mobile crowdsourcing achieves sublinear regret O(sqrt(T)) and truthfulness in a dynamic Bayesian game, with an extension for limited feedback per slot.
Efficient online learning with memory via frank-wolfe optimization: Algorithms with bounded dynamic regret and applications to control,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Truthful Online Preference Aggregation for LLM Fine-Tuning in Mobile Crowdsourcing
A novel online weighted aggregation mechanism for truthful preference feedback in mobile crowdsourcing achieves sublinear regret O(sqrt(T)) and truthfulness in a dynamic Bayesian game, with an extension for limited feedback per slot.