Develops a prediction method based on sampling design.
problem Creating accurate individual predictions.
method Design-based approach using expected cross-validation results.
result Valid inference of unobserved prediction errors defined with respect to sampling design.
Efficiently selects top-m designs for various contexts using sequential sampling.
problem Optimizing selection of top-m designs across different contexts.
method Formulated as a stochastic dynamic programming problem, developed sequential sampling policy.
result Asymptotically optimal sampling ratios for efficient selection.
We study signal recovery on graphs based on two sampling strategies: random sampling and experimentally designed sampling. We propose a new class of smooth graph signals, called approximately bandlimited, which generalizes the bandlimited class and is similar to the globally smooth class. We then propose two recovery s…
Active sampling improves design space exploration for analog circuits.
problem Efficiently exploring the space of design features in analog circuits with many parameters.
method Combining drastic dimension reduction with sensitivity analysis and Bayesian surrogate modeling for active sampling.
result The proposed active sampling flow outperforms traditional Monte-Carlo sampling.
A new sampling strategy improves reliability and robustness optimization for complex designs.
problem High sample requirements for optimizing reliability and robustness in complex designs.
method Local Latin Hypercube Refinement (LoLHR) for multi-objective design uncertainty optimization.
result LoLHR achieves better results compared to other surrogate-based strategies.
Web crawling, snowball sampling, and respondent-driven sampling (RDS) are three types of network sampling techniques used to contact individuals in hard-to-reach populations. This paper studies these procedures as a Markov process on the social network that is indexed by a tree. Each node in this tree corresponds to an…
Sampling one or more effective solutions from large search spaces is a recurring idea in machine learning, and sequential optimization has become a popular solution. Typical examples include data summarization, sample mining for predictive modeling and hyper-parameter optimization. Existing solutions attempt to adaptiv…
New partition designs reduce star discrepancy in high-dimensional sampling.
problem Improving the expected star discrepancy in high-dimensional sampling.
method Developed non-equal volume partitions to achieve lower expected star discrepancy.
result Explicit upper bounds for expected star discrepancy under non-equal volume partitions.
Paper extends conformal prediction to complex survey data.
problem Applying distribution-free prediction intervals to complex survey data.
method Design-based conformal prediction for non-exchangeable data.
result Empirical guarantees of finite-sample coverage for complex survey data.
Two simulation-based methods improve optimal sampling design in systems biology.
problem Optimal selection of sampling points for accurate parameter estimation in dynamical systems.
method E-optimal-ranking (EOR) and LSTM neural network-based methods.
result Simulation studies show the proposed methods outperform random selection and classical E-optimal design.
Bayesian methods improve drug discovery experiment design.
problem Optimizing drug screening experiments in high-dimensional data.
method Bayesian inference and optimisation with upper confidence bound algorithms, Thompson sampling, and sparse tree search.
result Sparse tree search techniques outperform other methods in drug toxicity screening.
Paper uses diffusion models to design electric aircraft quickly.
problem Designing electric aircraft efficiently and accurately.
method Simulation-based inference with hierarchical diffusion models.
result Rediscovers known aircraft design trends and laws.
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.
This paper proposes a new approach to construct high quality space-filling sample designs. First, we propose a novel technique to quantify the space-filling property and optimally trade-off uniformity and randomness in sample designs in arbitrary dimensions. Second, we connect the proposed metric (defined in the spatia…
This paper introduces a new method for sampling copulas using GANs and space-filling designs.
problem Lack of feasible inference and sampling methods for copulas in high-dimensional situations.
method Generative adversarial networks (GANs) and space-filling designs.
result Significantly enhances sampling accuracy and computational efficiency compared to existing methods.
We study the optimal design problems where the goal is to choose a set of linear measurements to obtain the most accurate estimate of an unknown vector in d d d dimensions. We study the A A A -optimal design variant where the objective is to minimize the average variance of the error in the maximum likelihood estimate of th…
Optimizes sampling for faster convergence in Bayesian experimental design and uncertainty quantification.
problem Efficiently selecting samples for faster convergence in Bayesian experimental design and uncertainty quantification.
method Output-weighted acquisition functions leveraging likelihood ratio to guide sampling towards relevant regions.
result Superiority of the proposed method in uncertainty quantification and rare event identification.
A new method for feature selection robust to noise and design variability.
problem Feature selection in high-dimensional regression under sampling variability and measurement error.
method Injects controlled additive noise into the design matrix, fits a base selector, and aggregates selection frequencies.
result Improved robustness compared to Stability Selection and standard base selectors.
This paper explores and analyzes two randomized designs for robust Principal Component Analysis (PCA) employing low-dimensional data sketching. In one design, a data sketch is constructed using random column sampling followed by low dimensional embedding, while in the other, sketching is based on random column and row …
New method optimizes experimental design for specific applications.
problem Inability to adapt causal inference methods to specific downstream applications.
method Task-specific experimental design and sampling strategies.
result Significantly reduces data requirements for achieving RCT performance.
Measures policy-violating content prevalence with ML-assisted sampling and LLM labeling.
problem Accurate measurement of content violations that are often rare and costly to label.
method Design-based measurement system using ML-assisted probability sampling and LLM labeling.
result Produces unbiased prevalence estimates with confidence intervals and dashboard drilldowns.
In experimental design, we are given a large collection of vectors, each with a hidden response value that we assume derives from an underlying linear model, and we wish to pick a small subset of the vectors such that querying the corresponding responses will lead to a good estimator of the model. A classical approach …
Unified framework for model-based RL with sample complexity guarantees.
problem Designing efficient posterior sampling methods for model-based RL.
method Optimistic posterior sampling, Hellinger distance reduction, data likelihood measurement.
result Unified algorithms with state-of-the-art sample complexity guarantees.
New method designs joint initial noises for diffusion models to improve diversity and alignment.
problem Independent initial noises limit diversity in generated images.
method Coupling of initial noises, maintaining Gaussian distribution while allowing dependence.
result Repulsive Gaussian coupling improves diversity without increasing sampling cost.
Neural Optimal Design of Experiments improves inverse problem solving efficiency.
problem Optimal experimental design in inverse problems.
method Jointly trains a reconstruction model and design variables in a single loop.
result Significantly reduces computational complexity and improves reconstruction accuracy.
This study improves audit sampling by using sequential procedures with statistical guarantees.
problem Improving audit efficiency and reliability with statistical methods.
method Formulated as a sequential testing problem, defining null and alternative hypotheses, stopping and decision rules, and exact boundary conditions.
result Exact design yields ex ante control of decision error probabilities, and simulation-based implementation approximates this design.
Algorithm identifies Pareto optimal designs efficiently for noisy, multi-objective functions.
problem Optimizing multi-objective functions with noisy data and large design spaces.
method Adaptive discretization and tree-based approach to identify Pareto optimal designs.
result Algorithm identifies Pareto optimal designs with fewer evaluations than exhaustive search.
New method improves stochastic kriging for high-dimensional simulations.
problem High-dimensional simulation models require prohibitive sample sizes and computational costs.
method Tensor Markov kernels and sparse grid experimental designs.
result Sample complexity grows only slightly with dimensionality, improving accuracy and efficiency.
Improves BED scalability for implicit models.
problem Designing experiments for implicit models with intractable data distributions.
method Hybrid gradient approach combining variational MI estimator, ES, and SGA.
result Significantly improves scalability of BED for implicit models.
We simplify diffusion models by defining a design space and improving FID scores.
problem Complexity in diffusion-based generative models.
method Defined a design space, improved sampling and training processes, and pre-conditioned score networks.
result Improved FID scores of 1.79 for CIFAR-10 and 1.97 for unconditional settings.
New algorithm selects optimal subset for multiclass classifier training.
problem Selecting optimal subset of labeled examples for multiclass classifier training.
method Regret minimization framework with new regularization scheme.
result New method consistently outperforms state-of-the-art approaches.
This work gives a simultaneous analysis of both the ordinary least squares estimator and the ridge regression estimator in the random design setting under mild assumptions on the covariate/response distributions. In particular, the analysis provides sharp results on the ``out-of-sample'' prediction error, as opposed to…
Avare improves optimization and sampling with adaptive importance sampling.
problem Improving convergence rate of stochastic gradient-based algorithms.
method Adaptive importance sampling with decreasing step-sizes.
result Achieves dynamic regret bounds of O ( T 2 / 3 ) \mathcal{O}(T^{2/3}) O ( T 2/3 ) and O ( T 5 / 6 ) \mathcal{O}(T^{5/6}) O ( T 5/6 ) . LES optimizes designs by sampling descent sequences, achieving strong sample efficiency.
problem Optimizing large, complex design spaces is infeasible and unnecessary.
method LES uses Bayesian optimization to target solutions reachable by iterative optimizers.
result LES achieves strong sample efficiency compared to existing methods.
New insights into how to inspect and learn from multi-stage processes and AI reasoning.
problem Understanding how to attribute outcomes to early stages in multi-stage operations and AI reasoning.
method Information-theoretic analysis and mathematical proofs of four key results.
result Uniform checkpoint spacing is minimax-optimal for inspection design under homogeneous signal attenuation.
Bayesian design improves accuracy without extra cost.
problem Nested inference in complex systems limits BED accuracy and efficiency.
method Grouped geometric pooled posterior with EKI formulation.
result Improved accuracy and stable estimators at comparable cost.
This paper analyzes OCBA algorithms' convergence rates for DEDS optimization.
problem Optimizing discrete-event dynamic systems with limited computing resources.
method Characterizes convergence rates of two OCBA algorithms under different performance measures.
result OCBA algorithms achieve optimal convergence rates under probability of correct selection and expected opportunity cost measures.
Generative neural network designs novel 3D molecules with specified properties.
problem Designing molecules with desired properties in chemistry.
method Conditional generative neural network for 3D molecular structures.
result Demonstrated utility in generating novel molecules with specified motifs or composition.
A major challenge in materials design is how to efficiently search the vast chemical design space to find the materials with desired properties. One effective strategy is to develop sampling algorithms that can exploit both explicit chemical knowledge and implicit composition rules embodied in the large materials datab…
Clever sampling methods can be used to improve the handling of big data and increase its usefulness. The subject of this study is remote sensing, specifically airborne laser scanning point clouds representing different classes of ground cover. The aim is to derive a supervised learning model for the classification usin…
New method learns diverse protein scaffolds for motif design.
problem Designing long, diverse protein scaffolds for specific motifs.
method E(3)-equivariant graph neural network for diffusion modeling.
result First to guarantee conditional sampling from diffusion models.
New method improves robustness of Bayesian experimental design.
problem Bayesian experimental design's sensitivity to prior distribution changes.
method Introduces robust expected information gain (REIG) and uses KL-divergence ambiguity sets.
result REIG stabilizes sampling-based EIG estimation and compensates for prior variability.
This work introduces a new sampling method to approximate an optimal design problem in ridge regression.
problem Finding an optimal subset of predictors in ridge regression to minimize prediction error.
method Developed a λ λ λ -regularized proportional volume sampling algorithm with approximation guarantees. result The algorithm provides a ( 1 + ε 1 + λ ′ ) (1+\fracε{\sqrt{1+λ'}}) ( 1 + 1 + λ ′ ε ) -approximation for the optimal design problem. Optimizes experimental designs for intractable models using mutual information bounds.
problem Finding optimal experimental designs for models with intractable data-generating distributions.
method Maximizes mutual information lower bounds parametrized by neural networks, updating network parameters and designs simultaneously.
result Framework enables experimental design for various tasks including parameter estimation and model discrimination.
Optimizes UUV hull design with a two-orders-of-magnitude speedup.
problem Designing efficient underwater vehicle hulls using CFD simulations.
method Bayesian Optimization-LCB algorithm and DNN-based surrogate model.
result Two-orders-of-magnitude speedup in design optimization process.
Improves survey sampling with unbiased machine learning methods.
problem Design-consistent model-assisted estimation lacks a general theory for machine learning.
method Proposes a subsampling Rao-Blackwell method for design-unbiased estimation.
result Yields efficiency gains over standard methods while ensuring valid estimation.
New estimators improve efficiency in two-phase designs with coarsened data.
problem Efficient estimation in two-phase designs with incomplete data.
method Developed new estimators within the TMLE framework.
result New estimators are asymptotically equivalent and more efficient.
The study provides a comprehensive error analysis for diffusion models.
problem Understanding the accuracy and design of diffusion-based generative models.
method Conducts a non-asymptotic convergence analysis and sampling error analysis for diffusion models.
result Theoretical insights into designing effective training and sampling processes for diffusion models.