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,695 papers · 148 categories

Trend · papers per month

139278416555 · Jun 202019922001200920172026
48 results for sample surveys

The paper tests the credibility of public and private surveys using linear regression and differential privacy.

problem Ensuring the validity of data analysis results from sample surveys using linear regression.
method Designing an algorithm to test the credibility of surveys and extending it to handle LDP.
result The algorithm achieves optimal estimation error bound for 1\ell_1 linear regression and reduces sample complexity.

The paper proposes a method to assess survey data credibility without needing many samples, regardless of data dimension.

problem Assessing the credibility of survey data across different dimensions.
method Task-based approach and model-specific distance metric for verifying survey data credibility in regression models.
result The sample complexity of the proposed algorithm is independent of the data dimension, making it more efficient.

Proposes a neural network method to combine nonprobability and probability survey samples.

problem Combining nonprobability and probability survey samples for accurate population mean estimation.
method Uses a deep neural network to estimate sampling scores from nonprobability samples and combines them with probability sample information.
result Proposed estimators improve robustness to parametric propensity-score misspecification, especially for nonlinear selection mechanisms.

Method completes mixed matrix from complex surveys with heterogeneous missingness.

problem Recovering a mixed dataframe matrix from complex survey sampling with different missingness patterns.
method Two-stage procedure: logistic regression for missingness modeling, and weighted log-likelihood maximization with low-rank constraint.
result The proposed method achieves sublinear convergence and shows superior performance compared to existing methods.

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. However, MCMC algorithms tend to be computationally demanding, and are particularly slow for large datasets…

2018-07-23abs ↗pdf ↗

Survey on learning models for irregularly sampled time series data.

problem Challenges in learning from non-uniformly sampled time series data.
method Survey of recent models and architectures based on temporal discretization, interpolation, recurrence, attention, and structural invariance.
result Significant progress in machine learning for irregularly sampled time series data.

PPI uses survey sampling methods for inference, bridging ML and statistics.

problem Combining machine learning predictions with small labeled data for valid inference.
method Equivalence of PPI estimators to survey sampling methods.
result PPI estimators are algebraically equivalent to survey sampling methods.

We survey some tools and techniques for determining geometric properties of a link complement from a link diagram. In particular, we survey the tools used to estimate geometric invariants in terms of basic diagrammatic link invariants. We focus on determining when a link is hyperbolic, estimating its volume, and boundi…

2017-08-23abs ↗pdf ↗

This paper reviews various sampling methods from statistics and machine learning.

problem Addressing sampling methods in statistics and machine learning.
method Explains and reviews simple random sampling, bootstrapping, stratified sampling, cluster sampling, multistage sampling, network sampling, snowball sampling, and sampling from cumulative distribution function.
result Summarizes characteristics, pros, and cons of different sampling methods.

Survey on Evidential Deep Learning for uncertainty estimation in deep neural networks.

problem Uncertainty estimation in deep neural networks with overhead or limited diversity.
method Evidential Deep Learning, parameterizing distributions over distributions.
result Single model and forward pass uncertainty estimation with a unified notation.

Optimizes survey design for private mean estimation with reduced variance.

problem Minimizing variance in private mean estimation with privacy constraints.
method Formulates optimal survey design as an optimization problem, determining optimal subsampling sizes to minimize variance.
result Identifies the first privacy-aware stratified sampling scheme that minimizes variance under different privacy mechanisms.

Deep learning models outperform MICE in large survey imputation but with hyperparameter tuning.

problem Comparing deep learning and MICE for missing data imputation in large surveys.
method Extensive simulation studies comparing four machine learning-based MI methods: MICE with classification trees, MICE with random forests, generative adversarial imputation networks, and multiple imputation using denoising autoencoders.
result MICE with classification trees consistently outperforms deep learning methods in terms of bias, mean squared error, and coverage.

Survey categorizes methods for learning state representations in reinforcement learning.

problem Addressing challenges in complex observation spaces for sequential decision making.
method Categorizes six main classes of methods for learning state representations.
result Enhances understanding of state representation learning in reinforcement learning.

