Papers

I study dynamic treatment effects in panel data under staggered adoption when treatment timing depends jointly on unobserved time-invariant heterogeneity and time-varying pretreatment covariates, including lagged outcomes. Untreated potential outcomes follow a nonparametric dynamic panel model that allows flexible interactions between time-varying covariates and latent heterogeneity. I use pretreatment outcome histories to find individuals with similar time-invariant latent factors, and the key requirement is that these histories are sufficiently informative about those latent factors. I develop an identification strategy for the dynamic average treatment effect on the treated (ATT) and propose kernel-based doubly robust estimators for the dynamic ATT. I further combine double cross-fitting with undersmoothing and show that, under suitable regularity conditions, the proposed estimators are $\sqrt{n}$-consistent, asymptotically normal, and asymptotically unbiased. The simulation study demonstrates that the proposed method provides accurate inference across a wide range of data-generating processes. I illustrate the method with an application to the U.S. family planning program studied by Bailey (2012) and reestimate its effect on fertility rates.

We investigate Empirical Bayes (EB) methods in the context of compound adaptive experiments, where the arm distribution in each experiment follows a normal distribution with an unknown mean that we seek to estimate. There are two main EB strategies: $g$-modeling, which estimates the prior by maximizing the marginal likelihood, and $f$-modeling, which derives posterior means directly from the empirical distribution of the observations. We show that $g$-modeling continues to be a valid EB procedure even when it incorrectly assumes that data are collected exogenously; its validity does not depend on the particular sampling algorithm or on whether sample sizes are endogenous. In practice, one can apply standard $g$-modeling techniques by acting as though the data were exogenously sampled. We extend regret guarantees from exogenous sampling to adaptively generated data. By contrast, naively applying the Tweedie formula based on the marginal density of the observed data, as in standard $f$-modeling, can produce biased rules under adaptive sampling. We corroborate the robustness of $g$-modeling through simulations with widely used adaptive algorithms and demonstrate its applicability using a real-world dataset consisting of multiple sequential experiments.

This paper develops Wald inference for least-squares estimation of linear regression models on dyadic data, accommodating configurations where multiple observations share the same pair of units (e.g., directed flows, multilayer networks, and dyadic panels). We establish that the dyadic-robust Wald statistic is asymptotically $\chi^2_q$ for an arbitrary nonrandom sequence of full-rank restrictions, under a single condition on the accumulation of dependence. Throughout, no convergence rate is assumed or estimated, permitting the condition number of the score's variance matrix to diverge. We further propose a delete-one-unit jackknife alternative that is positive semidefinite by construction. This jackknife statistic attains the same asymptotic limit under one additional condition on dyad multiplicity and remains asymptotically conservative when that condition fails. A supplement contains all proofs, Monte Carlo experiments featuring estimated coefficients that converge at heterogeneous rates, and an empirical gravity application to bilateral trade.

Model robustness analysis estimates an effect across a multiverse of specifications that pools control sets identifying the declared estimand with sets that condition on mediators or colliders. We propose stating rival assumptions about contested controls as a small set of candidate causal graphs, enumerating the adjustment sets each graph licenses, and reporting robustness metrics conditional on each graph. A finite-mixture identity splits the licensed multiverse's dispersion into within-graph and between-graph components; the between-graph share is a conditional descriptive summary whose reading depends on the candidate set, the weights, and a common estimand. Simulations examine misleading pooled robustness assessments and the limits of the decomposition. Applications to hurricane fatalities, job training, and union wages show fragility that survives every graph, instability produced by unlicensed specifications, and a fragility verdict concealing a significant premium in each adjustment-identified candidate world. An R package implements the workflow.

Anthropogenic forcing components follow different long-run paths, while persistent temperature change can involve distributional changes beyond the mean. Scalar regressions aggregate these components and retain only mean temperature, obscuring how distinct forcing paths relate to persistent distributional change. We develop new testing, estimation, and inference methods for long-run relations between an integrated predictor vector and a density-valued response. These comprise a residual-based test of between-cointegration (whether predictor trends account for all stochastic trends in the response density), a fully modified least-squares estimator of predictor-specific functional responses, and simulation-based inference for interpretable projections. We apply the methods to densities of observed local temperature anomalies and anthropogenic effective radiative forcing divided into CO$_2$ and non-CO$_2$ portfolios. The test results are consistent with persistent movements in these portfolios statistically accounting for the persistent evolution of the anomaly distribution, with no additional stochastic trend detected in the residual. A joint test rejects the common-response restriction imposed by aggregating the two portfolios. The fitted CO$_2$ response mainly shifts mass toward warmer anomalies and increases central concentration, whereas the non-CO$_2$ response produces a smaller shift but greater dispersion and off-center reshaping. Positive fitted mean responses for both portfolios conceal these contrasts, demonstrating the information lost through scalar aggregation.

The Money Pump Index (MPI) of Echenique et al. (2011) measures the severity of consumer irrationality, but computing the exact mean and median MPI over all revealed preference cycles is NP-hard (Smeulders et al., 2013). Existing solutions rely on heuristic proxies, such as evaluating only shorter cycles or bounding the MPI. By framing revealed preferences as a directed graph, this paper projects choice violations onto fundamental cycle bases, which are minimal sets of linearly independent cycles that span the graph's entire cycle space. This yields computationally tractable estimators for the mean and median MPI that are asymptotically equivalent to the original MPI. Applying this methodology to the scanner dataset analyzed by Echenique et al. (2011) and Smeulders et al., (2013), the proposed estimators compute quickly and with negligible small-sample bias.

Likelihood-based network models are often fitted under links' independence and low-order constraints, while empirical networks frequently exhibit systematic higher-order structures such as triangles and wedges, characterizing the observed clustering patterns. Real-world core-periphery networks such as the interbank market or the air transportation system represent key examples, with cores displaying complex and nonlinear features. We formalize Penalized Likelihood with Structural Discrepancies (PLSD) as an inference-level correction that trades likelihood fit for agreement with targeted motifs. PLSD augments the negative log-likelihood with a penalty on standardized wedge and triangle discrepancies, yielding a controlled distortion of the likelihood surface that can be interpreted through a linear response analysis. A calibration approach for the unique tuning hyperparameter is introduced to turn off the penalization term when the model is correctly specified, thereby recovering maximum-likelihood estimation in that case. We then introduce a mixed-constraint maximum-entropy core-periphery Exponential Random Graph Model (ERGM), derive unconditional semi-closed motif formulas under Pareto-distributed core fitness, and interpret sparse-regime scaling through a big-jump mechanism for heavy-tailed distributions. We finally corroborate the PLSD inference methodology both with Monte Carlo simulations of a toy stochastic block model and by applying the novel core-periphery ERGM to weekly eMID interbank networks (2009-2015) and monthly US air traffic networks (1991-2000). We show that PLSD describes cores that are not only dense but also higher-order-rich and captures the observed heterogeneous degree distributions and the overexpression of wedges and triangles, at a link-level cost proportional to the model misspecification.

The random-coefficient demand model of Berry, Levinsohn, and Pakes (1995) is commonly estimated by the generalized method of moments (GMM), using an unconditional moment restriction with a fixed set of instruments. Identification of the model, however, rests on a conditional moment restriction. The two are not equivalent: the unconditional restriction may admit additional parameter values. We construct a counterexample in which the model is identified by the conditional restriction yet standard GMM is not, even with the optimal instrument. Building directly on the identifying restriction, we propose a two-step estimator, following Ai and Chen (2003), that first estimates the relevant conditional expectations nonparametrically and then selects the structural parameters by a conditional-variance-weighted minimum-distance criterion; standard GMM is recovered as the special case of a linear projection onto finitely many instruments. We establish root-T asymptotic normality for the proposed estimator, and we develop the theory for both kernel and series implementations of the first stage. The two implementations share a common limiting distribution, attaining the semiparametric efficiency bound. Simulation evidence illustrates the consequences of the identification gap and demonstrates that the proposed estimator outperforms standard GMM in finite samples.

