Model Restrictiveness

• Model restrictiveness is the property that measures how a model or policy limits admissible behaviors or inferences relative to a broader possibility space.
• Different fields formalize restrictiveness via probabilistic comparability in stochastic orders, approximation error in economic models, and conservatism in safety-critical systems.
• Applications span identification theory, control safety, and policy design, highlighting trade-offs between reduced model flexibility and enhanced constraint calibration.

Searching arXiv for papers on model restrictiveness and related uses of the term. arXiv search query: "restrictiveness model stochastic order safety filter economics RKHS" Model restrictiveness denotes the extent to which a formal model, order, algorithm, or policy constrains admissible objects, behaviors, or inferences. The term is not used with a single universal formal definition across the literature. Instead, distinct communities operationalize it through probabilities of comparability in partially ordered spaces, average approximation error relative to an eligible class of functions, the strength of structural assumptions required for identifiability or convergence, and the conservatism of safety filters or policy constraints. Taken together, these usages suggest a common theme: restrictiveness concerns how much of an ambient possibility space is ruled out, and at what analytical or operational cost (Fried, 2020, Fudenberg et al., 2020, Huriot et al., 2024, Gonzalez et al., 2021).

1. Main formalizations

Across the cited literatures, restrictiveness is attached to different mathematical objects. In some cases the object is an order relation on distributions; in others it is a model class, a safety constraint, or a reasoning language. The notion is therefore context-dependent rather than intrinsic.

Setting	Formal object	Restrictiveness notion
Stochastic orders	$\Theta,\Theta' \sim \mathcal U(\Delta^n)$	Comparability probability $P(\Theta \preceq \Theta')$
Functional economic models	$\mathcal F_\Theta \subseteq \mathcal F$	Average discrepancy ratio $r(\mathcal F_\Theta,\mathcal F)$
Safety-critical control	CBF or sampled safety filter	How strict the safety constraint is or how often nominal control is overridden
Identification theory	$\mathcal M \subseteq \Delta(\mathcal L)$	Whether restrictions eliminate behaviorally equivalent representations
RKHS / logic / optimization formalisms	Assumption set or language fragment	How strongly the formalism limits admissible dynamics, expressions, or feedback laws

In the stochastic-order literature, the probability that two random objects are comparable is used as a direct quantitative notion of restrictiveness (Fried, 2021). In the economic literature, a model is more restrictive when it fits a smaller fraction of an eligible synthetic-data space well (Fudenberg et al., 2020). In safety-critical robotics, restrictiveness is tied to the degree of conservatism of safety constraints or the intervention rate of a safety filter (Huriot et al., 2024, Park et al., 24 Apr 2026). In assumption-centric work on Koopman operators, OWL 2 DL, and optimization dynamics, restrictiveness refers to how narrow the admissible class becomes once boundedness, decidability, or monotonicity requirements are imposed (Gonzalez et al., 2021, Schneider et al., 2012, Mudrik et al., 6 Oct 2025).

A plausible implication is that “restrictiveness” is best treated as a relational property: it is always defined relative to an ambient class, a benchmark, a discrepancy, or an operational objective.

2. Order-theoretic restrictiveness and comparability

A precise probabilistic notion appears in the study of stochastic orders on the probability simplex. Let

$$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$

and let each $\theta\in\Delta^n$ induce a discrete distribution $P_\theta$ on ordered support points $x_1<\cdots<x_n$ via

$P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$

If $P(\Theta \preceq \Theta')$0 are independent and uniformly distributed on $P(\Theta \preceq \Theta')$1, restrictiveness is identified with the probability that $P(\Theta \preceq \Theta')$2 and $P(\Theta \preceq \Theta')$3 are comparable under a chosen order (Fried, 2020).

For the hazard rate order, the central theorem is exact: $P(\Theta \preceq \Theta')$4 This quantity decays exponentially in $P(\Theta \preceq \Theta')$5, so comparability becomes rapidly rare as the support size grows (Fried, 2020). The order may be expressed through discrete hazard rates

