Efficient Balanced Treatment Assignments for Experimentation
- URL: http://arxiv.org/abs/2010.11332v1
- Date: Wed, 21 Oct 2020 22:06:37 GMT
- Title: Efficient Balanced Treatment Assignments for Experimentation
- Authors: David Arbour, Drew Dimmery, Anup Rao
- Abstract summary: We provide an algorithm that is optimal with respect to the minimum tree test of Friedman and Rafsky.
We provide a novel formulation of estimation as transductive inference and show how the tree structures used in design can also be used in an adjustment estimator.
- Score: 17.3699850124029
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this work, we reframe the problem of balanced treatment assignment as
optimization of a two-sample test between test and control units. Using this
lens we provide an assignment algorithm that is optimal with respect to the
minimum spanning tree test of Friedman and Rafsky (1979). This assignment to
treatment groups may be performed exactly in polynomial time. We provide a
probabilistic interpretation of this process in terms of the most probable
element of designs drawn from a determinantal point process which admits a
probabilistic interpretation of the design. We provide a novel formulation of
estimation as transductive inference and show how the tree structures used in
design can also be used in an adjustment estimator. We conclude with a
simulation study demonstrating the improved efficacy of our method.
Related papers
- Distributed Markov Chain Monte Carlo Sampling based on the Alternating
Direction Method of Multipliers [143.6249073384419]
In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers.
We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art.
In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
arXiv Detail & Related papers (2024-01-29T02:08:40Z) - Scalable method for Bayesian experimental design without integrating
over posterior distribution [0.0]
We address the computational efficiency in solving the A-optimal Bayesian design of experiments problems.
A-optimality is a widely used and easy-to-interpret criterion for Bayesian experimental design.
This study presents a novel likelihood-free approach to the A-optimal experimental design.
arXiv Detail & Related papers (2023-06-30T12:40:43Z) - Learning Unnormalized Statistical Models via Compositional Optimization [73.30514599338407]
Noise-contrastive estimation(NCE) has been proposed by formulating the objective as the logistic loss of the real data and the artificial noise.
In this paper, we study it a direct approach for optimizing the negative log-likelihood of unnormalized models.
arXiv Detail & Related papers (2023-06-13T01:18:16Z) - On Single-Objective Sub-Graph-Based Mutation for Solving the
Bi-Objective Minimum Spanning Tree Problem [0.0]
We contribute to the efficient approximation of the $mathcalNP$-hard multi-objective minimum spanning tree problem (moMST) adopting evolutionary computation.
We design several highly biased sub-graph-based mutation operators founded on the gained insights.
Our results confirm that the sub-graph based operators beat baseline algorithms from the literature.
arXiv Detail & Related papers (2023-05-31T22:35:17Z) - Validation Diagnostics for SBI algorithms based on Normalizing Flows [55.41644538483948]
This work proposes easy to interpret validation diagnostics for multi-dimensional conditional (posterior) density estimators based on NF.
It also offers theoretical guarantees based on results of local consistency.
This work should help the design of better specified models or drive the development of novel SBI-algorithms.
arXiv Detail & Related papers (2022-11-17T15:48:06Z) - Distributionally robust risk evaluation with a causality constraint and
structural information [0.0]
A set of alternative measures is characterized by the causal optimal transport.
We approximate test functions by neural networks and prove the sample complexity with Rademacher complexity.
Empirical analysis of realized volatility and stock indices demonstrates that our framework offers an attractive alternative to the classic optimal transport formulation.
arXiv Detail & Related papers (2022-03-20T14:48:37Z) - Amortized Implicit Differentiation for Stochastic Bilevel Optimization [53.12363770169761]
We study a class of algorithms for solving bilevel optimization problems in both deterministic and deterministic settings.
We exploit a warm-start strategy to amortize the estimation of the exact gradient.
By using this framework, our analysis shows these algorithms to match the computational complexity of methods that have access to an unbiased estimate of the gradient.
arXiv Detail & Related papers (2021-11-29T15:10:09Z) - Efficient Data-Dependent Learnability [8.766022970635898]
The predictive normalized maximum likelihood (pNML) approach has recently been proposed as the min-max optimal solution to the batch learning problem.
We show that when applied to neural networks, this approximation can detect out-of-distribution examples effectively.
arXiv Detail & Related papers (2020-11-20T10:44:55Z) - Optimal Bayesian experimental design for subsurface flow problems [77.34726150561087]
We propose a novel approach for development of chaos expansion (PCE) surrogate model for the design utility function.
This novel technique enables the derivation of a reasonable quality response surface for the targeted objective function with a computational budget comparable to several single-point evaluations.
arXiv Detail & Related papers (2020-08-10T09:42:59Z) - Distributed Averaging Methods for Randomized Second Order Optimization [54.51566432934556]
We consider distributed optimization problems where forming the Hessian is computationally challenging and communication is a bottleneck.
We develop unbiased parameter averaging methods for randomized second order optimization that employ sampling and sketching of the Hessian.
We also extend the framework of second order averaging methods to introduce an unbiased distributed optimization framework for heterogeneous computing systems.
arXiv Detail & Related papers (2020-02-16T09:01:18Z) - Efficient Adaptive Experimental Design for Average Treatment Effect
Estimation [18.027128141189355]
We propose an algorithm for efficient experiments with estimators constructed from dependent samples.
To justify our proposed approach, we provide finite and infinite sample analyses.
arXiv Detail & Related papers (2020-02-13T02:04:17Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.