Predict-then-optimize methods learn a mapping from features to unknown edge costs. They then solve the shortest-path problem on the predicted costs. We study a feature-free alternative for the case where the decision-maker observes many noisy cost vectors on a fixed network. The cost vectors are denoised by an eigenvalue decomposition (PCA) of their covariance matrix. Dijkstra's algorithm then runs on the result. We test this on the $5\times5$ grid of \citet{elmachtoub2022}, with $1000$ independent replications and a fresh ground truth in each. We compare against SPO+, against naive Dijkstra on noisy costs, and against two alternatives to a hand-picked rank $k$ (the Gavish-Donoho threshold and a Ledoit-Wolf filter). We also test a hybrid of SPO+ and PCA. Four findings emerge. First, the rank matters. Keeping $k=2$ components performs worse than no denoising. Second, when costs are close to linear in the features, the Gavish-Donoho threshold recovers the true rank without supervision. PCA-denoised Dijkstra outperforms SPO+ at $\deg=1$, but underperforms SPO+ at $\deg\geq 2$. The hybrid works best at $\deg=1$ and is slightly better than SPO+ at $\deg=2$. Third, when costs are strongly nonlinear ($\deg=4$), the signal is no longer low-rank, and only the Ledoit-Wolf filter clearly beats the naive baseline. Fourth, the benefit of denoising grows with network size on grids, but not on a layered non-grid network at high nonlinearity.

Two frequent approaches for identifying structural VARs are external instruments, which carry economic content but are often weak, and non-Gaussianity of the shocks, which provides statistical identification but carries no economic meaning. We combine the two strategies in a single generalized method of moments framework. This hybrid approach point-identifies the target shocks while also identifying the non-target shocks up to sign and ordering. Under suitable rank conditions, the higher-order moments of the structural shocks anchor the identification uniformly over the instrument strength. Consequently, under local-to-zero proxy relevance, estimators of the dynamic causal effects remain consistent, and standard asymptotic inference remains valid. Moreover, the Anderson-Rubin confidence sets are substantially narrower than their instrument-only counterparts. The hybrid estimator is also more efficient than either source of identification used in isolation: at any fixed proxy relevance, even a weak instrument increases the efficiency of the estimator through its covariance with the non-Gaussian moment block. Under local deviations from proxy exogeneity, we provide asymptotic bias bounds and show that stronger non-Gaussianity of the shocks compresses the bias. Finally, the over-identified structure yields two mutually orthogonal specification tests for proxy exogeneity and the validity of the higher-order moment conditions. We derive their limiting distributions and provide a bootstrap procedure for finite-sample critical values. Monte Carlo simulations and two applications with identification of oil news-shock and a Euro-area MP shock demonstrate the potential of our framework.

Observed choice in a dynamic game mixes current profit with continuation value. A rival adds a second problem: the same comparison averages over the rival's equilibrium policy. Changing the primitive transition rewrites continuation technology; changing the rival's Markov policy, holding that law fixed, rewrites the mixture over rival-contingent payoffs. The two are not substitutes. For a rival-feature payoff of rank $K$, rank identification up to location requires $\Ephi=\lceil(MK-1)/(M-1)\rceil$ policy environments, and a second kernel when payoffs are saturated. Rank can still be restored by arbitrarily small policy differences. Independent private shocks force mixed rival actions to factor, so a payoff that depends jointly on $d$ rivals is visible only at order $\eta^{d}$ near a common interior baseline. Either rank fails or the smallest identified singular value is at most $\kappa\eta^{\dPhi}$, independently of how many kernels are stacked. Oracle-GLS variance in that direction vanishes only if $n\eta^{2\dPhi}$ diverges. An Anderson–Rubin set that carries first-stage error in the design matrix covers without a vanishing-risk condition. On U.S.\ airline entry, even among rank-identified directions, the most favorable rival-dependent contrast is several times wider than observed behavior.