$P(\Theta \preceq \Theta')$6

or equivalently through tail-ratio inequalities. The proof uses an inductive reduction on simplex dimension, conditioning on the last coordinate, followed by a simplex-to-cube substitution of the form

$P(\Theta \preceq \Theta')$7

which factorizes the integral into $P(\Theta \preceq \Theta')$8 one-dimensional integrals, each contributing a factor $P(\Theta \preceq \Theta')$9 (Fried, 2020).

A later treatment places the hazard rate order between the likelihood ratio order and the usual stochastic order: $\mathcal F_\Theta \subseteq \mathcal F$0 consistent with

$\mathcal F_\Theta \subseteq \mathcal F$1

This use of restrictiveness is especially transparent: a more restrictive order is simply one that is satisfied by fewer randomly drawn pairs (Fried, 2021).

The same work proposes a randomness-testing application in which paired simplex vectors are checked for comparability under a chosen order and a binomial test is performed using the known null probability $\mathcal F_\Theta \subseteq \mathcal F$2 (Fried, 2021). This suggests that restrictiveness constants can function not only as order-theoretic descriptors but also as calibration parameters for statistical procedures.

3. Restrictiveness as average approximation error

A different formalization appears in model evaluation for economics. Here restrictiveness measures how much a model rules out, not merely how well it fits observed data. Let $\mathcal F_\Theta \subseteq \mathcal F$3 be a finite feature set, $\mathcal F_\Theta \subseteq \mathcal F$4 an outcome space, $\mathcal F_\Theta \subseteq \mathcal F$5 the unrestricted class of prediction rules, $\mathcal F_\Theta \subseteq \mathcal F$6 a model class, $\mathcal F_\Theta \subseteq \mathcal F$7 an eligible set encoding background constraints, and $\mathcal F_\Theta \subseteq \mathcal F$8 a discrepancy function. The distance from the model to a particular rule $\mathcal F_\Theta \subseteq \mathcal F$9 is

$r(\mathcal F_\Theta,\mathcal F)$0

Restrictiveness is then defined by

$r(\mathcal F_\Theta,\mathcal F)$1

where $r(\mathcal F_\Theta,\mathcal F)$2 is the uniform distribution on the eligible set (Fudenberg et al., 2020).

This construction is paired with completeness, a real-data fit measure,

$r(\mathcal F_\Theta,\mathcal F)$3

and model comparison proceeds via a Pareto frontier of classes that are simultaneously more complete and more restrictive (Fudenberg et al., 2020). When $r(\mathcal F_\Theta,\mathcal F)$4 and $r(\mathcal F_\Theta,\mathcal F)$5 are paired, the identity

$r(\mathcal F_\Theta,\mathcal F)$6

holds. This makes restrictiveness interpretable as the complement of attainable completeness relative to the unrestricted class (Fudenberg et al., 2020).

A central empirical point is that parameter count is not a reliable proxy for restrictiveness. In certainty equivalents, cumulative prospect theory had completeness about $r(\mathcal F_\Theta,\mathcal F)$7 and restrictiveness about $r(\mathcal F_\Theta,\mathcal F)$8, whereas disappointment aversion had completeness about $r(\mathcal F_\Theta,\mathcal F)$9 and restrictiveness about $\mathcal M \subseteq \Delta(\mathcal L)$0 (Fudenberg et al., 2020). In initial play, PCHM, Logit Level-1, and Logit PCHM were all extremely restrictive relative to weak dominance constraints, with restrictiveness values $\mathcal M \subseteq \Delta(\mathcal L)$1, $\mathcal M \subseteq \Delta(\mathcal L)$2, and $\mathcal M \subseteq \Delta(\mathcal L)$3, respectively (Fudenberg et al., 2020).

This framework is extended to infinite-dimensional functional and structural settings by replacing finite uniform sampling with Bayesian nonparametric draws from an evaluation distribution $\mathcal M \subseteq \Delta(\mathcal L)$4, including Gaussian process priors with kernels such as the Matérn $\mathcal M \subseteq \Delta(\mathcal L)$5 kernel

$\mathcal M \subseteq \Delta(\mathcal L)$6

The same restrictiveness ratio is then applied to semi/non-parametric function classes, shape-restricted classes, and structural models with endogeneity, instrumental variables, multiple equilibria, and nuisance components (Fudenberg et al., 7 Feb 2026). In this generalized setting, results consistent with the earlier certainty-equivalent ranking are obtained, but absolute restrictiveness is higher when the eligible set is the full continuum rather than a finite sample; for example, the CPT full model is about $\mathcal M \subseteq \Delta(\mathcal L)$7 and the DA full model about $\mathcal M \subseteq \Delta(\mathcal L)$8 (Fudenberg et al., 7 Feb 2026). In multinomial choice with endogenous prices, IV exogeneity conditions substantially increase overall restrictiveness while altering model rankings (Fudenberg et al., 7 Feb 2026).

This suggests that restrictiveness in approximation-based frameworks is not a single property of a functional form. It depends on the eligible set, the discrepancy, the baseline, and the evaluation distribution.

4. Identification, expressiveness, and the geometry of restrictions

In identification theory, restrictiveness is tied to whether a model excludes behaviorally equivalent latent representations. For a finite alternative set $\mathcal M \subseteq \Delta(\mathcal L)$9, a random utility model is any subset

$$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$0

where $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$1 is the set of linear orders on $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$2. Two distributions over preferences are behaviorally equivalent if they generate the same choice probabilities on every menu. The key result is that behavioral equivalence is generated by Ryser swaps, which move mass across a conjugate square of preferences while preserving all choice probabilities. If $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$3 denotes the span of all Ryser swaps, then

$$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$4

A model is identified iff every affine translate of $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$5 intersects the model in at most one point: $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$6 For support restrictions, identification is equivalent to the statement that every finite sequence of Ryser swaps that stays inside the support is trivial (Caradonna et al., 2024).

When the model depends smoothly on parameters through $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$7, identification can, under mild topological assumptions, be reduced to a local rank test: $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$8 provided $$\Delta^n=\left\{(\theta_1,\ldots,\theta_n)\in\mathbb{R}^n:\ \theta_i\ge 0,\ \sum_{i=1}^n \theta_i=1\right\},$$9 is simply connected (Caradonna et al., 2024). In this usage, a restriction is “strong enough” precisely when it eliminates all motions along behavior-preserving directions.

A related but distinct sense of restrictiveness appears in defect CFT inversion. There the inversion framework is described as highly predictive but not automatically overconstraining. For a broad ansatz for the tilt four-point functions, crossing reduces six free parameters via

$\theta\in\Delta^n$0

$\theta\in\Delta^n$1

$\theta\in\Delta^n$2

and the inversion algorithm further forces

$\theta\in\Delta^n$3

The ansatz is therefore reduced to essentially one free parameter $\theta\in\Delta^n$4, showing a framework that is restrictive enough to rule out many correlator structures without collapsing to inconsistency (Sakkas, 2024).

In cosmology, “the restrictiveness of current data” can refer to the narrowing of viable parameter space once multiple observational and dynamical constraints are imposed simultaneously. In the five-dimensional braneworld study of quintessential inflation, the combined requirements from inflation, reheating, BBN, gravitational waves, and late-time acceleration eliminate the studied simple potentials. For the inverse power-law potential, thawing quintessence is possible only for about

$\theta\in\Delta^n$5

yet the $\theta\in\Delta^n$6 required for late-time acceleration destroys the inflationary parameter space; for the exponential potential, late-time quintessence fails outright (Dias et al., 2010). Here restrictiveness is the effective overconstraint generated by heterogeneous empirical requirements.

5. Restrictive assumptions, expressive limits, and assumption hierarchies

In many mathematical and computational settings, restrictiveness refers to the assumptions needed to make a method work. The kernel perspective on dynamic mode decomposition is a prominent example. For dynamics $\theta\in\Delta^n$7, the Koopman operator is

$\theta\in\Delta^n$8

The work shows that standard assumptions about lattices of eigenfunctions, common eigenfunctions across discretizations, and bounded or compact Koopman operators are highly restrictive in RKHS settings. Its sharpest theorem states that if $\theta\in\Delta^n$9 is the native RKHS of the Gaussian RBF kernel and $P_\theta$0 is entire, then boundedness of $P_\theta$1 on $P_\theta$2 implies

$P_\theta$3

for some matrix $P_\theta$4 and vector $P_\theta$5; the real corollary is that bounded Koopman operators on the Gaussian RBF native space are supported only by affine dynamics (Gonzalez et al., 2021). This is an especially strong form of assumption-driven restrictiveness: a popular kernel does not merely narrow the dynamics class; it forces affinity under boundedness.

OWL 2 DL exhibits a similar trade-off between decidability and expressiveness. The language imposes global restrictions based on the distinction between simple and complex object properties and on regularity conditions in the property hierarchy. These restrictions forbid, among other patterns, a property being both transitive and asymmetric, which blocks the natural encoding $P(\Theta \preceq \Theta')$08 for a strict partial order. They also forbid disjointness on transitive properties, functionality on complex properties, self restrictions on transitive closures, and certain recursive property-chain definitions (Schneider et al., 2012). The paper argues that the resulting loss in modeling power is substantial, and shows that direct first-order reasoning without the global restrictions can handle the test patterns successfully (Schneider et al., 2012).

In noisy matrix completion, restrictiveness is attached to standard assumptions rather than to a language fragment. Classical guarantees require incoherence and uniform random sampling, whereas leverage-score-aware sampling relaxes these assumptions. With

$P_\theta$6

Theorem 1 assumes

$P_\theta$7

and yields exact recovery with probability at least

$P_\theta$8

for the convex program

$P_\theta$9

The model is therefore less restrictive with respect to matrix structure, but only because sampling becomes more structured and leverage-dependent (Huang et al., 2020).

A formal hierarchy of restrictiveness appears in control-centric continuous-time optimization. With stationarity vector $x_1<\cdots<x_n$0 and Lyapunov function

$x_1<\cdots<x_n$1

three feedback realizations are explicitly ordered by restrictiveness on $x_1<\cdots<x_n$2: Hessian-gradient dynamics are least restrictive, Newton dynamics are more restrictive, and gradient dynamics are most restrictive (Mudrik et al., 6 Oct 2025). The hierarchy is assumption-driven. HGD requires only

$x_1<\cdots<x_n$3

ND requires invertibility of $x_1<\cdots<x_n$4, and GD requires

$x_1<\cdots<x_n$5

Here greater restrictiveness does not mean a smaller feasible set in state space; it means stronger curvature and monotonicity assumptions on the stationarity map (Mudrik et al., 6 Oct 2025).

6. Operational conservatism, policy design, and non-monotonic effects

In control and policy applications, restrictiveness commonly denotes conservatism: how strict a constraint is, how often an override occurs, or how narrow the admissible operating envelope becomes. In decentralized multi-agent safety control with black-box trajectory predictors, the predictor-based control barrier function constraint is

$x_1<\cdots<x_n$6

The conformal variable $x_1<\cdots<x_n$7 directly controls restrictiveness: larger $x_1<\cdots<x_n$8 makes $x_1<\cdots<x_n$9 looser, smaller $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$0 makes it stricter. It is updated through conformal decision theory by

$P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$1

so that high observed loss decreases $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$2 and tightens the safety constraint (Huriot et al., 2024).

A sampling-based safety filter gives a related but probabilistic notion. Its $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$3-restrictiveness property states that if the filter overrides the nominal input, then

$P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$4

Using the scenario approach, the sample-size condition

$P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$5

ensures that, with probability at least $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$6, an override occurs only when safe future control sequences are rare under the sampling distribution $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$7 (Park et al., 24 Apr 2026). In distributed model predictive safety certification, conservatism is mitigated by allowing subsystems to negotiate local tube sizes $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$8, rather than using a fixed rigid partition of the invariant-tube budget, thereby reducing the restrictiveness of the safety certificate while preserving recursive feasibility (Muntwiler et al., 2019).

The same operational vocabulary appears in fail-safe quadcopter control. Restrictiveness is measured by admissible output limits, initial conditions, controller frequencies, symmetry constraints, and robustness to model uncertainty. The two-propeller architecture is reported to be less restrictive than the three-propeller architecture: it tolerates larger initial attitude deviations, lower controller frequencies, and greater model uncertainty, despite having fewer active propellers (Rible et al., 2020).

Outside control, policy models show that more restrictive interventions are not necessarily better in the objective of interest. In the $P_\theta(X=x_i)=\theta_i,\qquad i=1,\ldots,n.$9-SEIR model with social topology, lockdown restrictiveness is encoded by how strongly the degree distribution is shifted toward lower-contact states: smaller $P(\Theta \preceq \Theta')$00 in regular networks or larger $P(\Theta \preceq \Theta')$01 in scale-free networks means more restrictive distancing. Yet sufficiently restrictive lockdowns can produce a larger second wave; in the reported examples, the second peak surpasses the first for

$P(\Theta \preceq \Theta')$02

in regular networks with non-repeating lockdowns and $P(\Theta \preceq \Theta')$03, and for

$P(\Theta \preceq \Theta')$04

in scale-free networks (Rozan et al., 2023). The mechanism is preservation of a larger susceptible reservoir during the restrictive phase.

Flow-based market coupling exhibits an analogous trade-off. The feasible day-ahead trading domain

$P(\Theta \preceq \Theta')$05

becomes less restrictive as minRAM is increased. In the Central Western Europe case study, moving from $P(\Theta \preceq \Theta')$06 to $P(\Theta \preceq \Theta')$07 minRAM lowers total system cost, improves price convergence, and changes congestion-management volumes, but the relation is not one-dimensional because more permissive day-ahead allocation can shift stress into redispatch or curtailment (Weinhold, 2021). The paper therefore treats restrictiveness as a policy parameter governing the trade-off between permissive exchange capacity and downstream congestion management.

A recurring misconception is that greater restrictiveness is automatically epistemically or operationally desirable. The cited literature does not support that view. Restrictiveness can be useful when it identifies a model, enforces safety, or rules out implausible behavior. It can also be harmful when it reflects unnecessarily strong assumptions, overconstrains a viable theory, blocks natural modeling patterns, or produces excessive conservatism. The substantive question is always relative: restrictive with respect to what ambient class, what objective, and what cost of exclusion.