{"paper_id":"2410.14839","title":"Multi-Task Dynamic Pricing in Credit Market with Contextual Information","authors":["Adel Javanmard","Jingwei Ji","Renyuan Xu"],"paper_date":"2024-10-18","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2410.14839","page_url":"https://thequant.space/flowcharts/multi-task-dynamic-pricing-in-credit-market-with-contextual-information/","scores":{"empirical_rigor":7,"math_complexity":8,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes the Two-Stage Multi-Task (TSMT) algorithm for dynamic pricing of many credit securities, leveraging shared structure across tasks.","quote":"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.","summary":"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…","strategy":"Two-Stage Multi-Task (TSMT)"},"assumptions":{"status":"available","items":[{"assumption":"The context covariance matrices Σj are uniformly bounded away from zero and infinity across securities.","type":"statistical","stated":"explicit","quote":"Assumption 3.1. Assume that there exist 0 < λ < λ such that λ < min j∈[M] λmin Σj ≤ max j∈[M] λmax Σj < λ."},{"assumption":"BCL yields are bounded above by a constant \\bar r and the function A_t(r) ≤ 0 for r < \\bar r.","type":"model","stated":"explicit","quote":"Assumption 3.2. There exists some ¯r > 0 such that for every t ∈[T], it holds that At(r) ≤0, ∀r < ¯r."},{"assumption":"The noise in the yield model is i.i.d. Gaussian with finite variance and satisfies a technical inequality (3.6).","type":"statistical","stated":"explicit","quote":"... (3.6) requires that the true σ in (2.2) lies in a confined range determined by bond primitives."},{"assumption":"There are no strategic interactions between the broker and competitors (exogeneity of competitor pricing).","type":"market","stated":"explicit","quote":"means there are no strategic interactions between us and other competitors."}]},"datasets":{"status":"available","items":[{"name":"TRACE transaction records","provider":"FINRA","kind":"market-prices","access":"commercial","period":null,"universe":null,"quote":"We construct the data set by combining transaction records from TRACE [42]..."},{"name":"OpenBond daily bond information","provider":"OpenBond","kind":"fundamentals","access":"public","period":null,"universe":null,"quote":"daily bond information from OpenBond [78]..."},{"name":"Mergent FISD contractual information","provider":"Mergent","kind":"fundamentals","access":"commercial","period":null,"universe":null,"quote":"contractual information from Mergent FISD [72]..."},{"name":"FRED interest-rate data","provider":"Federal Reserve Economic Data","kind":"macro","access":"public","period":null,"universe":null,"quote":"interest-rate data from FRED [40]...","known_id":"fred"}],"known":[{"id":"fred","name":"FRED","provider":"Federal Reserve Bank of St. Louis","kind":"macro","access":"public","quote":"We construct the data set by combining transaction records from TRACE [42], daily bond information from OpenBond [78], contractual information from Mergent FISD [72], and interest-rate data from FRED [40].","mentions":4,"used_in":1}],"sample":{"start":null,"end":null,"market":"U.S. corporate bonds","asset_class":"fixed-income","frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_extracted","modeled":"unclear","headline_net_of_costs":null,"detail":null,"quote":null,"source":"none","rule":"R0","candidates":{"front_matter":"unclear","evidence_card":"unclear","evidence_card_quoted":false},"meaning":"the classifier was not confident"},"results":{"status":"available","evaluation_type":"pricing-calibration","findings":[{"finding":"TSMT achieves a regret bound of \\tilde O(δ_max \\sqrt{T M d} + M d), improving over individual and pooled baselines.","kind":"theoretical","quote":"We show that the TSMT achieves a regret bounded by \\tilde{O} ( δ_{max} \\sqrt{T M d} + M d ) , outperforming both fully individual and fully pooled baselines..."},{"finding":"In the 2024 evaluation, TSMT reduces realized accumulated regret by 32.5% relative to pooling and 38.0% relative to individual estimation, and achieves the lowest MAE of 7.724 bps.","kind":"performance","quote":"TSMT reduces realized accumulated regret by 32.5% relative to pooling and by 38.0% relative to individual estimation"}],"reported_performance":{"strategy":"Two-Stage Multi-Task (TSMT)","sharpe":null,"sharpe_benchmark":null,"annual_return_pct":null,"total_return_pct":null,"max_drawdown_pct":null},"out_of_sample":{"method":"unclear","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":9,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":1,"extracted_at":"2026-11-14T17:58:19Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}