论文检索

Under i.i.d. sampling, the maximum score estimator of Manski (1975) converges at the cube-root rate to a non-Gaussian limit. We show that, under multiway dependence and low-level conditions, it is asymptotically normal at a parametric rate in the smallest number of clusters and, when the cluster-level variance is non-degenerate, as fast as regular estimators such as probit. The result rests on a general theory for non-smooth M-estimators, under which a modified bootstrap is…

动态面板多项Logit模型AI 解读

This paper provides moment conditions for dynamic multinomial logit panel data models with individual specific fixed effects. The moment conditions do not depend on the fixed effects and thus form the basis for generalized method of moments estimation. For a leading case, we provide sufficient conditions under which the moment conditions identify the common parameters, and we illustrate their use in an empirical application to household soft drink purchases. The construction…

理性疏忽—加性随机效用模型的估计AI 解读

This paper develops likelihood-based estimation for parametric rational inattention--additive random utility models. We establish consistency and asymptotic normality of the exact maximum likelihood estimator and provide conditions under which the simulated estimator shares its asymptotic distribution. To implement estimation, we develop Newton--BA, a KKT-guided hybrid of Newton--Raphson and Blahut--Arimoto (BA). The algorithm accommodates both interior and boundary…

受限因变量模型中可扩展的似然推断AI 解读

Limited dependent variable models are central to empirical economics, but likelihood-based inference is infeasible when likelihoods involve high-dimensional integration over latent variables. This paper proposes Stochastically Estimated Gradient Ascent (SEGA), a scalable estimation approach for limited dependent variable models. Using Fisher's identity, SEGA replaces the intractable likelihood score with an unbiased augmented data score evaluated at a single conditional draw…

大规模需求估计的贝叶斯机器学习方法AI 解读

This work studies how Bayesian machine learning methods can be used for large-scale demand estimation with many product categories. I compare two model classes, a latent factorization model and a mixed logit model and two Bayesian estimation approaches, Markov Chain Monte Carlo (MCMC) and Variational Inference (VI). The analysis combines a simulation study with an application to supermarket scanner data. The results show that the latent factorization model benefits from…

组合取胜：用于分布外预测的模型平均AI 解读

Travel behaviour modellers have an increasingly diverse set of models at their disposal, ranging from traditional econometric structures to models from mathematical psychology and data-driven approaches from machine learning. A key question arises as to how well these different models perform in forecasting, especially when considering trips of different characteristics from those used in estimation, i.e. out-of-distribution prediction, and whether better predictions can be…

稀疏依赖下二元配置概率的对抗估计AI 解读

We consider the problem of estimating binary configuration probabilities, which is common in operations management applications, including product bundling, advertising, etc. Existing approaches typically model each assortment as a category and apply multinomial models to estimate the choice probabilities; while computationally convenient, these methods do not exploit independence structures in the joint distribution and may therefore be statistically inefficient when the…

扰动效用模型的 Fenchel–Young 估计量AI 解读

Perturbed Utility Models (PUMs) represent discrete choice as utility maximization under convex perturbation or regularization, encompassing a broad class of choice models, including Multinomial Logit (MNL) and models that permit zero choice probabilities. Because, for general perturbations, maximum likelihood may be non-convex, and the negative log-likelihood is infinite when a sparse model assigns zero probability to an observed choice, we specialize the Fenchel--Young…

熵正则化最优传输下的部分识别AI 解读

In many statistical settings, the available data and maintained assumptions do not suffice to uniquely identify the model parameters of interest. In such cases, one can only identify sets which are guaranteed to contain the true parameters. These are often characterized through linear programs that optimize over models compatible with the observed data. These programs can be infinite-dimensional in the optimizer and the number of constraints. We provide a unified way to…

离散选择面板模型中平均效应的界AI 解读

In discrete choice panel data, estimation of average effects is crucial for quantifying the effect of covariates, and for policy evaluation and counterfactual analysis. However, in short panels with individual-specific effects, challenges arise due to partial identification and the incidental parameter problem. In particular, estimating the sharp identified set of average effects becomes impractical when covariates have large support sets, such as when they are continuous.…

测度线性表示模型中识别、计算与推断的对抗方法AI 解读

We develop a framework for identification, computation, and inference in econometric models with a linear-in-measures representation. These models express maintained restrictions as moment conditions linear in the joint probability measure of observed and latent inputs, and map that measure linearly to the distribution of outputs, even with nonlinear outcome equations. We construct an adversarial discrepancy function whose zeros characterize the identified set for structural…

似然模型中的正交矩AI 解读

Many models, such as fixed-effect models for panel or network data, are hard to estimate because they feature nuisance parameters that are both numerous and estimated imprecisely. This, in general, causes an incidental-parameter problem in the estimator of the parameters of interest. The problem can be alleviated by working with an estimating equation whose expectation is insensitive to the value of the nuisance parameters. We discuss and contrast three notions of…

BLP 模型中的条件矩估计与推断AI 解读

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…

内生网络下的半参数动态 Logit 模型AI 解读

Many choices persist over time and are made among friends. Teenagers who smoke tend to keep smoking, and they tend to have friends who smoke. Part of this persistence is habit, but part may come from characteristics researchers do not observe, such as a taste for risk, that shape both whether a student smokes and whom they befriend. Methods that treat friendships as given cannot separate the two when the characteristic changes over time. This paper shows how the friendship…

大规模BLP估计的随机嵌套不动点算法AI 解读

We develop a stochastic nested fixed point (SNFP) estimator for random coefficients logit demand models that updates model parameters using stochastic gradients and performs demand inversion one market at a time. Relative to the conventional nested fixed point (NFP) estimator, SNFP substantially reduces memory requirements and computational cost, making estimation feasible in very large datasets. We establish the large-$T$ (number of markets) asymptotic properties of the…

含不可观测异质性的动态离散选择模型序贯估计AI 解读

Unobserved heterogeneity is empirically central in dynamic discrete choice models but computationally costly to incorporate: estimation requires repeatedly solving fixed-point equations for every latent type. We develop EM-NPL($q$), a unified framework combining the sequential pseudo-likelihood (NPL) and finite-mixture Expectation-Maximization (EM) algorithms, truncating the inner solver to $q$ iterations, and accommodating the Bellman, policy valuation, Euler, and Efficient…

可变选择集下的需求估计：嵌套 Logit 的似然修正AI 解读

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…

存在低报的有序选择模型中的变化中变化方法AI 解读

We develop a Difference-in-Differences framework for discrete, ordered outcomes subject to underreporting. Such outcomes commonly arise in self-reported surveys on socially undesirable or stigmatized behaviors, where respondents may conceal their true behavior. For a discrete Changes-in-Changes model that is shown to admit an equivalent threshold-crossing representation, we derive nonparametric bounds for the counterfactual and factual outcome distributions as well as for…

注意力过载AI 解读

We introduce an Attention Overload Model (AOM) in which alternatives compete for attention, so each alternative's consideration probability weakly decreases as the choice problem expands. This nonparametric restriction has a search-capacity foundation. We identify exactly which preference rankings are compatible with observed choices and establish sharp bounds on latent attention. We then consider heterogeneous preferences in settings where alternatives are presented in a…

二元选择模型的简便高功效诊断检验AI 解读

Conventional binary choice models, such as probit and logit, impose thin-tailed errors, and that tail determines whether the parameters of a binary choice model can be estimated at the regular rate. We test the restriction on observables, asking whether the conditional choice probability decays at a polynomial rate in a covariate. Identification of tail heaviness requires no independence, no linear index, and no homoskedasticity. The test is simple to implement and attains…

Softmax 混合模型中的 EM 算法与矩估计AI 解读

Softmax Mixture Models (SMMs) are discrete $K$-component mixture models for the probabilities of selecting one of $p$ candidate feature vectors $X_1,\ldots,X_p\in\mathbb{R}^L$ in heterogeneous populations and are widely used in econometrics and scientific applications. Related softmax mixture mechanisms also appear in modern LLM architectures. We provide a theoretical and methodological study of SMMs, focusing on the Expectation-Maximization (EM) algorithm and the Method of…

通过等变神经网络实现相关误差离散选择模型的摊销推断AI 解读

Discrete choice models are fundamental tools in management science, economics, and marketing for understanding and predicting decision-making. Logit-based models are dominant in applied work, largely due to their convenient closed-form expressions for choice probabilities. However, they impose restrictive assumptions on the stochastic utility component, constraining our ability to capture realistic substitution patterns. We propose an amortized inference approach that relies…

组成型双重差分AI 解读

Many causal questions involve outcomes distributed across mutually exclusive categories, such as votes by party, employment by status, or electricity generation by energy source, where researchers care about both the shares and the total quantity. It is well known that linear Difference-in-Differences (DiD) methods applied to category shares can produce incoherent counterfactuals and lack a discrete-choice foundation. This paper develops Compositional…

最大得分模型与线性规划下的二元分类AI 解读

This paper presents a computationally efficient method for binary classification using Manski's (1975, 1985) maximum score model when covariates are discretely distributed and parameters are partially but not point identified. We establish minimax-regret-optimal classification rules that take account of partial identification of the model's parameters. We bound misclassification probabilities and expected excess regret induced by sampling uncertainty. We also describe an…