A Kernelization-Based Approach to Nonparametric Binary Choice Models
Guo Yan

TL;DR
This paper introduces a scalable kernel-based estimator for nonparametric binary choice models that avoids parametric assumptions, improves finite sample performance, and is applicable to real-world data like court decisions.
Contribution
It presents a novel kernelization approach using spectral cut-off regularization for nonparametric binary choice models, enhancing computational efficiency and robustness.
Findings
Estimator is consistent and asymptotically normal.
Improves finite sample performance under misspecification.
Applied to US asylum court data to analyze temperature effects.
Abstract
We propose a new estimator for nonparametric binary choice models that does not impose a parametric structure on either the systematic function of covariates or the distribution of the error term. A key advantage of our approach is its computational scalability in the number of covariates. For instance, even when assuming a normal error distribution as in probit models, commonly used sieves for approximating an unknown function of covariates can lead to a large-dimensional optimization problem when the number of covariates is moderate. Our approach, motivated by kernel methods in machine learning, views certain reproducing kernel Hilbert spaces as special sieve spaces, coupled with spectral cut-off regularization for dimension reduction. We establish the consistency of the proposed estimator and asymptotic normality of the plug-in estimator for weighted average partial derivatives.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConsumer Market Behavior and Pricing · Economic and Environmental Valuation · Spatial and Panel Data Analysis
