May 07, 2025
This paper introduces a novel approach to contextual stochastic optimization, integrating operations research and machine learning to address decision-making under uncertainty. Traditional methods often fail to leverage contextual information, which underscores the necessity for new algorithms. In this study, we utilize neural networks with combinatorial optimization layers to encode policies. Our goal is to minimize the empirical cost, which is estimated from past data on uncertain parameters and contexts. To that end, we present a surrogate learning problem and a generic primal-dual algorithm that is applicable to various combinatorial settings in stochastic optimization. Our approach extends classic Fenchel–Young loss results and introduces a new regularization method using sparse perturbations on the distribution simplex. This allows for tractable updates in the original space and can accommodate diverse objective functions. We establish sublinear convergence for the exact linear-parametric version and provide a bound on the non-optimality of the resulting policy in terms of the empirical cost. Experiments on three contextual stochastic optimization problems show that our algorithm is efficient and scalable, achieving performance comparable to state-of-the-art baselines with significantly reduced computational requirements.
Keywords: contextual stochastic combinatorial optimization, empirical cost minimization, neural networks with combinatorial optimization layers, alternating minimization, Fenchel–Young loss
Consider a decision maker whose choice is affected by some random noise \(\boldsymbol{\xi}\in \Xi\). The decision maker does not know \(\boldsymbol{\xi}\) when he takes his decision, but has access to a realization \(x\) of a context variable \(\mathbf{x}\) correlated to \(\boldsymbol{\xi}\). The context space \(\mathcal{X}\) is the set of all possible context realizations. Based on a context realization \(x \in \mathcal{X}\), the decision maker takes a decision \(y\) in \(\mathcal{Y}(x)\). To that purpose, he chooses a policy \(\pi\) that maps a context realization \(x\) to a decision \(y \in \mathcal{Y}(x)\). We do not require the policy to be deterministic and can, therefore, see it as a conditional distribution \(\pi(y|x)\) over \(\mathcal{Y}(x)\) given \(x\). Assuming that the policy \(\pi\) has to belong to some hypothesis class \(\mathcal{H}\), our contextual stochastic optimization problem [1] aims at finding a policy \(\pi\) that minimizes the expected cost \(\mathcal{R}\), which is the expected cost under \(\pi\). \[\label{eq:contextualStochasticOptimization} \min_{\pi \in \mathcal{H}} \mathcal{R}(\pi) \quad \text{where} \quad \mathcal{R}(\pi) = \mathbb{E}_{(\mathbf{x}, \boldsymbol{\xi}), \mathbf{y}\sim \pi(\cdot|\mathbf{x})}\big[c(\mathbf{x}, \mathbf{y},\boldsymbol{\xi})\big].\tag{1}\]
The expectation is taken with respect to the distribution over \((\mathbf{x},\mathbf{y},\boldsymbol{\xi})\) that derives from the joint distribution over \((\mathbf{x},\boldsymbol{\xi})\) and the policy \(\pi\). Since the decision maker does not have access to \(\boldsymbol{\xi}\), the decision \(\mathbf{y}\) is independent of \(\boldsymbol{\xi}\) given the context \(\mathbf{x}\). In many situations, the noise \(\xi\) is observed once the decision has been taken, and the training set comes from historical data; we thus place ourselves in a learning setting.
Assumption 1. We do not know the joint distribution over \((\mathbf{x},\boldsymbol{\xi})\). But we have access to a training set \((x_1,\xi_1),\ldots,(x_N, \xi_N)\) of independent samples of \((\mathbf{x},\boldsymbol{\xi})\).
In this work, we focus on the combinatorial case where, for any context realization \(x \in \mathcal{X}\), the set of admissible decisions \(\mathcal{Y}(x)\) is finite but potentially combinatorially large, as formalized in the following assumption that holds throughout the paper.
Assumption 2. For every possible context \(x\), the set of admissible decisions \({\mathcal{Y}(x)\subset \mathbb{R}^{d(x)}}\) is finite. Further, we assume that \(\mathcal{Y}(x)\) is the set of extreme points of its convex envelope \(\mathcal{C}(x)= \mathop{\mathrm{conv}}\left(\mathcal{Y}(x)\right)\).
As \(\mathcal{Y}(x)\) is the set of extreme points of a polytope, for any \(\bar y\) in \(\mathcal{Y}(x)\), there exists a \(\theta \in \mathbb{R}^{d(x)}\) such that \(\bar y\) is the unique argmax of \(\max_{y\in \mathcal{Y}(x)}\langle\theta | y\rangle\), which allows us to build policies based on linear optimizers. Assumption 2 may seem restrictive at first glance, but the class of problems satisfying the conditions is actually very large. In particular, it includes all 0-1 optimization problems, which are ubiquitous in mathematical programming applications. We also emphasize that the set of feasible decisions \(\mathcal{Y}(x)\) is context-dependent, a feature that few contextual stochastic methods can handle.
For a stochastic optimization approach, one would typically build a policy \(\pi\) by solving the stochastic optimization problem that arises by taking the conditional expectation over \(\boldsymbol{\xi}\) given \(\mathbf{x}= x\). \[\label{eq:conditionalSto} \min_{y \in \mathcal{Y}(x)}\mathbb{E}_{\boldsymbol{\xi}}\big[c(\mathbf{x}, y,\boldsymbol{\xi})\big| \mathbf{x}= x\big].\tag{2}\] Practical approaches typically solve a sample average approximation of Equation 2 . Decomposition-coordination methods such as progressive hedging [2] solve thousands of instances of a deterministic (single scenario) problem of the form \[\label{eq:DeterministicProblem} \min_{y\in \mathcal{Y}(x)} c\big(x(\omega) , y,\xi(\omega)\big) + \langle \theta| y \rangle,\tag{3}\] where \(\theta\) is a dual vector, such as a vector of Lagrange multipliers. Our combinatorial and large dimensional setting in \(\mathbb{R}^{d(x)}\) brings two challenges. First, we do not know the distribution over \((\mathbf{x},\boldsymbol{\xi})\). We may learn a model, but large dimensional \(\mathbf{x}\) and \(\boldsymbol{\xi}\) require a large training set, which we do not always have in industrial settings. Second, the computational burden required by such algorithms becomes significant and prevents them from being applied online in a contextual setting, where the computing time is limited.
We therefore propose a change of paradigm. We instead define a hypothesis class \(\mathcal{H}_\mathcal{W}\) of policies \(\pi_w\) parameterized by \(w\) in \(\mathcal{W}\). Policies in \(\mathcal{H}_\mathcal{W}\) are chosen to be fast enough to be used online.
Working with a combinatorial solution space \(\mathcal{Y}(x)\) makes the choice of \(\pi\) challenging. Indeed, there are few statistically relevant, while computationally tractable, models from a combinatorial set to another. We rely on a combinatorial optimization (CO) layer to build such policies. We build upon recent contributions [3]–[6] that derive from the following regularized linear optimization problem \[\label{eq:COlayer} \max_{y \in \mathcal{C}(x)} \langle \theta| y \rangle - \Omega_{\mathcal{C}(x)}(y),\tag{4}\] a conditional distribution \(p_{\Omega_{\mathcal{C}(x)}}(\cdot|\theta)\) on \(\mathcal{Y}(x)\) (see Section 2.1), where \({\mathcal{C}(x)=\mathop{\mathrm{conv}}(\mathcal{Y}(x))}\). Here, \({\Omega_{\mathcal{C}(x)} : \mathop{\mathrm{dom}}(\Omega_{\mathcal{C}(x)}) \rightarrow \mathbb{R}}\) is a proper convex lower-semicontinuous regularization function, with \({\mathcal{C}(x) \subseteq \mathop{\mathrm{cl}}\big(\mathop{\mathrm{dom}}(\Omega_{\mathcal{C}(x)})\big)}\). The simplest such regularization is \(\Omega_{\mathcal{C}(x)} = 0\), in which case we obtain a Dirac on the \(\mathop{\mathrm{argmax}}\) (if unique). This model is parameterized by \(\theta\), the direction of the linear term. In our policies, we use a statistical model \(\varphi_w\), typically a neural network parameterized by \(w \in \mathcal{W}\subseteq \mathbb{R}^{n_w}\) to predict \(\theta\) from the context \(x\). In other words, we seek policies in the hypothesis class \[\label{eq:dl95policy} \mathcal{H}_{\mathcal{W}} = \Big\{\pi_w\colon w \in \mathcal{W}\Big\} \quad \text{where} \quad \pi_w(y|x) = p_{\Omega_{\mathcal{C}(x)}}\big(y|\varphi_w(x)\big),\tag{5}\] where \(\varphi_w : x \in \mathcal{X}\mapsto \theta \in \mathbb{R}^{d(x)}\) is a statistical model.
For such policies to work, we need a learning algorithm that leverages the training set to find a policy \(\pi_w\) in \(\mathcal{H}_\mathcal{W}\) with a low expected cost \(\mathcal{R}(\pi_w)\). Practically we solve the empirical cost minimization problem, \[\label{eq:Empiricalrisk} \min_{w \in \mathcal{W}} R_N( \pi_w) \quad \text{where} \quad R_N(\pi_w):= \frac{1}{N}\sum_{i=1}^N \mathbb{E}_{\mathbf{y}\sim \pi_w(\cdot|x_i)}\Big[c(x_i, \mathbf{y}, \xi_i)\Big].\tag{6}\]
which is just the empirical version on the training set of 2 where we restrict ourselves to policies in \(\mathcal{H}_{\mathcal{W}}\). For several regularization functions \(\Omega\), stochastic gradients can be computed, and the problem 6 is amenable to stochastic gradient descent. However, the results obtained tend to be poor as first the gradient estimates are noisy and the objective non-convex [5]. To that purpose, we introduce a surrogate problem that approximates 6 and for which we can derive a better behaved minimization algorithm. This algorithm relies on the following assumption—which is common in (contextual) stochastic optimization—to derive a tractable alternating minimization algorithm.
Assumption 3. We suppose having a reasonably efficient algorithm to solve the deterministic single scenario problem 3 .
Before introducing our algorithm, let us first focus on the main approach in the literature to train policies 5 : supervised learning. This will both motivate the use of empirical cost minimization and allow us to introduce a mathematical tool needed to define our surrogate.
Supervised learning requires a training set \((x_1,\bar y_1),\ldots,(x_N,\bar y_N)\) with a target decision \(\bar y_i\) to imitate, and minimizes the expectation of a loss \(\mathcal{L}\) that evaluates how far the prediction \(\pi_w(x_i)\) is from the target \(\bar y_i\). If using a standard loss such as the squared Euclidean distance, stochastic gradient descent on the supervised learning problem typically suffers from the same non-convexity and noisy gradients. Several losses have been proposed to address these issues, including Fenchel–Young losses.
Given a regularization function \(\Omega : \mathbb{R}^d \rightarrow \mathbb{R}\cup\{+\infty\}\), the Fenchel–Young loss \(\mathcal{L}_\Omega(\theta;\bar y)\) generated by \(\Omega\) [3] is defined over \(\mathop{\mathrm{dom}}(\Omega^*) \times \mathop{\mathrm{dom}}(\Omega)\) as \[\begin{align} \label{eq:FYloss95def} \mathcal{L}_\Omega(\theta;\bar y) &:= \Omega^*(\theta) + \Omega(\bar y) - \langle \theta| \bar y \rangle \nonumber\\ &= \sup_{y \in \mathop{\mathrm{dom}}(\Omega)}\big(\langle \theta | y \rangle - \Omega(y)\big) - \big(\langle \theta | \bar y \rangle - \Omega(\bar y)\big). \end{align}\tag{7}\] It measures the difference between the solution \(y_\theta\) of Equation 4 and a target \(\bar y \in \mathcal{Y}(x) \subset \mathop{\mathrm{dom}}(\Omega)\), as the non-optimality of the target for this problem. Such a loss is typically convex in \(\theta\), nonnegative, and equal to \(0\) if and only if \(p_{\Omega}(\cdot|\theta)\) is a Dirac in \(\bar y\). Note that \(\mathcal{L}_\Omega(\theta;\bar y)\) is the gap in the Fenchel–Young inequality of convex analysis. During the last few years, they have become the main approach for supervised training of policies of the form 5 as they lead to a tractable (with low variance pathwise gradient estimates) and convex learning problem. Under some hypotheses, they happen to coincide with Bregman divergences and are a key element in our expected cost minimization algorithm.
In our contextual setting, we may lack good targets \(\bar y_i\) to imitate. One natural approach under Assumption 3 is to use our deterministic oracle to get an anticipative decision \(\bar y_i \in \mathop{\mathrm{argmin}}_{y \in \mathcal{Y}(x_i)}c(x_i,y,\xi_i)\). While the approach has been successful on some problems [7], it is well known in stochastic optimization that such decisions can be arbitrarily far from the best non-anticipative decisions. Our goal is to provide a better learning approach based on empirical cost minimization for such problems.
We now have all the tools to introduce our surrogate problem to Problem 6 \[\mathcal{S}\big(w,y_{\otimes}\big) = \frac{1}{N} \sum_{i=1}^N c(x_i,y_i,\xi_i) + \kappa \mathcal{L}_\Omega(\theta_i,y_i), \quad \text{with} \quad \begin{cases} \theta_i = \varphi_w(x_i), \\ y_\otimes= (y_i)_{i \in [N]} \in \mathcal{Y}_\otimes, \end{cases}\] where \([N]\) denotes the set \(\{1, \ldots, N\}\), \(\kappa > 0\) is a positive constant, and \(\mathcal{L}\) is a Fenchel–Young loss and \[\mathcal{Y}_\otimes=\Big\{(y_i)_{i \in [N]}\colon y_i \in \mathcal{Y}(x_i) \text{ for each }i\Big\}.\] When \(\kappa \rightarrow \infty\), minimizing over \(y_\otimes\) leads to taking \(y_i = \mathop{\mathrm{argmax}}\langle \theta_i,y_i\rangle\), and we fall back on our empirical cost minimization problem 6 . When \(\kappa\) is finite, we get a relaxation whose error to \(\mathcal{R}(w)\) is in \(\frac{1}{\kappa}\).
Our learning algorithm minimizes \(\mathcal{S}\big(w,y_{\otimes}\big)\) using alternating minimization. \[\begin{align} y_{\otimes}^{(t+1)}&= \mathop{\mathrm{argmin}}_{y_{\otimes}} \mathcal{S}(w^{(t)},y_{\otimes}), && \text{(Decomposition)}, \tag{8} \\ w^{(t+1)} &\in \mathop{\mathrm{argmin}}_{w \in \mathcal{W}} \mathcal{S}(w,y_{\otimes}^{(t+1)}), && \text{(Coordination)}, \tag{9} \end{align}\] where \(y_{\otimes}^{(t+1)}= (y_i^{(t+1)})_{i \in [N]}\). In 8 , we do not ask that \(y_{\otimes}\) belongs to \(\mathcal{Y}_\otimes\) as we optimize in practice on a continuous space that contains \(\mathcal{Y}_\otimes\). Indeed, to make this algorithm practical on combinatorial spaces, we need to work on the space of distribution over \(\mathcal{Y}(x_i)\), which requires some technical preliminaries. We therefore postpone the precise definition to Section 2. Suffice it to say at this point that Step 8 decomposes per scenario and requires solving deterministic single-scenario problems of the form 3 , and that the coordination step 9 amounts to a supervised learning problem with a Fenchel–Young loss, for which efficient algorithms exist.
Our approach can be related to the proximal point algorithm (PPA), a classical method for finding zeros of maximal monotone operators popularized by the seminal work of [8]. [9] extended the PPA by replacing the Euclidean distance penalty with a Bregman divergence, giving rise to the Bregman PPA, and later refined this framework to allow inexact subproblems and double regularization [10]. More recently, [11] established convergence of the (Bregman) PPA even in the presence of computational errors at each iteration, a setting close to ours since our coordination step is itself solved only approximately by SGD, and [12] combined the Bregman PPA with operator splitting to handle composite objectives, in the same spirit as our decomposition-coordination scheme. We make this connection precise in Section 2.
We also rely on alternating minimization algorithms for Equations 8 9 , where a two-variable function \(\phi : (y,z) \mapsto \phi(y,z)\) is iteratively minimized along one of its coordinates while the other is fixed. The convergence of such algorithms is not a new topic, but the wide range of applications in machine learning and signal processing leads to a revived interest in the recent years [13]. [14] were the first to prove a sublinear rate of convergence in a Euclidean setting when \(\phi\) is assumed convex and L-smooth. In the present case, our function \(\phi\) is neither convex nor L-smooth. A more general setting, without any structural assumption on \(Y\), \(Z\) nor \(\phi\) is studied by [15]. They proved the convergence of the alternating minimization algorithm when \(\phi\) satisfies the five-point property, that is a non-local inequality involving \(\phi\) evaluated at different points.
Alternative proof strategies have been developed based on abstract convergence theorems [16]. In this work, the authors only assume a function to optimize, and a sequence generated by a descent algorithm, without any assumption on the algorithm used to generate the sequence. [16] prove the convergence of the sequence toward a critical point with finite length, provided that i. the sequence follows some descent properties, and ii. the function satisfies the so called Kurdyka–Łojasiewicz (KL) property, which ensures its variations are tame in the neighborhoods of critical points. We leverage this literature in Appendix 8.
Our main contribution is to introduce an alternating minimization algorithm for contextual stochastic combinatorial optimization, which has several nice properties.
This algorithm relies on sampling, stochastic gradient descent, and automatic differentiation to update a model \(\varphi_w\), and is therefore deep learning-compatible.
It is generic, and can be applied to any setting where assumptions 1-3 hold. It notably provides a generic algorithm to train policies based on neural networks with combinatorial optimization layers for contextual stochastic optimization problems. This notably allows us to deal with problems where the set of feasible solutions \(\mathcal{Y}(x)\), and even its dimension, depend on \(x\), which is a known difficulty for most contextual stochastic optimization methods in the literature.
We bound the difference between the empirical cost of the solution to the surrogate problem and the optimum of the empirical cost, and thus the non-optimality of the policy returned for the initial problem. When \(\varphi_w\) is linear in \(w\), we prove the convergence of the exact alternating scheme to a stationary point of the surrogate problem, as well as a convergence speed. Reformulating this exact scheme as the proximal point algorithm, we identify when it converges to a global optimum and when it might end-up in a local minimum due to non-convexity.
Our numerical experiments, using an approximate algorithm, on three different applications show that our algorithm is practically efficient and scalable in the size of the statistical model \(\varphi_w\), the size \(N\) of the training set, and the dimension of the combinatorial optimization problem. The limiting factor is the size of the deterministic instances that can be solved in Equation 3 . In particular, while its strength is to scale to large-dimensional, context-dependent sets \(\mathcal{Y}(x)\), it reaches the performance of state-of-the-art baselines in contextual stochastic optimization on problems whose size is compatible with those baselines, while being orders of magnitude faster.
The key challenge we face in defining practical versions of these algorithms is to develop tractable regularizations on non-full-dimensional polytopes \(\mathcal{C}(x)\) and on the distribution simplex over \(\mathcal{Y}(x)\). These have practical relevance for supervised learning with Fenchel–Young losses beyond our method.
Based on the work of [4], we introduce a new sparse regularization by perturbation on the distribution simplex over \(\mathcal{Y}(x)\). This new regularization is perhaps the key element to obtain a tractable and generic learning algorithm for large combinatorial problems.
We show that structured supervised learning with a Fenchel–Young loss using a generalized linear model can be seen as directly minimizing a single Fenchel–Young loss on the parameter space. Hence, only the projection of the imitated decisions onto the feature space matters.
We highlight several results on Fenchel–Young losses [3] on non-full-dimensional polytopes \(\mathcal{C}(x)\), and on the distribution simplex over \(\mathcal{Y}(x)\). We analyze their links with Legendre-type functions, mirror maps and regularizers.
The remainder of the paper is organized as follows. Section 2 presents the primal-dual algorithm and its properties, including tractability, a bound on the surrogate error, and a convergence analysis; proofs of the convergence results are gathered in Appendix 8. Section 3 introduces two new theoretical contributions: a sparse perturbation directly on the distribution space \(\Delta^{\mathcal{Y}}\) (Section 3.1), and a characterisation of the geometry induced by aggregating Fenchel–Young losses (Section 3.2); their proofs are in Appendices 7.1 and 7.3, respectively. Section 4 details numerical experiments and Section 5 concludes. Appendix [sec:regularization95on95distributions] gathers the background on regularization on non-full-dimensional spaces used throughout the paper.
We denote by \(\mathbb{R}\) the set of real numbers, and by \(\mathbb{R}_{++}\) the set of positive real numbers. Let \(E\) be an Euclidean space, and \(\mathcal{X}\subset E\) be a set. We denote by \(\mathop{\mathrm{span}}(\mathcal{X})\) the span of \(\mathcal{X}\), \(\mathop{\mathrm{aff}}(\mathcal{X})\) its affine hull, \(\mathop{\mathrm{int}}(\mathcal{X})\) its interior, \(\mathop{\mathrm{cl}}(\mathcal{X})\) its closure, \(\mathop{\mathrm{bdry}}(\mathcal{X})\) its boundary, and \(\mathop{\mathrm{rel\,int}}(\mathcal{X})\) its relative interior. We introduce \(\mathbb{I}_\mathcal{X}\) the indicator function of the set \(\mathcal{X}\), with value \(0\) over \(\mathcal{X}\) and \(+\infty\) elsewhere. For two sets \(\mathcal{X}_1\) and \(\mathcal{X}_2\), we denote by \(\mathcal{X}_1 \times \mathcal{X}_2\) their Cartesian product space, and \(\mathcal{X}_1+\mathcal{X}_2\) their Minkowski sum. In addition, when \(\mathcal{X}_1\) and \(\mathcal{X}_2\) are vector subspaces of \(E\), with \(\mathcal{X}_1 \cap \mathcal{X}_2 = \{0\}\), we have a direct sum written as \(\mathcal{X}_1 \oplus \mathcal{X}_2\). We extend this notation to \(S_1 \oplus S_2\) to denote \(\big\{s_1+s_2\colon s_1\in S_1,\,s_2 \in S_2\}\) given two subsets \(S_1\) and \(S_2\) of \(E\) (not necessarily vector spaces) such that \(\langle s_1| s_2 \rangle =0\) for any \(s_1 \in S_1\) and \(s_2\in S_2\). By default \(\|\cdot\|\) is the euclidean norm.
For \(E\) an Euclidean space with inner product \(\langle \cdot | \cdot \rangle\) and associated norm \(||\cdot ||\), we denote by \(\Gamma_0(E)\) the set of proper lower-semicontinuous (l.s.c.) convex functions from \(E\) to \((-\infty, + \infty]\). For a function \(\Psi \in \Gamma_0(E)\), we denote by \(\mathop{\mathrm{dom}}(\Psi)\) the domain of \(\Psi\), by \(\mathop{\mathrm{argmin}}\Psi\) and \(\mathop{\mathrm{argmax}}\Psi\) the sets of global minimizers and maximizers of \(\Psi\) (possibly empty), by \(\Psi^*:E \to (-\infty, +\infty]\) its Fenchel-conjugate function, \(\Psi^*:y\mapsto \sup_{x \in E} \{\langle x| y \rangle - \Psi(x)\}\), and by \(\partial \Psi\) its subdifferential, \(\partial \Psi: x\mapsto \{g \in E \, | \, \forall y \in E, \langle y-x| g \rangle + \Psi(x) \leq \Psi(y) \}\).
Given \(x \in E\), the mapping \(\Psi\) is subdifferentiable at \(x\) if \(\partial \Psi(x) \neq \emptyset\); the elements of \(\partial \Psi(x)\) are the subgradients of \(\Psi\) at \(x\). If \(\Psi\) is differentiable at \(x\), we name \(\nabla \Psi(x)\) the gradient of \(\Psi\) at \(x\).
For a continuously differentiable strictly convex function \(F:E\mapsto \bar \mathbb{R}\) with closed domain, we denote by \(D_F\) the Bregman divergence associated with \(F\), defined as \(D_F(x,y) = F(x) - F(y) - \langle \nabla F(y)| x-y\rangle\) for \(x,y \in \mathop{\mathrm{dom}}(F)\).
Let \(\mathcal{Y}\) be a finite combinatorial set in \(\mathbb{R}^d\), and \({\mathcal{C}= \mathop{\mathrm{conv}}(\mathcal{Y})}\) be its convex hull. We sometimes refer to \(\mathcal{C}\) as the moment polytope. As stated above, we assume that no element of \(\mathcal{Y}\) is a strict convex combination of other elements of \(\mathcal{Y}\). In other words, \(\mathcal{Y}\) is the set of vertices of the polytope \(\mathcal{C}\). We denote by \(H = \mathop{\mathrm{aff}}(\mathcal{Y})\) the affine hull of \(\mathcal{Y}\), and by \(V\) the direction of \(H\), a sub-vector space in \(\mathbb{R}^d\). We have the orthogonal sum \(\mathbb{R}^d = V \oplus V^\perp\), and we denote by \(\Pi_V\) the orthogonal projection onto \(V\) in \(\mathbb{R}^d\). We name \(Y\) the wide matrix with vectors \(y \in \mathcal{Y}\) as columns.
Let \(\Delta^{\mathcal{Y}} := \{q \in \mathbb{R}^{\mathcal{Y}}, q \geq 0, \sum_{y \in \mathcal{Y}} q_y = 1\}\) be the probability simplex whose vertices are indexed by \(\mathcal{Y}\), and \(H_{\Delta}\) its affine hull \(H_{\Delta} = \mathop{\mathrm{aff}}(\Delta^{\mathcal{Y}})\). We denote by \(V_{\Delta}\) the vector subspace (hyperplane) in \(\mathbb{R}^{\mathcal{Y}}\) that is the direction of \(H_{\Delta}\). As previously, we rely on the orthogonal sum \(\mathbb{R}^{\mathcal{Y}} = V_\Delta \oplus V_\Delta^\perp\), where here \(V_\Delta^\perp = \mathop{\mathrm{span}}(\mathbf{1})\). Let \(\theta \in \mathbb{R}^d\) be a cost vector and \(q \in \Delta^{\mathcal{Y}}\) be a probability distribution, then \(s_\theta = Y^\top \theta \in \mathbb{R}^{\mathcal{Y}}\) is the vector \((y^\top \theta)_{y \in \mathcal{Y}}\), and \(\mu_q = Yq = \sum_y q_y y = \mathbb{E}(\mathbf{y}|q)\) is the moment vector of the random variable \(\mathbf{y}\) on \(\mathcal{Y}\) with distribution \(q\).
This section presents the main results of the paper on learning structured policies for contextual stochastic combinatorial optimization. Section 2.1 defines the policy class \(\pi_w\) and the empirical cost minimization problem. Section 2.2 introduces a tractable surrogate problem and bounds the error incurred by optimizing it in place of the empirical cost. Section 2.3 presents the alternating minimization algorithm and establishes its tractability via a moment-space reformulation. Section 2.4 analyzes convergence of the algorithm when \(\varphi_w\) is linear in \(w\); the supporting proofs are gathered in Appendix 8.
Let us now formally introduce our policies \(\pi_w\), which are based on Legendre-type functions on the probability simplex \(\Delta^{\mathcal{Y}(x)}\) over \(\mathcal{Y}(x)\).
A function \({\Psi : \mathbb{R}^d \to \mathbb{R}\cup\{+\infty\}}\) is Legendre-type if it is strictly convex on \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\) and essentially smooth, i.e., i) \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\) is non-empty; ii) \(\Psi\) is differentiable through \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\); iii) \({\lim_{\mu \to \mathop{\mathrm{bdry}}(\mathop{\mathrm{dom}}(\Psi))} ||\nabla \Psi(\mu)|| = + \infty}\).
Remark 1. Let \(\Psi \in \Gamma_0(\mathbb{R}^d)\) be a proper convex l.s.c. function with Fenchel conjugate \(\Psi^*\). Then \(\Psi\) is a convex function of Legendre type if and only if \(\Psi^*\) is a convex function of Legendre type. When these conditions hold, the gradient mapping \(\nabla \Psi\) is one-to-one from the open convex set \(\mathop{\mathrm{int}}\big(\mathop{\mathrm{dom}}(\Psi)\big)\) onto the open convex set \(\mathop{\mathrm{int}}\big(\mathop{\mathrm{dom}}(\Psi^*)\big)\), continuous in both directions, and \(\nabla \Psi^* = (\nabla \Psi)^{-1}.\) As a consequence, the gradient of Legendre-type functions can be used as one-to-one mapping from the primal to the dual space.
Recall that \(\Delta^\mathcal{Y}:=\{q\in[0,1]^\mathcal{Y}\;|\; \sum_{y\in\mathcal{Y}} q_y =1 \}\) is the distribution simplex over \(\mathcal{Y}\). Let \(\Omega_{\Delta^{\mathcal{Y}}}\) be a proper l.s.c. convex function with domain \(\Delta^\mathcal{Y}\) whose restriction to \(H_\Delta\) (the affine hull of \(\Delta^{\mathcal{Y}}\)) is Legendre-type. Then \[\nabla \Omega_{\Delta^\mathcal{Y}}^* : s \in \mathbb{R}^{\mathcal{Y}} \mapsto \mathop{\mathrm{argmax}}_{q \in \Delta^\mathcal{Y}}\{ s^\top q - \Omega_{\Delta^{\mathcal{Y}}}(q) \}\] maps any score vector \(s \in \mathbb{R}^{\mathcal{Y}}\) to a (unique) probability distribution over \(\mathcal{Y}\). We refer to Proposition 3 for Fenchel duality results that underpin this definition. We call \(\mathbb{R}^\mathcal{Y}\) the score space, which is nothing but the space of cost functions from \(\mathcal{Y}\) to \(\mathbb{R}\), but seen as vectors indexed by \(\mathcal{Y}\). Furthermore, the Fenchel–Young loss associated with such an \(\Omega_{\Delta^\mathcal{Y}}\) \[\mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}}}}(s,q) = \Omega_{\Delta^{\mathcal{Y}}}(q) + \Omega_{\Delta^{\mathcal{Y}}}^*(s) - \langle s | q \rangle\] quantifies how far distribution \(q \in \Delta^{\mathcal{Y}}\) is from \(\nabla\Omega_{\Delta^{\mathcal{Y}}}^*(s) \in \Delta^{\mathcal{Y}}\).
Example 1 (Negentropy Regularization). The most classic regularization \(\Omega_{\Delta^{\mathcal{Y}}}\) is arguably the negentropy \(\Omega_{\Delta^{\mathcal{Y}}}(q) = \sum_{y \in \mathcal{Y}}q_y \log(q_y) + \mathbb{I}_{\Delta^\mathcal{Y}}(q)\). In that case, \(\nabla \Omega^*_{\Delta^\mathcal{Y}}(s)\) maps the score \(s\) to its softmax, which is the exponential family on \(\mathcal{Y}\) parameterized by \(s\): \[\label{eq:exponentialFamily} \nabla \Omega^*_{\Delta^\mathcal{Y}}(s) = \big(e^{s_y- A_{\Delta^{\mathcal{Y}}}(s)}\big)_{y \in \mathcal{Y}}\quad \text{where}\quad A_{\Delta^{\mathcal{Y}}}(s) = \log\Big(\sum_{y' \in \mathcal{Y}}\exp(s_{y'})\Big).\qquad{(1)}\] With this regularization, the Fenchel–Young loss coincides with the Kullback–Leibler divergence \(\mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}}}}(s,q) = D_{\mathrm{KL}}(q\|\nabla\Omega^*_{\Delta^{\mathcal{Y}}}(s))\) between \(q\) and \(\nabla\Omega^*_{\Delta^{\mathcal{Y}}}(s)\) [3].
When \(\mathcal{Y}\) is combinatorially large, exact probability computations become intractable and require approximations such as variational inference or Markov Chain Monte Carlo (MCMC) methods [18], [19]. Beyond graphical models, negentropy regularization has seen wide application in combinatorial optimization to smooth discrete landscapes and formulate continuous, differentiable approximations. Building upon these concepts, [20] employed entropy-regularized formulations to enable differentiable dynamic programming for structured prediction. More recently, this framework has proven instrumental in advancing learning-based combinatorial solvers: [21] leverage variational annealing on graphs to improve optimization trajectories, and [22] rely on entropy-regularized Monte Carlo policy gradients to reliably navigate binary optimization spaces. Furthermore, these regularization schemes naturally integrate into deep unified architectures that reduce diverse combinatorial problems into matrix-encoded generalizations, ensuring robust exploration and stable convergence [23].
Example 2 (Sparse perturbation). In Section 3.1, we extend the work of [4] and introduce a new regularization function \(\Omega_{\Delta^\mathcal{Y}}\) based on the sparse perturbation function \({F_{\varepsilon,\Delta}(s) = \mathbb{E}[\max_{y\in \mathcal{Y}}s_y + \varepsilon \mathbf{Z}^\top y] = \mathbb{E}[\max_{q\in \Delta^{\mathcal{Y}}}(s + \varepsilon Y^\top \mathbf{Z})^\top q]}\) where \(\mathbf{Z}\) is a random variable, typically a standard Gaussian. More precisely, we define \(\Omega_{\Delta^\mathcal{Y}}\) as the Fenchel conjugate of \(F_{\varepsilon,\Delta}\). This regularization enjoys convenient properties that we describe in Section 3.1. In particular, \[\nabla \Omega_{\Delta^\mathcal{Y}}^*(s) = \nabla F_{\varepsilon,\Delta}(s) = \mathbb{E}[\mathop{\mathrm{argmax}}_{q\in \Delta^{\mathcal{Y}}}(s + \varepsilon Y^\top \mathbf{Z})^\top q],\] which allows us to compute stochastic gradients using Monte Carlo approaches by sampling \(\mathbf{Z}\), which is particularly convenient for the alternating minimization algorithms presented in Section 2.3.
A policy maps a context value \(x \in \mathcal{X}\) to a distribution over the corresponding combinatorial set \(q \in \Delta^{\mathcal{Y}(x)}\). To define such policies, we map a context \(x\) to a direction vector \(\theta = \varphi_w(x)\); then lift it to the score space \(s_\theta = Y(x)^\top \theta = (\langle \theta | y\rangle)_{y \in \mathcal{Y}(x)}\), where \(Y(x) = (y)_{y \in \mathcal{Y}(x)}\) is the wide matrix of solutions in \(\mathcal{Y}(x)\); and finally to a distribution \(q = \nabla \Omega_{\Delta^\mathcal{Y}(x)}^*(s_\theta)\). Thus, the policy parameterized by \(w\) is defined as \[\pi_w(\cdot|x) = \mathop{\mathrm{argmax}}_{q \in \Delta^{\mathcal{Y}(x)}} \{ \langle \underbrace{Y(x)^\top \overbrace{\varphi_w(x)}^{\theta \in \mathbb{R}^{d(x)}}}_{s_\theta \in \mathbb{R}^{\mathcal{Y}(x)}} |q \rangle - \Omega_{\Delta^{\mathcal{Y}(x)}}(q) \} = \nabla \Omega_{\Delta^{\mathcal{Y}(x)}}^*\big(Y(x)^\top \varphi_w(x)\big).\] This connection is further detailed in Appendix 6.3. Such a policy depends on the weights \(w\) and the choice of the regularization function \(\Omega_{\Delta^{\mathcal{Y}(x)}}\). We do not explicitly show this second dependency to alleviate notation since the regularization \(\Omega_{\Delta^{\mathcal{Y}(x)}}\) is chosen once and for all.
We return to the setting described in Section 1 and denote by \((x, \xi)\) a context–noise pair. Recall that we have access to a dataset \((x_1, \xi_1), \ldots, (x_N, \xi_N)\) of such pairs. Our goal is to find \(w\) values that lead to low empirical cost \(R_N(\pi_w)\). \[\label{eq:R95N95pi95w} \min_{w \in \mathcal{W}} R_N(\pi_w) = \min_{w \in \mathcal{W}} \frac{1}{N}\sum_{i=1}^N \mathbb{E}_{\mathbf{y}\sim \pi_w(\cdot|x_i)}\Big[c(x_i, \mathbf{y}, \xi_i)\Big]\tag{10}\] With the \(\Omega_\Delta\) previously introduced, the empirical cost is differentiable with respect to \(w\), and stochastic gradients can be computed using score function estimators [24]. We could therefore directly minimize the empirical cost using stochastic gradient descent (SGD). This SGD performs poorly as the score function estimator suffers from a high variance, and \(R_N\) is highly non-convex as it is a smoothed piecewise constant function [25]. We therefore follow a different approach based on (less noisy) pathwise estimators for gradients and a convexified problem.
To that purpose, we reformulate the empirical cost minimization as a linear problem on the distribution space. Let \({\gamma(x,\xi) = \big(c(x,y,\xi)\big)_{y\in \mathcal{Y}(x)} \in \mathbb{R}^{\mathcal{Y}(x)}}\) be the score vector corresponding to the cost function \(c(x, \cdot, \xi)\) on the (finite) combinatorial space \(\mathcal{Y}(x)\). In general, \(\gamma\) does not belong to the image of \(Y(x)^\top\). Given a distribution \(q \in \Delta^\mathcal{Y}\) on \(\mathcal{Y}\), let us define \(R_{\Delta}(q;x,\xi)\) as the expected cost under \(q\). We can recast it as \[\label{eq:R95Delta} R_{\Delta}(q;x,\xi) = \mathbb{E}_{\mathbf{y}\sim q}\Big[c(x,\mathbf{y},\xi)\Big] = \langle \gamma(x, \xi) | q \rangle.\tag{11}\] We can rewrite the empirical cost as \[\begin{align} R_N(\pi_w) &= \frac{1}{N}\sum_{i=1}^N \mathbb{E}_{\mathbf{y}\sim \pi_w(\cdot|x_i)}\Big[c(x_i, \mathbf{y}, \xi_i)\Big] \\ &= \frac{1}{N} \sum_{i=1}^N R_\Delta\big( \underbrace{\nabla \Omega^*_{\Delta^{\mathcal{Y}(x_i)}}\big(\overbrace{Y(x_i)^\top\varphi_w(x_i)}^{s_i}\big)}_{\pi_w(\cdot|x_i)}, x_i,\xi_i\big) \end{align}\] We introduce the notation \(\mathcal{R}_{\Omega_\Delta,N}\) for the expected cost as a function of the score \(s_{\otimes}\), relying on the following product spaces \[\begin{align} S_{\otimes} &= \{s_\otimes = (s_i)_{i \in [N]} \,|\, \forall i \in [N], s_i \in \mathbb{R}^{\mathcal{Y}(x_i)} \},\\ \Delta_{\otimes} &= \{q_\otimes = (q_i)_{i \in [N]} \,|\, \forall i \in [N], q_i \in \Delta^{\mathcal{Y}(x_i)} \}, \\ \mathcal{R}_{\Omega_\Delta,N}(s_{\otimes}) &= \frac{1}{N} \sum_{i=1}^N R_{\Delta}(\nabla\Omega_{\Delta^{\mathcal{Y}(x_i)}}^*(s_i);x_i,\xi_i) \quad \text{where} \quad s_{\otimes} \in S_{\otimes}.\label{eq:empirical95risk95product} \end{align}\tag{12}\] The expression of \(R_N(\pi_w)\) above allows us to rewrite the empirical cost minimization problem 6 as \[\label{eq:dist95regret95min95pb} \min_{w \in \mathcal{W}} R_N(\pi_w) = \min_{w \in \mathcal{W}} \mathcal{R}_{\Omega_\Delta,N}\Big(\big(Y(x_i)^\top\varphi_w(x_i)\big)_{i \in [N]}\Big).\tag{13}\]
We recall that the Fenchel–Young loss generated by \(\Omega_{\Delta^{\mathcal{Y}(x)}}\) is defined over \({\mathbb{R}^{\mathcal{Y}(x)} \times \Delta^{\mathcal{Y}(x)}}\) by \(\mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}(x)}}}(s;q) = \Omega_{\Delta^{\mathcal{Y}(x)}}(q) + \Omega_{\Delta^{\mathcal{Y}(x)}}^*(s) - \langle s | q \rangle\). Let \(\kappa >0\) be a positive constant, we introduce the following surrogate functions for a single observation and for the full dataset: \[\tag{14} \begin{align} S_{\Omega_\Delta}(s,q;x,\xi) &= \langle\gamma(x,\xi)| q \rangle + \kappa \mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}(x)}}}\big(s, q\big), \\ \mathcal{S}_{\Omega_\Delta, N}\big(s_{\otimes}, q_{\otimes}\big) &= \frac{1}{N} \sum_{i=1}^N S_{\Omega_\Delta}\big(s_i,q_i;x_i,\xi_i\big), \tag{15} \end{align}\] where \(s_\otimes = (s_i)_{i\in [N]}\), \(q_\otimes = (q_i)_{i\in [N]}\), and \(\gamma(x,\xi)\) corresponds to the cost vector \((c(x,y,\xi))_{y \in \mathcal{Y}(x)}\). Notice that, by the Fenchel–Young inequality, \(S_{\Omega_\Delta} \geq R_\Delta\), with equality holding if and only if \(s\) and \(q\) are a dual pair matching the policy, i.e.,\(q = \nabla\Omega_{\Delta^{\mathcal{Y}(x)}}^*(s)\). Instead of directly minimizing the non-convex empirical cost, we aim to solve the following surrogate learning problem: \[\label{eq:surrogate95learning95pb} \min_{\substack{w \in \mathcal{W},\\ q_{\otimes} \in \Delta_\otimes}} \mathcal{S}_{\Omega_\Delta, N}\Big(\big(Y(x_i)^\top \varphi_w(x_i)\big)_{i \in [N]}, q_{\otimes}\Big).\tag{16}\]
We introduce 16 for algorithmic reasons. But before diving into algorithms, a natural concern is the quality of this surrogate object for solving the original empirical cost minimization 13 . Let us introduce the partial minimizer of the surrogate cost for a given fixed scenario: \[\begin{align}\label{eq:partial95surrogate} \underline{\mathcal{S}_{\Omega_\Delta}}(\theta;x,\xi) &:= \min_{q \in \Delta^\mathcal{Y}(x)} \mathcal{S}_{\Omega_\Delta}\big(Y(x)^\top \theta, q;x,\xi\big),\\ \underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_w) &:= \frac{1}{N} \sum_{i=1}^N \underline{\mathcal{S}_{\Omega_\Delta}}(\varphi_w(x_i);x_i,\xi_i) \nonumber\\ &= \min_{q_{\otimes} \in \Delta_\otimes} \mathcal{S}_{\Omega_\Delta, N}\big((Y(x_i)^\top \varphi_w(x_i))_{i \in [N]}, q_{\otimes}\big), \end{align}\tag{17}\]
The following theorem shows that the partial surrogate is a lower approximation of the empirical cost and gives an exact expression of the approximation error. We use the standard notation \(D_F(\cdot \mid \cdot)\) for the Bregman divergence associated with a differentiable convex function \(F\).
theoremthmboundrisk Let \(x\in\mathcal{X}\), \(\xi\in\Xi\), and \(\theta\in\mathbb{R}^{d(x)}\), and set \(s:=Y(x)^\top\theta\) and \(\gamma:=\gamma(x,\xi)\). Assume that \(\nabla\Omega_{\Delta^{\mathcal{Y}(x)}}^*\) is \(1/L_x\)-Lipschitz-continuous. Then \[\label{eq:bound95risk95single} 0 \leq R_\Delta\big( \nabla\Omega_{\Delta^{\mathcal{Y}(x)}}^*(s);x,\xi \big) - \underline{\mathcal{S}_{\Omega_\Delta}}(\theta;x,\xi) = \kappa D_{\Omega_{\Delta^{\mathcal{Y}(x)}}^*} \left( s-\frac{\gamma}{\kappa}\mid s \right) \leq \frac{\|\gamma\|^2}{2L_x\kappa}.\tag{18}\]
For the full dataset, let \(s_i(w):=Y(x_i)^\top\varphi_w(x_i)\), \(\gamma_i:=\gamma(x_i,\xi_i)\), and \(\Omega_i:=\Omega_{\Delta^{\mathcal{Y}(x_i)}}\). If \(\nabla\Omega_i^*\) is \(1/L_i\)-Lipschitz-continuous for every \(i\in[N]\), then, for every \(w\in\mathcal{W}\), \[\label{eq:bound95risk95sum} 0 \leq \mathcal{R}_{\Omega_\Delta,N}(\varphi_w) - \underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_w) = \frac{\kappa}{N} \sum_{i=1}^N D_{\Omega_i^*} \left( s_i(w)-\frac{\gamma_i}{\kappa}\mid s_i(w) \right) \leq \frac{1}{2\kappa N} \sum_{i=1}^N \frac{\|\gamma_i\|^2}{L_i}.\tag{19}\]
Finally, suppose that the minima are attained, and let \(w_{\mathcal{S}}\in\mathop{\mathrm{argmin}}_{w\in\mathcal{W}} \underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_w)\) and \(w_{\mathcal{R}}\in\mathop{\mathrm{argmin}}_{w\in\mathcal{W}} \mathcal{R}_{\Omega_\Delta,N}(\varphi_w)\). Then \[\label{eq:bound95empirical95risk} \mathcal{R}_{\Omega_\Delta,N}(\varphi_{w_{\mathcal{S}}}) - \mathcal{R}_{\Omega_\Delta,N}(\varphi_{w_{\mathcal{R}}}) \leq \frac{1}{2\kappa N} \sum_{i=1}^N \frac{\|\gamma_i\|^2}{L_i}.\tag{20}\] In particular, the right-hand sides of 19 and 20 are bounded above by \(\frac{1}{2L\kappa N}\sum_{i=1}^N\|\gamma_i\|^2\), where \(L:=\min_{i\in[N]}L_i\).
The proof is provided in Appendix 7.4.
Remark 2. Both the Euclidean regularization and the negentropy have \(1\)-Lipschitz conjugate gradients on the simplex. We show in Proposition [prop:strongConvexitySparsePerturbation] that the sparse perturbation regularization also has a Lipschitz-continuous conjugate gradient.
We propose the following primal-dual alternating minimization scheme for Problem 16 . \[\tag{21} \begin{align} q_i^{(t+1)} &= \mathop{\mathrm{argmin}}_{q_i \in \Delta^{\mathcal{Y}(x_i)}} S_{\Omega_\Delta}\big(Y(x_i)^\top \varphi_{\bar w^{(t)}}(x_i), q_i; x_i, \xi_i\big), \forall i \in [N], && \text{(decomposition)} \tag{22}\\ \bar w^{(t+1)} &\in \mathop{\mathrm{argmin}}_{w \in \mathcal{W}} \mathcal{S}_{\Omega_\Delta, N}\Big(\big(Y(x_i)^\top \varphi_w(x_i)\big)_{i \in [N]}, q_{\otimes}^{(t+1)}\Big). && \text{(coordination)} \tag{23} \end{align}\]
By construction of alternating minimization, the sequence of evaluated surrogate values \(\mathcal{S}_{\Omega_\Delta, N}\) monotonically decreases. To get better guarantees, one needs to assume a generalized linear structure mapping, such as \(\varphi_w(x) = \phi(x)^\top w\). But before delving into convergence, let us start with the tractability of the iterates 21 .
Algorithm 21 looks intractable at first glance, as working directly with full distributions \(q_i \in \Delta^{\mathcal{Y}(x_i)}\) is computationally prohibitive for combinatorial \(\mathcal{Y}(x_i)\). However, the following results show that we can work with moments instead of full distributions. The proof is given in Appendix 7.2.
propositionpropcomputationsprimaldualdist Let \(\mu_i^{(t+1)} = \mathbf{E}_{\mathbf{y}\sim q_i^{(t+1)}}[\mathbf{y}] = Y(x_i)q_i^{(t+1)}\) be the moment of \(\mathbf{y}_i\) according to \(q_i^{(t+1)}\). Given \(\bar w^{(t)}\), the next iterate of 21 can be computed through moments: \[\begin{align} \mu_i^{(t+1)} &= \mathbb{E}_{\mathbf{y}\sim q_i^{(t+1)}}[\mathbf{y}], \quad \text{where} \quad q_i^{(t+1)}=\nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*\Big(Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i\Big), \tag{24} \\ \bar w^{(t+1)} &\in \mathop{\mathrm{argmin}}_{w \in \mathcal{W}} \frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{C}(x_i)}}\big(\varphi_w(x_i); \mu_i^{(t+1)}\big), \tag{25} \end{align} where \mathcal{C}(x_i) = \mathop{\mathrm{conv}}(\mathcal{Y}(x_i)) is the moment polytope and \Omega_{\mathcal{C}(x_i)}(\mu) = \min_{q \in \Delta^{\mathcal{Y}(x_i)}}\{\Omega_{\Delta^{\mathcal{Y}(x_i)}}(q) \,|\, Y(x_i)q = \mu\}.\]
Dual coordination 25 reduces to supervised learning over the low-dimensional moment space \(\mathcal{C}\) with \(\mu_i^{(t)}\) as targets. It can be solved easily using stochastic gradient descent with well-chosen regularizations [3], [4]. Second, \(q_i^{(t+1)}\) admits a characterization that makes its moment \(\mu_i^{(t+1)}\) tractable for well-chosen regularization \(\Omega_{\Delta^{\mathcal{Y}(x)}}\). Let us now show that we can compute moments of \(\nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*\Big(Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i\Big)\) for our two main regularization functions.
Under a sparse perturbation formulation, Monte Carlo estimates of the primal moment can be computed using the deterministic combinatorial oracle.
propositionpropprimaldualperturbation Let \(\varepsilon>0\) be a positive constant. When the regularization functions \(\Omega_{\mathcal{C}(x)}\) and \(\Omega_{\Delta^{\mathcal{Y}(x)}}\) are defined as the Fenchel conjugates of the perturbed maxima \(\Omega_{\mathcal{C}(x)} := F_{\varepsilon, \mathcal{C}(x)}^*\) and \(\Omega_{\Delta^{\mathcal{Y}(x)}} := F_{\varepsilon, \Delta(x)}^*\) introduced in Equations 32 33 for some \(\varepsilon>0\), \[\label{eq:primalUpdatePerturbation} \mu_i^{(t+1)} = \mathbb{E}_\mathbf{Z}\Big[\mathop{\mathrm{argmin}}_{y \in \mathcal{Y}(x_i)} c(x_i,y,\xi_i) - \kappa\big(\varphi_{\bar w^{(t)}}(x_i) + \varepsilon \mathbf{Z}\big)^\top y \Big],\tag{26}\] where \(\mathbf{Z}\) is standard multivariate Gaussian noise.
The proof is given in Appendix 7.2. Remark that \(\kappa\) and \(\varepsilon\) appear only through their product \(\kappa\varepsilon\) in 26 ; in particular, fixing one and tuning the other explores exactly the same family of algorithm trajectories, in the non-contextual case.
Under a negentropy formulation, computing \(\mu_i^{(t+1)}\) amounts to inference in an exponential family over \(\mathcal{Y}\), and we therefore have the following well-known result [18].
Proposition 1. When the regularization functions \(\Omega_{\mathcal{C}(x)}\) and \(\Omega_{\Delta^{\mathcal{Y}(x)}}\) are defined using the negentropy \(\Omega_{\Delta^{\mathcal{Y}(x)}}(q) = \sum_{y \in \mathcal{Y}(x)} q_y\log(q_y) + \mathbb{I}_{\Delta^{\mathcal{Y}(x)}}(q)\), the primal moment update becomes: \[\begin{gather} \mu_i^{(t+1)} = \sum_{y \in \mathcal{Y}(x_i)} y \exp\Big( \varphi_{\bar w^{(t)}}(x_i)^\top y - \frac{1}{\kappa} c(x_i,y,\xi_i) \\ - A_{\Delta^{\mathcal{Y}(x_i)}}\Big(Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i\Big)\Big), \end{gather}\] where \(A_{\Delta^{\mathcal{Y}(x_i)}}\) is the log-partition function of the corresponding exponential family.
If the exact inference problem is generally intractable for large \(\mathcal{Y}(x_i)\), we can perform approximate inference using Metropolis-Hastings Markov Chain Monte Carlo (MCMC) methods [18]. In practice, sampling this exponential family yields an algorithm closely mirroring classic simulated annealing for the non-perturbed version of 26.
Our convergence proof does not focus on the non-linearity in the neural network. Let us assume for this subsection that the statistical model is linear, i.e.,\(\varphi_w(x_i) = \phi_i^\top w\) for some matrix \(\phi_i\), and \(\mathcal{W}= \mathbb{R}^{n_{\mathcal{W}}}\).
Let us start with the orthogonal decomposition of \(\mathcal{W}\) into identifiable parameters and their orthogonal. Let \[\mathcal{M}= \left\{ \frac{1}{N} \sum_{i=1}^N \phi_i Y(x_i) q_i \mid q_i \in \Delta^{\mathcal{Y}(x_i)} \right\} = \left\{ \frac{1}{N} \sum_{i=1}^N \phi_i \mu_i \mid \mu_i \in \mathcal{C}(x_i) \right\},\] \(H_\mathcal{M}:= \mathop{\mathrm{aff}}(\mathcal{M})\) be the affine hull of \(\mathcal{M}\), \(\bar \mathcal{W}\) the direction of \(H_\mathcal{M}\) in \(\mathcal{W}\), and \(\bar \mathcal{W}^{\perp}\) be its orthogonal so that \(\mathcal{W}= \bar \mathcal{W}\oplus \bar \mathcal{W}^{\perp}\). We define \(\bar\mathcal{M}= \Pi_{\bar \mathcal{W}}(\mathcal{M})\).
Proposition 2. Let \(w\in \mathcal{W}\), \(q_\otimes \in \Delta_{\otimes}\), and \(Y_i := Y(x_i)\).
For any \(i\), the result of our policy depends only on \(\Pi_{\bar \mathcal{W}}(w)\):
\(\nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*(Y_i^\top \phi_i^\top w) = \nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*(Y_i^\top \phi_i^\top \Pi_{\bar \mathcal{W}}(w))\)
The value of the surrogate depends only on \(\Pi_{\bar \mathcal{W}}(w)\):
\(S_{\Omega_{\Delta}, N}\big(w,q_{\otimes}\big) = S_{\Omega_{\Delta}, N}\big(\Pi_{\bar\mathcal{W}}(w),q_{\otimes}\big)\).
When learning a \(w\), only the component in \(\bar\mathcal{W}\) is identifiable:
Let \(w^*\in \mathop{\mathrm{argmin}}\frac{1}{N}\sum_{i=1}^N\mathcal{L}_{\Omega_{\mathcal{C}(x_i)}}(\phi_i^\top w, Y_iq_i)\), then \(\mathop{\mathrm{argmin}}\frac{1}{N}\sum_{i=1}^N\mathcal{L}_{\Omega_{\mathcal{C}(x_i)}}(\phi_i^\top w, Y_iq_i) = \Pi_{\bar \mathcal{W}}(w^*) + \bar\mathcal{W}^\perp\).
The proof of Proposition 2 is a direct consequence of Propositions 3 and 5, with the orthogonal of a sum of subspaces being the intersection of the orthogonals of each subspace. As a consequence, we can focus on the identifiable part of the surrogate problem \[\begin{align} \min_{\bar w \in \bar \mathcal{W}} \underline{S_{\Delta,N}}(\bar w) \quad \text{where} \quad \underline{S_{\Delta,N}}(\bar w) &:= \min_{q_\otimes \in \Delta_\otimes} S_{\Omega_{\Delta},N}\Big((Y(x_i)^\top \phi_i^\top \bar w)_{i \in [N]},q_i\Big), \end{align}\] where we have omitted the canonical inclusion from \(\bar \mathcal{W}\) to \(\mathcal{W}\) in \(Y(x_i)^\top \phi_i^\top w\) for clarity.
Our convergence results requires some form of convexity. To that purpose, we need to move from objective \(\underline{S_{\Delta,N}}(\bar w)\) in variable \(\bar w\), whose geometry is the one of a regularized piecewise constant function on the normal fan of \(\bar \mathcal{M}\), to an objective expressed on the “Fenchel conjugate” of \(\bar w\), which follows the geometry of \(\bar \mathcal{M}\). We define \(\Omega_{\bar{\mathcal{M}}}(\bar{\nu})\) as the Fenchel conjugate of the average of the dual regularization functions evaluated on the identifiable score space: \[\Omega_{\bar{\mathcal{M}}} := \bar{F}^*, \quad \text{where} \quad \bar{F}(\bar{w}) = \frac{1}{N} \sum_{i=1}^N \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*\big(Y(x_i)^\top \phi_i^\top J_{\Pi_{\bar \mathcal{W}}} \bar{w}\big).\]
where \(J_{\Pi_{\bar \mathcal{W}}}\) is the canonical injection that maps identifiable parameter \(\bar{w}\) to the full parameter space \(\mathcal{W}\), i.e.,\(w = J_{\Pi_{\bar \mathcal{W}}} \bar{w}\). Figure 1 illustrates the properties of \(\Omega_{\bar\mathcal{M}}\) described in the following proposition.
propositionpropcontextualregularization The function \(\bar{F}\) is of Legendre-type, hence \(\bar{F} =
\Omega_{\bar{\mathcal{M}}}^*\). Furthermore, \(\Omega_{\bar{\mathcal{M}}}\) is given by the infimal convolution: \[\label{eq:contextualRegularizationProp} \Omega_{\bar{\mathcal{M}}}(\bar{\nu}) = \inf_{(q_i)_{i \in [N]}} \left\{ \frac{1}{N} \sum_{i=1}^N \Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) \;\middle|\; q_i \in \Delta^{\mathcal{Y}(x_i)}, \,
\frac{1}{N} \sum_{i=1}^N \Pi_{\bar \mathcal{W}}\big( \phi_i Y(x_i) q_i\big) = \bar{\nu} \right\}.\tag{27}\] The domain of \(\Omega_{\bar{\mathcal{M}}}\) is the full-dimensional identifiable aggregated moment
space \(\bar{\mathcal{M}}\). For any \(\bar{\nu} \in \mathop{\mathrm{rel\,int}}(\bar{\mathcal{M}})\), the minimum in 27 is attained at \[q_i = \nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*\big(Y(x_i)^\top \phi_i^\top J_{\Pi_{\bar \mathcal{W}}} \nabla \Omega_{\bar{\mathcal{M}}}(\bar{\nu})\big).\] Given \(q_\otimes \in
\Delta_{\otimes}\), let \(\begin{cases} \bar w = \Pi_{\bar \mathcal{W}}(w) &\text{ for } w \in \mathop{\mathrm{argmin}}\frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{C}(x_i)}}(\phi_i^\top w,Y_iq_i), \\ \bar \nu
= \Pi_{\bar \mathcal{W}}(\nu) &\text{ for } \nu = \frac{1}{N} \sum_{i=1}^N \phi_i Y_i q_i, \end{cases}\)
the regularization function \(\Omega_{\bar \mathcal{M}}\) has the following properties, which are useful below \[\begin{align} \tag{28} \Pi_{\bar \mathcal{W}}(w) &= \nabla
\Omega_{\bar \mathcal{M}}\big(\Pi_{\bar \mathcal{W}}(\nu)\big) \\ \frac{1}{N}\sum_{i=1}^N\big( \Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) - \Omega_{\bar \mathcal{M}}(\bar \nu)\big) &= \frac{1}{N} \sum_{i=1}^N
\mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}(x_i)}}}\big(Y(x_i)^\top \phi_i^\top J_{\Pi_{\bar \mathcal{W}}}\bar w, q_i\big). \tag{29}
\end{align}\]
The detailed statement and proof are given in Section 3.2 and Appendix 7.3, respectively. We call \(q_{\otimes} \mapsto \frac{1}{N}\sum_{i=1}^N\big( \Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) - \Omega_{\bar \mathcal{M}}(\bar \nu)\big)\) the Cross Jensen gap in \(q_{\otimes}\). We use this terminology when the problem is non-structured (\(Y = I\)) and non-contextual (\(\Phi = I\)), we fall back on the usual Jensen gap \(\frac{1}{N}\sum_{i=1}^N \Omega_{\Delta}(q_i) - \Omega_{\Delta}(\frac{1}{N}\sum_{i=1}^N q_i)\).
Consider the iterates \(q_\otimes^{(t)}\) and \(w^{(t)}\) of algorithm 21 , we can define \({\bar \nu^{(t)}= \Pi_{\bar \mathcal{W}}\big(\frac{1}{N}\sum_{i=1}^N\phi_iY_iq_i^{(t)}}\big)\) and \(\bar w^{(t)} = \Pi_{\bar \mathcal{W}}(w^{(t)})\). Equation 28 shows that we do not need the full details of the moments \(\mu_i^{(t+1)}\) to compute \(\bar w^{(t+1)}\), but only the aggregate moment \(\bar \nu^{(t+1)}\) as \(\bar w^{(t+1)} = \nabla\Omega_{\bar \mathcal{M}}(\bar \nu^{t+1})\).
Let us now reformulate algorithm 21 in \(\bar \nu\). Consider the following relaxed objective function \(f_\kappa(\bar \nu)\) over the aggregated moment space \(\bar \mathcal{M}\): \[\label{eq:definitionOfFkappa} \begin{align} f_\kappa(\bar \nu) = \min_{q_{\otimes} \in \Delta_{\otimes}} \Bigg\{ \frac{1}{N} \sum_{i=1}^N \Big[ \langle \gamma_i | q_i \rangle + \kappa \big(\Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) - \Omega_{\bar \mathcal{M}}(\bar \nu)\big) \Big] \;\Bigg|\; \\ \frac{1}{N} \sum_{i=1}^N \Pi_{\bar \mathcal{W}}\big( \phi_i Y(x_i) q_i \big) = \bar \nu \Bigg\}. \end{align}\tag{30}\]
Equation 29 highlights the difference between \(f_{\kappa}\) and our algorithm iterates, we would need to split the minimization in 30 into two successive steps: first minimize the objective without constraint but fixing \(\bar \nu = \bar \nu^{(t)}\), then compute \(\bar \nu^{(t+1)}\) using the constraint. This decoupling is actually obtained in the proximal operator.
theoremtheoproximalpointoperator Let \(\bar \nu^{(0)} = \nabla \Omega_{\bar \mathcal{M}}^*(\bar w^{(0)})\). The sequence \(\bar \nu^{(t)}\) defined by the iterations of the Bregman proximal point algorithm on \(f_\kappa\): \[\label{eq:proximal95point95f95kappa} \bar \nu^{(t+1)} = \mathop{\mathrm{argmin}}_{\bar \nu \in \bar \mathcal{M}} \left\{ f_\kappa(\bar \nu) + \kappa D_{\Omega_{\bar \mathcal{M}}}\big(\bar \nu \mid \bar \nu^{(t)}\big) \right\}\tag{31}\] matches the iterates of the alternating minimization algorithm 21 , such that for all \(t\), we have the correspondence \(\bar \nu^{(t)} = \nabla \Omega_{\bar \mathcal{M}}^*\big(\Pi_{\bar \mathcal{W}}(w^{(t)})\big)\).
Given Theorem [theo:proximalPointOperator], we can use [9] to get the convergence of the PPA towards the global minimum if \(f_{\kappa}\) is convex, and derive a proof of convergence to a stationary point from [16] when it is not. The convexity of \(f_\kappa\) is implied by the convexity of the cross Jensen gap.
propositionpropconvexityfkappa The mapping \(\bar \nu \mapsto f_{\kappa}(\bar \nu)\) is convex if the cross Jensen gap \(q_\otimes \mapsto \frac{1}{N}\sum_{i=1}^N \Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) - \Omega_{\bar \mathcal{M}}( \bar \nu(q_\otimes) )\), where \(\bar \nu(q_\otimes):= \frac{1}{N} \Pi_{\bar{\mathcal{W}}} \sum_{i=1}^N \phi_i Y(x_i) q_i\), is convex.
Theorem [theo:proximalPointOperator] and Proposition [prop:convexityfkappa] are proved in Appendix 7.3. The rest of the section first highlights when the cross Jensen gap is convex and when it isn’t, and then states the convergence result to a stationary point in the general case.
Remark 3. We can rewrite \(f_\kappa\) as the difference of convex function \(G_\kappa-\kappa\Omega_{\bar{\mathcal{M}}}\) where \[\label{eq:Gkappa} G_\kappa(\bar\nu) := \min_{q_\otimes\in\Delta_\otimes} \left\{ \frac{1}{N}\sum_{i=1}^N\big(\langle\gamma_i,q_i\rangle+\kappa\Omega_i(q_i)\big) \;\middle|\; \frac{1}{N}\sum_{i=1}^N\Pi_{\bar{\mathcal{W}}}\phi_iY(x_i)q_i=\bar\nu \right\}.\qquad{(2)}\] Applying the difference of convex algorithm [26] with this decomposition again leads to our alternating minimization algorithm.
In the non-structured case, the moment polytope \(\mathcal{C}\) is the simplex and is identical to the distribution polytope. In this case, both terms of the cross Jensen gap live in the distribution space. Using the interpretation of the Fenchel–Young loss as a primal–dual Bregman divergence [3], we can express the Jensen gap as
\[q_\otimes \mapsto \frac{1}{N}\sum_{i=1}^N \big(\Psi_\Delta(q_i) - \Psi_\Delta(\frac{1}{N}\sum_{i=1}^N q_i)\big) =\frac{1}{N}\sum_{i=1}^N D_{\Psi_{\Delta}}\big(q_i \mid \frac{1}{N} \sum_{i=1}^N q_i\big),\]
where we used Proposition 4 to write \(\Omega_{\Delta} = \Psi_{\Delta} + \mathbb{I}_{\Delta}\) with \(\Psi_{\Delta}\) a Legendre-type function. This new expression reduces the convexity of the Jensen gap to the joint convexity of \(D_{\Psi_{\Delta}}\). The joint convexity of a Bregman divergence is a long-standing and delicate question that has received substantial attention from the literature (see [27] for a thorough analysis on the topic). Theorem 6.1 of [27] provides the necessary and sufficient condition for \(D_{\Psi_{\Delta}}\) to be convex, that is \((\nabla^2\Psi_\Delta)^{-1}\) is matrix-concave. This condition is known to hold for the negentropy and square-norm regularizers [27], but remains an open question for the sparse perturbation.
Figure 2 presents a counter-example showing that the use of a linear optimization layer on \(\mathcal{C}\), together with a nonlinear cost over the original decisions, can destroy global convexity in the structured case. The instance has four feasible decisions \(\mathcal{Y}=\{y_1,y_2,y_3,y_4\}\) and three scenarios. It is constructed so that two adverse effects appear simultaneously. First, the scenario-wise anticipative minimizers are \(y_2,y_3,y_4\), whereas the unique optimal non-anticipative deterministic decision is \(y_1\), which is never anticipatively optimal. Consequently, in the anticipative limit \(\kappa\to0\), the relaxed objective \(f_\kappa\) is minimized at the average moment of \(y_2,y_3,y_4\), which lies on the side of the polytope associated with \(y_3\), rather than on the side associated with the true optimum \(y_1\). Second, when \(\beta>1\), the horizontal regions associated with \(y_1\) and \(y_3\) are separated by the vertical regions associated with \(y_2\) and \(y_4\), whose expected cost \((2\beta-1)/3\) creates a barrier controlled by \(\beta\). This makes the empirical risk \(w\mapsto R_N(\pi_w)\) non-convex (in this single-context instance, the parameter \(w\) is directly the score vector \(\theta\)), and an analogous strict convexity violation holds for \(f_\kappa\) for all sufficiently large \(\kappa\). The corresponding computations (limiting forms of \(f_\kappa\), non-convexity of the structural Jensen gap, and the trajectory of the exact alternating minimization algorithm on the invariant horizontal subspace) are not included in the paper for brevity.
In Appendix 8, we adapt the proof of [16] to show that, under some conditions on the Bregman function and on the function minimized, the Bregman proximal point algorithm converges to a stationary point (Theorem 8). One of the key conditions is that the function minimized satisfies the Kurdyka–Łojasiewicz (KL) inequality. In this paper, we make assumptions that our functions are real analytic, which is stronger and implies the (KL) inequality [28]. This allows us to obtain the following convergence result.
theoremthmconvergence Let \((w^{(t)})_{t \geq 0}\) be the sequence generated by Algorithm 21 . Additionally, assume that:
(\(A_1\)) For every \(i\in[N]\) and every \(\gamma_i\in\mathbb{R}^{\mathcal{Y}(x_i)}\), the Hessian of the mapping \[\theta\mapsto\Omega_{\Delta_i}^*\big(Y(x_i)^\top\theta-\gamma_i\big)\] exists and is positive definite on \(V_i=\mathop{\mathrm{span}}(\mathcal{Y}(x_i)-\mathcal{Y}(x_i))\).
(\(A_2\)) \(\nabla\Omega^*_{\Delta_i}\) is \(L_i\)-lipschitz continuous for all \(i \in [N]\).
(\(A_3\)) for all \(i \in [N]\) and all \(\gamma_i \in \mathbb{R}^{\mathcal{Y}(x_i)}\), the map \(\theta \mapsto \Omega^*_{\Delta_i}\big(Y(x_i)^\top\theta - \gamma_i\big)\) is real analytic.
Then the identifiable trajectory \(\bar w^{(t)}\) does exactly one of the two following.
(C) Confined regime. The identifiable sequence converges toward a single stationary point \(\bar w^*\) of \(\underline{S_{\Delta,N}}\) with finite length, i.e., \(\sum_{t > 0} ||\bar w^{(t+1)} - \bar w^{(t)}|| < +\infty\), and \(\nabla \underline{S_{\Delta,N}}(\bar w^*) = 0\). Additionally, the function value converges at rate \(\underline{S_{\Delta,N}}(\bar w^{(t)}) - \underline{S_{\Delta,N}}(\bar w^*) = \mathcal{O}(1/t)\). On the primal side, \(\bar \nu^{(t)}\) converges with finite length toward a stationary point \(\bar{\nu}^*\) of \(f_\kappa\), and \(f_\kappa(\bar{\nu}^{(t)}) - f_\kappa(\bar{\nu}^*) = \mathcal{O}(1/t)\)
(E) Escape regime. The identifiable sequence diverges, i.e., \(||\bar w^{(t)}|| \rightarrow + \infty\). On the primal side, \(\operatorname{dist}\big(\bar\nu^{(t)},\operatorname{rbd}(\bar{\mathcal{M}})\big)\to0\).
Assumptions (\(A_1\)), (\(A_2\)), and (\(A_3\)) are mild and satisfied by most reasonable choices of regularization, as evidenced by Proposition [prop:regsatisfyconv], whose proof is postponed to Appendix 8.
propositionregularizationconv The negentropy regularization and the sparse perturbation with Gaussian noise satisfy assumptions (\(A_1\)), (\(A_2\)), and (\(A_3\)).
Introducing our algorithm required many new results on structured prediction with Fenchel–Young losses in the combinatorial setting of this paper. Some of them are technical: the theory of Fenchel–Young losses has been developed for full-dimensional polytopes. This assumption is satisfied neither by the polytopes we use in operations research applications nor by the probability simplex. We deal with this issue in Appendix [sec:regularization95on95distributions]. In this section we focus on the new results that are more original and that we believe may have an impact beyond our alternating minimization algorithm. Section 3.1 introduces a sparse perturbation directly on the distribution space \(\Delta^\mathcal{Y}\), extending the framework of [4] to the case where the combinatorial space \(\mathcal{Y}\) is not a continuous polytope. Section 3.2 studies the geometry induced by aggregating Fenchel–Young losses across training scenarios, characterizing the identifiable aggregate moment space \(\bar{\mathcal{M}}\), and the associated aggregate regularizer \(\bar{\Omega}_{\bar{\mathcal{M}}}\). Proofs for both subsections are deferred to Appendices 7.1 and 7.3, respectively.
We use the notations defined in Section 1 for both the variable and distribution spaces. Explicitly defining a proper l.s.c. convex regularization function \(\Omega \in \Gamma_0(\mathbb{R}^d)\) with domain \(\mathop{\mathrm{dom}}(\Omega) = \mathcal{C}\), and computing the regularized predictions \(\hat{y}_\Omega(\theta)\) defined in Equation 4 can be challenging. It may rely on Frank-Wolfe [29] algorithm in practice. We follow another approach pioneered by [4], defining instead \(\Omega_\mathcal{C}^*\) and \(\Omega_\Delta^*\) directly. More precisely, let \(\varepsilon \in \mathbb{R}_{++}\), we introduce: \[\label{eq:perturbation95moment} F_{\varepsilon, \mathcal{C}}(\theta) = \mathbb{E}[\max_{y \in \mathcal{Y}}(\theta + \varepsilon \mathbf{Z})^\top y] = \mathbb{E}[\max_{y \in \mathcal{C}}(\theta + \varepsilon \mathbf{Z})^\top y],\tag{32}\] \[\label{eq:perturbation95distribution} F_{\varepsilon,\Delta}(s) = \mathbb{E}[\max_{y\in \mathcal{Y}}s(y) + \varepsilon \mathbf{Z}^\top y] = \mathbb{E}[\max_{q\in \Delta^{\mathcal{Y}}}(s + \varepsilon Y^\top \mathbf{Z})^\top q],\tag{33}\] where \(\mathbf{Z}\) is a centred random variable on \(\mathbb{R}^d\) from an exponential family with positive density, typically a standard multivariate normal distribution. The perturbed linear program in Equation 32 is introduced by [4], while Equation 33 is new to the best of our knowledge. We denote by \(\Omega_{\varepsilon, \mathcal{C}}\) and \(\Omega_{\varepsilon, \Delta}\) their respective Fenchel conjugates. We extend from the work of [4], Proposition 2.2 the following properties for \(F_{\varepsilon, \mathcal{C}}\) to the case when \(\mathcal{C}\) is not full-dimensional.
propositionpropperturbation Let \(\varepsilon \in \mathbb{R}_{++}\), the function \(F_{\varepsilon, \mathcal{C}}\) defined above has the following properties:
\(F_{\varepsilon, \mathcal{C}}\) is a convex finite valued function of \(\mathbb{R}^d\), and in particular belongs to \(\Gamma_0(\mathbb{R}^d)\).
\(F_{\varepsilon, \mathcal{C}}\) is strictly convex over \(V\), and affine over \(V^\perp\). Let \(\theta \in \mathbb{R}^d\), such that \({\theta = \theta_V + \theta_{V^\perp}}\), where \(\theta_V = \Pi_V(\theta)\) and \(\theta_{V^\perp} = \theta - \theta_V\), and \(y_0 \in \mathcal{C}\), \[F_{\varepsilon, \mathcal{C}}(\theta) = \langle y_0 |\theta_{V^\perp} \rangle + F_{\varepsilon, \mathcal{C}}(\theta_V).\]
\(F_{\varepsilon, \mathcal{C}}\) is twice differentiable, with gradient given by: \[\label{eq:grad95F95calC} \nabla_\theta F_{\varepsilon, \mathcal{C}}(\theta) = \mathbb{E}[\mathop{\mathrm{argmax}}_{y \in \mathcal{C}}(\theta + \varepsilon \mathbf{Z})^\top y].\tag{34}\]
The Fenchel conjugate \(\Omega_{\varepsilon, \mathcal{C}} := F_{\varepsilon, \mathcal{C}}^*\) has domain \(\mathcal{C}\), and its restriction to \(H\) is a Legendre-type function.
Contrary to the full dimension case considered by [4], \(F_{\varepsilon, \mathcal{C}}\) is not strictly convex over the whole space \(\mathbb{R}^d\). Therefore, it is not a Legendre-type function, but its restriction to \(V\) is. Besides, its conjugate is not Legendre-type, but the restriction of its conjugate to the affine subspace \(H\) is. The proof is provided in Appendix 7.1.
The perturbation in the definition of \(F_{\varepsilon, \Delta}\) (see Equation 33 ) spans \(\mathop{\mathrm{Im}}(Y^\top)\), which is a subspace of dimension \(d' \ll |\mathcal{Y}|\). The proofs of [4], or the change of variable in the paper by [30], no longer hold. However, perhaps surprisingly, many properties remain valid.
theoremthmsparseperturbation Let \(\varepsilon \in \mathbb{R}_{++}\), the function \(F_{\varepsilon, \Delta}\) defined above has the following properties:
The function \(F_{\varepsilon, \Delta}\) is convex, Lipschitz continuous (and in particular in \(\Gamma_0(\mathbb{R}^{\mathcal{Y}})\)).
\(F_{\varepsilon, \Delta}\) is strictly convex over \(V_\Delta\), and affine over \(V_\Delta^\perp = \mathop{\mathrm{span}}(\mathbf{1})\). More precisely, let \(s \in \mathbb{R}^{\mathcal{Y}}\), decomposed as \(s = s_{V_\Delta} + s_{V_\Delta^{\perp}}\), where \(s_{V_\Delta} = \Pi_{V_{\Delta}}(s)\) and \(s_{V_\Delta^{\perp}} = s - s_{V_\Delta}\), and \(q_0 \in \Delta^{\mathcal{Y}}\) be any point in \(\Delta^{\mathcal{Y}}\), \[F_{\varepsilon, \Delta}(s) = \langle s_{V_\Delta^\perp} | q_0 \rangle + F_{\varepsilon, \Delta}(s_{V_\Delta}).\]
\(F_{\varepsilon, \Delta}\) is differentiable over \(\mathbb{R}^{\mathcal{Y}}\), with gradient given by: \[\label{eq:grad95F95Delta} \nabla_s F_{\varepsilon, \Delta}(s) = \mathbb{E}[\mathop{\mathrm{argmax}}_{q \in \Delta^{\mathcal{Y}}} (s +\varepsilon Y^\top \mathbf{Z})^\top q].\tag{35}\]
The Fenchel conjugate \(\Omega_{\varepsilon, \Delta} := F_{\varepsilon, \Delta}^*\) has domain \(\Delta^{\mathcal{Y}}\), and its restriction to \(H_\Delta\) is Legendre-type.
Proof. See Appendix 7.1. ◻
Now, we show another property of \(F_{\varepsilon, \Delta}\), useful to get the performance bound in Theorem [thm:bound95risk].
propositionpropstrongconvexitysparseperturbation Let \(\mathbf{Z}\sim \mathcal{N}(0, I_d)\) be a standard Gaussian. Then \(\nabla_s F_{\varepsilon, \Delta}(s)\) is Lipschitz continuous with constant \(L = \tfrac{2|\mathcal{Y}|^2}{\varepsilon m_\mathcal{Y}\sqrt{\pi}}\) where \(m_\mathcal{Y}:= \min_{(y, y') \in \mathcal{Y}^2, y \neq y'}||y-y'||_2\) is the minimum distance between two distinct points in \(\mathcal{Y}\). Consequently, the Fenchel conjugate \(\Omega_{\varepsilon, \Delta}\) is strongly convex on \(H_\Delta\) with parameter \(\mu = \tfrac{\varepsilon m_\mathcal{Y}\sqrt{\pi}}{2|\mathcal{Y}|^{2}} .\)
Proof. See Appendix 7.1. ◻
Finally, we show that \(\Omega_{\varepsilon, \mathcal{C}}\) is the structured regularization corresponding to \(\Omega_{\varepsilon, \Delta}\).
propositionpropstructuredpredictionsparseperturbation \(\Omega_{\varepsilon, \mathcal{C}}(\mu) = \min_{q \colon Yq=\mu}\Omega_{\varepsilon, \Delta}(q)\), and hence all the properties of Proposition 5 are true in the sparse perturbation case.
Proof. See Appendix 7.1. ◻
Let us suppose that we have a collection of polytopes \(\mathcal{P}_1, \ldots, \mathcal{P}_N\), where each \(\mathcal{P}_i \subset \mathbb{R}^{d_i}\) is not necessarily full-dimensional. We denote by \(H_i = \mathop{\mathrm{aff}}(\mathcal{P}_i)\) the affine hull of \(\mathcal{P}_i\), and by \(V_i\) the corresponding parallel linear subspace. We consider a collection of regularization functions \(\Omega_{\mathcal{P}_i}\) such that \(\mathop{\mathrm{dom}}(\Omega_{\mathcal{P}_i}) = \mathcal{P}_i\). Since \(\mathcal{P}_i\) is not full-dimensional, \(\Omega_{\mathcal{P}_i}\) cannot be of Legendre-type over \(\mathbb{R}^{d_i}\). Therefore, we assume that the restriction of \(\Omega_{\mathcal{P}_i}\) to \(H_i=\mathop{\mathrm{aff}}(\mathcal{P}_i)\) is of Legendre type.
We introduce a parameter vector \(w \in \mathbb{R}^d\) and linear maps denoted by matrices \(A_i \colon \mathbb{R}^{d_i} \to \mathbb{R}^d\). The parameter affects the \(i\)-th polytope through \(A_i^\top w\). The aggregate moment space is defined as \(\mathcal{M}= \left\{ \frac{1}{N} \sum_{i=1}^N A_i \pi_i \mid \pi_i \in \mathcal{P}_i \right\} \subset \mathbb{R}^d\). Just like the individual sets \(\mathcal{P}_i\), the space \(\mathcal{M}\) is not necessarily full-dimensional. Let us define \(H_\mathcal{M}= \mathop{\mathrm{aff}}(\mathcal{M})\), and by \(\bar \mathcal{W}\) the parallel linear subspace, and by \(\bar \mathcal{M}\) the full-dimensional restriction of \(\mathcal{M}\) to \(H_\mathcal{M}\). Since the affine hull of a Minkowski sum is the Minkowski sum of the affine hulls, we have \(\bar \mathcal{W}= \sum_{i=1}^N A_i V_i\). We denote by \(J_{\Pi_{\bar\mathcal{W}}}\) the canonical injection mapping an identifiable parameter \(\bar w \in \bar \mathcal{W}\) to the full parameter space \(\mathbb{R}^d\), meaning \(w = J_{\Pi_{\bar\mathcal{W}}} \bar w\). The adjoint operator \(\Pi_{\bar\mathcal{W}}\) projects the aggregated moments into the identifiable structure, creating the full-dimensional restricted space \(\bar \mathcal{M}= \Pi_{\bar\mathcal{W}} \mathcal{M}\).
Let us define the sum of dual regularizers over the identifiable parameter \(\bar w \in \bar \mathcal{W}\), and its corresponding conjugate: \[\label{eq:OmegaCalMstarDefinition} \bar F(\bar w) = \frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}^*(A_i^\top J_{\Pi_{\bar\mathcal{W}}} \bar w), \quad \text{and} \quad \Omega_{\bar \mathcal{M}}(\bar \nu) = \bar F^*(\bar \nu).\tag{36}\]
propositionpropbaromegaproperties
\(\Omega_{\bar \mathcal{M}}\) has the following properties:
\(\bar F\) is of Legendre type, hence \(\bar F = \Omega_{\bar \mathcal{M}}^*\).
\(\Omega_{\bar \mathcal{M}}\) admits the following infimal-projection representation. \[\label{eq:expressionOfBarOmega} \Omega_{\bar \mathcal{M}}(\bar \nu) = \inf_{(\pi_i)_{i=1}^N} \Big\{\frac{1}{N}\sum_{i=1}^N\Omega_{\mathcal{P}_i}(\pi_i)\colon \pi_i \in \mathcal{P}_i \text{ and } \frac{1}{N}\sum_{i=1}^N \Pi_{\bar\mathcal{W}} A_i\pi_i=\bar \nu\Big\}.\tag{37}\]
The domain of \(\Omega_{\bar \mathcal{M}}\) is \(\bar \mathcal{M}= \left\{ \bar \nu = \frac{1}{N} \sum_{i=1}^N \Pi_{\bar\mathcal{W}} A_i \pi_i \mid \pi_i \in \mathop{\mathrm{dom}}\Omega_{\mathcal{P}_i} \right\}\).
For any \(\bar\nu\in\mathop{\mathrm{rel\,int}}(\bar\mathcal{M})\), the minimum in 37 is attained in \((\pi_i)_{i=1}^N\) defined by \(\pi_i = \nabla \Omega_{\mathcal{P}_i}^*\big(A_i^\top J_{\Pi_{\bar\mathcal{W}}} \nabla \Omega_{\bar \mathcal{M}}(\bar \nu)\big)\).
Proof. See Appendix 7.3. ◻
propositionpropfylandcalm Given \(\pi_1,\ldots,\pi_N\) with \(\pi_i\) in \(\mathcal{P}_i\)
and \(w\) in \(\mathcal{W}\), let \[\begin{cases} \bar w = \Pi_{\bar \mathcal{W}}(w) &\text{ for } w \in \mathop{\mathrm{argmin}}\frac{1}{N} \sum_{i=1}^N
\mathcal{L}_{\Omega_{\mathcal{P}_i}}(A_i^\top w,\pi_i), \\ \bar \nu = \Pi_{\bar \mathcal{W}}(\nu) &\text{ for } \nu = \frac{1}{N} \sum_{i=1}^N A_i \pi_i, \end{cases}\]
we have \[\begin{align} \tag{38} \Pi_{\bar \mathcal{W}}(w) &= \nabla \Omega_{\bar \mathcal{M}}\big(\Pi_{\bar \mathcal{W}}(\nu)\big) \\ \frac{1}{N}\sum_{i=1}^N\big( \Omega_{\mathcal{P}_i}(\pi_i) -
\Omega_{\bar \mathcal{M}}(\bar \nu)\big) &= \frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{P}_i}}\big(A_i^\top J_{\Pi_{\bar \mathcal{W}}}\bar w, \pi_i\big). \tag{39}
\end{align}\]
Proof. See Appendix 7.3. ◻
The goal of our numerical experiments is to evaluate when the proposed primal-dual algorithm improves the learning of policies encoded as neural networks with combinatorial optimization layers. We benchmark against state-of-the-art baselines from the literature, including imitation-based CO-layer methods [5], [7] and contextual stochastic optimization approaches [31]. We first consider a contextual two-stage minimum-weight spanning-tree problem in Section 4.1, where the primal-dual method recovers the quality of a computationally heavy fully-coordinated scheme with a lightweight coordination procedure. We then evaluate the method on a stochastic vehicle-scheduling benchmark in Section 4.2, showing that it scales to a real-world application and remains competitive in a regime where uncoordinated imitation is already strong. Finally, we turn to a contextual assortment problem in Section 4.3, a genuinely contextual stochastic optimization setting where decisions must adapt to the observed customer context; there, the learned policy is competitive with contextual SAA methods while requiring only a small fraction of their inference time.
In the practical implementation of the primal-dual described in Algorithm 3, oracle denotes the deterministic single-scenario solver of Assumption 3, called with a linear perturbation of the objective. The routine perturbed implements the sparse-perturbation decomposition step 26 : it draws \(\texttt{nb\_samples}\) independent perturbations, solves the resulting deterministic problems, and returns a Monte Carlo estimate of the moment target \(\mu_i\). The object
Fenchel_Young_Loss is the sparse-perturbation Fenchel–Young loss generated by 32 . In the coordination step 25 , compute_gradient differentiates
this loss with respect to the model output \(\varphi_w(x_i)\), and Adam updates the parameters \(w\). Across the experiments, the training data set \(\mathcal{D}_{\texttt{train}}\) contains context–noise observations used to train the policy, while validation and test data sets are used only to tune hyperparameters and report out-of-sample performance.
The first step of Algorithm 3 is a classic uncoordinated imitation-learning framework with Fenchel–Young losses [7], which we use as a benchmark below. The main differences with the exact primal-dual algorithm of Eq 21 are that: i) we approximate the expectation in 26 with a Monte Carlo estimate, and ii) we approximate the coordination step 25 with a stochastic gradient descent.
We consider the contextual two-stage minimum weight spanning tree problem of [5]: given an undirected graph \(G=(V,E)\), the goal is to build a spanning tree over two stages at minimum cost, where second-stage edge costs depend on an exogenous noise \(\boldsymbol{\xi}\) unknown at the first stage, but a context \(\mathbf{x}\) correlated to \(\boldsymbol{\xi}\) is observed. We refer to [5] for the full problem formulation and to the open-source Julia package1 for the implementation. Instances are defined on \(20\times 20\) grid graphs; we use \(\texttt{train\_size}=50\), \(\texttt{val\_size}=50\), and \(\texttt{test\_size}=50\) instances, each with \(20\) scenarios (\(n_{\texttt{train}}=1000\) context–noise observations). The full mathematical formulation, the policy model, and the algorithm hyperparameters are detailed in Appendix 9.1.
We derive three benchmark policies for this problem. The median policy \(\pi_\texttt{median}\) is not learned: it solves the deterministic single-scenario problem 3 after replacing the unknown cost vector by an estimator of its median. The uncoordinated imitation policy \(\pi_{w^{(1)}}\) solves one deterministic problem 3 per scenario and then imitates the resulting solutions with a Fenchel–Young loss [7]. The fully-coordinated imitation policy \(\pi_{w^L}\) imitates first-stage solutions \(y_i^L\) obtained by solving, for each context \(x_i\), a sample average approximation problem with several noise realizations. We compute these targets with a Lagrangian heuristic as in [5, Sec. 6.5]. Both imitation benchmarks use the same neural-network architecture as our primal-dual policy, but generating the fully-coordinated training set is much more computationally intensive.
We plot validation and test estimated average gaps over iterations in Figure 4. The median policy \(\pi_{\texttt{median}}\) has roughly \(12\%\) average validation and test gaps, while the fully-coordinated policy \(\pi_{w^L}\) reaches average gaps close to \(2\%\). The uncoordinated policy \(\pi_{w^{(1)}}\) reaches \(4.3\%\) average validation and test gaps. Along the outer iterations, the current-weight policy \(\pi_{w^{(t)}}\) shows small oscillations, while the averaged policy \(\pi_{\bar w}\), based on \(\bar w^{(t)} = \frac{1}{t} \sum_{t' \leq t} w^{(t')}\), converges more smoothly and reaches the performance of the fully-coordinated benchmark.
Result 1. The averaged primal-dual policy \(\pi_{\bar w}\) improves over the uncoordinated imitation benchmark \(\pi_{w^{(1)}}\) and reaches the performance of the computationally demanding fully-coordinated benchmark \(\pi_{w^L}\), using the same input dataset and assumptions as the uncoordinated policy.
We now turn to a more complex problem, the stochastic vehicle scheduling problem (StoVSP) of [6]. We study the role of the perturbation scale \(\varepsilon\) across the three policies, and show that the averaged primal-dual policy improves over both imitation baselines at the optimal scale while remaining robust to large values of \(\varepsilon\) where the baselines degrade.
A first-stage decision assigns a fleet of vehicles to a set of tasks, represented as disjoint paths covering every task exactly once in a task graph; a vehicle performing task \(v\) immediately after task \(u\) corresponds to a binary variable \(y_{u,v}\), so that \(\mathcal{Y}(x)\) is again a \(\{0,1\}\)-polytope satisfying Assumption 2. In the second stage, random intrinsic delays \(\gamma_v(\xi)\) at each task propagate along the chosen vehicle routes through the recursion \(d_v(\xi) = \gamma_v(\xi) + \max\big(d_u(\xi) - \delta_{u,v}(\xi), 0\big)\), where \(\delta_{u,v}(\xi)\) is the slack time available between consecutive tasks \(u\) and \(v\). The cost \(c(x,y,\xi)\) sums the fixed routing cost of \(y\) and the resulting delay cost. We rely on the open-source implementation of this benchmark2 to generate \(200\) instances, with \(\texttt{nb\_scenarios}=25\) delay scenarios drawn per instance and \(\texttt{nb\_tasks}=20\) tasks each. We split into \(\texttt{train\_samples}=120 \times 25\), \(\texttt{val\_samples}=40 \times 25\), and \(\texttt{test\_samples}=40 \times 25\) samples.
For each instance \(x\), a GLM \(\varphi_w\) maps task features to a score vector \(\theta=\varphi_w(x)\) indexed by the arcs of the task graph. The
corresponding combinatorial layer solves the deterministic vehicle-scheduling problem with \(\theta\) as the oracle in Algorithm 3. We use the same primal-dual
implementation as in the spanning-tree experiment, fix the regularization weight \(\kappa=1\), and tune the perturbation scale \(\varepsilon\).
Because the StoVSP instances are small enough, we solve the sample average approximation (SAA) problem of each instance to optimality with a compact mixed-integer program. This gives two reference quantities: an exact fully-coordinated target solution for training \(\pi_{w^L}\), and the exact SAA cost evaluated on the otherwise unobserved test scenarios, which we use as an oracle bound in Table 1. We compare three learned policies: the uncoordinated imitation policy \(\pi_{w^{(1)}}\), the fully-coordinated imitation policy \(\pi_{w^L}\), and the averaged primal-dual policy \(\pi_{\bar w}\).
For each value of \(\varepsilon\) on a log-spaced grid from \(10^{-2}\) to \(10^{2}\), we train three policies sharing the same perturbation scale: \(\pi_{w^L}\), \(\pi_{w^{(1)}}\), and \(\pi_{\bar w}\) with its iteration selected by validation cost (out of \(T=20\) outer iterations). Table 1 reports the resulting average test costs alongside the SAA oracle (\(5646.4\)).
| \(\varepsilon\) | \(\pi_{w^L}\) | \(\pi_{w^{(1)}}\) | \(\pi_{\bar{w}}\) (best iter.) |
|---|---|---|---|
| \(0.01\) | \(5672.7\;(+0.47\%)\) | \(5691.5\;(+0.80\%)\) | \(5672.4\;(+0.46\%)\;[4]\) |
| \(0.1\) | \(5661.5\;(+0.27\%)\) | \(5663.5\;(+0.30\%)\) | \(5663.5\;(+0.30\%)\;[1]\) |
| \(1\) | \(5660.7\;(+0.25\%)\) | \(5661.5\;(+0.27\%)\) | \(5664.0\;(+0.31\%)\;[2]\) |
| \(5\) | \(5663.6\;(+0.31\%)\) | \(5663.4\;(+0.30\%)\) | \(\mathbf{5659.0}\;(+0.22\%)\;[20]\) |
| \(10\) | \(5667.5\;(+0.37\%)\) | \(5661.7\;(+0.27\%)\) | \(\mathbf{5658.5}\;(+0.22\%)\;[19]\) |
| \(50\) | \(5687.5\;(+0.73\%)\) | \(5690.2\;(+0.78\%)\) | \(5664.6\;(+0.32\%)\;[20]\) |
| \(100\) | \(5713.5\;(+1.19\%)\) | \(5719.5\;(+1.30\%)\) | \(5672.7\;(+0.47\%)\;[20]\) |
At small scales (\(\varepsilon \leq 1\)), the algorithm converges in one or two iterations, so \(\pi_{\bar w}\) matches \(\pi_{w^{(1)}}\) and all policies are within \(0.3\%\) of the oracle. At the sweet spot (\(\varepsilon \in \{5, 10\}\)), \(\pi_{\bar w}\) runs the full budget and improves over both \(\pi_{w^{(1)}}\) and the computationally expensive \(\pi_{w^L}\) (\(+0.22\%\) vs.\(+0.27\)–\(0.37\%\)). At large scales (\(\varepsilon \geq 50\)), both baselines degrade significantly while \(\pi_{\bar w}\) recovers via model averaging, staying within \(0.5\%\) of the oracle.
Result 2. On the stochastic vehicle scheduling benchmark, uncoordinated imitation is already strong at small perturbation scales. At the optimal scale (\(\varepsilon \in \{5, 10\}\)), the averaged primal-dual policy \(\pi_{\bar w}\) outperforms both imitation baselines, and remains robust at large scales where baselines degrade.
We evaluate Algorithm 3 in a contextual stochastic assortment setting where the customer context changes the optimal assortment [32]. We compare with contextual SAA baselines, assess scalability to larger catalogs, and show that the learned policy transfers to new catalogs unseen at training time. Instance parameters, model architecture, and hyperparameters are detailed in Appendix 9.2.
Each product \(i\) has a feature vector \(x_i^p\) (first coordinate: price), and the seller observes a customer context \(x^c\) before selecting an assortment \(y\in\{0,1\}^N\) with at most \(3\) offered products. Customer utility for an offered product is \(u_i=(x_i^p)^\top B x^c+\varepsilon_i\) with i.i.d.Gumbel noise \(\varepsilon_i\); the seller receives the price of the chosen product, or zero if the customer takes the outside option.
We use a learned bilinear score model over customer and product features; implementation details are given in Appendix 9.2. We compare against non-contextual SAA (using historical scenarios in the training set), nearest-neighbor (kNN-SAA), Gaussian-kernel (Gaussian-SAA), and random-forest (RF-SAA) contextual baselines [31], and the uncoordinated imitation policy \(\pi_{w^{(1)}}\). Hyperparameters are selected by validation performance.
Small catalog. For the small catalog setting \(N=10\), Table 2 reports mean values by instance seed; all entries except SAA are relative improvements over SAA.
The primal-dual iterations turn a poor uncoordinated imitation policy into a strong contextual policy. The validation-selected policy \(\bar{\pi}^{50}\) always improves over SAA, is most of the time better than the contextual-SAA prescriptions, and gives the best average performance.
| Seed | SAA | kNN | Gaussian | RF | \(\boldsymbol{\pi_{w^{(1)}}}\) | \(\boldsymbol{\pi^{50}}\) | \(\boldsymbol{\bar{\pi}^{50}}\) | \(\boldsymbol{\bar{\pi}^{100}}\) |
|---|---|---|---|---|---|---|---|---|
| 1 | 9.07 | -0.3% | -0.1% | -0.1% | -34.3% | +0.2% | +0.2% | -0.0% |
| 2 | 6.39 | +3.8% | +4.5% | +4.5% | -47.0% | -1.1% | +1.5% | +1.8% |
| 3 | 5.65 | +11.0% | +11.6% | +11.6% | -30.9% | +13.9% | +14.4% | +14.4% |
| 4 | 7.25 | +9.8% | +8.7% | +9.3% | -40.4% | +8.7% | +10.7% | +10.6% |
| 5 | 7.34 | +0.4% | +0.9% | +0.8% | -30.0% | -0.6% | +1.2% | +1.3% |
| Average | 7.14 | +4.4% | +4.6% | +4.7% | -36.4% | +3.7% | +5.6% | +5.6% |
Scaling. The larger-scale runs show the same overall pattern as the small benchmark, and in this pooled comparison the primal-dual policies improve over the contextual-SAA prescription. At \(N=25\) (resp. \(N=50\)), the best primal-dual policy improves over SAA by \(2.09\%\) (resp. \(1.62\%\)), compared with \(0.80\%\) (resp. \(0.45\%\)) for kNN-10.
As table 3 shows, contextual-SAA methods have little or no training cost, but solve a new weighted SAA problem at each test context. The learned primal-dual policies have a heavier offline training phase, but their online evaluation is essentially a forward pass, leading to orders of magnitudes faster inference.
| \(N=25\) | \(N=50\) | \(N=100\) | ||||
|---|---|---|---|---|---|---|
| 2-3(lr)4-5(lr)6-7 Method | Train (s) | Test (ms) | Train (s) | Test (ms) | Train (s) | Test (ms) |
| SAA | 3.0 | – | 11 | – | 81 | – |
| kNN-10 | 0.0 | 179 | 0.0 | 372 | 0.0 | 1587 |
| Gaussian-SAA | 0.0 | 2198 | 0.0 | 10696 | 0.0 | 61361 |
| RF-SAA | 0.4 | 1225 | 0.5 | 5724 | 0.8 | 36558 |
| \(\bar{\pi}^{50}\) | 274 | 0.013 | 453 | 0.024 | 1405 | 0.077 |
| \(\bar{\pi}^{100}\) | 552 | 0.016 | 898 | 0.028 | 2772 | 0.074 |
4pt
Result 3. The primal-dual algorithm outperforms the contextual-SAA baseline in value while reducing inference time by several orders of magnitude, at the price of a heavier training phase.
Remark 4. Because the primal-dual algorithm learns a feature-based scoring rule over products, the resulting policy can be evaluated directly on catalogs containing products unseen during training (in which case \(\mathcal{Y}(x)\) depends on \(x\)). This is not the case for empirical prescriptions such as SAA or kNN-SAA, which are tied to the products observed in the source catalog. In our transfer experiments (Appendix 9.2), this allows the primal-dual policy to remain competitive under catalog shift, and to become particularly advantageous when a large share of target products is new.
Our numerical experiments show that using policies based on combinatorial optimization layers is orders of magnitude faster at inference time and yields competitive results compared to other contextual stochastic optimization methods on contextual assortment. Furthermore, our approach is scalable to large-scale problems with context-dependent feasible sets \(\mathcal{Y}(x)\). The experiments also demonstrate that our deep learning-compatible empirical cost minimization improves upon the literature benchmark for training combinatorial optimization layers based on imitation learning. This advantage is particularly evident on assortment problems where anticipative decisions perform poorly.
On the theoretical side, even though we have shown that the exact linear-parametric version of the alternating scheme may converge to a local minimum of the surrogate problem, the practical algorithm achieves strong empirical performance in practice. This is backed by two theoretical elements: first, the exact scheme is equivalent to a proximal point algorithm on a function that becomes convex in the small \(\kappa\) regime; second, our extension of the regularization by perturbation to the distribution case enables us to obtain low-variance gradient estimates. We believe these tools might be relevant beyond our specific application. The convergence theorem does not cover the neural-network training and Monte Carlo/SGD approximations used in the experiments.
Looking ahead, it seems possible to extend our convergence analysis in three ways. First, it relies on exact evaluations of the updates of the algorithm. When we use a regularization by perturbation, we have a Monte Carlo estimate of the decomposition step and we solve the coordination step via stochastic gradient descent. It would be interesting to extend the convergence analysis to that setting. Second, a promising research direction would be to leverage the literature on generalization bounds to derive guarantees for the true expected cost minimization problem [33]. Third, some recent works study the case when Assumption 3 is relaxed when learning with Fenchel-Young losses [19], [34], meaning when we only have a heuristic solver (local search or large neighborhood search) at our disposal. The precise implications for our primal-dual algorithm, and convergence analyses are left as future works. Finally, an interesting direction would be to leverage the results on Section 3 to propose a new empirical cost minimization algorithm that does not suffer from the non-convexity of the Jensen gap.
We deeply thank Pierre-Cyril Aubin Frankowski, Jérôme Malick and Yohann De Castro for their feedback on this manuscript, and advice on the mirror descent and alternating minimization literature. Besides, we are grateful to Solène Delannoy Pavy for sharing her implementation of the contextual stochastic assortment problem.
This work has been partially supported by Renault Group through the Ph.D. studentship of Louis Bouvier. This support is gratefully acknowledged. The authors have no other competing interests to disclose.
The authors used large language models (LLMs) to assist in auditing proofs, exploring alternative proof strategies, and identifying relevant literature. All mathematical content was manually edited and thoroughly checked by the authors.
The appendices are organized as follows. Appendix [sec:regularization95on95distributions] gathers background on regularization over non-full-dimensional convex domains, used throughout the paper. Appendix 7 contains the proofs of the tractability results of Section 2.3, of the two new structured-prediction contributions of Section 3, of the surrogate error bound (Theorem [thm:bound95risk]), and of the equivalence between tuning \(\kappa\) and tuning \(\varepsilon\) (Appendix 7.5). Appendix 8 proves the convergence result of Section 2.4 (Theorem [thm:convergence:speed]), building on a generic convergence result for the Bregman proximal point algorithm. Finally, Appendix 9 details the implementation and hyperparameters of the numerical experiments of Section 4.
This appendix provides the background on regularization with non-full-dimensional convex domains that is used throughout the paper. We begin with the definitions of mirror maps and regularizers, then study the key properties of convex analysis on non-full-dimensional sets, and close with the link between regularization on the distribution space \(\Delta^\mathcal{Y}\) and on the moment space \(\mathcal{C}\).
We detail here the definitions of mirror maps and regularizers, and study their connections with Legendre-type functions.
Let \(\Psi: \mathbb{R}^d \rightarrow \mathbb{R}\cup \{+ \infty\}\) be a function and \(\mathcal{C}\subset \mathbb{R}^d\) be a closed convex set. We say that \(\Psi\) is a \(\mathcal{C}\)-compatible mirror map if
\(\Psi\) is lower-semicontinuous and strictly convex,
\(\Psi\) is differentiable on \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\),
the gradient of \(\Psi\) takes all possible values, i.e., \(\nabla \Psi\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big) = \mathbb{R}^d\).
\(\mathcal{C}\subset \mathop{\mathrm{cl}}\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big)\),
\(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) \cap \mathcal{C}\neq \emptyset\).
Remark 5. Let \(\mathcal{C}\subset \mathbb{R}^d\) be closed convex set, and \(\Psi\) be a Legendre-type function such that \(\mathcal{C}\subset \mathop{\mathrm{cl}}\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big)\), \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) \cap \mathcal{C}\neq \emptyset\), and \(\mathop{\mathrm{dom}}(\Psi^*) = \mathbb{R}^d\). Then \(\Psi\) is a \(\mathcal{C}\)-compatible mirror map.
Remark 6. Sometimes \(\Psi\) is called a Bregman potential, and the term of mirror map is used for its gradient \(\nabla \Psi\).
Let \(\mathcal{C}\subset \mathbb{R}^d\) be a closed convex set. A function \(\Omega: \mathbb{R}^d \rightarrow \mathbb{R}\cup \{+ \infty\}\) is a \(\mathcal{C}\)-pre-regularizer if it is strictly convex, lower-semicontinuous, and if \(\mathop{\mathrm{cl}}(\mathop{\mathrm{dom}}(\Omega)) = \mathcal{C}\). If in addition \(\mathop{\mathrm{dom}}(\Omega^*) = \mathbb{R}^d\), then \(\Omega\) is said to be a \(\mathcal{C}\)-regularizer.
Remark 7. The previous definition is less restrictive than the one of mirror maps. In particular, regularizers are not necessarily differentiable, and their domains may be sub-dimensional.
Let \(\Omega \in \Gamma_0(\mathbb{R}^d)\) be a proper l.s.c. convex function mapping \(\mathbb{R}^d\) to \((-\infty,+\infty]\). In this section, we consider the regularized prediction problem defined as \[\label{eq:regularized95pred} \hat{y}_\Omega(\theta) \in \mathop{\mathrm{argmax}}_{\mu \in \mathop{\mathrm{dom}}(\Omega)} \langle \theta| \mu \rangle - \Omega(\mu),\tag{40}\] and introduce some new geometric results related to it, which are useful for the study of our algorithm.
To the best of our knowledge, most of the theory of Fenchel–Young losses has been developed either by introducing a regularization function \(\Omega\) with full-dimensional domain \(\mathcal{C}\), where \(\Omega\) is Legendre-type, or by using a decomposition \(\Omega := \Psi + \mathbb{I}_{\mathcal{C}}\), where \(\Psi\) is Legendre-type. In many applications in operations research, we consider polytopes \(\mathcal{C}\) that are not full-dimensional (the simplex is a case in point). When defining \(\Omega\) directly on the polytope (using a perturbation as in [4] for instance), the decomposition \(\Omega := \Psi + \mathbb{I}_{\mathcal{C}}\) is not given. Therefore, when the polytope is not full-dimensional, we do not have access to a Legendre-type function. Instead, we have at our disposal a \(\mathcal{C}\)-regularizer.
The following proposition extends classic results of Legendre-type functions to functions with non-full dimensional domains \(\mathcal{C}\), whose restrictions to the affine hull of \(\mathcal{C}\) are Legendre-type, while the next constructs a \(\Psi + \mathbb{I}_{\mathcal{C}}\) decomposition.
Proposition 3. Let \(\mathcal{C}\subset \mathbb{R}^d\) be a non-empty convex compact set. We consider a proper l.s.c. convex regularization function \(\Omega \in \Gamma_0(\mathbb{R}^d)\) with domain \(\mathop{\mathrm{dom}}(\Omega)= \mathcal{C}\). We assume that the restriction of \(\Omega\) to \(H = \mathop{\mathrm{aff}}(\mathcal{C})\), denoted as \(\Omega_{|H}\), is Legendre-type (with respect to the metric of \(H\), and not the one of \(\mathbb{R}^d\)).
We denote by \(V\) the direction of \(H\) in \(\mathbb{R}^d\), and we have the orthogonal sum \({\mathbb{R}^d = V \oplus V^\perp}\). We introduce \(\Pi_V\), the orthogonal projection onto \(V\) in \(\mathbb{R}^d\). We have the following results:
The Fenchel conjugate of \(\Omega\), has full domain, i.e., \(\mathop{\mathrm{dom}}(\Omega^*)= \mathbb{R}^d\). Therefore, \(\Omega\) is a \(\mathcal{C}\)-regularizer (see Appendix 6.1). Further, the function \(\Omega^*\) is differentiable over \(\mathbb{R}^d\), and we have the property: \[\label{eq:subdiff95diff} \nabla \Omega^*(\partial \Omega(y)) = y, \quad \forall y \in \mathop{\mathrm{rel\,int}}(\mathcal{C}).\qquad{(3)}\]
Let \(\theta \in \mathbb{R}^d\), decomposed as \(\theta = \theta_V + \theta_{V^\perp}\), where \(\theta_V = \Pi_V(\theta)\) and \(\theta_{V^\perp} = \theta - \theta_V\), and \(y_0 \in \mathcal{C}\) be any point in \(\mathcal{C}\). The Fenchel conjugate of \(\Omega\), denoted as \(\Omega^*\), has an affine component over \(V^\perp\): \[\label{eq:affine95orthogonal} \Omega^*(\theta) = \Omega^*(\theta_V) + \langle \theta_{V^\perp}| y_0 \rangle.\qquad{(4)}\]
Let \(y \in H\), the subdifferential of \(\Omega\) at \(y\) is given by: \[\label{eq:subdiff95affine95subspace} \partial \Omega(y) = \partial(\Omega_{|H})(y) + V^\perp,\qquad{(5)}\] where we have omitted the canonical injection from \(H\) to \(\mathbb{R}^d\) for notational simplicity. In particular, for \(y \in \mathop{\mathrm{rel\,int}}(\mathop{\mathrm{dom}}(\Omega))\), we have: \[\label{eq:subdiff95relint95domain} \partial \Omega(y) = \{\nabla \Omega_{|H}(y)\} + V^\perp.\qquad{(6)}\]
We illustrate Proposition 3 in Figure 5, in the case \(d=3\), \(H\) is an affine hyperplane, and \(V^\perp\) a straight line. Arrows represent the links between primal and dual variables, involving the subdifferential of \(\Omega\) and the gradient of \(\Omega^*\). The proof relies on classic convex duality results.
Proof of Proposition 3. Given the assumptions in the preamble of the proposition,
The function \(\Omega\) belongs to the set of proper l.s.c. convex functions \(\Gamma_0(\mathbb{R}^d)\), thus for any \(\theta \in \mathbb{R}^d\), the supremum over the compact \(\mathcal{C}\) of \(\langle \theta| \cdot \rangle - \Omega(\cdot)\) is finite and attained, thus \(\mathop{\mathrm{dom}}(\Omega^*) = \mathbb{R}^d\). Recall that, as \(\Omega\) is in \(\Gamma_0(\mathbb{R}^d)\), using the computations of [17], Theorem 23.5, \(\partial \Omega^*(\theta)=\mathop{\mathrm{argmax}}_{y} \langle \theta| y \rangle - \Omega(y)\). As \(\Omega\) is strictly convex, the argmax is reduced to a single point, and \(\Omega^*\) is differentiable over \(\mathbb{R}^d\). Therefore, we have for \((y ,\theta) \in (\mathbb{R}^d)^2\): \[\theta \in \partial \Omega(y) \iff y \in \partial \Omega^*(\theta) \iff y = \nabla \Omega^*(\theta).\] Therefore, for \(y \in \mathop{\mathrm{rel\,int}}(\mathcal{C})\), we have \(\nabla \Omega^*(\partial \Omega(y)) = y\).
Let \(y_0 \in \mathcal{C}\) and \(\theta \in \mathbb{R}^d\) be decomposed as \(\theta = \theta_V + \theta_{V^\perp}\). Note that for all \(y \in \mathcal{C}\) we have \(\langle \theta_{V^\perp}| y \rangle = \langle \theta_{V^\perp}| y_0 \rangle\), since \(\theta_{V^\perp}\) is orthogonal to the direction of the affine hull of \(\mathcal{C}\). Thus, \[\begin{align} \Omega^*(\theta) & = \sup_{y \in \mathcal{C}} \langle \theta_V + \theta_{V^\perp}| y \rangle - \Omega(y) = \langle \theta_{V^\perp}| y_0 \rangle + \sup_{y \in \mathcal{C}} \langle \theta_V| y \rangle - \Omega(y), \end{align}\] which yields the result.
Let \((y, y') \in H^2\), \(\theta \in \partial \Omega(y)\), by definition of the subgradients, we have \[\Omega(y') - \Omega(y) \geq \langle \theta| y'-y \rangle = \langle \Pi_V(\theta)| y'-y \rangle,\] since \(y'-y\) belongs to \(V\). Therefore we have shown that \({\Pi_V(\theta) \in \partial(\Omega_{|H})(y)}\).
Conversely, let \(y \in H\) and \(\theta \in V\) be an element of \(\partial(\Omega_{|H})(y)\), for \(y' \in \mathbb{R}^d\) and \(\tilde{\theta} \in V^\perp\), \[\Omega(y') \geq \Omega(y) + \langle \theta + \tilde{\theta}| y'-y \rangle,\] since either \(y' \notin H\) and \(\Omega(y') = + \infty\), or \(y' \in H\) and \(y'-y \in V\) therefore \(\langle \tilde{\theta}| y'-y \rangle =0\). We have shown the first equality in Equation ?? .
Equation ?? comes from the fact that \(\Omega_{|H}\) is Legendre-type, thus differentiable, and for \(y \in \mathop{\mathrm{rel\,int}}(\mathop{\mathrm{dom}}(\Omega))\), \(\partial(\Omega_{|H})(y) = \{\nabla (\Omega_{|H})(y)\}\).
◻
We now show that any \(\Omega\) satisfying the assumption of Proposition 3, can be written as \(\Omega= \Psi + \mathbb{I}_\mathcal{C}\) for some Legendre-type function \(\Psi\).
Proposition 4. Let \(\mathcal{C}\subset \mathbb{R}^d\) be a convex compact set, and \(\Omega\) be a proper l.s.c. convex regularization function in \(\Gamma_0(\mathbb{R}^d)\), with domain \(\mathop{\mathrm{dom}}(\Omega)= \mathcal{C}\). We assume that the restriction of \(\Omega\) to \(H = \mathop{\mathrm{aff}}(\mathcal{C})\) is Legendre-type (with respect to the metric of \(H\)). Then, there exists a Legendre-type function \(\Psi\), with \(\mathcal{C}\subset \mathop{\mathrm{cl}}\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big)\), \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) \cap \mathcal{C}\neq \emptyset\), and such that \[\Omega = \Psi + \mathbb{I}_{\mathcal{C}}, \quad \text{and} \quad \mathop{\mathrm{dom}}(\Psi^*) = \mathbb{R}^d.\] Besides, let \(V\) be the direction of \(H\) in \(\mathbb{R}^d\), we have the direct sum \(\mathbb{R}^d = V \oplus V^\perp\). Given a vector \(\theta \in \mathbb{R}^d\), there exists a vector \(z \in V^\perp\) such that \[\nabla \Psi\big(\nabla \Omega^*(\theta) \big) = \theta + z.\]
This result can be seen as the converse, in a restricted setting (with more assumptions on \(\Omega\)), of a proposition by [35], Proposition 2.11, where given a \(\mathcal{C}\)-compatible mirror map \(\Psi\), a \(\mathcal{C}\)-regularizer \(\Omega\) is defined as \(\Omega := \Psi + \mathbb{I}_{\mathcal{C}}\). Indeed, we know with Proposition 3 that \(\Omega\) defined in the preamble of Proposition 4 is (in particular) a \(\mathcal{C}\)-regularizer.
Proof of Proposition 4. Let \(\Pi_V\) be the linear orthogonal projection onto \(V\). W.l.o.g., we consider the case \(H = V\), which means the affine hull of the domain of \(\Omega\) is actually a vector subspace in \(\mathbb{R}^d\). Extending to the affine case involves a translation. We define the following map: \[\begin{align} \Psi: & \quad \mathbb{R}^d \rightarrow \mathbb{R}\\ & \quad y \mapsto \Omega(\Pi_V(y)) + \frac{1}{2} ||y - \Pi_V(y)||^2_2, \end{align}\] where \(\Pi_V(y)\) is seen as an element of \(\mathbb{R}^d\) here. When it is the input of the restriction of \(\Omega\) to \(V\), we see it as an element of \(V\). Notice that by definition, \(\Omega = \Psi + \mathbb{I}_\mathcal{C}\). We are going to prove that \(\Psi\) is a Legendre-type function. We first show that \(\Psi\) defined as such is essentially smooth by checking the three properties of the definition.
Since \(\mathop{\mathrm{dom}}(\Omega) = \mathcal{C}\subset V\) and \(\|\cdot\|^2_2\) is defined over \(\mathbb{R}^d\), the domain of \(\Psi\) is \({\mathop{\mathrm{dom}}(\Psi) = \mathcal{C}\oplus V^\perp}\), and \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) = \mathop{\mathrm{rel\,int}}(\mathcal{C}) \oplus V^\perp\), which is not empty. We therefore have \[\mathcal{C}\subset \mathop{\mathrm{cl}}\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big), \quad \text{and} \quad \mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) \cap \mathcal{C}\neq \emptyset.\]
By composition with linear projections and sum, \(\Psi\) is differentiable over \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\). We denote by \(J_{\Pi_V}\) the Jacobian of \(\Pi_V\), that can be seen as the canonical injection of \(V\) into \(\mathbb{R}^d\). Let now \((y, h) \in \mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) \times \mathbb{R}^d\) be two vectors such that \(y+h \in \mathop{\mathrm{dom}}(\Psi)\), \[\begin{align} \Psi(y+h) &= \Omega(\Pi_V(y+h)) + \frac{1}{2}||y+h - \Pi_V(y+h)||^2_2,\\ & = \Omega(\Pi_V(y) + \Pi_V(h)) + \frac{1}{2}||y-\Pi_V(y) + h - \Pi_V(h)||^2_2,\\ & = \Omega_{|V}(\Pi_V(y)) + \langle J_{\Pi_V} \nabla(\Omega_{|V})(\Pi_V(y))| \Pi_V(h) \rangle + o(||\Pi_V(h)||),\\ & + \frac{1}{2}||y-\Pi_V(y)||^2_2 + \langle y-\Pi_V(y)| h-\Pi_V(h)\rangle + o(||h-\Pi_V(h)||),\\ & = \Omega(\Pi_V(y)) + \langle J_{\Pi_V} \nabla(\Omega_{|V})(\Pi_V(y)) | \Pi_V(h) + h - \Pi_V(h)\rangle + o(||h||),\\ & + \frac{1}{2}||y-\Pi_V(y)||^2_2 + \langle y-\Pi_V(y)| h-\Pi_V(h) + \Pi_V(h)\rangle + o(||h||),\\ & = \Psi(y) + \langle J_{\Pi_V} \nabla(\Omega_{|V})(\Pi_V(y)) + y-\Pi_V(y) | h \rangle + o(||h||). \end{align}\] In the computations above we use the linearity of \(\Pi_V\), the fact that \(\Omega\) and \(\Omega_{|V}\) coincide over \(V\), that \(\Omega_{|V}\) is Legendre-type thus differentiable, and the orthogonal sum \(\mathbb{R}^d = V \oplus V^\perp\). Therefore, we have shown that the gradient of \(\Psi\) is given by: \[\nabla \Psi(y) = \underbrace{J_{\Pi_V}}_{\substack{\text{Canonical}\\\text{injection} \\ V\rightarrow \mathbb{R}^d}} \nabla \Omega_{|V}(\Pi_V(y)) + y - \Pi_V(y).\]
The boundary of \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\) is \[\mathop{\mathrm{bdry}}\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big) = \mathop{\mathrm{cl}}\big(\mathop{\mathrm{rel\,int}}(\mathcal{C})\big) \backslash \mathop{\mathrm{rel\,int}}(\mathcal{C}) \oplus V^\perp.\] Indeed, \(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi)) = \mathop{\mathrm{rel\,int}}(\mathcal{C}) \oplus V^\perp\) is isomorphic to \(\mathop{\mathrm{rel\,int}}(\mathcal{C}) \times V^\perp\), \(\mathop{\mathrm{bdry}}(V^\perp) = \emptyset\), \(\mathop{\mathrm{cl}}(V^\perp) = V^\perp\), and for two sets \(S_1\) and \(S_2\) \[\mathop{\mathrm{bdry}}(S_1\times S_2) = \big(\mathop{\mathrm{bdry}}(S_1)\times \mathop{\mathrm{cl}}(S_2) \big) \cup \big(\mathop{\mathrm{cl}}(S_1)\times \mathop{\mathrm{bdry}}(S_2)\big),\] where the boundaries in the right-hand side above are computed with respect to the topology corresponding to each set.
Let now \(\mu\) be in \(\mathop{\mathrm{bdry}}\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big)\), and let \((\mu_i)_{i \in \mathbb{N}}\) be a sequence in \(\big(\mathop{\mathrm{int}}(\mathop{\mathrm{dom}}(\Psi))\big)^{\mathbb{N}}\), such that \[\lim _{i\to +\infty} \mu_i = \mu = \underbrace{\Pi_V(\mu)}_{\in \mathop{\mathrm{cl}}\big(\mathop{\mathrm{rel\,int}}(\mathcal{C})\big) \backslash \mathop{\mathrm{rel\,int}}(\mathcal{C})} + \underbrace{\mu - \Pi_V(\mu)}_{\in V^\perp}.\]
Since \(\Pi_V\) is continuous, \[\lim_{i\to +\infty} \underbrace{\Pi_V(\mu_i)}_{\in \mathop{\mathrm{rel\,int}}(\mathcal{C})} = \Pi_V(\mu), \quad \text{and} \quad \lim_{i\to +\infty} \underbrace{\mu_i - \Pi_V(\mu_i)}_{\in V^\perp} = \mu - \Pi_V(\mu).\] Now, using the fact that \(\Omega_{|V}\) is Legendre-type, the expression of \(\nabla \Psi\) above, and the reverse triangular inequality, \[\begin{align} ||\nabla \Psi(\mu_i)|| &= || J_{\Pi_V} \nabla(\Omega_{|V})(\Pi_V(\mu_i)) + \mu_i - \Pi_V(\mu_i)||, \\ & \geq \big| \underbrace{||J_{\Pi_V} \nabla(\Omega_{|V})(\Pi_V(\mu_i))||}_{\to + \infty} - \underbrace{||\mu_i - \Pi_V(\mu_i)||}_{\to ||\mu - \Pi_V(\mu)||} \big|. \end{align}\] Therefore, we have shown that \(\lim_{i \to + \infty} ||\nabla \Psi(\mu_i)|| = +\infty\).
Let us finally show that \(\Psi\) is strictly convex. We first remark that \(\mathop{\mathrm{dom}}(\Psi)\) is convex since both \(\mathcal{C}\) and \(V^\perp\) are. Let \((y_1, y_2)\) be in \((\mathop{\mathrm{dom}}(\Psi))^2\), with \(y_1 \neq y_2\), and let \(t\) be in \((0,1)\). To ease notations, we denote \(y_i^V=\Pi_V(y_i)\), and \(y_i^\perp = y_i-\Pi_V(y_i)\), \[\begin{align} \Psi(ty_1 + (1-t)y_2) &= \Omega(ty_1^V + (1-t)y_2^V) + \frac{1}{2} ||t y_1^\perp + (1-t)y_2^\perp||^2_2,\\ & < t \Omega(y_1^V) + (1-t)\Omega(y_2^V) + t \frac{1}{2} \|y_1^\perp\|^2 + (1-t)\frac{1}{2} \|y_2^\perp\|^2 ,\\ & = t \Psi(y_1) + (1-t)\Psi(y_2). \end{align}\] The first line is by linearity of the orthogonal projection onto \(V\). Further, as \(y_1 \neq y_2\) we have \(y_1^V \neq y_2^V\) or \(y_1^\perp \neq y_2^\perp\), thus the strict convexity of \(\Omega\) over \(\mathcal{C}\) and of \(\|\cdot\|^2_2\) yields the second line. We have therefore shown that \(\Psi\) is a Legendre-type function.
We now consider its Fenchel conjugate \(\Psi^*\), and study its domain. Let \(\theta \in \mathbb{R}^d\), decomposed as \(\theta = \theta_V + \theta_{V^\perp}\), where \(\theta_V = \Pi_V(\theta)\) and \(\theta_{V^\perp} = \theta - \theta_V\), \[\begin{align} \Psi^*(\theta) &= \sup_{y \in \mathbb{R}^d} \{\langle \theta | y \rangle - \Psi(y)\},\\ & =\sup_{y \in \mathbb{R}^d} \Big\{ \langle \theta_V | \Pi_V(y) \rangle - \Omega(\Pi_V(y)) + \langle \theta_{V^\perp} | y - \Pi_V(y) \rangle - \frac{1}{2} ||y - \Pi_V(y)||^2_2 \Big\},\\ & =\sup_{\substack{y_V \in V, \\ y_{V^\perp} \in V^\perp}} \Big\{ \langle \theta_V | y_V \rangle - \Omega(y_V) + \langle \theta_{V^\perp} | y_{V^\perp} \rangle - \frac{1}{2} ||y_{V^\perp}||^2_2 \Big\},\\ & = \Omega^*(\theta_V) + \frac{1}{2}||\theta_{V^\perp}||^2_2. \end{align}\] Now, since \(\Omega^*\) has full domain using Proposition 3, we have \(\mathop{\mathrm{dom}}(\Psi^*) = \mathbb{R}^d\).
We eventually show the property on the composition of the gradients of \(\Psi\) and \(\Omega^*\). First, we highlight that by Proposition 3, \(\Omega^*\) is indeed differentiable over \(\mathbb{R}^d\). Its gradient corresponds to the regularized prediction defined by Equation 40 , and belongs to the relative interior of the convex compact set \(\mathcal{C}\). Let \(\theta \in \mathbb{R}^d\) be a vector decomposed as \(\theta = \theta_V + \theta_{V^\perp}\), where \(\theta_V = \Pi_V(\theta)\) and \(\theta_{V^\perp} = \theta - \theta_V\). Then we have \[\nabla \Omega^*(\theta) = \nabla \Omega^*(\theta_V) = \underbrace{J_{\Pi_V}}_{\substack{\text{Canonical}\\\text{injection} \\ V\rightarrow \mathbb{R}^d}} \nabla \Omega^*_{|V}(\theta_V).\] Therefore, applying the gradient of \(\Psi\) leads to \[\begin{align} \nabla \Psi \big(\nabla \Omega^*(\theta)\big) &= \nabla \Psi \big(\underbrace{J_{\Pi_V} \nabla \Omega^*_{|V}(\theta_V)}_{\in \mathop{\mathrm{rel\,int}}(\mathcal{C})} + \underbrace{0}_{\in V^\perp}\big), \\ & = J_{\Pi_V} \nabla \Omega_{|V} \big(\nabla \Omega^*_{|V}(\theta_V) \big) + 0,\\ & = \theta_V = \theta \underbrace{- \theta_{V^\perp}}_{z \in V^\perp}. \end{align}\] In the computations above, we use the expression of the gradient of \(\Psi\), and the fact that the restriction \(\Omega_{|V}\) of \(\Omega\) to \(V\) is a Legendre-type function with Fenchel conjugate \(\Omega^*_{|V}\). Therefore, we have shown that there exists a vector \(z \in V^\perp\) such that \(\nabla \Psi \big(\nabla \Omega^*(\theta)\big) = \theta + z\). ◻
Until now in this section, the Fenchel–Young loss has only been introduced in the context of the regularization (see Equation 40 ) of a linear optimization problem \(\max_{\mu \in \mathcal{C}} \langle \theta| \mu \rangle\). However, to deal with arbitrary minimization problems \(\min_{y\in \mathcal{Y}} \; c(y)\) on a finite but combinatorial set \(\mathcal{Y}\), it is convenient to consider regularization on distributions. The proposition below explores regularization on the distribution polytope. We recall that notations are introduced at the end of Section 1.
Proposition 5. Let \(\Omega_{\Delta^{\mathcal{Y}}} \in \Gamma_0(\mathbb{R}^{\mathcal{Y}})\) be a proper l.s.c. convex function with domain \(\Delta^{\mathcal{Y}}\). We drop the \(\mathcal{Y}\) in the notation \(\Omega_\Delta\) when \(\mathcal{Y}\) is clear from context. We assume that the restriction of \(\Omega_{\Delta}\) to \(H_\Delta\), denoted as \(\Omega_{\Delta|H_\Delta}\) is Legendre-type (with respect to the metric of \(H_\Delta\), and not the one of \(\mathbb{R}^{\mathcal{Y}}\)). For \(\mu \in \mathcal{C}\), we define \[\label{eq:omega95moment95from95distribution} \Omega_\mathcal{C}(\mu) := \min\{\Omega_{\Delta}(q)\colon Yq = \mu \}.\qquad{(7)}\]
Let \(\theta \in \mathbb{R}^d\) and \(q \in \Delta^{\mathcal{Y}}\), we have the following properties:
\(\langle s_\theta | q \rangle = \langle Y^\top \theta | q \rangle = \theta^\top Y q = \langle \theta | Y q\rangle = \theta^\top \mu_q\).
\(\Omega_{\mathcal{C}}^*(\theta) = \Omega_{\Delta}^*(Y^\top \theta)\), therefore \(\Omega_\mathcal{C}^*\) has domain \(\mathop{\mathrm{dom}}(\Omega_\mathcal{C}^*) = \mathbb{R}^d\), it is differentiable over its domain and affine over \(V^\perp\).
\(\Omega_\Delta (q)\geq \Omega_\mathcal{C}(\mu_q)\) and \(\mathcal{L}_{\Omega_\Delta}(s_\theta;q) \geq \mathcal{L}_{\Omega_\mathcal{C}}(\theta;\mu_q)\), both with equality if and only if \[{q = \mathop{\mathrm{argmin}}\limits_{q' \in \Delta^{\mathcal{Y}} \colon Yq' = \mu_q}\Omega_\Delta(q')}.\]
\(\min\limits_{\theta'} \mathcal{L}_{\Omega_\Delta}(s_{\theta'};q) \geq \min\limits_{\theta'} \mathcal{L}_{\Omega_\mathcal{C}}(\theta';\mu_q)\), with equality if and only if \({q = \mathop{\mathrm{argmin}}\limits_{q' \in \Delta^{\mathcal{Y}} \colon Yq' = \mu_q}\Omega_\Delta(q')}\).
\(\nabla_\theta \mathcal{L}_{\Omega_\Delta}(s_\theta;q) = \nabla_\theta \mathcal{L}_{\Omega_\mathcal{C}}(\theta;\mu_q) = Y (\nabla\Omega_\Delta^*(s_\theta) - q) = \nabla\Omega_\mathcal{C}^*(\theta) - \mu_q\).
This notion of regularization on distributions, and the way it induces a regularization on the moment space have already been introduced by [3, Sec. 7.1], but in the case of \(\Omega_{\Delta}\) being a generalized negentropy [36].
Proof.
Immediate.
By definition, \[\begin{align} \Omega_\mathcal{C}^*(\theta) = \max_{\mu}\Big( \theta^\top \mu + \max_{q \colon Yq = \mu}- \Omega(q)\Big) &= \max_{\mu, q\colon \mu = Yq}\underbrace{\theta^\top \mu}_{s_\theta^\top q} - \Omega(q), \\ & = \max_{q} s_\theta^\top q - \Omega(q) = \Omega^*_\Delta(s_\theta). \end{align}\] Applying Proposition 3.[lem:Fenchel95conjugate95subdimension95diff] to \(\Omega_\Delta\), we get that \({\mathop{\mathrm{dom}}(\Omega_\Delta^*) = \mathbb{R}^{\mathcal{Y}}}\), and it is differentiable over \(\mathbb{R}^{\mathcal{Y}}\). Composing with a linear map gives the domain and differentiability results. Applying Proposition 3.[lem:conjugate95constant95perp] to \(\Omega_\Delta^*\) with \(V_\Delta^\perp = \mathop{\mathrm{span}}(\mathbf{1})\), we have \(\Omega^*_\Delta\) affine over \(\mathop{\mathrm{span}}(\mathbf{1})\). Besides, \[s_\theta \in \mathop{\mathrm{span}}(\mathbf{1}) \iff \exists \alpha \in \mathbb{R}, \forall y \in \mathcal{Y}, \langle \theta| y \rangle = \alpha \iff \theta \in V^\perp.\]
An immediate consequence of the definition of \(\Omega_\mathcal{C}\) and the previous points.
It follows from properties [prop:objectivesEquality] and [prop:FenchelDualsEquality] that the two minimization problems are equivalent up to a constant.
Consequence of the equality of the losses up to a constant that does not depend on \(\theta\).
◻
Proof of Proposition [prop:Perturbation]. Let \(\varepsilon \in \mathbb{R}_{++}\),
Let \((\theta, Z) \in (\mathbb{R}^d)^2\), since \(\mathcal{C}\) is compact and non-empty, the maximum in the definition 32 of \(F_{\varepsilon, \mathcal{C}}\) is well-defined. The expectation with respect to the normal distribution remains finite, and thus \(\mathop{\mathrm{dom}}(F_{\varepsilon, \mathcal{C}}) = \mathbb{R}^d\). Further, the function \(\theta \mapsto \max_{y \in \mathcal{C}}(\theta + \varepsilon Z)^\top y\) is convex as a maximum of affine functions. Finally, recall that finite convex functions are continuous.
The strict convexity of \(F_{\varepsilon, \mathcal{C}}\) over \(V\) stems directly from the proof of [4], Proposition 2.2. Let now \(\theta = \theta_V + \theta_{V^\perp}\) be any vector in \(\mathbb{R}^d\), and \(y_0\) be any vector in \(\mathcal{C}\), \[\begin{align} F_{\varepsilon, \mathcal{C}}(\theta) = \mathbb{E}[\max_{y \in \mathcal{C}}(\theta_V + \theta_{V^\perp} + \varepsilon \mathbf{Z})^\top y] &= \mathbb{E}[\theta_{V^\perp}^\top y_0 + \max_{y \in \mathcal{C}}(\theta_V + \varepsilon \mathbf{Z})^\top y],\\ & = \theta_{V^\perp}^\top y_0 + F_{\varepsilon, \mathcal{C}}(\theta_V). \end{align}\]
As highlighted by [4], Proposition 3.1, we can apply the technique of [30], Lemma 1.5 using the smoothness of the distribution of the noise variable \(\mathbf{Z}\) to show the smoothness of \(F_{\varepsilon, \mathcal{C}}\). It involves a simple change of variable \(u = \theta + \varepsilon Z\). The expression of the gradient comes from Danskin’s lemma and swap of integration and differentiation.
We first show that the domain of \(F_{\varepsilon, \mathcal{C}}^*\) is \(\mathcal{C}\). Let \(y \in \mathbb{R}^d\), by definition \[F_{\varepsilon, \mathcal{C}}^*(y) = \sup_{\theta \in \mathbb{R}^d}\{\theta^\top y - \mathbb{E}[\max_{y' \in \mathcal{C}}(\theta + \varepsilon \mathbf{Z})^\top y']\}.\]
If \(y \in \mathbb{R}^d \backslash \mathcal{C}\), we can separate it from \(\mathcal{C}\): there exists \(\bar \theta \in \mathbb{R}^d\), and \(\eta >0\) such that for all \(y' \in \mathcal{C}\), \(\langle \bar \theta| y - y'\rangle \geq \eta\). Thus, for any \(Z \in \mathbb{R}^d\), and \(\lambda >0\), we have \[\begin{align} \langle \lambda \bar \theta + \varepsilon Z| y-y'\rangle &\geq \lambda \eta + \langle \varepsilon Z| y-y' \rangle \geq \lambda \eta - ||\varepsilon Z||_2 ||y-y'||_2, \quad \forall y' \in \mathcal{C}. \end{align}\] Since \(\mathcal{C}\) is compact in \(\mathbb{R}^d\), we can consider \(D_{\mathcal{C}, y} :=\sup_{y' \in \mathcal{C}} ||y-y'||_2 < + \infty.\) Minimizing with respect to \(y' \in \mathcal{C}\) yields \[\begin{align} \langle \lambda \bar \theta + \varepsilon Z| y \rangle - \max_{y' \in \mathcal{C}} \langle \lambda \bar \theta + \varepsilon Z | y'\rangle & \geq \lambda \eta - ||\varepsilon Z|| D_{\mathcal{C}, y}. \end{align}\]
Now, we recall that \(\mathbf{Z}\) is centered with distribution \(\nu\) (typically a multivariate standard normal distribution) with finite variance. We thus denote \(N_\nu:= \mathbb{E}_{\mathbf{Z}\sim \nu}[||\mathbf{Z}||_2]< + \infty\) and \(\mathbb{E}[||\varepsilon \mathbf{Z}||_2] = |\varepsilon| N_\nu < + \infty\). Taking the expectation with respect to \(\nu\) of the inequality above we get \[\begin{align} \langle \lambda \bar \theta| y \rangle - \mathbb{E}[\max_{y' \in \mathcal{C}} \langle \lambda \bar \theta + \varepsilon \mathbf{Z}|y'\rangle] & \geq \lambda \eta - |\varepsilon|N_\nu D_{\mathcal{C}, y}. \end{align}\] Therefore, since \(F_{\varepsilon, \mathcal{C}}^*(y)\geq \langle \lambda \bar \theta| y \rangle - \mathbb{E}[\max_{y' \in \mathcal{C}} \langle \lambda \bar \theta + \varepsilon \mathbf{Z}|y'\rangle]\) and considering the limit \(\lambda \to +\infty\) gives us \(F_{\varepsilon, \mathcal{C}}^*(y) = + \infty\).
If \(y \in \mathcal{C}\), since \(\mathbf{Z}\) is centered, \[\begin{align} F_{\varepsilon, \mathcal{C}}^*(y) &= \sup_{\theta \in \mathbb{R}^d}\{\theta^\top y - \mathbb{E}[\max_{y' \in \mathcal{C}}(\theta + \varepsilon \mathbf{Z})^\top y']\},\\ &= \sup_{\theta \in \mathbb{R}^d}\{\mathbb{E}[(\theta+\varepsilon \mathbf{Z})^\top y] - \mathbb{E}[\max_{y' \in \mathcal{C}}(\theta + \varepsilon \mathbf{Z})^\top y']\},\\ & = \sup_{\theta \in \mathbb{R}^d}\{\mathbb{E}[\underbrace{(\theta+\varepsilon \mathbf{Z})^\top y - \max_{y' \in \mathcal{C}}(\theta + \varepsilon \mathbf{Z})^\top y'}_{\leq 0 \text{ since } y \in \mathcal{C}}]\} < +\infty.\\ \end{align}\]
Therefore, we have shown that \(\mathop{\mathrm{dom}}(F_{\varepsilon, \mathcal{C}}^*) = \mathcal{C}\). Point \(2.\) shows that \((F_{\varepsilon, \mathcal{C}})_{|V}\) is strictly convex over \(V\). Using the computations of point \(3.\), we show that \((F_{\varepsilon, \mathcal{C}})_{|V}\) is differentiable over \(V\). It is thus a Legendre-type function with \(\mathop{\mathrm{dom}}\big((F_{\varepsilon, \mathcal{C}})_{|V}\big) = V\). Indeed, point 3 of the essentially smooth definition holds vacuously. To show that \((F_{\varepsilon, \mathcal{C}}^*)_{|H}\) is Legendre-type, we use the fact that it is the conjugate (up to a translation) of \((F_{\varepsilon, \mathcal{C}})_{|V}\) in \(V\). Then, Remark 1 shows that \((F_{\varepsilon, \mathcal{C}}^*)_{|H}\) with domain \(\mathcal{C}\) is a Legendre-type function (with respect to the metric of \(H\)).
This concludes the proof. ◻
Proof of Theorem [prop:SparsePerturbation].
Let \(s_1, s_2 \in \mathbb{R}^{\mathcal{Y}}\). As \(\Delta^{\mathcal{Y}}\) is a polytope, there exists \(q^\sharp_1\) such that \[\begin{align} \max_{q_1 \in \Delta^{\mathcal{Y}}} \langle s_1 | q_1 \rangle - \max_{q_2 \in \Delta^{\mathcal{Y}}} \langle s_2 | q_2 \rangle &= \langle s_1 | q_1^\sharp \rangle - \max_{q_2 \in \Delta^{\mathcal{Y}}} \langle s_2 | q_2 \rangle \leq \langle s_1 - s_2 | q_1^\sharp \rangle \\ &\leq \max_{q \in \Delta^{\mathcal{Y}}}\langle s_1 - s_2 | q \rangle \\ &\leq \max_{q \in \Delta^{\mathcal{Y}}}\| s_1 - s_2\|_2 \|q\|_2 = \| s_1 - s_2\|_2 \end{align}\] where the last equality comes from the definition of \(\Delta^{\mathcal{Y}}\). Thus, \[\begin{align} F_\Delta(s_1) - F_\Delta(s_2) &= \mathbb{E}_{\mathbf{Z}} \big[\max_{q \in \Delta^{\mathcal{Y}}} \langle s_1 + \varepsilon Y^\top \mathbf{Z}| q \rangle - \max_{q \in \Delta^{\mathcal{Y}}} \langle s_2 + \varepsilon Y^\top \mathbf{Z}| q \rangle \big] \leq ||s_1 - s_2||. \end{align}\] By symmetry, we have shown that \(F_\Delta\) is 1-Lipschitz continuous.
The proof relies on the following technical lemma provided just below.
Lemma 6. Let \(\mathcal{Y}\subset \mathbb{R}^d\) be a finite set satisfying Assumption 2. For any vector \(s \in \mathbb{R}^{\mathcal{Y}}\), we denote by \(s(y) \in \mathbb{R}\) the component of \(s\) indexed by \(y \in \mathcal{Y}\). We also consider \(\varepsilon >0\) a positive real number, and \(\mathbf{Z}\), a random variable with standard multivariate normal distribution over \(\mathbb{R}^d\).
For \(i\in\{1,2\}\), let \(f_i(y;Z):=s_i(y)+\varepsilon Z^\top y\). Then, for any distinct \(s_1,s_2\in V_\Delta\), there is not almost surely a point \(y^\star\in\mathcal{Y}\) that maximizes both \(f_i(\cdot;\mathbf{Z})\) over \(\mathcal{Y}\). Then, for any distinct \(s_1,s_2\in V_\Delta\), the event \(\mathop{\mathrm{argmax}}_{y\in\mathcal{Y}}f_1(y;\mathbf{Z})\cap\mathop{\mathrm{argmax}}_{y\in\mathcal{Y}}f_2(y;\mathbf{Z})=\emptyset\) has positive probability.
Let \(t \in (0, 1)\), the lemma above leads to \[\begin{align} \mathbb{P}_{\mathbf{Z}} \Bigg[\max_{y \in \mathcal{Y}} \bigg(t f_1(y; \mathbf{Z}) + (1-t) f_2(y;\mathbf{Z}) \bigg) < & \max_{y \in \mathcal{Y}} t f_1(y; \mathbf{Z}), \\ & + \max_{y \in \mathcal{Y}} (1-t) f_2(y;\mathbf{Z}) \Bigg] > 0. \end{align}\] Since \(F_\Delta\) is convex, this strict inequality with positive probability leads to the strict convexity of \(F_\Delta\) over \(V_\Delta\). Last, using the decomposition \(\mathbb{R}^{\mathcal{Y}} = V_\Delta + \mathop{\mathrm{span}}(\mathbf{1})\), we get the affine property over \(V_\Delta^\perp = \mathop{\mathrm{span}}(\mathbf{1})\) with the same arguments as for Proposition [prop:Perturbation] Point 2.
We first show that the \(\mathop{\mathrm{argmax}}\) in the definition of \(F_{\varepsilon, \Delta}\) is reduced to a singleton almost surely. Indeed, assume that for a pair of vectors \((y,y')\in\mathcal{Y}^2\), \[P_{\mathbf{Z}}\big[ s(y) + \varepsilon \mathbf{Z}^\top y = s(y') + \varepsilon \mathbf{Z}^\top y'\big] > 0,\] then, as \(\varepsilon\mathbf{Z}\) is a non-degenerate Gaussian, it implies that \(\langle \cdot| y-y'\rangle\) is constant (equal to \(s(y')-s(y)\)) on a ball of positive radius, and thus that \(y=y'\).
Note that the uniqueness of the \(\mathop{\mathrm{argmax}}\) in \(\mathcal{Y}\) implies the uniqueness of the corresponding \(\mathop{\mathrm{argmax}}\) in the distribution space \(\Delta^{\mathcal{Y}}\) (see Equation 33 ). Now, as the argmax is almost surely unique, using Danskin’s theorem [37] Theorem 10.31, and swapping integration with respect to the density of \(\mathbf{Z}\) and differentiation with respect to \(s\), we get: \[\nabla_s\mathbb{E}[\max_{q \in \Delta^{\mathcal{Y}}} (s +\varepsilon Y^\top \mathbf{Z})^\top q] = \mathbb{E}[\mathop{\mathrm{argmax}}_{q \in \Delta^{\mathcal{Y}}} (s +\varepsilon Y^\top \mathbf{Z})^\top q].\]
The domain property is proved in the same way as for Proposition [prop:Perturbation] point 4, the rest also yields similarly.
◻
Proof of Lemma 6. Let \((s_1, s_2) \in (V_\Delta)^2, \, s_1 \neq s_2\) be two vectors. We are going to show that \[\mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} \{s_1(y) + \varepsilon Z^\top y \} \,\cap \, \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} \{s_2(y) + \varepsilon Z^\top y \} = \emptyset,\]
for \(Z\) almost everywhere with respect to the Lebesgue measure in an open ball in \(\mathbb{R}^d\). Since \(\mathbf{Z}\) follows a non-degenerate normal distribution, this open ball has positive Gaussian measure, and the result yields.
Suppose first that \(\mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} s_1(y) \cap \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} s_2(y) = \emptyset.\) Then, a ball centered on \(0_{\mathbb{R}^d}\) with sufficiently small radius gives the result.
Let now \(y^*\) be a common maximizer of \(s_1\) and \(s_2\). Since \(s_1\) and \(s_2\) are elements of \({V_\Delta = \mathop{\mathrm{span}}(\mathbf{1})^\perp}\), and they are distinct, they are not equal up to a constant. We can thus fix a \(\bar{y} \in \mathcal{Y}\) such that \(s_1(\bar{y}) - s_1(y^*) \neq s_2(\bar{y}) - s_2(y^*).\)
In particular, it implies that \(\bar y\) does not belong to the intersection of the \(\mathop{\mathrm{argmax}}\), \(\bar y \notin \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} s_1(y) \cap \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} s_2(y).\) Let \(\bar Z\) be in the relative interior of the normal cone of \(\mathop{\mathrm{conv}}(\mathcal{Y})\) at \(\bar y\), such that the function g defined as \(g: y \mapsto \varepsilon \bar Z^\top y,\) is injective over \(\mathcal{Y}\). It is possible since the normal cone is full dimensional, and the union of the hyperplanes where two dot products are equal is not full dimensional. Then, for \(\lambda \in \mathbb{R}_+\) sufficiently large, \(\mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} s_1(y) + \varepsilon \lambda \bar Z^\top y = \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} s_2(y) + \varepsilon \lambda \bar Z^\top y = \{\bar y \}.\)
For \(i \in \{1,2\}\), let us define \(F_i\) as \(F_i : \lambda \in \mathbb{R}\mapsto \max_{y \in \mathcal{Y}}\big(s_i(y) + \varepsilon \lambda \bar Z^\top y \big) - s_i(y^*).\) Note that if there exists \(\lambda^* \in \mathbb{R}\) such that \(\mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} \big(s_i(y) + \lambda^* \varepsilon \bar Z^\top y \big)\) for \(i \in \{1,2\}\) are disjoint singletons, then considering a small enough open ball around the vector \(\lambda^* \bar Z\) gives the result. We now show that such a \(\lambda^*\) exists.
Since \(\mathcal{Y}\) is finite, for \(i\in\{1,2\}\), \(F_i\) is a maximum of a finite number of affine functions in \(\lambda\), it is therefore a piecewise affine function. Since \(g\) is injective, for \(i \in \{1,2\}\), there exists a collection of \(k_i +1\) real numbers, \(k_i \in \mathbb{N}, \, k_i >1\), denoted as \(0=\lambda_0^i< \ldots < \lambda_{k_i}^i\) and a unique collection \(y^* = y_1^i, \ldots, y_{k_i}^i = \bar{y}\) of two-by-two distinct vectors such that \[F_i(\lambda) = s_i(y_j^i) + \varepsilon \lambda \bar Z^\top y_j^i - s_i(y^*), \quad \forall \lambda \in [\lambda_{j-1}^i, \lambda_j^i].\]
Furthermore, the fact that \(g\) is injective implies that \(y_j^i\) is the unique maximizer over \(\mathcal{Y}\) of \(y \mapsto s_i(y) + \varepsilon \lambda \bar Z^\top y\) for \(\lambda \in ]\lambda_{j-1}^i,\lambda_j^i[\). If the collections for \(i \in \{1,2\}\) are not identical, the proof is finished. By contradiction, we assume that the two collections are identical and denote by \({0=\lambda_0< \ldots < \lambda_k}\) and \({y^* = y_1, \ldots, y_k = \bar{y}}\) the common collections.
Let \(\tilde{j}\) be the smallest \(j' \in [k]\) such that \(s_1(y_{j'}) - s_1(y^*) \neq s_2(y_{j'}) - s_2(y^*)\). It exists since the inequality holds for \(\bar{y}\). Without loss of generality, we can assume from now on that \(s_1(y_{\tilde{j}}) - s_1(y^*) > s_2(y_{\tilde{j}}) - s_2(y^*)\). For \(i \in \{1,2\}\), we define \(\tilde{\lambda}_i\) as:
\[\tilde{\lambda}_i := \min \{\lambda \;|\; y_{\tilde{j}} \in \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} \big( s_i(y)+\varepsilon \lambda \bar Z^\top y \big)\}.\]
We eventually get a contradiction by proving \(\tilde{\lambda}_1 < \tilde{\lambda}_2\) with the following inequality. \[\begin{align} & s_2(y_{\tilde{j}}) - s_2(y^*) + \tilde{\lambda}_1 g(y_{\tilde{j}}), \\ &< s_1(y_{\tilde{j}}) - s_1(y^*) + \tilde{\lambda}_1 g(y_{\tilde{j}}), && (\text{hypothesis right above}), \\ &= s_1(y_{\tilde{j}-1}) - s_1(y^*) + \tilde{\lambda}_1 g(y_{\tilde{j}-1}), && \text{(Both y_{\tilde{j}} and y_{\tilde{j}-1} are optimal at the junction)}, \\ &= s_2(y_{\tilde{j}-1})- s_2(y^*) + \tilde{\lambda}_1 g(y_{\tilde{j}-1}), && \text{(by definition of \tilde{j})}. \end{align}\] Hence, for \(\lambda = \tilde{\lambda}_1 + \eta\) with \(\eta> 0\) sufficiently small, \(y_{\tilde{j}}\) is the unique \(\mathop{\mathrm{argmax}}\) of \(s_1(y) + \lambda g(y)\) and \(y_{\tilde{j}-1} \neq y_{\tilde{j}}\) is the unique \(\mathop{\mathrm{argmax}}\) of \(s_2(y) + \lambda g(y)\). ◻
Proof of Proposition [prop:strongConvexitySparsePerturbation] (strong convexity of \(\Omega_{\varepsilon,\Delta}\)). Let \((s_a, s_b) \in (\mathbb{R}^{\mathcal{Y}})^2\). By Theorem [prop:SparsePerturbation], the gradient of \(F_{\varepsilon, \Delta}\) is given by: \[\begin{align} \nabla_s F_{\varepsilon, \Delta}(s) &= \mathbb{E}\left[\mathop{\mathrm{argmax}}_{q \in \Delta^{\mathcal{Y}}} (s + \varepsilon \mathbf{Z})^\top q\right] = \mathbb{E}\left[ \sum_{y \in \mathcal{Y}} e_y \mathbb{1}\left\{ y = \mathop{\mathrm{argmax}}_{y' \in \mathcal{Y}} (s(y') + \varepsilon \langle\mathbf{Z}|{y'}\rangle) \right\} \right], \end{align}\] where \(e_y\) denotes the standard basis vector in \(\mathbb{R}^{\mathcal{Y}}\) corresponding to \(y\). Note that the \(\mathop{\mathrm{argmax}}\) is reduced to a singleton almost surely, as detailed in the proof of Theorem [prop:SparsePerturbation]. Thus, we can bound the distance between the two gradients: \[\begin{align} \|\nabla F_{\varepsilon, \Delta}(s_a) - \nabla F_{\varepsilon, \Delta}(s_b)\|_2 &= \Big\| \mathbb{E}\Big[ \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} (s_a(y) + \varepsilon \langle\mathbf{Z}|y\rangle) - \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} (s_b(y) + \varepsilon \langle\mathbf{Z}|y\rangle) \Big] \Big\|_2 \\ &\leq \mathbb{E}\Big[ \Big\| \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} (s_a(y) + \varepsilon \langle\mathbf{Z}|y\rangle) - \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} (s_b(y) + \varepsilon \langle\mathbf{Z}|y\rangle) \Big\|_2 \Big] \\ &\leq \sum_{(y_1, y_2) \in \mathcal{Y}^2} \|e_{y_1} - e_{y_2}\|_2 P_{y_1, y_2}, \end{align}\]
where \[\begin{align} P_{y_1, y_2} := \mathbb{P}\Big( &y_1 = \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} (s_a(y) + \varepsilon \langle\mathbf{Z}|y\rangle), y_2 = \mathop{\mathrm{argmax}}_{y \in \mathcal{Y}} (s_b(y) + \varepsilon \langle\mathbf{Z}|y\rangle) \Big). \end{align}\] Since \(e_{y_1}\) and \(e_{y_2}\) are vertices of the standard simplex, for any \(y_1 \neq y_2\), we have \(\|e_{y_1} - e_{y_2}\|_2 = \sqrt{2}\).
If the \(\mathop{\mathrm{argmax}}\) shifts from \(y_1\) under \(s_a\) to \(y_2\) under \(s_b\), then the relative order of the scores of \(y_1\) and \(y_2\) must have swapped. In particular: \[\begin{align} s_a(y_1) + \varepsilon \langle\mathbf{Z}|{y_1}\rangle &\geq s_a(y_2) + \varepsilon \langle\mathbf{Z}|{y_2}\rangle \implies \varepsilon(\langle\mathbf{Z}|{y_1}\rangle - \langle\mathbf{Z}|{y_2}\rangle) \geq s_a(y_2) - s_a(y_1) \\ s_b(y_1) + \varepsilon \langle\mathbf{Z}|{y_1}\rangle &\leq s_b(y_2) + \varepsilon \langle\mathbf{Z}|{y_2}\rangle \implies \varepsilon(\langle\mathbf{Z}|{y_1}\rangle - \langle\mathbf{Z}|{y_2}\rangle) \leq s_b(y_2) - s_b(y_1) \end{align}\] Therefore, the probability \(P_{y_1, y_2}\) is upper-bounded by the probability that the random variable \(\varepsilon(\langle\mathbf{Z}|{y_1}\rangle - \langle\mathbf{Z}|{y_2}\rangle)\) falls between \(s_a(y_2) - s_a(y_1)\) and \(s_b(y_2) - s_b(y_1)\). Up to reordering \(a\) and \(b\) to form a valid interval, we obtain: \[\begin{align} P_{y_1, y_2} &\leq \mathbb{P}\left( \varepsilon(\langle\mathbf{Z}|{y_1}\rangle - \langle\mathbf{Z}|{y_2}\rangle) \text{ is strictly between } s_a(y_2) - s_a(y_1) \text{ and } s_b(y_2) - s_b(y_1) \right) \\ &= \mathbb{P}\left( \frac{\langle\mathbf{Z}|{y_1}\rangle - \langle\mathbf{Z}|{y_2}\rangle}{\sqrt{2}} \in I_{y_1, y_2} \right), \end{align}\] where \(I_{y_1, y_2}\) is an interval of length: \[\begin{align} \frac{1}{\varepsilon \sqrt{2}} |(s_b(y_2) - s_b(y_1)) - (s_a(y_2) - s_a(y_1))| &\leq \frac{2}{\varepsilon \sqrt{2}} \|s_a - s_b\|_{\infty} \\ &= \frac{\sqrt{2}}{\varepsilon} \|s_a - s_b\|_{\infty} \leq \frac{\sqrt{2}}{\varepsilon} \|s_a - s_b\|_2. \end{align}\]
Since \(\mathbf{Z}\sim \mathcal{N}(0, I_d)\) is a standard Gaussian in \(\mathbb{R}^d\) and \(\langle\mathbf{Z}|y\rangle := y^\top\mathbf{Z}\), we have \[\frac{\langle\mathbf{Z}|{y_1}\rangle - \langle\mathbf{Z}|{y_2}\rangle}{\sqrt{2}} \sim \mathcal{N}\!\left(0, \frac{||y_1 - y_2||_2^2}{2}\right).\] Given a Gaussian \(X \sim \mathcal{N}(0,\sigma^2)\), we have \(\mathbb{P}(X \in [\alpha, \beta]) \leq \frac{|\beta - \alpha|}{\sqrt{2\pi}\,\sigma}\) since the density is uniformly bounded by \(1/(\sqrt{2\pi}\,\sigma)\).
Applying this to our probability bound yields for \(y_1 \neq y_2\): \[P_{y_1, y_2} \leq \frac{1}{\sqrt{2\pi}} \frac{\sqrt{2}}{||y_1-y_2||_2}\frac{\sqrt{2}}{\varepsilon} \|s_a - s_b\|_2.\]
Let \(m_\mathcal{Y}:= \min_{(y, y') \in \mathcal{Y}^2, y \neq y'}||y-y'||_2\) be the minimum distance between two distinct points in \(\mathcal{Y}\). Substituting this back into the sum, which contains at most \(|\mathcal{Y}|^2\) non-zero terms (since \(P_{y,y}\) doesn’t change relative distance but \(\|e_y-e_y\|_2=0\), we just upper bound the sum generously by considering all \(|\mathcal{Y}|^2\) pairs): \[\begin{align} \|\nabla_s F_{\varepsilon, \Delta}(s_a) - \nabla_s F_{\varepsilon, \Delta}(s_b)\|_2 &\leq \sum_{(y_1, y_2) \in \mathcal{Y}^2} \sqrt{2} \left( \frac{1}{\sqrt{2\pi}} \frac{\sqrt{2}}{m_\mathcal{Y}} \frac{\sqrt{2}}{\varepsilon} \|s_a - s_b\|_2 \right) \\ &\leq \frac{2|\mathcal{Y}|^2}{\varepsilon m_\mathcal{Y}\sqrt{\pi}} \|s_a - s_b\|_2 \end{align}\] which gives the desired Lipschitz constant \(L\).
Finally, knowing that \(F_{\varepsilon, \Delta}\) is a convex function with an \(L\)-Lipschitz continuous gradient, standard duality results in convex analysis dictate that its Fenchel conjugate \(\Omega_{\varepsilon, \Delta}\) is \((1/L)\)-strongly convex. This strong convexity is on \(H_\Delta\) and with respect to \(||\cdot||_2\). Therefore, \(\Omega_{\varepsilon, \Delta}\) is strongly convex on \(H_\Delta\) with respect to \(||\cdot||_2\) with parameter: \(\mu = \frac{1}{L} = \frac{\varepsilon m_\mathcal{Y}\sqrt{\pi}}{2|\mathcal{Y}|^{2}}.\) ◻
Proof of Proposition [prop:structuredPredictionSparsePerturbation] (structured prediction regularizer with sparse perturbation). By definition, \(F_{\varepsilon, \mathcal{C}}(\theta) = F_{\varepsilon, \Delta}(Y^\top \theta)\). Besides, since \(\Omega_{\varepsilon, \mathcal{C}}\) and \(\Omega_{\varepsilon, \Delta}\) are proper convex lower-semicontinuous, they are bi-conjugate by Fenchel-Moreau theorem. Applying the computations of [38], Corollary 15.28 with \(g = F_{\varepsilon, \Delta}\) and \({L : x \mapsto Y^\top x}\) leads to the result. ◻
At this point, we now have all the elements needed to prove the two main propositions that underpin the tractability of updates 24 25 .
Proof of Proposition [prop:computations95primal95dual95dist]. To derive Equation 24 remark the following. First, \(\mathcal{S}_{\Omega_\Delta,N}\) is defined as the sum of \(S_{\Omega_\Delta}\), and since \(\bar w^{(t)}\) is fixed, we obtain \(N\) independent problems. Now, using the expression of \(S_{\Omega_\Delta}\), we see that \(q_i^{(t+1)}\) belongs to the minimizers of \[\Omega_{\Delta^{\mathcal{Y}(x_i)}}(\cdot) - \langle Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i | \cdot \rangle.\] Using Fenchel duality, we recognize \(\nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*\big(Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i\big)\).
For the dual update in Equation 25 , using the expression of \(S_{\Omega_\Delta}\), and omitting the term that does not depend on \(w\), we can first recast Equation 23 as \[\bar w^{(t+1)} \in \mathop{\mathrm{argmin}}_{w \in \mathcal{W}} \frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\Delta(x_i)}}\big(Y(x_i)^\top \varphi_w(x_i); q_i^{(t+1)}\big).\] Now, we leverage the computations of Section 6.3. In particular, based on the regularization function \(\Omega_{\Delta^{\mathcal{Y}(x)}}\) on distributions in \(\Delta^{\mathcal{Y}(x)}\), we define a regularization function \(\Omega_{\mathcal{C}(x)}\) on the moment space \({\mathcal{C}(x) = \mathop{\mathrm{conv}}(\mathcal{Y}(x))}\) as in Equation ?? . We then use Proposition 5, more precisely Points [prop:objectivesEquality]-[prop:FenchelDualsEquality], to get Equation 25 . ◻
Proof of Proposition [prop:primal95dual95perturbation]. For the primal update in Equation 26 , we can reformulate Equation 24 in this perturbation setting \[\begin{align*} \mu_i^{(t+1)} &= Y(x_i)q_i^{(t+1)} = Y(x_i)\nabla F_{\varepsilon, \Delta(x_i)}\big(Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i \big),\\ &= Y(x_i)\mathbb{E}_\mathbf{Z}\big[\mathop{\mathrm{argmax}}_{q_i \in \Delta^{\mathcal{Y}(x_i)}} \langle Y(x_i)^\top\varphi_{\bar w^{(t)}}(x_i) - \frac{1}{\kappa}\gamma_i + \varepsilon Y(x_i)^\top \mathbf{Z}| q_i \rangle \big],\\ &= \mathbb{E}_\mathbf{Z}\big[Y(x_i)\mathop{\mathrm{argmin}}_{q_i \in \Delta^{\mathcal{Y}(x_i)}}\langle \big(\frac{1}{\kappa}c(x_i,y,\xi_i) - (\varphi_{\bar w^{(t)}}(x_i) + \varepsilon \mathbf{Z})^\top y\big)_{y \in \mathcal{Y}(x_i)}| q_i \rangle \big],\\ &= \mathbb{E}_\mathbf{Z}\big[\mathop{\mathrm{argmin}}_{y_i \in \mathcal{Y}(x_i)} c(x_i,y_i,\xi_i) - \kappa (\varphi_{\bar w^{(t)}}(x_i) + \varepsilon \mathbf{Z})^\top y_i \big]. \end{align*} \label{eq:decomposition95dist95pert}\tag{41}\] In the computations above, we use Theorem [prop:SparsePerturbation] for the expression of the gradient of the function \(F_{\varepsilon, \Delta(x_i)}\), and the fact that the minimum of the linear optimization problem in \(q_i\) is attained (almost surely) at a vertex of the simplex \(\Delta^{\mathcal{Y}(x_i)}\), corresponding to a Dirac on a point \(y_i \in \mathcal{Y}(x_i)\). We see that the two constants \(\kappa\) and \(\varepsilon\) play similar roles in this setting; a formal equivalence between tuning one parameter versus the other is established in Appendix 7.5. Up to a re-normalization of the statistical model \(\varphi_w\), we keep the hyper-parameter \(\varepsilon\) to tune the regularization scale.
For the dual update in Equation 25 , we simply use the expression of the Fenchel–Young loss in the perturbation setting and omit the terms that do not depend on \(w\). ◻
Proof of Proposition [prop:barOmegaProperties]. Recall that \(H_i:=\mathop{\mathrm{aff}}(\mathcal{P}_i)\), that \(V_i\) is its direction space, and that \(\bar\mathcal{W}=\sum_{i=1}^N A_iV_i\). We regard \(\bar\mathcal{W}\) as a Euclidean space with the inner product inherited from \(\mathbb{R}^d\). Set \[\bar F(\bar w) := \frac{1}{N}\sum_{i=1}^N \Omega_{\mathcal{P}_i}^* \big(A_i^\top J_{\Pi_{\bar\mathcal{W}}}\bar w\big), \qquad \Phi(\pi_\otimes) := \frac{1}{N}\sum_{i=1}^N\Omega_{\mathcal{P}_i}(\pi_i),\] and define \(B\pi_\otimes:=N^{-1}\sum_i\Pi_{\bar\mathcal{W}}A_i\pi_i\).
For each \(i\), choose \(a_i\in H_i\) and define, for \(v\in V_i\), \(\widetilde{\Omega}_i(v) := \Omega_{\mathcal{P}_i}(a_i+v).\) On \(V_i\), \(\widetilde{\Omega}_i\) is closed, proper, and of Legendre type. Since its domain \(\mathcal{P}_i-a_i\) is compact, its conjugate is finite on all of \(V_i\). Hence, by [17], Theorem 26.5, \(\widetilde{\Omega}_i^*\) is of Legendre type and, in particular, strictly convex on \(V_i\).
Moreover, for every \(s\in\mathbb{R}^{d_i}\), \(\Omega_{\mathcal{P}_i}^*(s) = \langle s,a_i\rangle + \widetilde{\Omega}_i^*(\Pi_{V_i}s).\) Thus \(\Omega_{\mathcal{P}_i}^*\) is finite and continuously differentiable on \(\mathbb{R}^{d_i}\), affine along \(V_i^\perp\), and strictly convex along every segment whose direction does not belong to \(V_i^\perp\).
Let \(\bar w_a\neq\bar w_b\) and set \(u:=J_{\Pi_{\bar\mathcal{W}}}(\bar w_a-\bar w_b)\). If \(A_i^\top u\in V_i^\perp\) for every \(i\), then \(\langle u,A_iv_i\rangle=0\) for every \(v_i\in V_i\). Hence \(u\perp\sum_iA_iV_i=\bar\mathcal{W}\). Since \(u\in\bar\mathcal{W}\), this would give \(u=0\), a contradiction. Thus at least one summand of \(\bar F\) is strictly convex along \([\bar w_a,\bar w_b]\), while all the others are convex. Therefore \(\bar F\) is strictly convex. Since it is differentiable on its whole domain \(\bar\mathcal{W}\), it is of Legendre type. Furthermore, \(\bar F\) is closed, and hence \(\bar F=\bar F^{**}=\Omega_{\bar\mathcal{M}}^*\) by [17], Theorem 12.2.
Now let \(p:=B\Phi\) be the image function \[p(\bar\nu) := \inf\{\Phi(\pi_\otimes)\colon B\pi_\otimes=\bar\nu\}.\] Since \(\mathop{\mathrm{dom}}\Phi=\prod_i\mathcal{P}_i\) is compact, \(p\) is proper and lower semicontinuous, and its infimum is attained whenever it is finite; it is convex by [17], Theorem 5.7. Moreover, [17], Theorem 16.3 gives \(p^*=\Phi^*\circ B^*\). Since \(B^*\bar w=(N^{-1}A_i^\top J_{\Pi_{\bar\mathcal{W}}}\bar w)_i\), the scaling rule for conjugates yields \[p^*(\bar w) = \frac{1}{N}\sum_{i=1}^N \Omega_{\mathcal{P}_i}^* \big(A_i^\top J_{\Pi_{\bar\mathcal{W}}}\bar w\big) = \bar F(\bar w).\] Therefore, again by [17], Theorem 12.2, \(\Omega_{\bar\mathcal{M}}=\bar F^*=p^{**}=p\), which proves 37 . It also gives \[\mathop{\mathrm{dom}}\Omega_{\bar\mathcal{M}} = B\Big(\prod_{i=1}^N\mathop{\mathrm{dom}}\Omega_{\mathcal{P}_i}\Big) = \bar\mathcal{M}.\]
Finally, let \(\bar\nu\in\mathop{\mathrm{rel\,int}}(\bar\mathcal{M})\). By [17], Theorem 26.5, \[\bar w:=\nabla\Omega_{\bar\mathcal{M}}(\bar\nu) \quad\text{satisfies}\quad \bar\nu=\nabla\bar F(\bar w).\] Define \(\pi_i := \nabla\Omega_{\mathcal{P}_i}^* \big(A_i^\top J_{\Pi_{\bar\mathcal{W}}}\bar w\big).\) Differentiating \(\bar F\) gives \(B\pi_\otimes=\bar\nu\). Furthermore, Fenchel’s equality [17] Theorem 23.5, applied to each \(i\), gives \[\Phi(\pi_\otimes) = \langle\bar w,B\pi_\otimes\rangle-\bar F(\bar w) = \langle\bar w,\bar\nu\rangle-\bar F(\bar w) = \Omega_{\bar\mathcal{M}}(\bar\nu).\] Thus \(\pi_\otimes\) attains the minimum in 37 , with the claimed expression. ◻
Proof of Proposition [prop:FYLandCalM]. We first prove Equation 38 . By definition, the parameter \(w\) minimizes the empirical average of the Fenchel–Young losses. Expanding the loss, the objective to minimize is: \[\frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{P}_i}}(A_i^\top w, \pi_i) = \frac{1}{N} \sum_{i=1}^N \Big( \Omega_{\mathcal{P}_i}(\pi_i) + \Omega_{\mathcal{P}_i}^*(A_i^\top w) - \langle A_i^\top w, \pi_i \rangle \Big).\] Because \(\pi_i\) is fixed, minimizing this objective with respect to \(w\) is equivalent to minimizing: \[\frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}^*(A_i^\top w) - \Big\langle w, \frac{1}{N} \sum_{i=1}^N A_i \pi_i \Big\rangle.\] By introducing the aggregated moment \(\nu = \frac{1}{N} \sum_{i=1}^N A_i \pi_i\), the unconstrained minimization problem for the full parameter \(w\) is exactly the minimization of \(\frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}^*(A_i^\top w) - \langle w, \nu \rangle\).
We restrict our attention to the identifiable parameter \(\bar w = \Pi_{\bar \mathcal{W}}(w)\) via the canonical injection \(w = J_{\Pi_{\bar \mathcal{W}}} \bar w\). The objective mapped to the identifiable space \(\bar \mathcal{W}\) becomes: \[\underbrace{\frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}^*(A_i^\top J_{\Pi_{\bar \mathcal{W}}} \bar w)}_{= \bar F(\bar w)} - \langle J_{\Pi_{\bar \mathcal{W}}} \bar w, \nu \rangle.\] Using the adjoint property of the canonical injection \(J_{\Pi_{\bar \mathcal{W}}}\), we have \(\langle J_{\Pi_{\bar \mathcal{W}}} \bar w, \nu \rangle = \langle \bar w, \Pi_{\bar \mathcal{W}}(\nu) \rangle = \langle \bar w, \bar \nu \rangle\). Thus, \(\bar w\) minimizes the strictly convex function \(\bar F(\bar w) - \langle \bar w, \bar \nu \rangle\). The first-order optimality condition yields: \[\nabla \bar F(\bar w) - \bar \nu = 0 \implies \bar \nu = \nabla \bar F(\bar w).\] Because \(\bar F\) is of Legendre type on the identifiable space, its gradient map is a bijection and we can invert it using the Fenchel conjugate \(\Omega_{\bar \mathcal{M}} = \bar F^*\). This gives \(\bar w = \nabla \Omega_{\bar \mathcal{M}}(\bar \nu)\), which is precisely \(\Pi_{\bar \mathcal{W}}(w) = \nabla \Omega_{\bar \mathcal{M}}\big(\Pi_{\bar \mathcal{W}}(\nu)\big)\), proving Equation 38 .
We now prove Equation 39 . Let us evaluate the average Fenchel–Young loss on the identifiable space using \(\bar w\): \[\begin{align} \frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{P}_i}}\big(A_i^\top J_{\Pi_{\bar \mathcal{W}}}\bar w, \pi_i\big) &= \frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}(\pi_i) + \underbrace{\frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}^*(A_i^\top J_{\Pi_{\bar \mathcal{W}}}\bar w)}_{= \bar F(\bar w)} \\ &\quad - \Big\langle J_{\Pi_{\bar \mathcal{W}}}\bar w, \frac{1}{N} \sum_{i=1}^N A_i \pi_i \Big\rangle. \end{align}\] Substituting \(\nu = \frac{1}{N} \sum_{i=1}^N A_i \pi_i\) and reusing the adjoint property \(\langle J_{\Pi_{\bar \mathcal{W}}}\bar w, \nu \rangle = \langle \bar w, \bar \nu \rangle\), the equation simplifies to: \[\frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{P}_i}}\big(A_i^\top J_{\Pi_{\bar \mathcal{W}}}\bar w, \pi_i\big) = \frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}(\pi_i) + \bar F(\bar w) - \langle \bar w, \bar \nu \rangle.\] From the first part of the proof, we established that \(\bar w = \nabla \Omega_{\bar \mathcal{M}}(\bar \nu)\) and \(\bar \nu = \nabla \bar F(\bar w)\). Because \((\bar w, \bar \nu)\) form a conjugate pair linked by the gradient of the Legendre-type function \(\bar F\), Fenchel’s equality holds tightly: \[\bar F(\bar w) + \Omega_{\bar \mathcal{M}}(\bar \nu) = \langle \bar w, \bar \nu \rangle \implies \bar F(\bar w) - \langle \bar w, \bar \nu \rangle = - \Omega_{\bar \mathcal{M}}(\bar \nu).\] Substituting this relation back into our expanded loss expression yields: \[\frac{1}{N} \sum_{i=1}^N \mathcal{L}_{\Omega_{\mathcal{P}_i}}\big(A_i^\top J_{\Pi_{\bar \mathcal{W}}}\bar w, \pi_i\big) = \frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{P}_i}(\pi_i) - \Omega_{\bar \mathcal{M}}(\bar \nu),\] which establishes Equation 39 , concluding the proof. ◻
We now specialize these results to the primal-dual setting of the paper, given in Section 2.4.
Proof of Proposition [prop:contextualRegularization]. The first four statements of the proposition follow directly as a corollary of Proposition [prop:barOmegaProperties]. By setting the polytopes \(\mathcal{P}_i = \Delta^{\mathcal{Y}(x_i)}\), and the linear operators \(A_i = \phi_i Y(x_i)\), the function \(\bar{F}(\bar{w})\) defined in this section perfectly matches the aggregate dual regularizer \(\bar{F}\) of Proposition [prop:barOmegaProperties]. Since the restriction of \(\Omega_{\Delta^{\mathcal{Y}(x_i)}}\) to its affine hull \(H_{\Delta}\) is of Legendre type, it satisfies all structural requirements of Proposition [prop:barOmegaProperties]. Consequently, \(\bar{F}\) is of Legendre type, \(\Omega_{\bar{\mathcal{M}}} = \bar{F}^*\), the infimal convolution expression 27 holds, the domain is \(\bar{\mathcal{M}}\), and the minimum is attained at \(q_i = \nabla \Omega_{\Delta^{\mathcal{Y}(x_i)}}^*(Y(x_i)^\top \phi_i^\top J_{\Pi_{\bar\mathcal{W}}} \nabla \Omega_{\bar{\mathcal{M}}}(\bar{\nu}))\).
We now prove Equations 28 and 29 . These equations follow directly as a corollary of the Proposition [prop:FYLandCalM] using the same definition of \(\mathcal{P}_i\), \(\Omega_{\mathcal{P}_i}\), and \(A_i\) as above. The unconstrained minimization of the coordination loss and the definition of the aggregated moment \(\nu = \frac{1}{N} \sum_{i=1}^N \phi_i Y(x_i) q_i\) exactly match the premises of the proposition. Applying the proposition immediately yields the dual parameter mapping \(\Pi_{\bar \mathcal{W}}(w) = \nabla \Omega_{\bar \mathcal{M}}\big(\Pi_{\bar \mathcal{W}}(\nu)\big)\) of Equation 28 and the cross Jensen gap equality of Equation 29 , concluding the proof. ◻
Proof of Theorem [theo:proximalPointOperator]. We proceed by induction. The base case \(t=0\) holds by construction: both algorithms are initialized at \(\bar \nu^{(0)} = \nabla \Omega_{\bar \mathcal{M}}^*(\bar w^{(0)})\). Assume that at step \(t\), \(\bar \nu^{(t)} = \nabla \Omega_{\bar \mathcal{M}}^*(\bar w^{(t)})\), where we denote the identifiable parameter as \(\bar w^{(t)} = \Pi_{\bar \mathcal{W}}(w^{(t)})\). Because \(\Omega_{\bar \mathcal{M}}\) is of Legendre type on the full-dimensional \(\bar\mathcal{M}\), we have \(\bar w^{(t)} = \nabla \Omega_{\bar \mathcal{M}}(\bar \nu^{(t)})\) and \(D_{\Omega_{\bar \mathcal{M}}}(\bar \nu \mid \bar \nu^{(t)}) = \mathcal{L}_{\Omega_{\bar \mathcal{M}}}(\bar w ^{(t)}, \bar \nu)\).
The update rule for the Bregman proximal algorithm is: \[\bar \nu^{(t+1)} = \mathop{\mathrm{argmin}}_{\bar \nu \in \bar \mathcal{M}} f_\kappa(\bar \nu) + \kappa D_{\Omega_{\bar \mathcal{M}}}\big(\bar \nu \mid \bar \nu^{(t)}\big) = \mathop{\mathrm{argmin}}_{\bar \nu \in \bar \mathcal{M}} f_\kappa(\bar \nu) + \kappa \mathcal{L}_{\Omega_{\bar \mathcal{M}}}(\bar w ^{(t)}, \bar \nu) .\] Let us now detail the minimization problem \[\begin{align} &\min_{\bar \nu \in \bar \mathcal{M}} f_\kappa(\bar \nu) + \kappa \mathcal{L}_{\Omega_{\bar \mathcal{M}}}(\bar w ^{(t)}, \bar \nu)\\ &= \left| \begin{aligned} \min_{\bar \nu, \bar q} \frac{1}{N} \,&\sum_{i=1}^N \Big( \langle \gamma_i, q_i \rangle + \big(\kappa \Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) + \kappa\overbrace{\Omega_{\Delta^{\mathcal{Y}(x_i)}}^*(Y_i^\top\phi_i^\top J_{\Pi_{\bar \mathcal{W}}} \bar w^{(t)} )}^{\text{constant}} \\ &\qquad - \kappa\langle Y_i^\top\phi_i^\top J_{\Pi_{\bar \mathcal{W}}} \bar w^{(t)} | q_i \rangle \big) \Big) \\ s.t.\colon\, & \frac{1}{N} \sum_{i=1}^N \Pi_{\bar \mathcal{W}}\big(\phi_i Y(x_i) q_i\big) = \bar \nu \end{aligned} \right. \end{align}\] where we have used the definition of \(f_{\kappa}\) and \(\Omega_{\bar \mathcal{M}}^*(\bar w^{(t)})\) (Proposition [prop:barOmegaProperties].1 and Equation 36 ), brought the Fenchel–Young loss within the minimization in \(q_{\otimes}\), merged the two minimizations in \(\bar \nu\) and \(q_{\otimes}\), and simplified \(\kappa \Omega_{\bar \mathcal{M}}(\bar \nu)\), which appears with a negative sign in \(f_\kappa(\bar \nu)\) and a positive sign in the Fenchel–Young loss. Observe that since we minimize jointly in \(q_{\otimes}\) and \(\bar \nu\), we can just minimize in \(q_{\otimes}\) without constraint and define \(\bar \nu = \frac{1}{N} \sum_{i=1}^N \Pi_{\bar \mathcal{W}}\big(\phi_i Y(x_i) q_i\big)\) a posteriori. Furthermore, the minimization decomposes by \(i\), and we get \[\begin{align} \tilde{q}_i &= \mathop{\mathrm{argmin}}_{q_i} \langle \gamma_i, q_i \rangle + \kappa\big( \Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) - \langle Y_i^\top\phi_i^\top J_{\Pi_{\bar \mathcal{W}}} \bar w^{(t)} | q_i \rangle \big) \\ &= \mathop{\mathrm{argmin}}_{q_i \in \Delta^{\mathcal{Y}(x_i)}} \langle \gamma_i, q_i \rangle + \kappa\mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}(x_i)}}}(Y_i^\top\phi_i^\top J_{\Pi_{\bar \mathcal{W}}} \bar w^{(t)},q_i) \\ &= \mathop{\mathrm{argmin}}_{q_i \in \Delta^{\mathcal{Y}(x_i)}} \langle \gamma_i, q_i \rangle + \kappa \mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}(x_i)}}}(Y_i^\top\phi_i^\top w^{(t)},q_i)\\ \bar \nu^{(t+1)} &= \frac{1}{N}\Pi_{\bar \mathcal{W}} \sum_{i=1}^N \phi_iY_i\tilde{q}_i,\\ \Pi_{\bar \mathcal{W}}(\tilde{w}) &= \nabla \Omega_{\bar \mathcal{M}}(\bar \nu^{(t+1)}) \quad \text{where} \quad\tilde{w} \in \mathop{\mathrm{argmin}}\frac{1}{N}\sum_{i=1}^N \mathcal{L}_{\Omega_{\Delta^{\mathcal{Y}(x_i)}}}(Y_i^\top\phi_i^\top w,\tilde{q}_i) \end{align}\] where the first two minima are equal up to a constant by definition of Fenchel–Young losses, and the last two are again equal up to a constant by Proposition 3.2. The remaining equalities follow from Proposition [prop:contextualRegularization]. These are exactly the iterates of our alternating minimization, and we therefore obtain the induction hypothesis and the theorem. ◻
Proof of Proposition [prop:convexityfkappa]. Set \(Aq_\otimes:=\bar\nu(q_\otimes)\) and define \[H(q_\otimes):= \frac{1}{N}\sum_{i=1}^N\langle\gamma_i,q_i\rangle +\kappa\left( \frac{1}{N}\sum_{i=1}^N\Omega_{\Delta^{\mathcal{Y}(x_i)}}(q_i) -\Omega_{\bar\mathcal{M}}(Aq_\otimes) \right) +\mathbb{I}_{\Delta_\otimes}(q_\otimes).\] By assumption, the cross Jensen gap is convex; hence \(H\) is convex. Moreover, by 30 , \(f_\kappa(\bar\nu)=\inf\{H(q_\otimes)\colon Aq_\otimes=\bar\nu\}\). Thus \(f_\kappa\) is the image function of \(H\) under the linear map \(A\), and is convex by [17], Theorem 5.7. ◻
In this appendix, we prove Theorem [thm:bound95risk]. We first derive an exact expression for the difference between the empirical cost and the partial surrogate for one observation. Averaging this identity gives the dataset-level bound, from which the comparison between the two global minimizers follows.
Proof. We first consider a single observation and omit the dependence on \(x\) and \(\xi\) to alleviate notation. Set \(F:=\Omega_\Delta^*\) and \(s:=Y^\top\theta\). As the partial surrogate 17 is obtained by partially minimizing the surrogate 14 , we have \[\begin{align} \underline{\mathcal{S}_{\Omega_\Delta}}(\theta) &= \min_{q\in\Delta^\mathcal{Y}} \left\{ \langle\gamma\mid q\rangle + \kappa\big( \Omega_\Delta(q)+F(s)-\langle s\mid q\rangle \big) \right\} \\ &= \kappa F(s) + \kappa \min_{q\in\Delta^\mathcal{Y}} \left\{ \Omega_\Delta(q)-\langle s-\gamma/\kappa\mid q\rangle \right\} = \kappa\Big(F(s)-F(s-\gamma/\kappa)\Big), \end{align}\] where the last equality follows from the definition of the Fenchel conjugate.
The policy associated with \(s\) is \(\nabla F(s)\), so its expected cost is \(R_\Delta(\nabla F(s))=\langle\gamma\mid\nabla F(s)\rangle\) (see 11 ). Consequently, \[\begin{align} R_\Delta(\nabla F(s)) - \underline{\mathcal{S}_{\Omega_\Delta}}(\theta) &= \kappa\left( F(s-\gamma/\kappa)-F(s) + \langle\nabla F(s)\mid\gamma/\kappa\rangle \right) = \kappa D_F(s-\gamma/\kappa\mid s). \end{align}\] This quantity is nonnegative by convexity of \(F\). Since \(\nabla F\) is \(1/L_x\)-Lipschitz-continuous, the descent lemma (see e.g. [16] Lemma 3.1), applied at \(u=s-\gamma/\kappa\) and \(v=s\), gives \(D_F(s-\gamma/\kappa\mid s)\leq\|\gamma/\kappa\|^2/(2L_x)\). This proves 18 .
Applying this identity to each observation and averaging proves 19 . In particular, \(\underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_w) \leq\mathcal{R}_{\Omega_\Delta,N}(\varphi_w)\) for every \(w\in\mathcal{W}\). Finally, by optimality of \(w_{\mathcal{S}}\) and the preceding one-sided inequality, \(\underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_{w_{\mathcal{S}}}) \leq \underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_{w_{\mathcal{R}}}) \leq \mathcal{R}_{\Omega_\Delta,N}(\varphi_{w_{\mathcal{R}}}).\) It follows that \[\mathcal{R}_{\Omega_\Delta,N}(\varphi_{w_{\mathcal{S}}}) - \mathcal{R}_{\Omega_\Delta,N}(\varphi_{w_{\mathcal{R}}}) \leq \mathcal{R}_{\Omega_\Delta,N}(\varphi_{w_{\mathcal{S}}}) - \underline{\mathcal{S}_{\Omega_\Delta,N}}(\varphi_{w_{\mathcal{S}}}),\] and 20 follows from 19 . ◻
We make precise the remark made in the proof of Proposition [prop:primal95dual95perturbation] (Appendix 7.2) that the regularization weight \(\kappa\) and the perturbation scale \(\varepsilon\) “play similar roles”. We show this in the non-contextual setting, where a single score vector \(\theta\) is shared by all scenarios: the two hyperparameters then act on the alternating scheme only through their product, so that fixing one to \(1\) and tuning the other explores exactly the same set of algorithm trajectories as tuning the other hyperparameter alone.
We place ourselves in the non-contextual alternating minimization scheme, with feasible set \(\mathcal{Y}\), costs \(c_i(\cdot) := c(\cdot,\xi_i)\), and the sparse perturbation regularizer \(\Omega_{\varepsilon,\mathcal{C}} := F_{\varepsilon,\mathcal{C}}^*\) shared by every scenario. Fix \(\kappa>0\) and \(\varepsilon>0\), and let \(\big(\theta^{(t)}(\kappa,\varepsilon), \mu_i^{(t)}(\kappa,\varepsilon)\big)_{i\in[N],\,t\ge0}\) denote the iterates of this scheme, started from \(\theta^{(0)}(\kappa,\varepsilon)=0\).
Proposition 7. For every \(\lambda>0\), \(i \in [N]\), and \(t \geq 0\), \[\mu_i^{(t)}(\kappa,\varepsilon) = \mu_i^{(t)}\Big(\frac{\kappa}{\lambda},\;\lambda\varepsilon\Big), \qquad \theta^{(t)}(\kappa,\varepsilon) = \frac{1}{\lambda}\,\theta^{(t)}\Big(\frac{\kappa}{\lambda},\;\lambda\varepsilon\Big).\] Consequently, the whole trajectory of the alternating scheme – and hence the learned policies – depends on \((\kappa,\varepsilon)\) only through the product \(\kappa\varepsilon\). In particular, fixing \(\kappa=1\) and tuning \(\varepsilon\) explores exactly the same family of trajectories as fixing \(\varepsilon=1\) and tuning \(\kappa\).
Proof. Step 1: invariance of the primal update. Fix \(i\in[N]\), \(t\ge0\), and let \(\theta \in \mathbb{R}^d\). For every \(\lambda>0\) and every realization of \(\mathbf{Z}\), \[c_i(y) - \kappa(\theta + \varepsilon \mathbf{Z})^\top y \;= \;c_i(y) - \frac{\kappa}{\lambda}\big(\lambda\theta + \lambda\varepsilon \mathbf{Z}\big)^\top y, \qquad \forall y \in \mathcal{Y},\] the two sides are identical as functions of \(y\), so their \(\mathop{\mathrm{argmin}}\) over \(y \in \mathcal{Y}\), and thus its expectation under \(\mathbf{Z}\), coincide. Writing \(\mu_i^{(t+1)}(\kappa,\varepsilon,\theta)\) for the corresponding primal update, we get \[\label{eq:primal95invariance} \mu_i^{(t+1)}(\kappa,\varepsilon,\theta) \;= \;\mu_i^{(t+1)}\Big(\frac{\kappa}{\lambda},\;\lambda\varepsilon,\;\lambda\theta\Big), \qquad \forall \lambda>0.\tag{42}\]
Step 2: scaling law of \(F_{\varepsilon,\mathcal{C}}\) and \(\Omega_{\varepsilon,\mathcal{C}}\). By definition 32 , for every \(\theta\in\mathbb{R}^d\) and \(\varepsilon>0\), \[F_{\varepsilon,\mathcal{C}}(\theta) = \mathbb{E}\big[\max_{y \in \mathcal{Y}}(\theta+\varepsilon \mathbf{Z})^\top y\big] = \varepsilon\, \mathbb{E}\big[\max_{y \in \mathcal{Y}}(\theta/\varepsilon+\mathbf{Z})^\top y\big] = \varepsilon\, F_{1,\mathcal{C}}(\theta/\varepsilon).\] Taking Fenchel conjugates on both sides (using that conjugation of \(\theta \mapsto \varepsilon g(\theta/\varepsilon)\) yields \(\varepsilon g^*\) for any \(g\)), \[\Omega_{\varepsilon,\mathcal{C}} = \varepsilon\,\Omega_{1,\mathcal{C}}, \qquad \text{hence} \qquad \nabla\Omega_{\varepsilon,\mathcal{C}|_V} = \varepsilon\,\nabla\Omega_{1,\mathcal{C}|_V}.\]
Step 3: dual update. The coordination step reads, with \(\bar\mu^{(t+1)} := \frac{1}{N}\sum_{i=1}^N \mu_i^{(t+1)}\), \[\theta^{(t+1)} \in \mathop{\mathrm{argmin}}_{\theta \in \mathbb{R}^d} \frac{1}{N}\sum_{i=1}^N\mathcal{L}_{\Omega_{\varepsilon,\mathcal{C}}}\big(\theta; \mu_i^{(t+1)}\big) = \frac{1}{N}\sum_{i=1}^N\Omega_{\varepsilon,\mathcal{C}}\big(\mu_i^{(t+1)}\big) + F_{\varepsilon,\mathcal{C}}(\theta) - \langle \theta \,|\, \bar\mu^{(t+1)}\rangle,\] using \(\Omega_{\varepsilon,\mathcal{C}}^* = F_{\varepsilon,\mathcal{C}}\). Write \(\theta = \theta_V + \theta_{V^\perp}\) with \(\theta_V = \Pi_V(\theta)\). By Point 2 of Theorem [prop:SparsePerturbation], for any fixed \(y_0 \in \mathcal{C}\), \[F_{\varepsilon,\mathcal{C}}(\theta) = \langle y_0 \mid \theta_{V^\perp}\rangle + F_{\varepsilon,\mathcal{C}}(\theta_V).\] Since \(\bar\mu^{(t+1)} \in \mathcal{C}\subset H = y_0 + V\), its \(V^\perp\)-component equals \(y_0\), so \(\langle \theta \mid \bar\mu^{(t+1)}\rangle = \langle \theta_V \mid \bar\mu^{(t+1)}\rangle + \langle \theta_{V^\perp} \mid y_0\rangle\). The two \(\theta_{V^\perp}\)-terms cancel in the objective, which reduces to minimizing \(F_{\varepsilon,\mathcal{C}}(\theta_V) - \langle \theta_V \mid \bar\mu^{(t+1)}\rangle\) over \(\theta_V \in V\) alone. Since \(F_{\varepsilon,\mathcal{C}}|_V\) is Legendre-type (Theorem [prop:SparsePerturbation], Point 4), the minimizer in \(V\) is unique and given by gradient inversion; taking the canonical representative \(\theta^{(t+1)} \in V\) and using Step 2, \[\theta^{(t+1)} = \nabla\Omega_{\varepsilon,\mathcal{C}|_V}\big(\bar\mu^{(t+1)}\big) = \varepsilon\, \nabla\Omega_{1,\mathcal{C}|_V}\big(\bar\mu^{(t+1)}\big) \in V.\]
Step 4: induction. We show by induction on \(t\) that \(\mu_i^{(t)}(\kappa,\varepsilon) = \mu_i^{(t)}(1,\kappa\varepsilon)\) for every \(i\), and \(\theta^{(t)}(\kappa,\varepsilon) = \theta^{(t)}(1,\kappa\varepsilon)/\kappa\). The base case \(t=0\) holds since both trajectories start at \(0 \in V\). Note that Step 3 maps every iterate to \(V\), so we consider \(\theta^{(t)} \in V\) for all \(t \geq 0\). Assume it holds at \(t\). By 42 with \(\lambda=\kappa\) and \(\theta = \theta^{(t)}(\kappa,\varepsilon) = \theta^{(t)}(1,\kappa\varepsilon)/\kappa\), \[\mu_i^{(t+1)}(\kappa,\varepsilon) = \mu_i^{(t+1)}\Big(\kappa,\varepsilon,\;\tfrac{1}{\kappa}\theta^{(t)}(1,\kappa\varepsilon)\Big) = \mu_i^{(t+1)}\Big(1,\;\kappa\varepsilon,\;\theta^{(t)}(1,\kappa\varepsilon)\Big) = \mu_i^{(t+1)}(1,\kappa\varepsilon), \qquad \forall i\in[N].\] Averaging over \(i\) and applying Step 3 at \((\kappa,\varepsilon)\) and at \((1,\kappa\varepsilon)\) – both evaluated, by the previous display, at the same \(\bar\mu^{(t+1)}\) –, \[\theta^{(t+1)}(\kappa,\varepsilon) = \varepsilon\,\nabla\Omega_{1,\mathcal{C}|_V}\big(\bar\mu^{(t+1)}\big), \qquad \theta^{(t+1)}(1,\kappa\varepsilon) = \kappa\varepsilon\,\nabla\Omega_{1,\mathcal{C}|_V}\big(\bar\mu^{(t+1)}\big),\] so the two right-hand sides differ exactly by the factor \(\kappa\), i.e.,\(\theta^{(t+1)}(\kappa,\varepsilon) = \theta^{(t+1)}(1,\kappa\varepsilon)/\kappa\), which closes the induction.
Finally, for arbitrary \(\lambda>0\), both \((\kappa,\varepsilon)\) and \((\kappa/\lambda,\lambda\varepsilon)\) have the same product \(\kappa\varepsilon\), so the induction above (applied once to each pair against the common reference \((1,\kappa\varepsilon)\)) yields \(\mu_i^{(t)}(\kappa,\varepsilon)=\mu_i^{(t)}(1,\kappa\varepsilon)=\mu_i^{(t)}(\kappa/\lambda,\lambda\varepsilon)\), and similarly \(\theta^{(t)}(\kappa,\varepsilon) = \theta^{(t)}(1,\kappa\varepsilon)/\kappa = \theta^{(t)}(\kappa/\lambda,\lambda\varepsilon)/\lambda\), which is the claimed identity. ◻
In particular, any point \((\kappa,\varepsilon)\) on the hyperbola \(\kappa\varepsilon=c\) yields the same sequence of policies as the point \((1,c)\), so restricting the search to \(\kappa=1\) and tuning only \(\varepsilon\) entails no loss of generality on the set of policies reachable by the algorithm.
This appendix starts by proving the convergence of Bregman PPA under some generic assumptions on the function minimized \(f\) and the Bregman function \(h\) in Section 8.1. Section 8.2 deduces from these results the convergence of our alternating minimization algorithm (Theorem [thm:convergence:speed]). Section 8.3 finally shows that our regularizations satisfy the conditions of Theorem [thm:convergence:speed], and are in particular real analytic (Proposition [prop:regsatisfyconv]).
Let \(\mathcal{U}\subset\mathbb{R}^n\) be a non-empty compact convex set. Fix \(u^{(0)}\in\operatorname{relint}(\mathcal{U})\), set \(E:=\operatorname{aff}(\mathcal{U})-u^{(0)}\), and identify \(\operatorname{aff}(\mathcal{U})\) with the Euclidean space \(E\) by translation. For notational simplicity, we still write \(\mathcal{U}\) for the translated set. All interiors, boundaries, gradients, Hessians, and subdifferentials below are understood in this relative geometry.
Let \(f:E\to\mathbb{R}\cup\{+\infty\}\) be proper and lower semicontinuous, with \(\mathop{\mathrm{dom}}f=\mathcal{U}\). Fix \(\kappa>0\), and consider a sequence \((u^{(t)})_{t\ge0}\) and its dual sequence \((v^{(t)})_{t\ge0}\) defined by \[\label{eq:generic-bregman-ppa} u^{(t+1)} \in \mathop{\mathrm{argmin}}_{u \in \mathcal{U}} \{ f(u) + \kappa D_h(u \mid u^{(t)}) \}, \qquad v^{(t)} := \nabla h(u^{(t)}).\tag{43}\]
We assume:
(H1) Non-degenerate local geometry: \(h:E\to\mathbb{R}\cup\{+\infty\}\) is a closed proper convex Legendre-type function such that \(\operatorname{int}(\mathop{\mathrm{dom}}h)=\operatorname{relint}(\mathcal{U})\), \(\overline{\mathop{\mathrm{dom}}h}=\mathcal{U}\), and \(\mathop{\mathrm{dom}}h^*=E\). Moreover, \(h^*\) is \(C^2\) on \(E\) and \(\nabla^2h^*(v)\succ0\) for every \(v\in E\). In particular, \(\nabla h^*\) maps \(E\) into \(\operatorname{relint}(\mathcal{U})\), and \(\nabla h\) is its \(C^1\) inverse on \(\operatorname{relint}(\mathcal{U})\).
(H2) Lipschitz dual map: \(\nabla h^*\) is \(L\)-Lipschitz continuous. In particular, \(h\) is \(1/L\)-strongly convex, hence \(D_h(u\mid u')\ge 1/(2L)\|u-u'\|^2\), for \(u,u'\in\operatorname{relint}(\mathcal{U})\).
(H3) Real analytic objective: \(f\) is real analytic on \(\operatorname{relint}(\mathcal{U})\).
(H4) Interior proximal trajectory: The sequence \((u^{(t)})_{t\ge0}\) stays in \(\operatorname{relint}(\mathcal{U})\).
Throughout, \(\partial f\) denotes the limiting subdifferential [37] Def. 8.3.
Theorem 8 (Generic Bregman PPA convergence dichotomy). Assume (H1)–(H4), and let \(\omega\) be the accumulation set of \((u^{(t)})_{t\ge0}\). Then either \(\omega\cap\operatorname{relint}(\mathcal{U})\neq\emptyset\), in which case \((u^{(t)})\) converges with finite length to some \(\tilde{u}\in\operatorname{relint}(\mathcal{U})\) with \(0\in\partial f(\tilde{u})\), and \(f(u^{(t)})-f(\tilde{u})=\mathcal{O}(1/t)\); or \(\omega\subseteq\operatorname{rbd}(\mathcal{U})\), in which case \(\|v^{(t)}\|\to+\infty\). In the first case, moreover, \(v^{(t)}\to\nabla h(\tilde{u})\) with finite length.
The proof follows the Attouch–Bolte–Svaiter abstract convergence strategy [16] Thm. 2.9. Recall that \(f\) has the Kurdyka-Łojasiewicz (KL) property at \(\tilde{u}\) if there exist a neighborhood \(U\) of \(\tilde{u}\), \(\eta>0\), and a concave \(C^1\) desingularizer \(\varphi\), with \(\varphi(0)=0\) and \(\varphi'>0\), such that \(\varphi'(f(u)-f(\tilde{u}))\operatorname{dist}(0,\partial f(u))\ge1\) whenever \(u\in U\) and \(f(\tilde{u})<f(u)<f(\tilde{u})+\eta\). Attouch–Bolte–Svaiter [16] assume that a function \(f\) and sequence \((u^{(t)})_{t\geq 0}\) follows, for some \(a,b > 0\) and every \(t > 0\), a sufficient decrease (SD) property \(f(u^{(t)}) - f(u^{(t+1)}) \geq a ||u^{(t+1)} - u^{(t)}||^2\), a relative-error estimate (RE) \(\exists \xi^{(t+1)} \in \partial f(u^{(t+1)})\) with \(||\xi^{(t+1)}|| \leq b ||u^{(t+1)} - u^{(t)}||\) and (KL). Combining (SD), (RE) and (KL) leads to finite length convergence toward a critical point. In our setting, (SD) is global, whereas (RE) is only local: it holds on compact subsets of \(\operatorname{relint}(\mathcal{U})\), where \(\nabla h\) is Lipschitz. Thus, the theorem cannot be directly applied from the outset; instead, we first localize the tail near an interior accumulation point, and repeat the standard KL capture argument: starting from an iterate sufficiently close to \(\tilde{u}\), the KL estimate, (SD), and local (RE) imply that the whole tail remains in the same interior neighborhood and has finite length. Once this localization is obtained, the usual KL convergence and value-rate arguments apply. The boundary alternative is handled separately: if all accumulation points lie on \(\operatorname{rbd}(\mathcal{U})\), then boundedness of the dual sequence would produce an interior accumulation point through the map \(\nabla h^*\), a contradiction.
Proof of Theorem 8. Set \(\Delta_{t+1}:=u^{(t+1)}-u^{(t)}\). Since \(f\) is lower semicontinuous and finite on the compact set \(\mathcal{U}\), it is bounded below. Using \(u^{(t)}\) as a feasible point in 43 and (H2), we obtain, with \(a:=\kappa/(2L)\), \[f(u^{(t)})-f(u^{(t+1)}) \ge \kappa D_h(u^{(t+1)}\mid u^{(t)}) \ge a\|\Delta_{t+1}\|^2 .\label{eq:generic95SD}\tag{44}\]
Hence \(f(u^{(t)})\downarrow f_*:=\lim_t f(u^{(t)})\), \(\sum_t\|\Delta_{t+1}\|^2<+\infty\), and \(\|\Delta_{t+1}\|\to0\).
Since \(u^{(t+1)}\in\operatorname{relint}(\mathcal{U})\), the first-order optimality condition for 43 , together with the exact sum rule ([37] Ex. 8.8) for the limiting subdifferential, gives \[\xi^{(t+1)} := \kappa\big(\nabla h(u^{(t)})-\nabla h(u^{(t+1)})\big) \in \partial f(u^{(t+1)}).\label{eq:generic95RE0}\tag{45}\] Moreover, by (H1), \(\nabla h\) is Lipschitz on every compact subset of \(\operatorname{relint}(\mathcal{U})\).
Assume that there exists an accumulation point \(\tilde{u}\) of \((u^{(t)})\) in \(\operatorname{relint}(\mathcal{U})\). Then by continuity of \(f\) on \(\operatorname{relint}(\mathcal{U})\), \(f_*=f(\tilde{u})\). Let \(\rho>0\) be such that \(\bar B(\tilde{u},2\rho)\subset\operatorname{relint}(\mathcal{U})\), and let \(b\) be a Lipschitz constant of \(\kappa\nabla h\) on this ball. Whenever \(u^{(t)},u^{(t+1)}\in\bar B(\tilde{u},2\rho)\), 45 therefore gives \[\operatorname{dist}(0,\partial f(u^{(t+1)})) \le b\|\Delta_{t+1}\|.\label{eq:generic95RE}\tag{46}\]
By (H3), \(f\) is real analytic near \(\tilde{u}\in\operatorname{relint}(\mathcal{U})\), hence it satisfies the KL inequality there. Choose a KL neighborhood \(U\), a level \(\eta>0\), and a desingularizer \(\varphi\). Shrinking \(\rho>0\) if necessary, assume \(\bar B(\tilde{u},2\rho)\subset U\cap\operatorname{relint}(\mathcal{U})\).
If \(f(u^{(t_0)})=f(\tilde{u})\) for some \(t_0\), then 44 makes the sequence stationary from \(t_0\) onward, and the capture conclusion is immediate. We therefore assume below that \(f(u^{(t)})>f(\tilde{u})\) for every \(t\).
Since \(\tilde{u}\) is an accumulation point, there is a subsequence \(u^{(t_j)}\to\tilde{u}\). Along this subsequence, \(\|\Delta_{t_j+1}\|\to0\), \(f(u^{(t_j)})\to f(\tilde{u})\), and \(\varphi(f(u^{(t_j)})-f(\tilde{u}))\to0\). Hence we may choose \(t_1=t_j\) large enough so that \(u^{(t_1)}\in B(\tilde{u},\rho)\), \(u^{(t_1+1)}\in B(\tilde{u},2\rho)\), \(0<f(u^{(t_1)})-f(\tilde{u})<\eta\), and \[\|u^{(t_1)}-\tilde{u}\| +2\|\Delta_{t_1+1}\| +\frac{b}{a}\varphi(f(u^{(t_1)})-f(\tilde{u})) <2\rho .\label{eq:generic95capture95condition}\tag{47}\]
We now prove the KL capture. Suppose that \(u^{(t)},u^{(t+1)}\in\bar B(\tilde{u},2\rho)\). Since \(f(u^{(t+1)})>f(\tilde{u})\), the KL inequality applies at \(u^{(t+1)}\). Moreover, \(\|\Delta_{t+1}\|>0\): otherwise 46 would give \(\operatorname{dist}(0,\partial f(u^{(t+1)}))=0\), contradicting the KL inequality because \(f(u^{(t+1)})>f(\tilde{u})\). Combining KL with 46 , the concavity of \(\varphi\), and the global sufficient decrease 44 gives \[\|\Delta_{t+2}\|^2 \le \frac{b}{a}\|\Delta_{t+1}\| \big( \varphi(f(u^{(t+1)})-f(\tilde{u})) - \varphi(f(u^{(t+2)})-f(\tilde{u})) \big).\] The AM–GM inequality then yields \[2\|\Delta_{t+2}\| \le \|\Delta_{t+1}\| +\frac{b}{a} \big( \varphi(f(u^{(t+1)})-f(\tilde{u})) - \varphi(f(u^{(t+2)})-f(\tilde{u})) \big).\label{eq:generic95KL95step}\tag{48}\]
Let \[T^*:=\sup\{T\ge t_1+1: u^{(s)}\in\bar B(\tilde{u},2\rho) \text{ for all }t_1\le s\le T\}.\] Then \(T^*\ge t_1+1\). If \(T^*<+\infty\), summing 48 for \(t=t_1,\ldots,T^*-1\) gives \[\sum_{s=t_1+1}^{T^*+1}\|\Delta_s\| \le 2\|\Delta_{t_1+1}\| +\frac{b}{a}\varphi(f(u^{(t_1+1)})-f(\tilde{u})) \le 2\|\Delta_{t_1+1}\| +\frac{b}{a}\varphi(f(u^{(t_1)})-f(\tilde{u})).\] Therefore, by 47 , \[\|u^{(T^*+1)}-\tilde{u}\| \le \|u^{(t_1)}-\tilde{u}\| + \sum_{s=t_1+1}^{T^*+1}\|\Delta_s\| <2\rho,\] contradicting the maximality of \(T^*\). Hence \(T^*=+\infty\), the whole tail remains in \(\bar B(\tilde{u},2\rho)\), and as \(T^*=\infty\) in the same estimate gives \(\sum_{t\ge t_1}\|u^{(t+1)}-u^{(t)}\|<+\infty\).
Thus \(u^{(t)}\) is Cauchy and converges to \(\tilde{u}\), as a subsequence was already shown to converge to \(\tilde{u}\). Since \(\xi^{(t+1)}\to0\), \(u^{(t+1)}\to\tilde{u}\), and \(f(u^{(t+1)})\to f(\tilde{u})\), the closedness of the limiting-subdifferential [37] Prop. 8.7 graph yields \(0\in\partial f(\tilde{u})\).
It remains to record the value rate. If \(f(u^{(t_0)})=f(\tilde{u})\) for some \(t_0\), then 44 makes the sequence stationary from \(t_0\) onward. Otherwise, after the KL capture, the tail satisfies the standard sufficient-decrease and relative-error assumptions in a fixed KL neighborhood. Since \(f\) is analytic near \(\tilde{u}\), the KL inequality can be taken in power form; equivalently, for some \(\theta\in[\tfrac12,1)\) and \(c>0\), \(\operatorname{dist}(0,\partial f(u)) \ge c\big(f(u)-f(\tilde{u})\big)^\theta\) near \(\tilde{u}\). Applying the standard KL rate estimate [39] Thm. 4 to \(r_t:=f(u^{(t)})-f(\tilde{u})\) gives a linear rate when \(\theta=\tfrac12\), and \(r_t=\mathcal{O}\!\left(t^{-1/(2\theta-1)}\right)\) when \(\theta>\tfrac12\). In particular, \(r_t=\mathcal{O}(1/t)\).
We now prove the boundary alternative. If \(\omega\subseteq\operatorname{rbd}(\mathcal{U})\) and \((v^{(t)})\) had a bounded subsequence, then, up to extraction, \(v^{(t_j)}\to\bar v\in E\). By (H1), \(u^{(t_j)}=\nabla h^*(v^{(t_j)})\to\nabla h^*(\bar v)\in \operatorname{relint}(\mathcal{U})\), contradicting \(\omega\subseteq\operatorname{rbd}(\mathcal{U})\). Hence \(\|v^{(t)}\|\to+\infty\).
Finally, in the capture case, the tail of \((u^{(t)})\) lies in a compact subset of \(\operatorname{relint}(\mathcal{U})\), where \(\nabla h\) is Lipschitz. Thus \(v^{(t)}=\nabla h(u^{(t)})\to\nabla h(\tilde{u})\), and finite length of \((u^{(t)})\) transfers to finite length of \((v^{(t)})\). ◻
To prove Theorem [thm:convergence:speed], we apply Theorem 8 with \(\mathcal{U}=\bar{\mathcal{M}}\), the identifiable moment \(\bar{\nu}\) a primal variable \(u\), the identifiable parameter \(\bar{w}\) dual variable \(v\), the aggregate regularizer \(\Omega_{\bar{\mathcal{M}}}\) as Bregman potential \(h\), and \(f_\kappa\) as \(f\). By Theorem [theo:proximalPointOperator], the sequence \(\bar{\nu}^{(t)}\) generated by Algorithm 21 matches the primal trajectory of the Bregman proximal point algorithm on \(f_\kappa\), while the dual sequence matches \(\bar{w}^{(t)}\). To apply Theorem 8, we must check that the generic conditions (H1)-(H4) hold for \(\Omega_{\bar{\mathcal{M}}}\) and \(f_\kappa\) under the assumptions of Theorem [thm:convergence:speed]. Moreover, we show that the dual sequence inherits the convergence properties of the primal one. For every \(i\in[N]\) write \(\Delta_i:=\Delta^{\mathcal{Y}(x_i)}\), \(Y_i:=Y(x_i)\), \(\Omega_i:=\Omega_{\Delta_i}\), \(\gamma_i:=\gamma(x_i,\xi_i)\), and \(A_i:=\phi_iY_i\), so that \(Y_i^\top\phi_i^\top w=A_i^\top w\).
We first note that \(f_\kappa\), defined in 30 , satisfies the standing assumptions of Theorem 8.
By ?? , \(G_\kappa\) is the infimal projection of a lower-semicontinuous function over the compact set \(\Delta_\otimes\) under a continuous linear constraint; it is therefore finite and lower semicontinuous on \(\bar{\mathcal{M}}\). Moreover, Proposition [prop:barOmegaProperties] shows that \(\Omega_{\bar{\mathcal{M}}}\) is a lower-semicontinuous convex function with domain equal to the polytope \(\bar{\mathcal{M}}\); it is therefore continuous relative to \(\bar{\mathcal{M}}\) by [17] Theorem 10.2. Hence \(f_\kappa=G_\kappa-\kappa\Omega_{\bar{\mathcal{M}}}\) is a proper lower-semicontinuous function with domain \(\bar{\mathcal{M}}\).
From Proposition [prop:barOmegaProperties], \(\mathop{\mathrm{dom}}(\Omega_{\bar \mathcal{M}}) = \bar \mathcal{M}\), and the Fenchel conjugate of our Bregman potential is \(\Omega_{\bar{\mathcal{M}}}^*(\bar{w}) = \bar{F}(\bar{w}) = \frac{1}{N} \sum_{i=1}^N \Omega_{\mathcal{C}_i}^*(\phi_i^\top J_{\Pi_{\bar\mathcal{W}}} \bar{w})\). Because each \(\Omega_{\mathcal{C}_i}^*\) is twice continuously differentiable by specific assumption (\(A_1\)), their finite sum after linear precomposition, \(\bar F\), is also twice continuously differentiable. We now verify that \(\nabla^2 \bar{F}(\bar{w}) \succ 0\) on \(\bar{\mathcal{W}}\). For any \(u \in \bar{\mathcal{W}}\), we have: \[u^\top \nabla^2 \bar{F}(\bar{w}) u = \frac{1}{N} \sum_{i=1}^N (\phi_i^\top u)^\top \nabla^2 \Omega_{\mathcal{C}_i}^*(\phi_i^\top J_{\Pi_{\bar\mathcal{W}}} \bar{w}) (\phi_i^\top u) \ge 0.\] By assumption (\(A_1\)), \(\nabla^2 \Omega_{\mathcal{C}_i}^* \succ 0\) in the direction of \(V_i\). Thus, the sum equals zero if and only if \(\phi_i^\top u \in V_i^\perp\) for all \(i \in [N]\). If \(u \in \bar{\mathcal{W}}\) satisfies this equality, then for any \(v = \frac{1}{N}\sum_{i=1}^N \phi_i \theta_i \in \bar{\mathcal{W}}\) (with \(\theta_i \in V_i\)), we have \(\langle u, v \rangle = \frac{1}{N}\sum_{i=1}^N \langle \phi_i^\top u, \theta_i \rangle = 0\). This implies \(u \in \bar{\mathcal{W}} \cap \bar{\mathcal{W}}^\perp = \{0\}\). Therefore, \(\nabla^2 \bar{F} \succ 0\) on \(\bar{\mathcal{W}}\), which gives (H1). Furthermore, (\(A_2\)) gives that each \(\nabla \Omega_i^*\) is Lipschitz continuous. Because \(\nabla\bar F\) is a finite sum of linear compositions of these maps, \(\nabla \Omega_{\bar{\mathcal{M}}}^* = \nabla \bar{F}\) is also Lipschitz continuous on \(\bar{\mathcal{W}}\), giving (H2). (H4) follows directly from Theorem [theo:proximalPointOperator], where \(\bar \nu^{(t)} = \nabla\Omega^*_{\bar\mathcal{M}}(\bar w^{(t)}) \in \textrm{rel int}(\bar \mathcal{M})\) for all \(t \geq 0\).
We must show that \(f_\kappa(\bar{\nu}) = G_\kappa(\bar{\nu}) - \kappa \Omega_{\bar{\mathcal{M}}}(\bar{\nu})\) is real analytic on \(\operatorname{relint}(\bar{\mathcal{M}})\).
We introduce the shifted dual potential \[\label{eq:shifted95dual95potential} \tilde{\bar{F}}(\bar{w}) := \frac{1}{N}\sum_{i=1}^N \Omega_i^*(A_i^\top J_{\Pi_{\bar\mathcal{W}}} \bar{w} - \gamma_i/\kappa).\tag{49}\] Assumption (\(A_3\)) ensures that the maps \(\theta \mapsto \Omega_i^*(Y_i^\top \theta - c)\) are real analytic for any constant shift \(c\). Precomposing these with the linear mapping \(\bar{w} \mapsto \phi_i^\top J_{\Pi_{\bar\mathcal{W}}} \bar{w}\) preserves analyticity, meaning both \(\bar{F}\) and \(\tilde{\bar{F}}\) are real analytic on \(\bar{\mathcal{W}}\).
By definition of \(f_\kappa\) in 30 and \(G_\kappa\) in ?? , we have \(f_\kappa = G_\kappa - \kappa \Omega_{\bar{\mathcal{M}}}\). Using Fenchel duality, \[\begin{align} G_\kappa^*(\lambda) = \sup_{q_\otimes \in \Delta_\otimes} \frac{1}{N} \sum_{i=1}^N \Big[ \langle A_i^\top \lambda, q_i \rangle - \langle \gamma_i, q_i \rangle - \kappa \Omega_i(q_i) \Big] = \frac{\kappa}{N} \sum_{i=1}^N \Omega_i^*\Big(\frac{A_i^\top \lambda - \gamma_i}{\kappa}\Big). \end{align}\] Evaluating this at \(\lambda = \kappa \bar{w}\) yields \(G_\kappa^*(\kappa \bar{w}) = \kappa \tilde{\bar{F}}(\bar{w})\). Since \(\tilde{\bar{F}}\) is real analytic, so is \(G_\kappa^*\). As verified in Step 1, \(\nabla^2 \bar{F}\) (and analogously by the shifted part of (\(A_1\)), \(\nabla^2 \tilde{\bar{F}}\)) are strictly positive definite, meaning their gradients have everywhere-nonsingular Jacobians. By the analytic inverse function theorem [40, p. I.B.7], their respective conjugates \(\Omega_{\bar{\mathcal{M}}} = \bar{F}^*\) and \(G_\kappa = (G_\kappa^*)^*\) are real analytic on \(\operatorname{relint}(\bar{\mathcal{M}})\). Consequently, their linear combination \(f_\kappa = G_\kappa - \kappa \Omega_{\bar{\mathcal{M}}}\) is real analytic, which gives (H3).
We start with a lemma that transfers the convergence guarantees of the primal sequence to the dual one.
Lemma 9 (Dual identities and value transfer). For every \(\lambda\), \[G_\kappa^*(\lambda) = \frac{\kappa}{N}\sum_{i=1}^N \Omega_i^*\left(\frac{A_i^\top J\lambda-\gamma_i}{\kappa}\right) = \kappa\tilde{\bar F}(\lambda/\kappa).\] Moreover, for every \(t\ge0\), \(f_\kappa(\bar\nu^{(t+1)}) \le \underline{S_{\Delta,N}}(\bar w^{(t)}) \le f_\kappa(\bar\nu^{(t)}).\) Consequently, if \(\bar\nu^{(t)}\to\bar\nu^*\in\operatorname{relint}(\bar{\mathcal{M}})\) and \(\bar w^*=\nabla\Omega_{\bar{\mathcal{M}}}(\bar\nu^*)\), then \(\underline{S_{\Delta,N}}(\bar w^*)=f_\kappa(\bar\nu^*)\), and any value rate for \(f_\kappa(\bar\nu^{(t)})-f_\kappa(\bar\nu^*)\) transfers to \(\underline{S_{\Delta,N}}(\bar w^{(t)})-\underline{S_{\Delta,N}}(\bar w^*)\).
Proof. The formula for \(G_\kappa^*\) follows by eliminating the affine image variable in ?? : \(G_\kappa^*(\lambda)=\sup_{q_\otimes\in\Delta_\otimes} \tfrac1N\sum_i\{\langle A_i^\top J\lambda-\gamma_i,q_i\rangle -\kappa\Omega_i(q_i)\}\), and the product structure of \(\Delta_\otimes\) gives the stated sum of conjugates. Using \(f_\kappa=G_\kappa-\kappa\Omega_{\bar{\mathcal{M}}}\), Fenchel duality, and the identity \(G_\kappa^*(\kappa\bar w)=\kappa\tilde{\bar F}(\bar w)\), we get \[\min_{\bar\nu\in\bar{\mathcal{M}}} \{f_\kappa(\bar\nu)+\kappa\mathcal{L}_{\Omega_{\bar{\mathcal{M}}}}(\bar w^{(t)},\bar\nu)\} = \underline{S_{\Delta,N}}(\bar w^{(t)}).\] Evaluating the minimum at \(\bar\nu^{(t)}=\nabla\Omega_{\bar{\mathcal{M}}}^*(\bar w^{(t)})\) gives the upper bound, since the Fenchel–Young loss vanishes there. Moreover, \(\mathcal{L}_{\Omega_{\bar{\mathcal{M}}}}(\bar w^{(t)},\bar\nu) =D_{\Omega_{\bar{\mathcal{M}}}}(\bar\nu\mid\bar\nu^{(t)})\), so the minimum is the proximal objective in 31 , attained at \(\bar\nu^{(t+1)}\). Positivity of the Bregman divergence gives the lower bound. Since \(f_\kappa(\bar\nu^{(t)})\) decreases to \(f_\kappa(\bar\nu^*)\), the sandwich implies \(\underline{S_{\Delta,N}}(\bar w^{(t)})\to f_\kappa(\bar\nu^*).\) Moreover, \(\bar w^{(t)}=\nabla\Omega_{\bar{\mathcal{M}}}(\bar\nu^{(t)})\to\bar w^*\), and \(\underline{S_{\Delta,N}}\) is continuous. Hence \(\underline{S_{\Delta,N}}(\bar w^*)=f_\kappa(\bar\nu^*)\). Finally, \(0\le \underline{S_{\Delta,N}}(\bar w^{(t)})-\underline{S_{\Delta,N}}(\bar w^*) \le f_\kappa(\bar\nu^{(t)})-f_\kappa(\bar\nu^*),\) so any upper rate for the primal value gap transfers to the dual value gap. ◻
In the escape case, Theorem 8 gives \(\omega\subseteq\operatorname{rbd}(\bar{\mathcal{M}})\) and \(\|\bar w^{(t)}\|\to+\infty\). Since \(\bar{\mathcal{M}}\) is compact and \(\operatorname{rbd}(\bar{\mathcal{M}})\) is closed, this is equivalent to \(\operatorname{dist}\big(\bar\nu^{(t)},\operatorname{rbd}(\bar{\mathcal{M}})\big) \to0.\)
We now consider the confined case. The generic theorem gives \(\bar\nu^{(t)}\to\bar\nu^*\in\operatorname{relint}(\bar{\mathcal{M}})\) with finite length. Since \(\bar w^{(t)}=\nabla\Omega_{\bar{\mathcal{M}}}(\bar\nu^{(t)})\), and \(\nabla\Omega_{\bar{\mathcal{M}}}\) is Lipschitz on a compact neighborhood of \(\bar\nu^*\), the sequence \((\bar w^{(t)})\) also converges to \(\bar w^*:=\nabla\Omega_{\bar{\mathcal{M}}}(\bar\nu^*)\) with finite length.
By 30 and ?? , \(f_\kappa=G_\kappa-\kappa\Omega_{\bar{\mathcal{M}}}\). Since \(\bar\nu^*\in\operatorname{relint}(\bar{\mathcal{M}})\), the exact subdifferential sum rule gives \(0\in\partial f_\kappa(\bar\nu^*)\) iff \(\kappa\bar w^*\in\partial G_\kappa(\bar\nu^*)\). By Fenchel duality and differentiability of \(G_\kappa^*\), this is equivalent to \(\bar\nu^*=\nabla G_\kappa^*(\kappa\bar w^*)\). Moreover, Proposition [prop:barOmegaProperties] gives \(\bar\nu^*=\nabla\Omega_{\bar{\mathcal{M}}}^*(\bar w^*)=\nabla\bar F(\bar w^*)\), while Lemma 9 gives \(\nabla G_\kappa^*(\kappa\bar w^*)=\nabla\tilde{\bar F}(\bar w^*)\). Hence \(\nabla\bar F(\bar w^*)=\nabla\tilde{\bar F}(\bar w^*)\), which is exactly \(\nabla\underline{S_{\Delta,N}}(\bar w^*)=0\).
0◻
We now show that our two main examples of regularization fall into the convergence framework above, thus proving Proposition [prop:regsatisfyconv]. The sparse-perturbation case requires the following two lemmas, which are of independent interest. The only nonstandard point is real analyticity of the Gaussian-smoothed support function.
Lemma 10 (Gaussian non-degeneracy). \(\nabla^2F_{\varepsilon,\mathcal{C}}\succ0\) over \(V\), the direction of \(\operatorname{aff}(\mathcal{C})\). More generally, for every continuous \(c:\mathcal{C}\to\mathbb{R}\), the shifted perturbed max \(F_{\varepsilon,\mathcal{C},c}(\theta):=\mathbb{E}[\max_{y\in\mathcal{C}}\{(\theta+\varepsilon\mathbf{Z})^\top y-c(y)\}]\), where \(\mathbf{Z}\sim \mathcal{N}(O,I_d)\), has \(\nabla^2F_{\varepsilon,\mathcal{C},c}\succ0\) over \(V\).
Proof. By [4], Prop. 3.1 (adapting [30], Lemma 1.5), \(\nabla^2F_{\varepsilon,\mathcal{C}}(\theta)=\frac{1}{\varepsilon}\mathbb{E}[y^*(\theta+\varepsilon\mathbf{Z})\mathbf{Z}^\top]\) with \(y^*(\theta)\in\mathop{\mathrm{argmax}}_{y\in\mathcal{C}}\theta^\top y\) (any fixed measurable selection; the tie set where the argmax is not a singleton is Lebesgue-null). For \(v\in V\setminus\{0\}\), \(\|v\|=1\), decomposing \(\mathbf{Z}=\mathbf{r}v+\mathbf{Z}_\perp\) with \(\mathbf{r}\sim\mathcal{N}(0,1)\) independent of \(\mathbf{Z}_\perp\) reduces \(v^\top\nabla^2F_{\varepsilon,\mathcal{C}}(\theta)v\) to \(\frac{1}{\varepsilon}\mathbb{E}_{\mathbf{Z}_\perp}\mathbb{E}_\mathbf{r}[g(\mathbf{r})\mathbf{r}]\) with \(g(r):=v^\top y^*(\theta+\varepsilon\mathbf{Z}_\perp+\varepsilon rv)\) non-decreasing in \(r\) by monotonicity of the subdifferential of the support function \(F(\theta):=\max_{y\in\mathcal{C}}\theta^\top y\) [17] Thm. 24.8; since \(\mathbb{E}[\mathbf{r}]=0\) this makes \(\mathbb{E}_\mathbf{r}[g(\mathbf{r})\mathbf{r}]\ge0\) pointwise in \(\mathbf{Z}_\perp\), strictly so unless \(g\) is a.e.constant, which is excluded since \(v\ne0\) and \(V\) has dimension \(\ge1\) give distinct limits of \(g\) at \(\pm\infty\). The same argument applies to \(F_{\varepsilon,\mathcal{C},c}\) by replacing the support function with the convex function \(\theta\mapsto\max_{y\in\mathcal{C}}\{\theta^\top y-c(y)\}\); the subdifferential is still monotone, and the linear term \(\varepsilon rv^\top y\) dominates the bounded shift \(c(y)\) as \(r\to\pm\infty\). ◻
Proposition 11 (Real analyticity of the perturbed max). Let \(\varepsilon>0\), let \(\mathcal{C}\subset\mathbb{R}^d\) be non-empty compact, and let \(c:\mathcal{C}\to\mathbb{R}\) be continuous. Then the shifted perturbed max, with \(\mathbf{Z}\sim \mathcal{N}(O,I_d)\), \[F_{\varepsilon,\mathcal{C},c}(\theta) := \mathbb{E}\big[\max_{y\in\mathcal{C}}\{(\theta+\varepsilon\mathbf{Z})^\top y-c(y)\}\big]\] is real analytic on \(\mathbb{R}^d\). In particular, taking \(c\equiv0\), \(F_{\varepsilon,\mathcal{C}}\) is real analytic on \(\mathbb{R}^d\).
Proof. Define, for \(\theta\in\mathbb{C}^d\), \[\tilde{F}_{\varepsilon,\mathcal{C}}(\theta) = \frac{1}{(2\pi)^{d/2}\varepsilon^d} \int_{\mathbb{R}^d} F(u) \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right) \,du,\] with \(F(u):=\max_{y\in\mathcal{C}}\{u^\top y-c(y)\}\). Note that, for \(\theta\in\mathbb{R}^d\), \(\tilde{F}_{\varepsilon,\mathcal{C}}(\theta)=F_{\varepsilon,\mathcal{C},c}(\theta)\), by the change of variable \(u=\theta+\varepsilon z\).
We first establish a compact-uniform domination bound. Since \(\mathcal{C}\) is compact and \(c\) continuous, \(|F(u)|\le R\|u\|+\|c\|_\infty\le C_0(1+\|u\|)\) with \(R:=\max_{y\in\mathcal{C}}\|y\|<+\infty\), \(\|c\|_\infty:=\max_{y\in\mathcal{C}}|c(y)|<+\infty\), and \(C_0:=\max\{R,\|c\|_\infty\}\). Let \(K\subset\mathbb{C}^d\) be compact and write \(\theta=\alpha+i\beta\), with \(\alpha,\beta\in\mathbb{R}^d\). On \(K\), there exist constants \(A_K,B_K<+\infty\) such that \(\|\alpha\|\le A_K\) and \(\|\beta\|\le B_K\) for all \(\theta=\alpha+i\beta\in K\). By bilinearity, and since \(u-\alpha,\beta\in\mathbb{R}^d\), \((u-\theta)^\top(u-\theta)=\|u-\alpha\|^2-\|\beta\|^2 -2i(u-\alpha)^\top\beta .\) Hence \[\left| \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right) \right| = \exp\!\left(\frac{\|\beta\|^2}{2\varepsilon^2}\right) \exp\!\left(-\frac{\|u-\alpha\|^2}{2\varepsilon^2}\right).\] Moreover, \(\|u-\alpha\|^2 = \|u\|^2-2u^\top\alpha+\|\alpha\|^2 \ge \frac{1}{2}\|u\|^2-\|\alpha\|^2 \ge \frac{1}{2}\|u\|^2-A_K^2.\) Therefore, uniformly for \(\theta\in K\), \(\left| F(u) \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right) \right| \le C_K(1+\|u\|) \exp\!\left(-\frac{\|u\|^2}{4\varepsilon^2}\right)\) for some finite constant \(C_K\). The right-hand side is integrable on \(\mathbb{R}^d\). Hence \(\tilde{F}_{\varepsilon,\mathcal{C}}\) is well defined and continuous on \(\mathbb{C}^d\) by dominated convergence.
Fix \(u\in\mathbb{R}^d\). Note that the map \(\theta\mapsto \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right)\) is entire on \(\mathbb{C}^d\). Thus, for \(j\in[d]\), we have \[\frac{\partial}{\partial \theta_j} \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right) = \frac{u_j-\theta_j}{\varepsilon^2} \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right).\] On the same compact set \(K\), let \(M_K:=\sup_{\theta\in K}\|\theta\|<+\infty\). Since \(|u_j-\theta_j| \le \|u\|+\|\theta\| \le \|u\|+M_K,\) the differentiated integrand is dominated by \(C_K'(1+\|u\|)(\|u\|+M_K) \exp\!\left(-\frac{\|u\|^2}{4\varepsilon^2}\right),\) which is integrable on \(\mathbb{R}^d\). Differentiation under the integral sign is therefore justified, and \[\frac{\partial \tilde{F}_{\varepsilon,\mathcal{C}}}{\partial \theta_j}(\theta) = \frac{1}{(2\pi)^{d/2}\varepsilon^d} \int_{\mathbb{R}^d} F(u) \frac{u_j-\theta_j}{\varepsilon^2} \exp\!\left(-\frac{(u-\theta)^\top(u-\theta)}{2\varepsilon^2}\right) \,du.\] By Mattner’s theorem on complex differentiation under the integral [41], applied coordinatewise, \(\tilde{F}_{\varepsilon,\mathcal{C}}\) is separately holomorphic. Since the compact-uniform domination above also gives joint continuity, Osgood’s lemma [40, p. I.A.2] yields joint holomorphy on \(\mathbb{C}^d\).
Consequently, \(\tilde{F}_{\varepsilon,\mathcal{C}}\) admits a convergent complex Taylor expansion around every point of \(\mathbb{C}^d\). Restricting this expansion around each real point \(\theta_0\in\mathbb{R}^d\) to real increments gives a convergent real power-series expansion of \(F_{\varepsilon,\mathcal{C},c}\) around \(\theta_0\). Hence \(F_{\varepsilon,\mathcal{C},c}\) is real analytic on \(\mathbb{R}^d\).
Finally, this yields (A\(_3\)) for the sparse perturbation: since \(\Omega^*_{\Delta}(s)=\mathbb{E}[\max_{y\in\mathcal{Y}}\{s_y+\varepsilon(Y^\top\mathbf{Z})_y\}]\), the composed map satisfies \(\Omega^*_{\Delta}(Y^\top\theta-c)=\mathbb{E}[\max_{y\in\mathcal{Y}}\{(\theta+\varepsilon\mathbf{Z})^\top y-c_y\}]=F_{\varepsilon,\mathcal{Y},c}(\theta)\), real analytic for every fixed \(c\in\mathbb{R}^{\mathcal{Y}}\) by the above. ◻
We can now prove Proposition [prop:regsatisfyconv].
Proof. Negentropy. \(\Omega_i^*\) is the log-sum-exp function; its gradient, the softmax map, has Jacobian equal to a categorical covariance matrix, hence operator norm at most \(1\), so the softmax map is \(1\)-Lipschitz, giving (A\(_2\)). The same Hessian is positive semidefinite with kernel \(\operatorname{span}(\mathbf{1})\); since \(\Omega^*_{\mathcal{C}_i}=\Omega^*_{\Delta_i}(Y_i^\top\cdot)\), for any direction \(v\) we get \(v^\top\nabla^2\Omega^*_{\mathcal{C}_i}(\theta)v =(Y_i^\top v)^\top\nabla^2\Omega^*_{\Delta_i}(Y_i^\top\theta)(Y_i^\top v)\), which vanishes if and only if \(Y_i^\top v\in\operatorname{span}(\mathbf{1})\), i.e., \(\langle v,y-y'\rangle=0\) for all \(y,y'\in\mathcal{Y}(x_i)\), i.e., \(v\in V_i^\perp\). Hence \(\nabla^2\Omega^*_{\mathcal{C}_i}\succ0\) on \(V_i\), which is (A\(_1\)). The same kernel computation with \(Y_i^\top\theta-c\) in place of \(Y_i^\top\theta\) gives the shifted part of (A\(_1\)). Log-sum-exp is real analytic on \(\mathbb{R}^{\mathcal{Y}(x_i)}\), so for every \(c\) the composed map \(\theta\mapsto\operatorname{logsumexp}(Y_i^\top\theta-c)\) is real analytic (affine precomposition), which is (A\(_3\)).
Sparse perturbation. (A\(_2\)) is Proposition [prop:strongConvexitySparsePerturbation]; (A\(_1\)) is the Gaussian non-degeneracy Lemma 10 above including its shifted statement, and from Proposition 11, which gives the required \(C^2\)-regularity; for (A\(_3\)), the generalized Proposition 11 gives, for every \(c\in\mathbb{R}^{\mathcal{Y}(x_i)}\), that \(\Omega^*_{\Delta_i}(Y_i^\top\theta-c)=F_{\varepsilon,\mathcal{Y}(x_i),c}(\theta)\) is real analytic. ◻
Let \(G = (V, E)\) be an undirected graph, and let \(\boldsymbol{\xi}\in \Xi\) be an exogenous noise. For each edge \(e \in E\) and scenario \(\xi \in \Xi\), we denote by \(c_e\) the scenario-independent first-stage cost of building \(e\), and by \(d_{e}(\xi)\) the scenario-dependent second-stage cost. The contextual stochastic two-stage minimum weight spanning tree problem is:
\[\label{eq:first95stage95min95weight95spanning95tree95md} \min_{\pi\in \mathcal{H}} \mathbb{E}_{\mathbf{x}, \mathbf{y}\sim \pi(\cdot | \mathbf{x})} \bigg[\sum_{e \in E} c_e \mathbf{y}_e + \mathbb{E}_{\boldsymbol{\xi}| \mathbf{x}} \big[ Q\big(\mathbf{y}; \boldsymbol{\xi}\big)\big] \bigg],\tag{50}\]
where the hypothesis class \(\mathcal{H}\) is defined as \[\begin{align} \mathcal{H}&:=\{\pi \, | \, \pi(\cdot | x) \in \Delta^{\mathcal{Y}}\}, \quad \text{where} \\ \mathcal{Y}&:= \{y \in \{0,1\}^{E} \, | \, \forall Y, \emptyset \subsetneq Y \subseteq V, \sum\limits_{e \in E(Y)}y_e \leq |Y| - 1\}. \end{align}\] The combinatorial space \(\mathcal{Y}\) corresponds to the first-stage solutions (forests on \(G\)). The second-stage recourse function \(Q\) is defined as:
\[\tag{51} \begin{align} Q\big(y; \xi\big) := \min_z \quad & \sum_{e \in E} d_{e}(\xi)z_e, \\ \text{s.t.} \quad & \sum_{e \in E} y_e + z_{e} = |V| - 1,\tag{52}\\ & \sum\limits_{e \in E(Y)}y_e + z_{e} \leq |Y| - 1, \quad & \forall Y, \emptyset \subsetneq Y \subseteq V, \tag{53} \\ & z_{e} \in \{0, 1\}, & \quad \forall e \in E.\tag{54} \end{align}\]
In problem 50 , we look for “good” first-stage forests to be completed (in the second stage) into spanning trees, given a context realization \(x \in \mathcal{X}\).
Remark 8. In practice, the structure of the graph (and thus \(\mathcal{Y}(x)\)) can depend on the variable \(x\); we intentionally simplify the notation above.
Each edge \(e\) of an instance (context) \(x\) is encoded by a feature vector \(\phi(x, e)\) detailed in the appendix to [5]. The feature matrix is given as input to a generalized linear model (GLM) \(\varphi_w\), which predicts edge weights \(\theta_e\), illustrated in Figure 6. We use the predicted edge weights \(\theta\) as the objective of a maximum weight forest problem; this problem is solved by Kruskal’s algorithm, which plays the role of oracle in Algorithm 3.
After tuning hyperparameters, we run \(\texttt{nb\_iterations}=50\) outer iterations with perturbation scale \(\varepsilon=10^{-4}\), and estimate expectations with \(\texttt{nb\_samples}=20\) perturbation samples of \(\mathbf{Z}\). The coordination step is trained for \(\texttt{nb\_epochs}=30\) epochs with Adam initialized at \(\texttt{lr\_init}=10^{-5}\).
Each product feature vector has \(d_p=3\) coordinates, consisting of price and two non-price features, and customer contexts have dimension \(d_c=5\). We report results over \(5\) instance seeds and \(5\) data seeds. Each instance seed fixes the product catalog and preference matrix \(B\in\mathbb{R}^{d_p\times d_c}\): product features are drawn uniformly on \([1,10]\), the first coordinate is interpreted as price, the price row of \(B\) is fixed to \(-0.7\), and the remaining entries are drawn uniformly on \([0,1]\). For each data seed, we draw \(100\) training customers, \(100\) validation customers and evaluate on \(1000\) independent test customers, with customer-context coordinates drawn from \(\mathcal{N}(0,1)\).
The covariates consist of customer-context features and product features augmented by quantile-based summaries of the assortment instance. The predictive model is a learned bilinear score: product-side and customer-side covariates are each mapped through a single tanh layer into latent embeddings, whose interaction is parameterized by a learned bilinear form and passed through a softplus link. Unless otherwise stated, we use \(\kappa=1\), perturbation scale \(\varepsilon=1\), \(\texttt{nb\_samples}=10\), \(\texttt{epochs}=30\), and learning rate \(10^{-4}\). In the scaling experiments, we report checkpoints at \(T=50\) and \(T=100\); validation-selected policies are denoted by \(\bar{\pi}^T\).
For Table 4, the source and target catalogs both contain \(10\) products. We vary the share of target-catalog products that were unseen during training. For SAA and kNN-SAA, prescriptions are restricted to old products that remain available in the target catalog. The learned policies \(\pi_{w^{(1)}}\) and \(\bar{\pi}^{50}\) are evaluated on the full target catalog.
| Method | 0% | 20% | 40% | 60% | 80% | 100% |
|---|---|---|---|---|---|---|
| SAA | 7.14 | 7.03 | 7.03 | 6.18 | 5.41 | 0.00 |
| kNN-10 | 7.27 | 7.35 | 7.14 | 6.24 | 5.40 | 0.00 |
| \(\pi_{w^{(1)}}\) | 4.54 | 4.56 | 3.85 | 4.20 | 3.77 | 3.63 |
| \(\bar{\pi}^{50}\) | 7.42 | 6.69 | 6.03 | 6.50 | 6.27 | 5.77 |