More Like this

1. Empirical Privacy Variance

   Hu, Yuzheng; Wu, Fan; Xian, Ruicheng; Liu, Yuhang; Zakynthinou, Lydia; Kamath, Pritish; Zhang, Chiyuan; Forsyth, David (July 2025, openreview.net)
2. Empirical Re-Conceptualization: Bridging from Empirical Patterns to Insight and Understanding

   Ellis, A.B. (July 2020, Proceedings of the twenty-third Annual Conference on Research in Undergraduate Mathematics Education)

   Identifying patterns is an important part of mathematical investigation, but many students struggle to explain or justify their pattern-based generalizations or conjectures. These findings have led some researchers to argue for a de-emphasis on pattern-based activities, but others argue that empirical investigation can support the discovery of insight into a problem’s structure. We introduce a phenomenon we call empirical re-conceptualization, in which learners identify a conjecture based on an empirical pattern, and then re-interpret that conjecture from a structural perspective. We elaborate this construct by drawing on interview data from undergraduate calculus students and research mathematicians, providing a representative example of empirical re-conceptualization from each participant group. Our findings indicate that developing empirical results can foster subsequent insights, which can in turn lead to justification and proof. 

   more » « less
3. Empirical Re-Conceptualization: Bridging from Empirical Patterns to Insight and Understanding

   Ellis, A.B. (January 2020, Research in Undergraduate Mathematics)

   null (Ed.)
4. Empirical Q-Value Iteration

   https://doi.org/10.1287/stsy.2019.0062  

   Kalathil, Dileep; Borkar, Vivek S.; Jain, Rahul (October 2020, Stochastic Systems)

   null (Ed.)

   We propose a new simple and natural algorithm for learning the optimal Q-value function of a discounted-cost Markov decision process (MDP) when the transition kernels are unknown. Unlike the classical learning algorithms for MDPs, such as Q-learning and actor-critic algorithms, this algorithm does not depend on a stochastic approximation-based method. We show that our algorithm, which we call the empirical Q-value iteration algorithm, converges to the optimal Q-value function. We also give a rate of convergence or a nonasymptotic sample complexity bound and show that an asynchronous (or online) version of the algorithm will also work. Preliminary experimental results suggest a faster rate of convergence to a ballpark estimate for our algorithm compared with stochastic approximation-based algorithms. 

   more » « less
5. Robust Empirical Bayes Confidence Intervals

   https://doi.org/10.3982/ECTA18597  

   Armstrong, Timothy B.; Kolesár, Michal; Plagborg-Møller, Mikkel (January 2022, Econometrica)

   We construct robust empirical Bayes confidence intervals (EBCIs) in a normal means problem. The intervals are centered at the usual linear empirical Bayes estimator, but use a critical value accounting for shrinkage. Parametric EBCIs that assume a normal distribution for the means (Morris (1983b)) may substantially undercover when this assumption is violated. In contrast, our EBCIs control coverage regardless of the means distribution, while remaining close in length to the parametric EBCIs when the means are indeed Gaussian. If the means are treated as fixed, our EBCIs have an average coverage guarantee: the coverage probability is at least 1 −  α on average across the n EBCIs for each of the means. Our empirical application considers the effects of U.S. neighborhoods on intergenerational mobility. 

   more » « less