Papers for Rachel Leah Childers

Methodology

How it works

Every weekday night, after arXiv's 20:00 US-Eastern announcement, a GitHub Actions job fetches the papers announced in the last 7 days of listings in stat.ML, stat.ME, math.ST, stat.AP, stat.CO, stat.OT, econ.EM (new submissions, including cross-lists, and papers released late from moderation, dated by the listing they actually appeared in), scores each one on four criteria against a profile, and rebuilds this site. Nothing is filtered out: irrelevant papers are just ranked low.

The four criteria

Each paper's title and abstract is embedded with sentence-transformers/allenai-specter, a small model that runs on CPU. Each criterion is then converted to the paper's rank within the run, scaled to [0, 1], because raw similarities against different sets live on different scales. The ranks are combined with these weights:

criterionwhat it asksweight
your workweighted maximum cosine similarity to one of my papers0.3
favoritesweighted maximum cosine similarity to a paper I've listed as a favorite0.2
interestsweighted maximum cosine similarity to one of the interest statements below0.25
readinghow much the paper looks like my whole Zotero library (2489 papers read since grad school): mostly a tf-idf logistic-regression classifier trained to tell my library from a background sample of 15380 arXiv papers in these categories, plus a smaller part for mean similarity to the 10 nearest library papers (held out, the classifier tells arXiv preprints I've read from ones I haven't with AUC 0.8909)0.25

A paper that is closer to one of the avoid statements than to any of my papers, favorites or interests loses up to 0.3 from its combined score. It is pushed down, not removed.

Before the best match is taken, each profile item's average similarity to that day's papers is subtracted, so a generic item that is moderately close to everything doesn't win every comparison.

The highlighted sections at the top show only papers from the latest listing. Each paper appears under the one criterion it ranks highest on, so the sections don't repeat each other. The "why" line under every paper names the profile item that matched best, with its cosine similarity. For the reading criterion it shows the terms that pushed the classifier's score up the most.

Only derived data from the library is published: the classifier's vocabulary and coefficients, and embedding vectors. Titles and abstracts of the library stay on my laptop.

Interests

Semiparametric inference and debiased machine learning weight 1.5

Semiparametric efficiency and estimation of low-dimensional functionals with machine-learned nuisance parameters: influence functions and efficient influence function calculus, double or debiased machine learning, orthogonal and Neyman-orthogonal moments, cross-fitting, doubly robust and targeted estimators, automatic debiasing through Riesz representers and Riesz regression, automatic differentiation of influence functions, kernel debiased plug-in estimation, and inference for conditional or heterogeneous effects built on the same machinery. Includes prediction-powered and design-based semi-supervised inference, where model predictions, LLM annotations or synthetic data stand in for missing labels and validity is restored with a small gold-standard sample.

Adaptive data collection and anytime-valid inference weight 1.5

Statistical inference when data are collected adaptively or sequentially: adaptive experimental design, bandit algorithms used for estimation rather than regret, active and online data collection to estimate a target parameter efficiently, deciding which data source or measurement to acquire under a budget, inference after adaptive experiments, martingale concentration, confidence sequences, e-values and e-processes, safe anytime-valid and game-theoretic inference, and design-based confidence sequences for online experiments.

Online learning and statistical learning theory weight 1.2

Theory of prediction and learning: online learning and regret minimization against adversarial or nonstationary data, sequential Rademacher complexity, sequential probability assignment and minimax regret under log loss, relaxations and algorithm design from minimax analysis, eluder dimension and decision-estimation coefficients for interactive decision making, and generalization theory for overparameterized models — double descent, benign overfitting and interpolation, PAC-Bayes and compression bounds, algorithmic stability.

Reinforcement learning, policy learning and off-policy evaluation weight 1.2

Sequential decision making viewed statistically: off-policy evaluation and its semiparametric efficiency, doubly robust and double reinforcement learning, dynamic treatment regimes and optimal treatment allocation, policy learning with welfare or regret guarantees, offline reinforcement learning, sample complexity of model-based RL, costly observation and timing of actions, and reinforcement learning methods for solving economic models and finding equilibria.

