Browse State-of-the-Art › Survey Sampling

Survey Sampling

1 paper with code · 0 benchmarks · 0 datasets archive 2025-07-28

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 15 · with a code link: 1 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 15 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 15 of 15, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from.

  • 20 May 2015 1 repository listed
    Under certain assumptions on the referral tree, the design effect of network sampling has a critical threshold that is a function of the referral rate m and the clustering structure in the social network, represented by…
  • Prediction-powered estimators for finite population statistics in highly imbalanced textual data: Public hate crime estimation
    5 May 2025 0 repositories listed
    Estimating population parameters in finite populations of text documents can be challenging when obtaining the labels for the target variable requires manual annotation.
  • A step towards the integration of machine learning and small area estimation
    12 Feb 2024 0 repositories listed
    The use of machine-learning techniques has grown in numerous research areas.
  • Mixed Matrix Completion in Complex Survey Sampling under Heterogeneous Missingness
    6 Feb 2024 0 repositories listed
    Modern surveys with large sample sizes and growing mixed-type questionnaires require robust and scalable analysis methods.
  • Do We Really Even Need Data?
    14 Jan 2024 0 repositories listed
    As artificial intelligence and machine learning tools become more accessible, and scientists face new obstacles to data collection (e.g. rising costs, declining survey response rates), researchers increasingly use…
  • Asymptotically Unbiased Off-Policy Policy Evaluation when Reusing Old Data in Nonstationary Environments
    23 Feb 2023 0 repositories listed
    In this work, we consider the off-policy policy evaluation problem for contextual bandits and finite horizon reinforcement learning in the nonstationary setting.
  • Sampling Algorithms, from Survey Sampling to Monte Carlo Methods: Tutorial and Literature Review
    2 Nov 2020 0 repositories listed
    This paper is a tutorial and literature review on sampling algorithms.
  • Controlling Privacy Loss in Sampling Schemes: an Analysis of Stratified and Cluster Sampling
    24 Jul 2020 0 repositories listed
    Sampling schemes are fundamental tools in statistics, survey design, and algorithm design.
  • Design-unbiased statistical learning in survey sampling
    25 Mar 2020 0 repositories listed
    Design-consistent model-assisted estimation has become the standard practice in survey sampling.
  • Proxy expenditure weights for Consumer Price Index: Audit sampling inference for big data statistics
    15 Jun 2019 0 repositories listed
    Purchase data from retail chains provide proxy measures of private household expenditure on items that are the most troublesome to collect in the traditional expenditure survey.
  • Subsampling MCMC - An introduction for the survey statistician
    23 Jul 2018 0 repositories listed
    The rapid development of computing power and efficient Markov Chain Monte Carlo (MCMC) simulation algorithms have revolutionized Bayesian statistics, making it a highly practical inference method in applied work.
  • Estimating prediction error for complex samples
    13 Nov 2017 0 repositories listed
    With a growing interest in using non-representative samples to train prediction models for numerous outcomes it is necessary to account for the sampling design that gives rise to the data in order to assess the…
  • Scalable MCMC for Large Data Problems using Data Subsampling and the Difference Estimator
    10 Jul 2015 0 repositories listed
    We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations.
  • Survey schemes for stochastic gradient descent with applications to M-estimation
    9 Jan 2015 0 repositories listed
    In certain situations that shall be undoubtedly more and more common in the Big Data era, the datasets available are so massive that computing statistics over the full sample is hardly feasible, if not unfeasible.
  • Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation
    1 Dec 2013 0 repositories listed
    We provide a detailed study of the estimation of probability distributions---discrete and continuous---in a stringent setting in which data is kept private even from the statistician.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections