{'fraction_non_alphanumeric': 0.018447348193697154, 'fraction_numerical': 0.0, 'mean_word_length': 5.711340206185567, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Technical Note - Dynamic Data-Driven Estimation of Nonparametric Choice Models

Choice models are prevalent in several application areas, and their nonparametric estimation was introduced to alleviate unreasonable assumptions in traditional parametric models. Existing literature focuses only on the static observational setting where all of the observations are given up front and lacks algorithms that provide explicit convergence rate guarantees or an a priori analysis for the model accuracy versus sparsity trade-off on the actual estimated model returned. In contrast, in “Dynamic Data-Driven Estimation of Nonparametric Choice Models,” Ho-Nguyen and Kılınç-Karzan focus on estimating a nonparametric choice model from observational data in a dynamic setting, where observations are obtained over time. They show that this estimation problem can be cast as a convex-concave saddle point joint estimation and optimization problem and provide an online convex optimization-based primal-dual framework for deriving algorithms for it. By tailoring this framework carefully to the choice model estimation problem, they provide low-cost algorithms that come with provable convergence guarantees, explicit theoretical bounds on the sparsity of the estimated model, and a superior empirical performance.