SDRF estimates complex survey designs for conditional distributions.

problem Estimating conditional distributions under complex survey designs.
method Survey-calibrated distributional random forest (SDRF) with pseudo-population bootstrap and MMD split criterion.
result Established design consistency and model consistency for survey designs.

AI-assisted interviews allow respondents to describe experiences naturally, but mapping those accounts into structured survey variables is fallible.

problem Mapping AI-assisted interview responses into structured survey variables is fallible.
method Adaptive Matrix Validation (AMV) is proposed, which involves mapping responses into tabular data and using a small set of structured questions for statistical adjustment.
result The estimator calibrates mapped values using validation answers from other respondents and corrects remaining error with validation answers observed for the target respondent.

New method improves active statistical inference by reducing noise.

problem Inaccurate uncertainty estimates in active sampling lead to noisy results.
method Robust sampling strategies that interpolate between uniform and active sampling based on uncertainty scores.
result The robust sampling ensures that the estimator is never worse than uniform sampling and usually outperforms active inference.

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 generalized predictive utility of a proposed prediction rule. After learning a prediction rule based on a non…

2017-11-13abs ↗pdf ↗

The data torrent unleashed by current and upcoming astronomical surveys demands scalable analysis methods. Many machine learning approaches scale well, but separating the instrument measurement from the physical effects of interest, dealing with variable errors, and deriving parameter uncertainties is often an after-th…

2017-07-14abs ↗pdf ↗

A reinforcement learning agent tries to maximize its cumulative payoff by interacting in an unknown environment. It is important for the agent to explore suboptimal actions as well as to pick actions with highest known rewards. Yet, in sensitive domains, collecting more data with exploration is not always possible, but…

2019-01-21abs ↗pdf ↗

Market research is generally performed by surveying a representative sample of customers with questions that includes contexts such as psycho-graphics, demographics, attitude and product preferences. Survey responses are used to segment the customers into various groups that are useful for targeted marketing and commun…

2019-01-25abs ↗pdf ↗

This paper provides a tutorial on Boltzmann Machines and Deep Belief Networks.

problem Understanding and applying Boltzmann Machines and Deep Belief Networks.
method Explains the structures, conditional distributions, Gibbs sampling, training methods, and deep belief networks of RBMs.
result Comprehensive overview of RBMs and DBNs, useful in various fields.

As a promising area in artificial intelligence, a new learning paradigm, called Small Sample Learning (SSL), has been attracting prominent research attention in the recent years. In this paper, we aim to present a survey to comprehensively introduce the current techniques proposed on this topic. Specifically, current S…

2018-08-14abs ↗pdf ↗

Bayesian approach learns causal concepts from diverse social surveys.

problem Inferring causal concepts from heterogeneous data with sparse changes.
method Hierarchical Bayesian model with sequential Monte Carlo sampling.
result Model infers meaningful causal concepts and plausible relations.

Survey connects three DNN generalization fields for better inference.

problem Assessing if DNNs generalize correctly at inference time.
method Investigates predictive uncertainty, out-of-distribution, and adversarial example detection.
result Connects three fields for better DNN inference.

PICZL improves photometric redshifts for AGN in all-sky surveys.

problem Challenges in accurately computing photo-z for AGN due to interplay of SMBH and host galaxy emissions.
method PICZL uses an ensemble of CNNs with cross-channel integration of image and catalog data, leveraging Gaussian mixture models.
result PICZL achieves a photo-z variance of 4.5% and outlier fraction of 5.6% on a validation sample of 8098 AGN, outperforming previous methods.

Survey of Laplacian-based methods for data dimensionality reduction and embedding.

problem Efficiently reducing high-dimensional data to lower dimensions while preserving important features and structures.
method Laplacian-based methods including spectral clustering, Laplacian eigenmap, locality preserving projection, graph embedding, and diffusion map.
result Comprehensive overview of various optimization variants and applications of Laplacian-based techniques.