{"paper_id":"2510.24607","title":"Entropy-Guided Multiplicative Updates: KL Projections for Multi-Factor Target Exposures","authors":["Yimeng Qiu"],"paper_date":"2025-10-28","paper_type":"theoretical","paper_url":"https://arxiv.org/pdf/2510.24607v2","page_url":"https://thequant.space/flowcharts/entropy-guided-multiplicative-updates-kl-projections-for-mu/","scores":{"empirical_rigor":2,"math_complexity":9,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes Entropy-Guided Multiplicative Updates (EGMU), a convex optimization framework that constructs multi‑factor target‑exposure portfolios by minimizing Kullback‑Leibler divergence from a benchmark under linear factor constraints.","quote":"We introduce Entropy-Guided Multiplicative Updates (EGMU), a convex optimization framework for constructing multi-factor target-exposure portfolios by minimizing Kullback-Leibler divergence from a benchmark under linear factor constraints.","summary":"We introduce Entropy-Guided Multiplicative Updates (EGMU), a convex optimization framework for constructing multi-factor target-exposure portfolios by minimizing Kullback-Leibler divergence from a benchmark under linear factor constraints. We establish feasibility and uniqueness of strictly…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The benchmark distribution is strictly positive and the target exposures lie in the convex hull of the factor exposures.","type":"model","stated":"explicit","quote":"We establish feasibility and uniqueness of strictly positive solutions when the benchmark and targets satisfy convex-hull conditions. (i) We formalize feasibility and uniqueness: with strictly positive benchmark and feasible targets in the convex hull of exposures, the solution is unique and strictly positive.","support":"full"},{"assumption":"Feasibility of the linear constraints implies a convex polytope (or half‑space) for the weights.","type":"model","stated":"explicit","quote":"If t ∈relint conv(X) and bi > 0, the KL objective is essentially smooth and strictly convex on the relative interior of the simplex, so the unique minimizer satisfies w⋆ i > 0 by standard 8 Lagrange multiplier/KKT arguments. With inequalities Aw ≤c, feasibility is a convex polytope; infeasibility admits a Farkas certificate (see, e.g., 4, Ch.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"Feasibility and uniqueness of a strictly positive solution are established when the benchmark and targets satisfy convex‑hull conditions.","kind":"theoretical","quote":"We establish feasibility and uniqueness of strictly positive solutions when the benchmark and targets satisfy convex-hull conditions.","support":"full"},{"finding":"A dual concave formulation is derived with explicit gradient, Hessian, and sensitivity expressions.","kind":"theoretical","quote":"We derive the dual concave formulation with explicit gradient, Hessian, and sensitivity expressions, and provide two provably convergent solvers: a damped dual Newton method with global convergence and local quadratic rate, and a KL-projection scheme based on iterative proportional fitting and Bregman-Dykstra projections. (ii) We derive the dual concave program with gradient t −Ew(θ)[x] and Hessian −Covw(θ)(x), and","support":"full"},{"finding":"Two provably convergent solvers are provided: a damped dual Newton method with global convergence and local quadratic rate, and a KL‑projection scheme based on iterative proportional fitting and Bregman‑Dykstra projections.","kind":"theoretical","quote":"We derive the dual concave formulation with explicit gradient, Hessian, and sensitivity expressions, and provide two provably convergent solvers: a damped dual Newton method with global convergence and local quadratic rate, and a KL-projection scheme based on iterative proportional fitting and Bregman-Dykstra projections. (iii) We present two provably convergent solvers: a damped dual Newton method with global","support":"full"},{"finding":"The framework is generalized to elastic targets and robust target sets, and a path‑following ODE is introduced for tracing solution trajectories.","kind":"theoretical","quote":"We further generalize EGMU to handle elastic targets and robust target sets, and introduce a path-following ordinary differential equation for tracing solution trajectories. (iv) We further generalize EGMU with elastic targets (strongly concave dual) and robust target sets (support-function dual), and introduce a path-following ODE for solution trajectories, all reusing the same dual-moment structure and solved via","support":"full"},{"finding":"Implementation notes ensure stability and scalability via LogSumExp stabilization, covariance regularization, and half‑space KL projections.","kind":"theoretical","quote":"Stable and scalable implementations are provided using LogSumExp stabilization, covariance regularization, and half-space KL projections. 6 Implementation Notes (Stability and Scaling) • Stability: always use LogSumExp for partition functions; center exposures to reduce conditioning; add small ridge δI when Σ is nearly singular. • Elastic targets (R1): the I/λsoft term improves conditioning and ensures strong","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":19,"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":2,"extracted_at":"2026-11-14T19:46:36Z"},"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/"}