Pessimistic Assortment Optimization (PASTA)

• PASTA is an offline, data-driven method that applies a max–min framework on logged customer-choice data to robustly identify optimal product assortments under sparse coverage conditions.
• It leverages likelihood-based confidence sets and a pessimistic objective to mitigate revenue overestimation, ensuring reliable performance even when only the optimal assortment is observed.
• The framework extends to richer models like latent class logit and joint assortment-pricing, providing finite-sample regret guarantees while addressing complex combinatorial action spaces.

Pessimistic Assortment Optimization (PASTA) is an offline, data-driven approach to assortment optimization that applies the principle of pessimism to historical customer-choice data. In the original formulation, the seller observes logged assortments, customer choices, and revenues, does not know the underlying choice model, and seeks an assortment with maximal expected counterfactual revenue. PASTA replaces optimistic plug-in optimization with a max–min rule over a likelihood-based confidence region, thereby guarding against overestimation caused by sparse coverage in a combinatorial action space. Its central structural feature is that, under the multinomial logit (MNL) model, correct identification and finite-sample regret guarantees require only that the optimal assortment be covered by the offline data, rather than that all feasible assortments be observed (Dong et al., 2023). Subsequent work has broadened the term from a specific algorithm to a more general pessimistic principle for offline assortment learning, and has extended its scope to weaker coverage notions, richer model classes, and joint assortment–pricing settings (Han et al., 10 Feb 2025, Dong et al., 2 Oct 2025, Zhang et al., 21 Apr 2026).

1. Offline formulation and the coverage problem

In the original problem setup, the item set is $[N]=\{1,2,\dots,N\}$, each item $i$ has a feature vector $x_i\in\mathbb{R}^d$, and the feasible family of assortments is $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$. The offline dataset is

$D=\{(S_i,A_i,R_i)\}_{i=1}^n,$

where $S\in\mathbb{S}$ is the offered assortment, $A\in S\cup\{0\}$ is the observed choice, and $R$ is the realized revenue. Writing $\pi_S(s)=\mathbb{P}(S=s)$ for the probability that assortment $s$ appears in the log, the objective is to identify

$i$0

where $i$1 is the potential revenue under intervention $i$2 (Dong et al., 2023).

The original analysis adopts the standard causal assumptions of consistency and un-confoundedness. Under these assumptions, together with “positivity everywhere,” the expected revenue of every assortment is identifiable from observed data. The difficulty is that “positivity everywhere,” namely $i$3 for all $i$4, is typically implausible when $i$5 grows exponentially in $i$6 and firms rarely explore revenue-poor assortments. PASTA therefore replaces this with the strictly weaker “positivity at optimum” condition,

$i$7

meaning that the offline data covers the optimal assortment but need not cover the full combinatorial action space (Dong et al., 2023).

This distinction addresses a common misconception. PASTA is not designed around uniform identification of all assortments. Its premise is that the decisive quantity is estimation quality at the optimal assortment, because the pessimistic objective suppresses overoptimistic valuations of poorly covered alternatives (Dong et al., 2023).

2. MNL model and pessimistic objective

The original PASTA paper studies the MNL model with unknown parameter $i$8, where $i$9 is compact. For an assortment $x_i\in\mathbb{R}^d$0, the choice probabilities are

$x_i\in\mathbb{R}^d$1

and

$x_i\in\mathbb{R}^d$2

If $x_i\in\mathbb{R}^d$3 is the known per-item revenue and $x_i\in\mathbb{R}^d$4, then the expected revenue of assortment $x_i\in\mathbb{R}^d$5 under parameter $x_i\in\mathbb{R}^d$6 is

$x_i\in\mathbb{R}^d$7

The true optimal assortment is $x_i\in\mathbb{R}^d$8 (Dong et al., 2023).

The pessimistic construction begins from the empirical negative log-likelihood

$x_i\in\mathbb{R}^d$9

with MLE $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$0. PASTA then forms the likelihood-ratio confidence region

$\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$1

Its decision rule is the max–min program

$\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$2

The inner minimization penalizes assortments whose revenue estimates are uncertain due to insufficient coverage; the outer maximization selects assortments with high robust value. This directly contrasts with estimate-then-optimize baselines that first fit $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$3 and then maximize $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$4, a procedure that can overestimate poorly covered assortments and therefore mis-rank the action space (Dong et al., 2023).

3. Identification logic and regret guarantees

The regret of an assortment estimator $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$5 is

$\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$6

For PASTA, the core calibration lemma states that if $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$7, then

$\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$8

Thus the regret is controlled entirely by the worst-case drop in value at the optimal assortment, not by uniform control over all $\mathbb{S}\subseteq 2^{[N]}\setminus\{\emptyset\}$9 (Dong et al., 2023).

