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

Trend · papers per month

1223 · Nov 202219922001200920172026
48 results for Design-of-experiment

This study evaluates the importance of design of experiments for PINN in physics-informed deep learning.

problem Accuracy of PINN predictions depends on the design of experiment scheme.
method Comparative study of five PDEs using different design of experiment schemes.
result Hammersley sampling-based PINN outperforms other design of experiment schemes.

We introduce an application of the group lasso to design of experiments. Note that we are NOT trying to explain experimental design for the group lasso. Conversely, we explain how we can use the idea of the group lasso in experimental design, showing that the problem of constructing an optimal design matrix can be tran…

2013-08-06abs ↗pdf ↗

A method to select validation data from a dataset using statistical criteria.

problem Selecting a validation basis from a full dataset for machine learning model validation.
method Adopting a 'design of experiments' point of view and using statistical criteria, particularly Maximum Mean Discrepancy criteria.
result The 'support points' concept is particularly relevant for selecting validation data.

Do-AIQ framework evaluates AI algorithms' quality using DOE.

problem Quality evaluation of AI mislabel detection algorithms.
method Design-of-experiment approach with high-dimensional constraint space design and surrogate modeling.
result Established framework for evaluating AI algorithm quality robustly.

Bayesian SDOE method estimates QoIs from expensive black-box functions efficiently.

problem Estimating non-linear QoIs from expensive, unknown functions.
method Sequential design of experiments using Bayesian surrogate models and information gain.
result Method efficiently estimates QoIs with limited function evaluations.

Algorithm improves reinforcement learning policies using offline data.

problem Improving reinforcement learning policies with limited online data.
method Designs a single non-reactive policy using offline data with provable guarantees.
result Algorithm achieves better policy quality with less online data.

Optimizes biomanufacturing processes with a new digital twin calibration method.

problem Lack of interpretability and sample efficiency in traditional DoE methods.
method Developed a computational approach to calibrate Bio-SoS digital twin model.
result Guides sample-efficient and interpretable DoEs by quantifying sub-model parameter estimation errors.

Unsupervised machine learning helps design complex experiments more efficiently.

problem Designing experiments with many factors and constraints is challenging and costly.
method Applied a beta variational autoencoder (beta-VAE) to represent trials in a low-dimensional latent space.
result Generated pragmatic designs with fewer trials while maintaining objectives.

New method designs experiments robustly for nonlinear estimation, improving parameter knowledge.

problem Designing robust experiments for nonlinear estimation under parametric uncertainty.
method Multi-stage robust optimization framework for sequential experiments.
result Identifies experiments better conducted early for improved parameter knowledge.

The paper investigates AI robustness through experiments and statistical analysis.

problem Inaccurate AI predictions can lead to safety and adoption issues.
method Design of experiments framework to study AI classification robustness.
result AI algorithms' robustness is influenced by various factors.

We investigate two new strategies for the numerical solution of optimal stopping problems within the Regression Monte Carlo (RMC) framework of Longstaff and Schwartz. First, we propose the use of stochastic kriging (Gaussian process) meta-models for fitting the continuation value. Kriging offers a flexible, nonparametr…

2015-09-07abs ↗pdf ↗

This work uses RL to optimize batch experiments in SDOE.

problem Maximizing knowledge with limited resources and constraints.
method Reinforcement Learning for batch-sampling in Bayesian SDOE.
result The proposed algorithm optimizes experiment selection for multiple tasks.

Designs a single policy for collecting data to train near-optimal policies.

problem Engineering overhead in deploying minimax procedures for stochastic linear contextual bandits.
method Designs a single stochastic policy to collect data from which a near-optimal policy can be extracted.
result The designed policy can collect data from which a near-optimal policy can be extracted.

Proposes a method to generate multivariate prediction intervals for random forests.

problem Uncertainty estimates for iterative design of experiments with multiple correlated model outputs.
method Recalibrated bootstrap method for bagged models.
result Significantly decreases the number of iterations required for satisfactory candidate in sequential learning problems.

Regression models are increasingly built using datasets which do not follow a design of experiment. Instead, the data is e.g. gathered by an automated monitoring of a technical system. As a consequence, already the input data represents phenomena of the system and violates statistical assumptions of distributions. The …

2017-01-16abs ↗pdf ↗

We propose a Bayesian optimization algorithm for objective functions that are sums or integrals of expensive-to-evaluate functions, allowing noisy evaluations. These objective functions arise in multi-task Bayesian optimization for tuning machine learning hyperparameters, optimization via simulation, and sequential des…

2018-03-23abs ↗pdf ↗

Predicts optimal training dataset sizes per class for machine learning models.

problem Optimizing training dataset sizes for class-specific machine learning models.
method Algorithm based on space-filling design of experiments, models like powerlaw curves and generalized linear models.
result The algorithm predicts optimal training dataset sizes per class for improved model performance.

Paper uses transfer learning and Bayesian optimization to reduce DNA sequence design experiments.

problem Designing many similar DNA sequences for specific applications is expensive and time-consuming.
method Combines transfer learning with Bayesian optimization to reduce experiment count.
result Total number of experiments can be significantly reduced by sharing information between tasks.

The study examines how experimental design choices affect machine learning model performance.

problem Lack of guidelines on choosing experimental designs and machine learning models.
method 12 experimental designs, 7 families of predictive models, 7 test functions, 8 noise settings.
result Guidelines for practical applications of DOE and ML are provided.

Unified Skew-Gaussian process framework for various regression and classification tasks.

problem Handling multiple types of regression and classification problems.
method Generalization of Skew-Gaussian processes to handle various types of data and likelihoods.
result Closed-form posterior distributions for multiple tasks.

Study designs experiments to identify causal graph structure with cycles and latent confounders.

problem Identify causal graph structure with cycles and latent confounders.
method Established lower bounds, developed CI and do see tests algorithms, and proved tightness.
result Proposed algorithms can recover all causal edges except for double adjacent bidirected edges.

Bayesian optimization speeds up bioprocess development across scales.

problem Costly and complex bioprocess development across scales and biocatalyst selection.
method Multi-fidelity batch Bayesian optimization framework integrating Gaussian Processes and mixed-variable optimization.
result Reduction in experimental costs and increased yield in bioprocess optimization.

Bayesian DOE accelerates experimental design with improved efficiency.

problem Enhancing experimental design efficiency and reliability.
method Bayesian framework, conditional density estimation, informative data selection.
result Significantly improved computational efficiency of experimental design.

The inverse statistical problem of finding direct interactions in complex networks is difficult. In the natural sciences, well-controlled perturbation experiments are widely used to probe the structure of complex networks. However, our understanding of how and why perturbations aid inference remains heuristic, and we l…

2019-03-25abs ↗pdf ↗