In social and economic networks linked agents often share connections in common. There are two competing explanations for this phenomenon. First, agents may have a structural taste for transitive links - the returns to linking may be higher if two agents share a common connection. Second, agents may assortatively match on unobserved attributes, a process called homophily. We study parameter identifiability in a simple model of dynamic network formation with both effects. Agents form, maintain, and dissolve links over time to maximize utility. The return to linking may be higher if agents share connections in common. A pair-specific utility component allows for arbitrary homophily on time-invariant agent attributes. We derive conditions under which it is possible to detect the presence of a taste for transitivity in the presence of assortative matching on unobservables. We leave the joint distribution of the initial network and the pair-specific utility component, both high dimensional nuisance parameters, unrestricted. Our identification result is constructive, suggesting an analog estimator, whose finite and (single) large network properties we characterize. We show, via examples, the delicacy of information accumulation in the single (large) network setting.

A switchback experiment alternates an entire system between treatment and control over time. It is especially useful when interactions between units can undermine standard unit-level experiments. Switchback experiments are commonly implemented on fixed temporal grids, which impose highly structured restrictions on when treatment can switch. We study a broader class of random-duration switchbacks, in which treatment and control alternate across runs whose durations are drawn from a common distribution. Under finite carryover, we show that the mean squared error of the Horvitz-Thompson estimator has a simple frequency-domain representation governed by how temporal outcome patterns align with design-induced imbalance and contamination patterns. This representation yields a tractable worst-case design criterion that can be computed directly from the duration distribution. Optimizing over even a simple two-rate family produces a run-age-dependent switching rule that reduces the asymptotic worst-case mean squared error by at least 32% relative to the standard independently randomized fixed-block switchback.

We develop a causal framework for matrix completion under missing not at random (MNAR) data. Drawing on synthetic controls from the econometric panel data literature, our approach relaxes two assumptions common in MNAR matrix completion: positivity and independence of observation indicators. Unlike traditional panel data models, which often require prescribed block-sparse geometries, our framework accommodates flexible, heterogeneous observation patterns through target-specific local information structures. We propose synthetic nearest neighbors (SNN), a local synthetic-controls-inspired estimator, and establish finite-sample entrywise error bounds and consistency for mean recovery under suitable conditions. We further derive asymptotic normality under heteroskedastic noise and develop feasible entrywise inference. To estimate entry-specific noise variances, we apply the same local principle to squared outcomes, obtaining consistency under bounded noise and asymptotic unbiasedness under general subgaussian noise. Simulation studies corroborate the theoretical findings across a range of missingness designs and observation patterns.

Probabilistic forecasting is central to decision-making under uncertainty, yet its methodological landscape has become increasingly fragmented across temporal and spatiotemporal forecasting, statistical modeling, machine learning, and deep generative modeling. This survey develops a unified perspective by organizing probabilistic forecasting methods according to where and how uncertainty is introduced into the forecasting pipeline. Our taxonomy connects model-agnostic approaches including ensembles and distribution-free calibration, with model-intrinsic approaches spanning Bayesian modeling, parametric predictive distributions, distributional regression, and modern generative models, and further examines the emerging role of time series foundation models. Beyond methodological synthesis, we identify the assumptions, computational demands, and forms of uncertainty represented by different paradigms, and translate these distinctions into data-driven and domain-specific guidance for method selection. We complement the survey with a cross-paradigm empirical study on univariate, multivariate, and spatiotemporal forecasting tasks. The results reveal that no single uncertainty-quantification paradigm dominates across settings. Calibration, sharpness, predictive accuracy, and computational efficiency can lead to substantially different model preferences, while expressive generative models and zero-shot foundation models exhibit markedly different accuracy-efficiency trade-offs. Lastly, we identify unresolved challenges surrounding uncertainty in evolving dependency structures, physics-informed predictive distributions, forecasting extreme events, handling count-valued, directional, and continuous-time series, and the development of unified software resources. Our survey provides both a conceptual framework and a practical roadmap for probabilistic forecasting research.

