Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use quadrature rules in Owen Sampling #599

Open
janosg opened this issue Jun 13, 2024 · 0 comments
Open

Use quadrature rules in Owen Sampling #599

janosg opened this issue Jun 13, 2024 · 0 comments
Labels
enhancement New feature or request

Comments

@janosg
Copy link
Collaborator

janosg commented Jun 13, 2024

Owen sampling has roughly the following structure:

for idx in data.indices:
    for prob in np.linspace(0, 1, n_samples_outer):
        for _ in range(n_samples_inner):
            # draw samples and calculate utilites with and without index

The loop over probabilities controls the size of the samples. The fixed grid is a discrete approximation of an integral.

We should investigate the following questions:

  • Can we use standard quadrature rules to approximate the integral more efficiently than with a uniform grid?
  • Can we learn from other methods (e.g Truncated Permutation Sampling) which set sizes should be sampled with a lower frequency?

My rough intuition is that very small sample sizes should be avoided because they yield very noisy value estimates and very large samples should be avoided because no single data point contributes a lot of value if the sample size is large.

@janosg janosg added the enhancement New feature or request label Jun 13, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant