Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

54109163217 · May 202619922001200920172026
48 results for inverse propensity score

Improves robustness of propensity score estimators in challenging settings.

problem Limited overlap, small sample sizes, or unbalanced data.
method Extends calibration techniques for propensity score models, focusing on sample-splitting schemes.
result Calibration reduces variance and bias in inverse probability weighting and double/debiased machine learning frameworks.

New method improves causal effect estimation by addressing imbalance in training data.

problem Imbalance between treatment and control groups in training data.
method Combines distributionally robust optimization and weight regularization.
result Consistent improvements over existing methods in experiments.

Optimizes insurance pricing by accounting for policyholders' price sensitivity.

problem Traditional insurance pricing does not consider policyholders' price sensitivity.
method Formulates insurance pricing as a decision-making problem and uses off-policy evaluation and stochastic control.
result Neural networks outperform existing techniques for policy optimization.

The paper resolves the paradox of using unlabeled data for treatment effect estimation.

problem Using unlabeled data to estimate propensity scores for treatment effect estimation.
method Proposes a simple procedure to reconcile the use of estimated propensity scores with the advice to use true propensity scores.
result Direct regression may be preferable to inverse-propensity weighting in many circumstances.

FIDDLE uses deep learning to estimate ATE from complex data.

problem Estimating ATE from high-dimensional, correlated covariates with sparse nonlinear effects.
method Factor-augmented deep learning for propensity and outcome models.
result FIDDLE consistently estimates ATE under model misspecification and is semiparametrically efficient.

Study designs for estimating treatment effects in adaptive experiments.

problem Estimating treatment effects under adaptive treatment assignment.
method Propose and analyze IPW and AIPW estimators, establish CLTs under design stability.
result Central limit theorems for IPW and AIPW estimators under design stability.

The paper addresses statistical inference for online decision-making in a contextual bandit setting.

problem Understanding the performance of reward models in online decision-making with contextual information.
method The paper uses the contextual bandit framework with a linear reward model and the ε\varepsilon-greedy policy to address the exploration-exploitation dilemma. It employs the martingale central limit theorem and inverse propensity score weighting to establish asymptotic normality of parameter estimators.
result The online ordinary least squares estimator and the online weighted least squares estimator are asymptotically normal, providing insights into the performance of the reward model.

Proposes a new method to handle data heterogeneity in causal inference.

problem Challenges of collaborating between different data centers due to heterogeneity.
method Collaborative inverse propensity score weighting estimator to adjust for distribution shift.
result Significant improvements over traditional meta-analysis methods when dealing with increased heterogeneity.

New framework for evaluating ad auctions using stochastic modeling.

problem Challenges in evaluating deterministic ad auctions.
method Repurposed bid landscape model to approximate propensity scores, enabling robust OPE estimators.
result Remarkable alignment with online A/B test results, achieving 92% MDA in CTR prediction.

Novel LSE estimator improves off-policy learning and evaluation.

problem High variance and poor performance with low-quality propensity scores and heavy-tailed reward distributions.
method Introduces a novel estimator based on the log-sum-exponential (LSE) operator.
result Achieves convergence rate of O(nε/(1+ε))O(n^{-ε/(1+ ε)}) for regret bounds.

This study optimizes covariate density and propensity score for efficient ATE estimation.

problem Efficiently estimating average treatment effects (ATEs) with minimal variance.
method Adaptive experiment optimizing both covariate density and propensity score.
result Proposed method minimizes the semiparametric efficiency bound for ATE estimation.

Paper proposes unbiased learning for recommendation causal effects.

problem Estimating the causal effect of recommendation when the ground truth is unobservable.
method Inverse propensity scoring technique to construct unbiased estimators, followed by empirical risk minimization with propensity capping.
result The proposed method outperforms other biased learning methods in various settings.

Post-calibration improves the accuracy of causal effect estimation.

problem Improperly calibrated propensity scores lead to inaccurate causal effect estimation.
method Performed a simulation study to assess the impact of post-calibration on causal effect estimation.
result Post-calibration reduces the error in estimating the average treatment effect, especially for expressive uncalibrated statistical estimators.

The paper investigates how calibrating propensity scores improves DML estimates of average treatment effects.

problem Improving the accuracy of DML estimates in finite samples.
method Propensity score calibration within the Double/debiased machine learning framework.
result Calibrating propensity scores reduces the root mean squared error of DML estimates of average treatment effects in finite samples.

CAEL-MIPS learns embeddings to improve MIPS for better OPE in contextual bandits.

problem High variance in IPS weighting for OPE in large action spaces.
method Context-Action Embedding Learning (CAEL) for MIPS to minimize MSE.
result CAEL-MIPS outperforms baselines in MSE for OPE in contextual bandits.

A new method combines online and offline learning to tackle contextual bandits with missing action support.

problem Learning optimal policies with logged data when the logging policy has deficient support.
method Hybrid approach using online exploration to exploit supported actions and offline learning to avoid unnecessary explorations.
result Determines an optimal policy with theoretical guarantees using minimal online explorations.

Unified causal inference framework using distribution adaptation.

problem Estimating Average Treatment Effects (ATE) under uncertainty in propensity scores.
method Reframed as domain adaptation problem, using machine learning techniques.
result Joint Robust Estimator (JRE) achieves up to 15% reduction in MSE.

Proposes methods to estimate posterior probability and propensity score functions without assuming constant propensity score.

problem Learning from biased positive-unlabeled data.
method Parametric approach to joint estimation of posterior probability and propensity score functions using maximum likelihood and alternating maximization.
result Proposed methods are comparable or better than existing methods based on Expectation-Maximisation scheme.

A new tensor completion method handles missing data with missing not at random entries.

problem Handling missing data in tensors where the probability of observation depends on other entries.
method Estimate propensities using convex relaxation, then use higher-order SVD with inverse propensities weights.
result Finite-sample error bounds on the completed tensor are provided.

Propensity score matching improves fairness in machine learning models.

problem Bias in training data affects fairness metrics in machine learning models.
method Propensity score matching to evaluate and mitigate bias in test data.
result FairMatch significantly reduces bias in test data without sacrificing predictive performance.

Adaptive experiment designs can dramatically improve statistical efficiency in randomized trials, but they also complicate statistical inference. For example, it is now well known that the sample mean is biased in adaptive trials. Inferential challenges are exacerbated when our parameter of interest differs from the pa…

2019-11-07abs ↗pdf ↗

Estimating average causal effect (ACE) is useful whenever we want to know the effect of an intervention on a given outcome. In the absence of a randomized experiment, many methods such as stratification and inverse propensity weighting have been proposed to estimate ACE. However, it is hard to know which method is opti…

2019-07-10abs ↗pdf ↗

The paper learns personalized treatment rules from observational data.

problem Developing effective treatment policies for individual patients.
method Contextual bandit approach to minimize expected risk of treatment policies.
result The proposed method outperforms physicians and baseline approaches in IV and VP administration.

We present a Bayesian view of counterfactual risk minimization (CRM) for offline learning from logged bandit feedback. Using PAC-Bayesian analysis, we derive a new generalization bound for the truncated inverse propensity score estimator. We apply the bound to a class of Bayesian policies, which motivates a novel, pote…

2018-06-29abs ↗pdf ↗

Neural score matching improves high-dimensional causal inference by using neural networks for balancing scores.

problem Impracticality of traditional matching methods in high-dimensional datasets due to the curse of dimensionality.
method Develops neural networks to create non-trivial, multivariate balancing scores for high-dimensional causal inference.
result Neural score matching outperforms other methods in treatment effect estimation and reducing imbalance on high-dimensional datasets.

Proposes a method to stabilize treatment effect estimation with unbalanced data.

problem Unbalanced treatment assignment leading to unstable propensity score estimations.
method Undersamples data for propensity score modeling and calibrates scores to match original distribution.
result The estimator retains asymptotic properties of the DML estimator and improves finite sample performance.

Ablation studies show BCF model's propensity score is not essential for treatment effect estimation.

problem Understanding the necessity of propensity score in nonparametric treatment effect estimation.
method Partial ablation studies of Bayesian Causal Forest (BCF) model.
result Excluding estimated propensity score does not affect treatment effect estimation or uncertainty quantification.

Proposes a novel neural network method to estimate average treatment effect.

problem Bias in estimating average treatment effect due to confounding and instrumental variables.
method Self-balancing neural network (Sbnet) that estimates pseudo propensity scores and average treatment effect in one step.
result Proposed method outperforms state-of-the-art methods in simulations and real-world datasets.

AIPS improves ranking policy evaluation by adapting to diverse user behavior.

problem Inaccurate Off-Policy Evaluation of ranking policies due to high variance under diverse user behavior.
method Developed Adaptive IPS (AIPS) that adapts to different user behaviors and minimizes MSE.
result AIPS achieves minimum variance among unbiased estimators and provides significant empirical accuracy improvement.

In this paper, we propose deep learning techniques for econometrics, specifically for causal inference and for estimating individual as well as average treatment effects. The contribution of this paper is twofold: 1. For generalized neighbor matching to estimate individual and average treatment effects, we analyze the …

2018-03-01abs ↗pdf ↗

Quantum neural networks improve causal inference in biomedical studies, especially for small samples.

problem Addressing selection bias in comparing surgical techniques using observational data.
method Developed QNN-based propensity score models focusing on four key covariates (Age, Sex, Stage, BMI). Employed a linear ZFeatureMap for data encoding, SummedPaulis for predictions, and CMA-ES for optimization. Integrated noise modeling to enhance predictive stability.
result QNNs, particularly with noise-aware strategies, outperformed classical models in small samples, achieving AUC up to 0.750 for n=100.

The paper develops methods to handle missing data using regularized M-estimation in reproducing kernel Hilbert space.

problem Handling missing data in statistical analysis.
method Kernel ridge regression for imputation and maximum entropy method for propensity score estimation.
result The proposed methods achieve statistical consistency and asymptotic equivalence.