This paper studies identification and inference in a triangular system with an endogenous regressor when exclusion restrictions are unavailable and the dependence between structural disturbances is modeled through an unrestricted control function. In this setting, standard orthogonality conditions do not deliver point identification, as the unknown control function can rationalize a wide range of structural coefficients. We show that identifying information can be extracted from distributional shifts in the first-stage disturbance induced by an auxiliary variable that may directly affect the outcome. Imposing a local restriction on the log density ratio, together with an explicit bound on the sieve approximation error of the control function, we derive moment inequalities that restrict the structural parameter. We develop a practical inference procedure based on test inversion and multiplier bootstrap that accommodates generated regressors, cross-fitted sieve estimation, and locally estimated density-ratio nuisances. The results clarify how identification can be recovered from weak local distributional structure in the absence of classical instruments.

We derive the exact likelihood of the Berry (1994) share-form nested logit and show it contains a Jacobian term that depends on nest size and the nesting parameter. Omitting the term biases within-nest substitution estimates wherever choice sets vary across markets. Commonly-used count instruments for the within-nest share fail exclusion when product counts enter demand directly. The corrected likelihood identifies substitution without them, making crowding estimable. We apply the estimator to Medicare Advantage plan proliferation after 2019 elimination of the “meaningful difference” requirement. Estimates indicate plan proliferation raised consumer surplus in most markets, but ignoring crowding overstates the gains.

This paper investigates the construction of moment restrictions in dyadic network formation models with unobserved individual heterogeneity under nontransferable utility. Using observed links and covariates from five-node pentads, we construct moment restrictions that do not depend on individual fixed effects. For a broad class of covariate specifications, the construction is minimal in the sense that it uses the least possible number of nodes and dyads. Based on these moment restrictions, we propose the pentad-GMM estimator. We establish asymptotic normality of the pentad-GMM estimator in dense, sparse, and ultra-sparse network regimes, with regime-specific convergence rates and asymptotic variances. These results provide a basis for inference across all three regimes. To make our method computationally efficient, we develop an algorithm that reduces the computational cost of the estimator from naïve \(O(N^5)\) to \(O(N^3)\). We apply the proposed method to an academic-discussion network, and find academic homophily and a positive association between link formation and a potential partner's openness to different perspectives.

Including covariates alongside strictly monotone transformations can change a causal forest's treatment decisions without adding information. Random feature selection favors covariates represented by these multiple columns. Under stated conditions, I show that this imbalance can persist as samples grow. Treatment effect components associated with other covariates are omitted, attenuated, or recovered depending on their inclusion probabilities and tree depth. Simulations and a job-training replication illustrate sensitivity to redundant transformations. Sampling groups of variables that generate identical splits restores prediction invariance on the grouping data when fitting and randomization are held fixed.

Identification in vector autoregressions involves two distinct choices: how extensively to orthogonalize shocks and whether orthogonality is imposed sequentially or simultaneously. Generalized identification imposes no orthogonality; Sims (1980} imposes full orthogonality sequentially; Francis et al. (2026) impose full orthogonality simultaneously; and Buchwalter et al. (2026a) provide clustered partial orthogonalization sequentially. We fill the remaining case by developing simultaneous clustered orthogonalization (SCO). SCO preserves contemporaneous dependence within economically meaningful clusters while imposing orthogonality across clusters jointly, thereby eliminating dependence on cluster ordering. We formulate the associated correlation-maximizing identification problem and show that, in correlation space, it reduces to a quadratic matrix equation. This yields a closed-form solution, and we prove that the associated identification matrix is the unique global maximizer. SCO is order- and scale-invariant and nests generalized identification and full simultaneous orthogonalization as special cases, yielding a flexible family of structural decompositions indexed by the number and composition of clusters.

We establish a sharp pathwise signal-to-noise criterion for quasi-maximum-likelihood (QML) estimation of a dominant breakpoint in the second-moment structure of a multivariate time series: the QML estimator is consistent whenever the between-regime contrast exceeds the within-regime fluctuation by an explicit factor, and below this threshold global recovery can fail. Two innovations drive the result. First, the framework is pathwise: no stochastic model is imposed on the data. Second, the log-determinant objective carries an additive ridge regularization: it removes the endpoint boundary layers, so no trimming of the candidate set is required, and tuning the ridge weakens the consistency condition. As an application of the main theorem, we establish consistency of QML breakpoint estimation in pervasive factor models whose dimension diverges with the sample size, for completely general error terms – not necessarily independent, idiosyncratic, or even random.