Under Assumption 4, $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$0, and a likelihood-based concentration condition ensuring both confidence-set coverage and concentration of empirical likelihood around population likelihood, the original paper proves

$D=\{(S_i,A_i,R_i)\}_{i=1}^n,$1

with high probability. The dependence on $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$2 makes explicit that the guarantee worsens when the optimal assortment is only rarely observed, but it does not require positivity away from the optimum (Dong et al., 2023).

For MNL, the theory specializes further. Let $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$3, and define $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$4 so that $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$5 for all $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$6, $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$7, and $D=\{(S_i,A_i,R_i)\}_{i=1}^n,$8. With

$D=\{(S_i,A_i,R_i)\}_{i=1}^n,$9

the high-probability regret bound becomes

$S\in\mathbb{S}$0

The paper summarizes this as regret scaling like $S\in\mathbb{S}$1 up to coverage-related constants. An important limitation is that under MNL one has $S\in\mathbb{S}$2, so the bound contains terms that grow at least as $S\in\mathbb{S}$3; the paper explicitly notes that sharp minimax lower bounds are an open question in that formulation (Dong et al., 2023).

Later work generalized this template. The unified framework of "PASTA: A Unified Framework for Offline Assortment Learning" defines a likelihood-based confidence set over a general model class $S\in\mathbb{S}$4,

$S\in\mathbb{S}$5

and solves

$S\in\mathbb{S}$6

It proves a general regret bound of the form

$S\in\mathbb{S}$7

and gives model-specific rates for MNL, latent class logit, and nested logit, together with a minimax regret lower bound (Dong et al., 2 Oct 2025).

4. Computational procedure under MNL

The original solver alternates between assortment optimization given a model parameter and worst-case parameter search given an assortment. Step 0 computes $S\in\mathbb{S}$8 by standard optimization such as gradient descent, and constructs

$S\in\mathbb{S}$9

Step 1 fixes $A\in S\cup\{0\}$0, sets $A\in S\cup\{0\}$1, and solves

$A\in S\cup\{0\}$2

where $A\in S\cup\{0\}$3 is the assortment indicator and $A\in S\cup\{0\}$4 is encoded by $A\in S\cup\{0\}$5 linear inequalities with a totally unimodular matrix. This fractional program is equivalent to a linear program in variables $A\in S\cup\{0\}$6, and the assortment is recovered via

$A\in S\cup\{0\}$7

Total unimodularity yields polynomial-time solvability and integral solutions (Dong et al., 2023).

Step 2 fixes the current assortment $A\in S\cup\{0\}$8 and minimizes $A\in S\cup\{0\}$9 over $R$0 by gradient descent with line search. The iteration is initialized at some $R$1, computes the gradient $R$2, proposes

$R$3

and shrinks $R$4 by a factor $R$5 until feasibility $R$6 is restored. The algorithm alternates the two steps for $R$7 iterations, starting from $R$8 and an initial assortment obtained from Step 1, and returns the final assortment $R$9 (Dong et al., 2023).

The computational significance of this design is that it avoids explicit enumeration of exponentially many assortments. The MLE step scales in $\pi_S(s)=\mathbb{P}(S=s)$0 and $\pi_S(s)=\mathbb{P}(S=s)$1, the assortment subproblem is polynomial in $\pi_S(s)=\mathbb{P}(S=s)$2 and $\pi_S(s)=\mathbb{P}(S=s)$3 under totally unimodular constraints, and the inner minimization is first-order in a $\pi_S(s)=\mathbb{P}(S=s)$4-dimensional parameter space (Dong et al., 2023).

5. Numerical behavior, applicability, and limitations

The original numerical studies use synthetic datasets with known $\pi_S(s)=\mathbb{P}(S=s)$5 and $\pi_S(s)=\mathbb{P}(S=s)$6, allowing direct evaluation of regret. The experiments vary the number of products $\pi_S(s)=\mathbb{P}(S=s)$7, a cardinality constraint $\pi_S(s)=\mathbb{P}(S=s)$8, feature dimension $\pi_S(s)=\mathbb{P}(S=s)$9, sample size $s$0, and the coverage parameter $s$1. Item revenues satisfy $s$2, features are random unit vectors, and $s$3 is imposed to avoid degenerate cases. The baseline is estimate-then-optimize: compute $s$4 by gradient descent and then solve the assortment LP without pessimism. Evaluation uses average regret and assortment accuracy, defined as the fraction of items in $s$5 correctly selected, across 50 random datasets per configuration (Dong et al., 2023).