Causal inference and identification in econometrics weight 1.2

Econometric methods for causal effects: identification with instruments, marginal treatment effects and continuous instruments, mediation, front-door and proximal identification, causal discovery and graphical models used to choose adjustment sets, difference-in-differences and event studies with staggered or continuous treatment, synthetic control, partial identification and inference on identified sets, weak identification, and causal interpretation of time series estimands such as impulse responses, local projections and structural VARs.

Computational methods for heterogeneous agent and dynamic economic models weight 1.3

Numerical solution of dynamic stochastic general equilibrium models with heterogeneous agents and aggregate shocks: HANK, Aiyagari and Krusell-Smith economies, sequence-space Jacobian methods, perturbation and linearization in function space, projection methods and sparse grids, continuous-time models solved as systems of partial differential equations, mean field games, and deep learning and neural network solution methods for high-dimensional dynamic programs, including physics-informed networks, deep BSDE solvers and neural operators.

Bayesian computation and structural estimation weight 1.2

Estimation of structural economic and statistical models by simulation and sampling: Hamiltonian Monte Carlo, Langevin dynamics and their convergence theory, sampling as optimization through gradient flows and optimal transport, sequential Monte Carlo and particle filters, variational inference and its behaviour under misspecification, differentiable state-space models and probabilistic programming, simulation-based and likelihood-free inference, moment matching and indirect inference, Bayesian workflow and model checking, and Bernstein-von Mises theorems.

Macroeconometrics and time series weight 1.0

Econometrics for macroeconomic time series: forecasting and nowcasting with large or shifting data, Bayesian VARs and priors for long-run relationships, low-frequency econometrics, local projections versus VARs, identification of structural shocks and impulse responses, distributional and heterogeneous responses to aggregate shocks, and combining micro and macro data to identify aggregate effects of monetary and fiscal policy.

Kernels, operators and functional data weight 1.0

Learning with infinite-dimensional objects: reproducing kernel Hilbert spaces and kernel mean embeddings, Koopman and transfer operators for dynamical systems, operator learning and neural operators, functional data regression and functional instrumental variables, ill-posed inverse problems and nonparametric IV, and spectral methods — graph Laplacians, diffusion maps and manifold learning.

Language models as statistical objects weight 1.0

Statistical and theoretical views of large language models and deep learning: in-context learning as statistical estimation, transformers as algorithms, probabilistic inference and sequential Monte Carlo over language model outputs, preference learning, reward modelling and dueling bandits behind RLHF, using LLM outputs and simulations as data for social science with valid inference, and results that change how the field understands why deep learning generalizes.

Empirical Bayes, shrinkage and decision theory weight 1.0

Compound decision problems and empirical Bayes: nonparametric maximum likelihood for mixing distributions, shrinkage and hierarchical models for many parallel estimates, meta-analysis and aggregating evidence across studies, forecasting with dynamic panels, and statistical decision theory for policy choice under uncertainty.

Things to push down

Incremental deep learning weight 1.0

A new neural network architecture, training trick, prompting method, agent framework or retrieval-augmented generation pipeline evaluated by accuracy on standard benchmarks, with state-of-the-art results and ablations but no statistical, causal or economic question behind it.

Domain applications of machine learning weight 1.0

Applying deep learning or standard machine learning to a specific engineering or science domain: medical imaging, remote sensing, wireless networks, traffic and energy load forecasting, fault detection, materials and molecules, genomics, clinical prediction models, speech and computer vision datasets.

Clinical and biomedical studies weight 1.0

Reports of clinical trials, epidemiological cohort studies, biostatistics for a clinical audience, survival analysis of a particular patient population, pharmacometrics and bioinformatics pipelines.

My papers

Favorites

From my year-end "papers I liked" posts and papers I've linked on Bluesky.

Caveats

This is all machine similarity, and it is sometimes wrong. The ranks are relative to one run, so they compare a paper with the others found that week and say nothing more. Papers first announced in another category and cross-listed into these categories later don't appear.