Development and humanitarian organizations produce and support surveys, administrative registries, and other data resources to inform research, policy, and operations, yet systematically identifying where these datasets are referenced remains difficult. Such references are dispersed across research papers, project documents, humanitarian reports, and other unstructured text, limiting both the ability to trace data use and to identify potential gaps in data availability or dissemination. We present a weakly supervised framework for adapting dataset extraction to forced displacement and Fragile, Conflict, and Violence (FCV) documents without first constructing a large manually labeled training corpus. A lightweight model trained on general research literature generates candidate dataset mentions from unlabeled domain documents, which a frontier large language model (LLM) reviews in context, validating or rejecting candidates and correcting their extraction boundaries. The resulting annotations are supplemented with targeted synthetic and contrastive examples and used to fine-tune the lightweight model for large-scale extraction. We evaluate the resulting model on an independent gold-standard benchmark of 1,706 text passages spanning research, humanitarian, and operational documents. Across the full benchmark, the model achieves 74.1% precision and 70.5% recall at the mention level; among passages containing dataset references, precision reaches 89.5%. At the passage level, the model achieves 88.2% accuracy and 88.6% specificity in distinguishing passages with dataset references from those without them. These results demonstrate a practical approach for constructing domain-specific supervision when labeled data are limited, and provide a technical foundation for larger-scale analysis of data use and potential gaps in the displacement data landscape.

Generative artificial intelligence changes how firms reach customers, but standard marketing data do not record how often users see and notice a firm's name in generated answers. We develop Generative Marketing Mix Modeling (GMMM) to estimate the causal effects of Generative Engine Optimization (GEO) and Generative Engine Marketing (GEM). For GEO, GMMM combines repeated generated answers with question counts, shares of use across generative systems, and notice probabilities. For GEM, it combines records of sponsored placements with notice probabilities. GMMM compares expected business responses under alternative treatment sequences and establishes sufficient conditions for identifying the resulting effects. We investigate the empirical performance of the proposed method using simulated answers to product recommendation in English and Japanese.

Modeling the joint distribution of extreme values in high-dimensional financial time series is challenging because extremes are sparse and locally extreme observations are not necessarily extreme relative to their full marginal distribution. To address this, we introduce a time-dependent network Hüsler-Reiss model in which market-informed adjacency matrices determine how strongly observations contribute to the estimation. We propose binary and weighted specifications, including the Joint Extremes Adjacency Matrix (JEAM) which combines information about individual extremeness with historical patterns of joint extreme movements. In the forecasting evaluation part, covering one-minute stock returns from three sectors of the S&P 100, JEAM achieves the best out-of-sample log scores for both tail directions; improving scores by 12.5-13.6% in the lower tail and 11.4-14.9% in the upper tail. The results show that incorporating market-informed network structures in the estimation, improves forecast evaluation of extremes across time series.

Graphical causal inference supplies a complete theory of efficient covariate adjustment for the average treatment effect: one adjustment set, computable from the graph, is optimal under every compatible distribution. We show that this is a property of the average treatment effect's inverse-prevalence weights, not of causal estimands in general. For the average treatment effect on the treated we index the efficiency bound by the adjustment set and derive exact identities for its change under treatment-side and outcome-side extensions of a valid set. Covariates that predict only the treated-arm outcome are exactly efficiency-neutral, and covariates that predict the control-arm outcome can strictly increase the bound when the propensity is below one half – a reversal of the supplementation lemma whose source is an arithmetic-geometric-mean inequality that holds for the average treatment effect and fails for the treated-population estimand. A construction with two faithful distributions on one graph proves that no graphical optimality criterion exists for the treated-population estimand; under no effect modification the ATE-optimal set is nonetheless optimal among the graphically valid sets, with an exact expression for its advantage. The results extend to weighted average treatment effects with propensity-dependent weights, yielding symmetric thresholds for overlap weights, an estimand-drift phenomenon under instrument adjustment, and a characterization of constant weights as the only smooth positive weights for which outcome-side supplementation never increases the bound. Simulations and the LaLonde data provide illustrations.

