Paper: arXiv 2510.24607

Authors: Yimeng Qiu

Abstract

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 positive solutions when the benchmark and targets satisfy convex-hull conditions. 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. We further generalize EGMU to handle elastic targets and robust target sets, and introduce a path-following ordinary differential equation for tracing solution trajectories. Stable and scalable implementations are provided using LogSumExp stabilization, covariance regularization, and half-space KL projections. Our focus is on theory and reproducible algorithms; empirical benchmarking is optional.

Complexity vs Empirical Score

  • Math Complexity: 9.0/10
  • Empirical Rigor: 2.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper is dense with advanced mathematical derivations, including convex optimization, sensitivity analysis, and ODE-based path-following, while explicitly stating that empirical benchmarking is optional and providing only theoretical algorithms without real-world data or backtests.

Research Flowchart

  flowchart TD
  A["Research Goal: Construct multi-factor target-exposure portfolios"]
  B["Methodology: Entropy-Guided Multiplicative Updates EGMU Framework"]
  C["Input: Benchmark & Target Exposures"]
  D["Solver 1: Damped Dual Newton Method"]
  E["Solver 2: Bregman-Dykstra KL Projections"]
  F["Generalization: Elastic Targets & Robust Sets"]
  G["Key Findings: Uniqueness, Convergence, Stability"]

  A --> B
  C --> B
  B --> D
  B --> E
  B --> F
  D & E & F --> G

Evidence Card

What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card

Proposes

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.

Source sentence
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.

Assumes 2

  • The benchmark distribution is strictly positive and the target exposures lie in the convex hull of the factor exposures. model
    Source sentence
    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.
  • Feasibility of the linear constraints implies a convex polytope (or half‑space) for the weights. model
    Source sentence
    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.

Data

No dataset named in the text.

Costs

Not applicable The paper reports no trading or execution result.

Finds 5

  • Feasibility and uniqueness of a strictly positive solution are established when the benchmark and targets satisfy convex‑hull conditions. theoretical
    Source sentence
    We establish feasibility and uniqueness of strictly positive solutions when the benchmark and targets satisfy convex-hull conditions.
  • A dual concave formulation is derived with explicit gradient, Hessian, and sensitivity expressions. theoretical
    Source sentence
    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
  • 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. theoretical
    Source sentence
    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
  • The framework is generalized to elastic targets and robust target sets, and a path‑following ODE is introduced for tracing solution trajectories. theoretical
    Source sentence
    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
  • Implementation notes ensure stability and scalability via LogSumExp stabilization, covariance regularization, and half‑space KL projections. theoretical
    Source sentence
    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

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 19 related papers). Coverage is partial, so this is neither replication nor refutation.

Code

No repository by the authors found in the paper.

Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.

Cited References (9)

  1. Convex Optimization (2004)
  2. Elements of Information Theory (2006)
  3. I-divergence geometry of probability distributions and minimization problems (1975)
  4. Generalized iterative scaling for log-linear models (1972)
  5. Dykstra’s algorithm with Bregman projections: A convergence proof (2000)
  6. Graphical models, exponential families, and variational inference (2008)
  7. Fully flexible views: Theory and practice (2008)
  8. A Course in Convexity (2002)
and 1 more
  1. Convex Analysis and Monotone Operator Theory in Hilbert Spaces (2011)

0 of 9 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.