New Bayesian optimization models for efficient material screening.
problem Efficiently screening materials with expensive and cheap tests.
method Flexible multi-test Bayesian optimization models with complex relationships.
result Demonstrated power on synthetic and real data.
New test assesses probabilistic model calibration without expensive approximations.
problem Assessing calibration of probabilistic models with scores.
method Kernel Calibration Conditional Stein Discrepancy (KCCSD) test using new score-based kernels.
result Control over type-I error with improved scalability and efficiency.
This work uses GANs to generate realistic vehicle test inputs.
problem Lack of realistic input sequences for automotive testing.
method Applying GANs to learn from unlabeled in-vehicle signals and generate synthetic inputs.
result Improved virtual test coverage and reduced need for expensive field tests.
Building machine translation (MT) test sets is a relatively expensive task. As MT becomes increasingly desired for more and more language pairs and more and more domains, it becomes necessary to build test sets for each case. In this paper, we investigate using Amazon's Mechanical Turk (MTurk) to make MT test sets chea…
Study examines time-varying betas and their volatility in bank interest income and expense margins.
problem Understanding the variability of bank betas and their impact on net interest margins.
method Used state-space methods to estimate time-varying betas and conditional volatility.
result Substantial variation in interest income and expense betas, leading to varying net interest margin coefficients.
Tests for Esophageal cancer can be expensive, uncomfortable and can have side effects. For many patients, we can predict non-existence of disease with 100% certainty, just using demographics, lifestyle, and medical history information. Our objective is to devise a general methodology for customizing tests using user pr…
Novel CE-method variants reduce local minima convergence with fewer function evaluations.
problem Local minima and expensive function evaluations in optimization.
method Surrogate model-based CE-method variants to reduce local minima convergence.
result Surrogate model-based approach reduces local minima convergence using fewer function evaluations.
Many expensive black-box optimisation problems are sensitive to their inputs. In these problems it makes more sense to locate a region of good designs, than a single-possibly fragile-optimal design. Expensive black-box functions can be optimised effectively with Bayesian optimisation, where a Gaussian process is a popu…
DRIFT uses RL to automate functional software testing efficiently.
problem Efficient and reliable automated software testing.
method DRIFT employs Q-learning with Graph Neural Networks on symbolic UI representations.
result DRIFT can robustly test software functionalities in a fully automated manner.
Hypothesis testing for graphs has been an important tool in applied research fields for more than two decades, and still remains a challenging problem as one often needs to draw inference from few replicates of large graphs. Recent studies in statistics and learning theory have provided some theoretical insights about …
Reduces test set maintenance effort by 80-100%.
problem Lack of proper and up-to-date test sets in real-world scenarios.
method Simple technique to reduce labeling effort.
result Significant reduction in test set maintenance effort (80-100%).
CTT compresses samples to test distributions near-linearly, outperforming existing methods.
problem Efficiently testing distributions with high power and near-linear runtime.
method Sample compression followed by permutation testing.
result CTT achieves near-linear runtime while maintaining high statistical power.
Cheap permutation tests speed up distribution testing without sacrificing accuracy.
problem Efficiently testing distribution differences and independence.
method Group datapoints into bins and permute only these bins, using stored sufficient statistics.
result Cheap permutation tests maintain the accuracy and optimality of standard tests but are significantly faster.
BDC uses Distance Correlation for efficient Bayesian optimization of expensive functions.
problem Efficiently optimizing expensive black-box functions with Bayesian methods.
method Integrates Bayesian optimization with Distance Correlation for automatic exploration and exploitation.
result BDC performs similarly to popular BO methods on benchmark tests and real terrain optimization.
We propose a class of nonparametric two-sample tests with a cost linear in the sample size. Two tests are given, both based on an ensemble of distances between analytic functions representing each of the distributions. The first test uses smoothed empirical characteristic functions to represent the distributions, the s…
Active testing reduces label costs for efficient model evaluation.
problem Real-world applications require expensive test labels, disconnecting from existing model evaluation methods.
method Derives acquisition strategies to select test points efficiently, addressing label bias and variance.
result Active testing improves model evaluation efficiency without sacrificing accuracy.
Probabilistic generative models provide a powerful framework for representing data that avoids the expense of manual annotation typically needed by discriminative approaches. Model selection in this generative setting can be challenging, however, particularly when likelihoods are not easily accessible. To address this …
A new kernel-based CI test improves on existing methods.
problem Testing conditional independence (CI) in a broad range of dependencies.
method Regression-model-agnostic kernel-based CI test using reproducing kernel Hilbert spaces.
result GKCM outperforms state-of-the-art CI tests in simulations.
GTBO uses group testing to optimize high-dimensional functions efficiently.
problem Challenges in optimizing high-dimensional, expensive functions due to the curse of dimensionality.
method GTBO combines testing and optimization phases to identify active variables and guide efficient optimization.
result GTBO outperforms state-of-the-art methods on high-dimensional optimization tasks.
The study analyzes and mitigates errors in PC-based causal discovery methods.
problem Errors in PC-based causal discovery methods can lead to incorrect graphs.
method The study introduces coherency scores to detect assumption violations and small sample errors in PC-based methods.
result The coherency scores can detect errors that other methods cannot, bridging between global and local error detection.
More accurate machine learning models often demand more computation and memory at test time, making them difficult to deploy on CPU- or memory-constrained devices. Teacher-student compression (TSC), also known as distillation, alleviates this burden by training a less expensive student model to mimic the expensive teac…
Improved SV estimator for efficient data valuation.
problem Computational inefficiency in Shapley value estimation.
method Group Testing-based SV estimator with improvements.
result Enhanced asymptotic sample complexity and insights into challenges.
MINIROCKET speeds up time series classification by 75x.
problem High computational complexity in time series classification.
method Random convolutional kernels and linear classifier.
result Up to 75 times faster on larger datasets.
Bayesian neural networks improve simulation-based inference with limited data.
problem Inaccurate inference in data-poor regimes with limited or expensive simulations.
method Bayesian neural networks for posterior approximation, accounting for computational uncertainty.
result Bayesian neural networks produce well-calibrated posteriors with few simulations.
Bayesian optimization tackles expensive cascade processes.
problem Optimizing multistage decision-making processes with expensive costs.
method Formulated as Bayesian optimization framework with two types of acquisition functions.
result Demonstrated effectiveness through numerical experiments and a solar cell simulator application.
New algorithms test independence with fewer samples by using predictive information.
problem Testing independence of distributions with limited samples.
method Augmented distribution testing framework that incorporates predictive information.
result Optimal sample complexity achieved, matching lower bounds.
A clustering method for multivariate populations with similar dependence structures.
problem Grouping populations with similar dependence structures.
method Orthogonal projection coefficients of density copulas estimated from populations.
result Clusters of populations with similar dependence structures.
A new method reduces computational costs for testing RF variable importance measures.
problem Testing variable importance measures from random forests is computationally expensive and challenging.
method Sequential permutation testing and sequential p-value estimation to reduce computational costs.
result Theoretical properties of sequential tests are confirmed, maintaining type-I error and high power.
PPAT uses predictions to improve risk estimation in active testing.
problem Exploiting informative predictions from black-box models for efficient risk estimation.
method Combines LURE estimator with prediction-powered control variate.
result PPAT outperforms existing methods in risk estimation and uncertainty quantification.
VarFA efficiently estimates student skill levels with uncertainty for adaptive testing.
problem Efficiently estimating student skill levels with uncertainty for adaptive testing.
method VarFA uses variational inference to extend factor analysis models for educational data.
result VarFA efficiently handles large datasets and produces uncertainty estimates.
Automates design of lightweight neural networks for image classification.
problem Designing efficient neural networks for edge devices with limited computational resources.
method Uses the Mesh Adaptive Direct Search (MADS) algorithm to optimize network architecture.
result Achieves comparable performance to standard methods with fewer design trials.
Physical systems are modelled and investigated within simulation software in an increasing range of applications. In reality an investigation of the system is often performed by empirical test scenarios which are related to typical situations. Our aim is to derive a method which generates diverse test scenarios each re…
New algorithm for efficiently identifying the best arm in stochastic bandits.
problem Best arm identification in stochastic multi-armed bandits with fixed confidence.
method Sequential probability ratio tests for arm selection.
result Asymptotically optimal sample complexity and guaranteed δ−PAC performance. Adversarial robust learning improved for transductive setting.
problem Adversarial robust learning in transductive setting.
method Simple transductive learner for bounded VC dimension classes.
result Robust error rate linear in VC dimension, adaptive to perturbation complexity.
SALSA automatically adjusts learning rates in stochastic gradient methods.
problem Automatic adjustment of learning rates in stochastic gradient methods.
method SALSA uses a line-search procedure to gradually increase the learning rate, then a statistical test to decrease it.
result SALSA matches the performance of best hand-tuned learning rate schedules in deep learning tasks.
Lactate threshold is considered an essential parameter when assessing performance of elite and recreational runners and prescribing training intensities in endurance sports. However, the measurement of blood lactate concentration requires expensive equipment and the extraction of blood samples, which are inconvenient f…
GTBO uses group testing to optimize high-dimensional functions efficiently.
problem Optimizing expensive, high-dimensional functions with limited data.
method Group testing to identify active dimensions, then guide optimization.
result GTBO outperforms state-of-the-art methods on high-dimensional benchmarks.
One important assumption underlying common classification models is the stationarity of the data. However, in real-world streaming applications, the data concept indicated by the joint distribution of feature and label is not stationary but drifting over time. Concept drift detection aims to detect such drifts and adap…
A new kernel test avoids permutations for independence testing.
problem Intractable null distributions of kernel statistics.
method Developed xHSIC and xdCov, avoiding permutations.
result New tests have limiting Gaussian distributions under null.
Study examines downsizing impact on Indian construction firms' profitability.
problem Impact of downsizing layoffs on construction firms' profitability in India.
method Used Co-integration test, OLS, and VAR models on secondary data of 15 companies.
result Employee Expenses and Number of Employees have significant impact on profitability.
Are two sets of observations drawn from the same distribution? This problem is a two-sample test. Kernel methods lead to many appealing properties. Indeed state-of-the-art approaches use the L2 distance between kernel-based distribution representatives to derive their test statistics. Here, we show that Lp distan…
Improved SSD for faster and more accurate goodness-of-fit tests and model learning.
problem Optimal slicing directions for SSD are computationally expensive and sub-optimal.
method Relaxed optimal slicing requirement, active sub-space construction, spectral decomposition.
result 14-80x speed-up in goodness-of-fit tests compared to gradient-based alternatives.
Metric learning methods for dimensionality reduction in combination with k-Nearest Neighbors (kNN) have been extensively deployed in many classification, data embedding, and information retrieval applications. However, most of these approaches involve pairwise training data comparisons, and thus have quadratic computat…
A new method reduces hyperparameter tuning evaluations by using sequential tests.
problem Time-consuming hyperparameter tuning in machine learning.
method Sequential Random Search (SQRS) extending regular random search.
result SQRS finds similarly well-performing parameter settings with fewer evaluations.
We propose Efficient Neural Architecture Search (ENAS), a fast and inexpensive approach for automatic model design. In ENAS, a controller learns to discover neural network architectures by searching for an optimal subgraph within a large computational graph. The controller is trained with policy gradient to select a su…
This work analyzes and optimizes memory and compute costs of learned optimizers.
problem High memory and compute costs of learned optimizers.
method Identified and quantified design features of learned and hand-designed optimizers, constructed a more efficient learned optimizer.
result A learned optimizer that is faster and more memory efficient than previous work.
Many probabilistic models of interest in scientific computing and machine learning have expensive, black-box likelihoods that prevent the application of standard techniques for Bayesian inference, such as MCMC, which would require access to the gradient or a large number of likelihood evaluations. We introduce here a n…
EGORSE optimizes high-dimensional problems using random and supervised embeddings.
problem Efficiently solving computationally expensive high-dimensional optimization problems.
method EGORSE combines random and supervised linear embeddings for adaptive optimization.
result EGORSE outperforms state-of-the-art methods in high-dimensional optimization.