We show how to optimally design experiments when the resulting data will be used to choose a welfare-maximizing policy subject to constraints. A decision maker seeks to maximize Bayes expected welfare by choosing a policy whose effects depend on an unknown finite-dimensional parameter. The decision maker has access to a first wave of experimental data with a fixed design but may choose the design of a second wave that will be collected before choosing the policy. The resulting experimental design–policy choice problem is a very high-dimensional dynamic program that is generally intractable in finite samples. We propose a tractable approximation based on the limit experiment and show it is asymptotically optimal using a new asymptotic representation theorem for adaptive experiments with continuous treatments. We apply the method to a conditional cash transfer experiment and demonstrate the potential for large gains from tailoring the experiment to the policy choice.

This paper studies identification in linear quantile panel models with unrestricted individual heterogeneity when the number of time periods is fixed and small. We impose strict exogeneity, whereby the conditional quantile restriction holds given the individual's complete regressor history and latent individual effect, but otherwise allow the disturbances to be arbitrarily dependent over time.

Many real-world policies and business interventions require assessing short-term effects to inform timely decisions, even though most causal inference methods focus on long-term average treatment effects. In this paper, we introduce average treatment effect localization (ATEL), which captures localized, short-term policy impacts in panel data settings with a single treated unit and provides early indicators of policy impact. To accommodate both time-varying and nonlinear effects of observed and unobserved covariates, we propose a nonparametric model for untreated outcome, interpreted as a time-varying factor model via sieve approximation. Estimating the time-varying factor model is challenging due to the boundary bias and identification. Our estimation method based on diversified projection can effectively address these issues. We develop an asymptotic distribution theory to facilitate inference for the ATEL estimator. In an empirical application, we apply our proposed methodology to assess the impact of right-to-carry laws on violent crime rate.

This paper presents a causal decision framework for list-price elasticities in intermediated retail channels, where estimates are confounded by promotions, competitor moves and shopkeeper pass-through. Rather than forcing a number when the evidence is ambiguous, the system treats abstention (Wait) as an active diagnostic output. Built on Double Machine Learning and conformal prediction, it evaluates whether conditions exist to act on a recommended price or whether withholding is preferable, and it states when: acting beats withholding exactly when the calibration slope of the true headroom on the recommended move exceeds one half, a condition that predicts the sign of the gain in 37 of 38 synthetic groups. When the system abstains, it classifies the cause and flags which products are candidates for a designed pricing experiment. Aggregating estimates to the brand or category level, where independent price designs average out, cuts the root mean squared error from 0.488 to 0.159, although aggregation alone does not make the intervals honest. Tested on synthetic data with known truth and on public scanner data, the study reports its costs: the system abstains on 52% to 87% of presentations that were identifiable, and a single-window estimate forecasts real price changes poorly (calibration slope 0.22). What it offers is a way to audit any abstention rule and to publish at the unit the evidence supports; no commercial panel or pilot was used, so it does not measure commercial uplift.

Policy decisions often hinge on conventional p-value thresholds, which ignore economic costs and benefits of further data collection. This paper recasts statistical significance as a choice between making an immediate policy recommendation and deferring it until further evidence is collected. The welfare-optimal decision corresponds, under minimax regret, to a statistical test whose level depends on the cost and precision of additional evidence. Inverting this rule, we introduce and recommend reporting the abstention-value (A-value) to determine where additional data collection is most needed. The A-value defines the break-even welfare cost of abstaining and recommending further experimentation given the initial evidence. Computing the A-value only requires a point estimate and its standard error, imposes no prior assumptions on policy effects, and can be converted to a monetary research budget using inputs already frequently used by regulators and funding agencies. When experimentation capacity is limited, we show that prioritizing additional data collection where A-values are the largest yields strong finite-sample guarantees. Applications to anti-poverty programs and to a medical study illustrate the practical benefits of using A-values.