The reported pattern is consistent across the tested regimes. When sample size varies, including configurations such as $s$6, $s$7, $s$8, $s$9 and also $i$00, $i$01, PASTA achieves regret less than 25% of the baseline’s regret across $i$02 values. When coverage varies over $i$03, its gains remain robust, including when suboptimal assortments are not covered. When feature dimension varies over $i$04, both methods deteriorate, but PASTA maintains an advantage in both regret and accuracy. The reported hyperparameters are $i$05, $i$06, and GDLS parameters $i$07, $i$08, $i$09 (Dong et al., 2023).

The method is particularly suited to offline retail settings with large $i$10 and combinatorial $i$11, where logged data likely omit many assortments but include optimal or near-optimal assortments with nonzero probability. The paper recommends estimating $i$12, building $i$13 from the likelihood-ratio constraint, running the alternating LP-plus-GDLS procedure, and conducting sensitivity analysis over $i$14 and $i$15 while monitoring $i$16 across candidate assortments (Dong et al., 2023).

The assumptions and limitations are explicit. The guarantees rely on the MNL model with compact $i$17, uniform strong convexity of $i$18 and $i$19, known revenues $i$20 independent of assortment, stationarity through i.i.d. offline samples, causal consistency and un-confoundedness, and positivity at the optimum only. The regret bound degrades with $i$21, very small coverage of $i$22 is unfavorable, the analysis is tailored to MNL, and handling assortment-dependent revenues is possible but complicates optimization (Dong et al., 2023).

6. Later developments and evolving uses of the term

Later papers use “PASTA” in related but not identical senses, and this terminological expansion is itself part of the topic.

Work	Relation to PASTA	Coverage or guarantee emphasized
(Dong et al., 2023)	Original max–min pessimistic assortment optimization	Positivity at optimum, $i$23
(Han et al., 10 Feb 2025)	PRB as a PASTA-style pessimistic pipeline	Optimal item coverage is sufficient and necessary
(Dong et al., 2 Oct 2025)	Unified PASTA framework	Offline data distribution contains an optimal assortment
(Zhang et al., 21 Apr 2026)	Offline LCB assortment–pricing method mapped to “PASTA” terminology	Local information around the optimal assortment–price pair

"Learning an Optimal Assortment Policy under Observational Data" does not define PASTA as a formal algorithm; instead, it presents Pessimistic Rank-Breaking (PRB) and interprets it as an instance of the same pessimistic principle. PRB rank-breaks observational choices into pairwise comparisons between item $i$24 and the no-purchase option, constructs lower-confidence estimates of $i$25, converts them to pessimistic attraction parameters $i$26, and solves

$i$27

Its main conceptual advance is the replacement of full optimal-assortment coverage by optimal item coverage: each item in $i$28 must appear sufficiently often in historical offers, even if the full set $i$29 never appears as a logged assortment. The paper proves that this condition is both sufficient and necessary for efficient offline learning under MNL, and gives near-matching upper and lower bounds, making PRB nearly minimax optimal up to logarithmic factors (Han et al., 10 Feb 2025).

"PASTA: A Unified Framework for Offline Assortment Learning" broadens the original construction from MNL to a model class including MNL, latent class logit, and nested logit. It retains the likelihood-ratio uncertainty set and pessimistic max–min selection rule, proves finite-sample regret bounds under coverage at the optimum, and derives a minimax regret lower bound. In its parametric summary, the critical value satisfies

$i$30

so the regret scales as

$i$31

The paper presents this as the first finite-sample regret bounds for offline assortment optimization across several widely used choice models and as a minimax-optimal result in sample and model complexity up to logarithmic factors (Dong et al., 2 Oct 2025).

"Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing" does not literally use the name “PASTA,” but its offline method is explicitly mapped to that terminology in the supplied summary. There the pessimistic object is an assortment–price pair $i$32 rather than an assortment alone. The algorithm estimates a regularized MLE, constructs a price-uniform confidence region for price-dependent utilities, defines lower-confidence utilities

$i$33

and maximizes the induced lower-confidence revenue

$i$34

Its offline suboptimality guarantee is governed by local information around the optimal assortment–price pair, via inverse-Hessian geometry and weights $i$35, rather than by exact coverage of the optimal action (Zhang et al., 21 Apr 2026).

Taken together, these developments suggest two stable features of PASTA as a research concept. First, pessimism is the invariant algorithmic principle: optimize a lower-confidence or worst-case revenue functional rather than a point estimate. Second, the data requirement has progressively weakened from exact coverage of the optimal assortment, to itemwise coverage of the optimal set, to more local information conditions around the optimal action. That trajectory does not erase the original formulation; rather, it locates the 2023 PASTA algorithm as the starting point of a broader pessimistic program in offline assortment learning (Dong et al., 2023, Han et al., 10 Feb 2025, Dong et al., 2 Oct 2025, Zhang et al., 21 Apr 2026).