Multi-Task Dynamic Pricing in Credit Market with Contextual Information
Not on the map. Why?
Abstract (arXiv)
We study the dynamic pricing problem faced by a broker seeking to learn prices for a large number of credit market securities, such as corporate bonds, government bonds, loans, and other credit-related securities. A major challenge in pricing these securities stems from their infrequent trading and the lack of transparency in over-the-counter (OTC) markets, which leads to insufficient data for individual pricing. Nevertheless, many securities share structural similarities that can be exploited. Moreover, brokers often place small "probing" orders to infer competitors' pricing behavior. Leveraging these insights, we propose a multi-task dynamic pricing framework that leverages the shared structure across securities to enhance pricing accuracy. In the OTC market, a broker wins a quote by offering a more competitive price than rivals. The broker's goal is to learn winning prices while minimizing expected regret against a clairvoyant benchmark. We model each security using a d-dimensional feature vector and assume a linear contextual model for the competitor's pricing of the yield, with parameters unknown a priori. We propose the Two-Stage Multi-Task (TSMT) algorithm: first, an unregularized MLE over pooled data to obtain a coarse parameter estimate; second, a regularized MLE on individual securities to refine the parameters. We show that the TSMT achieves a regret bounded by tildeO ( δmax √T M d + M d ) , outperforming both fully individual and fully pooled baselines, where M is the number of securities and δmax quantifies their heterogeneity. Finally, our empirical experiment on U.S. corporate bonds shows promising performance of our TSMT algorithm and supports the theoretical findings.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 98 references that are in the map. First posted on arXiv 18 Oct 2024.
Builds on
22 of 98 references.
References · 22
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2020Gradient Surgery for Multi-Task Learningcited by 1,210
- 2019A Comprehensive Survey on Transfer Learningcited by 1,154
- 2020Meta-Learning in Neural Networks: A Surveycited by 944
- 2019Online Meta-Learningcited by 137
- 2020Transfer Learning for High-dimensional Linear Regression: Prediction, Estimation, and Minimax Optimalitycited by 89
- 2021Meta-Thompson Samplingcited by 62
- 2021Policy Evaluation and Temporal-Difference Learning in Continuous Time and Space: A Martingale Approachcited by 62
- 2016Dynamic Pricing in High-dimensionscited by 55
- 2019Deep Learning in Asset Pricingcited by 41
- 2021How Fine-Tuning Allows for Effective Meta-Learningcited by 41
- 2022Adaptive and Robust Multi-Task Learningcited by 33
10 more
- 2016Dynamic Pricing with Demand Covariatescited by 30
- 2023Learning from Similar Linear Representations: Adaptivity, Minimaxity, and Robustnesscited by 27
- 2020Privacy-Preserving Dynamic Personalized Pricing with Demand Learningcited by 23
- 2022Robustness Implies Generalization via Data-Dependent Generalization Boundscited by 23
- 2017Perishability of Data: Dynamic Pricing under Varying-Coefficient Modelscited by 19
- 2022Robust angle-based transfer learning in high dimensionscited by 16
- 2024Sublinear Regret for a Class of Continuous-Time Linear-Quadratic Reinforcement Learning Problemscited by 10
- 2021Generalised correlated batched bandits via the ARC algorithm with application to dynamic pricingcited by 2
- 2024Reinforcement Learning for Corporate Bond Trading: A Sell Side Perspectivecited by 1
- 2024Dynamic Pricing in Securities Lending Market: Application in Revenue Optimization for an Agent Lender Portfoliocited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.