Results for “adaptive sampling”

NASA NTRS1971

Digital adaptive sampling.

Discussion of digital adaptive sampling, which is consistently better than fixed sampling in noise-free cases. Adaptive sampling is shown to be feasible and, it is considered, should be studied further. It should be noted that adaptive sampling is a class of variable rate sampling in which the variability depends on system signals. Digital rather than analog laws should be studied, because cases can arise in which the analog signals are not even available. An extremely important problem is implementation.

Breazeale, G. J.↗

DOE OSTI2026

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization [SWR-25-166]

Adaptive Sampling Trust Region Method for Bi-fidelity Simulation Optimization aims to demonstrate the effect of adaptive sampling-based bi-fidelity stochastic trust region method (ASTRO-BFDF). ASTRO-BFDF, derived from a derivative-free adaptive sampling trust-region optimization (ASTRO-DF) (Shashaani et al. 2018, Ha and Shashaani 2023), intended to efficiently solve the bi-fidelity simulation optimization.

Mueller, Juliane [National Laboratory of the Rocki↗

NASA NTRS2005

Accurate Biomass Estimation via Bayesian Adaptive Sampling

The following concepts were introduced: a) Bayesian adaptive sampling for solving biomass estimation; b) Characterization of MISR Rahman model parameters conditioned upon MODIS landcover. c) Rigorous non-parametric Bayesian approach to analytic mixture model determination. d) Unique U.S. asset for science product validation and verification.

Wheeler, Kevin R.↗

DOE OSTI2025

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

DOE OSTI2025

Simulation driven adaptive sampling for neutron-diffraction based strain mapping of additively manufactured parts

Neutron diffraction based strain mapping is a useful technique for measuring residual strains in additively manufactured (AM) metal parts. The measurement is traditionally done by scanning the sample in a point-wise raster pattern to extract the strain at each position. Since the overall scan can span several hours, adaptive sampling approaches using Bayesian optimization based on Gaussian process (BO-GP) regression have been introduced—demonstrating that even with a fraction of the typically made measurements the dominant strain patterns in the sample can be reconstructed. However, the parameters of the BO-GP algorithm have to be carefully chosen for best performance, and the movement time between arbitrary points can offset the time savings from a reduced number of measurement locations. In this paper, we propose algorithms to refine the BO-GP based methods by using simulations of strain patterns in AM parts based on the materials and the process used to print them. We demonstrate that the simulated strain patterns can be used to help choose better parameters for the BO-GP based framework—leading to low reconstruction error for the final strain pattern. Furthermore, we show that the strain mapping experiment can be initialized with a sampling pattern learnt from the simulation data and ordered to reduce movement time, dramatically enabling reduction in the overall time required to run the baseline BO-GP method.

Gaussian process regression↗

DOE OSTI2025

FLAMES─Fast, Low-Storage, Accurate, and Memory-Efficient Adaptive Sampling─Approach to Resolve Spatially Dependent Dynamics of Molecular Liquids

Many critical phenomena in soft matter occur at large length scales, necessitating the resolution of their structure and dynamics at low wavenumbers. However, resolving wavenumber-dependent dynamics computationally via molecular dynamics simulations presents significant challenges, as these phenomena span several orders of magnitude in both time and length scales, resulting in high computational costs and memory demands. Here, this work highlights the computational and memory challenges associated with analyzing molecular trajectories in reciprocal space and demonstrates a method to address them. We introduce FLAMESFast, Low-storage, Accurate, and Memory-Efficient adaptive Sampling, which is a direct method for calculation of structure factors, allowing us to select only the required number of wavevectors for binning. We also use wavenumber-dependent time steps to extract dynamics. Our FLAMES approach effectively mitigates computational and memory/storage bottlenecks. We demonstrate the method using simulations of a model system, liquid octane, at various temperatures. Comparisons with experimental data and real space computation show that the FLAMES technique achieves high accuracy in resolving temperature- and spatially dependent dynamics while being significantly more computationally efficient and requiring less memory and storage than methods based on a uniform wavevector grid and fixed temporal spacing.

Chen, Guang [Argonne National Laboratory (ANL), Ar↗

NASA NTRS2018

Shifting Data Collection from a Fixed to an Adaptive Sampling Paradigm

For domains where data are difficult to obtain due to human or resource limitations, an emphasis is needed to efficiently explore the dimensions of information spaces to acquire any given response of interest. Many disciplines are still making the transition from brute force, dense, full factorial exploration of their information spaces to a more efficient design of experiments approach; the latter being in use successfully for many decades in agricultural and automotive applications. Although this transition is still incomplete, groundwork must be laid for incorporating the next generation of algorithms to adaptively explore the information space in response to data collected, as well as any resulting empirical models (i.e., metamodels). The methodology in the present work was to compare metamodel quality using a fixed sampling technique compared to an adaptive sampling technique based on metamodel variance. In order to quantify metamodeling errors, a delta method was used to provide quantitative model variance estimates. The present methodology was applied to a design space with an air-breathing engine performance response. It was shown that competitive metamodel quality with lower associated error could be achieved for an adaptive sampling technique for the same level of effort as a fixed, a priori sampling technique.

Axdahl, Erik L.↗

NASA NTRS2012

Adaptive Sampling of Time Series During Remote Exploration

This work deals with the challenge of online adaptive data collection in a time series. A remote sensor or explorer agent adapts its rate of data collection in order to track anomalous events while obeying constraints on time and power. This problem is challenging because the agent has limited visibility (all its datapoints lie in the past) and limited control (it can only decide when to collect its next datapoint). This problem is treated from an information-theoretic perspective, fitting a probabilistic model to collected data and optimizing the future sampling strategy to maximize information gain. The performance characteristics of stationary and nonstationary Gaussian process models are compared. Self-throttling sensors could benefit environmental sensor networks and monitoring as well as robotic exploration. Explorer agents can improve performance by adjusting their data collection rate, preserving scarce power or bandwidth resources during uninteresting times while fully covering anomalous events of interest. For example, a remote earthquake sensor could conserve power by limiting its measurements during normal conditions and increasing its cadence during rare earthquake events. A similar capability could improve sensor platforms traversing a fixed trajectory, such as an exploration rover transect or a deep space flyby. These agents can adapt observation times to improve sample coverage during moments of rapid change. An adaptive sampling approach couples sensor autonomy, instrument interpretation, and sampling. The challenge is addressed as an active learning problem, which already has extensive theoretical treatment in the statistics and machine learning literature. A statistical Gaussian process (GP) model is employed to guide sample decisions that maximize information gain. Nonsta tion - ary (e.g., time-varying) covariance relationships permit the system to represent and track local anomalies, in contrast with current GP approaches. Most common GP models are stationary, e.g., the covariance relationships are time-invariant. In such cases, information gain is independent of previously collected data, and the optimal solution can always be computed in advance. Information-optimal sampling of a stationary GP time series thus reduces to even spacing, and such models are not appropriate for tracking localized anomalies. Additionally, GP model inference can be computationally expensive.

Thompson, David R.↗

NASA NTRS1978

Random sampling adaptively focusing synthetic aperture radar

A high resolution narrow angle of view imaging radar system is considered that employs an airborne synthetic aperture of 600 meters operating at X-band to produce a beamwidth of approximately 0.05 mr. This system differs from a conventional SAR in that only a smaller number of wavefront samples, spaced randomly over the aperture are processed, and adaptive beamforming with open loop scanning is used. As a result, the processing requirements are reduced to within the capability of present day small computer technology, and the tolerance on flight stability is loosened by about 100:1. The system is described and initial analysis and evaluation results are presented.

Powers, E. N.↗

DOE OSTI2025

A Behavioral Robotics Approach to Radiation Mapping Using Adaptive Sampling

Radiation mapping is a desirable task to automate because of the inherent risks involved and its tedious nature. A novel system was designed to address this by combining various existing technologies, utilizing behavior-based robotics and Bayesian optimization. The system uses a quadruped robot equipped with a manipulator and gamma detector to take measurements at locations that are selected based on the uncertainty of a surrogate model used to estimate the true radiation field. The robot uses input from the world with depth cameras to avoid collisions with the robot’s body, and unreachable points for the end effector are addressed by both allowing for a soft collision with the environment to occur, prompting the system to abandon that point, and varying the exploration tendency of the optimization based on consecutive collisions. This approach provides unique traversability and adaptability over other strategies in the literature. Experiments were performed by placing a Cesium-137 source on the ground and varying geometric setups and an optimization parameter demonstrating the adaptability to diverse environments and the increased robustness resulting from the designed behavior. The results additionally demonstrate that dynamically adjusting the optimization algorithm’s exploration tendency based on the arm’s collision history improves the system’s ability to navigate cluttered environments and construct accurate radiation maps without getting stuck in unreachable areas.

Adams, Joel↗

NASA NTRS2013

Adaptive Sampling of Spatiotemporal Phenomena with Optimization Criteria

This work was designed to find a way to optimally (or near optimally) sample spatiotemporal phenomena based on limited sensing capability, and to create a model that can be run to estimate uncertainties, as well as to estimate covariances. The goal was to maximize (or minimize) some function of the overall uncertainty. The uncertainties and covariances were modeled presuming a parametric distribution, and then the model was used to approximate the overall information gain, and consequently, the objective function from each potential sense. These candidate sensings were then crosschecked against operation costs and feasibility. Consequently, an operations plan was derived that combined both operational constraints/costs and sensing gain. Probabilistic modeling was used to perform an approximate inversion of the model, which enabled calculation of sensing gains, and subsequent combination with operational costs. This incorporation of operations models to assess cost and feasibility for specific classes of vehicles is unique.

Chien, Steve A.↗

NASA NTRS1977

Survey of adaptive image coding techniques

The general problem of image data compression is discussed briefly with attention given to the use of Karhunen-Loeve transforms, suboptimal systems, and block quantization. A survey is then conducted encompassing the four categories of adaptive systems: (1) adaptive transform coding (adaptive sampling, adaptive quantization, etc.), (2) adaptive predictive coding (adaptive delta modulation, adaptive DPCM encoding, etc.), (3) adaptive cluster coding (blob algorithms and the multispectral cluster coding technique), and (4) adaptive entropy coding.

Habibi, A.↗

DOE OSTI2026

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Discovery and Analysis of Rare High-Impact Failure Modes using Adversarial RL-Informed Sampling

Adaptive learning agents have tremendous potential to handle critical tasks currently performed by humans. Unfortunately, due to their complexity, it can be difficult to verify that these learning agents do not have critical failure modes. Standard verification and validation methods often do not apply directly to learning agents and Monte Carlo methods have difficulty covering even a small fraction of the state space, especially in multiagent systems or over long time horizons. To overcome this difficulty, we demonstrate an adaptive stress-testing method based on reinforcement learning of correlations that raise the probability of failure. This approach has three key properties: (1) it is able to find rare failure modes with far greater sample efficiency than Monte Carlo methods, (2) it can estimate the true probability of a failure mode despite the inherent bias in the learning method, and (3) it is capable of learning and resampling compact representations of multimodal failure spaces. These properties are important in practice as we need to find disparate failure modes while accounting for their actual relevance. This is a significant advantage over traditional adaptive stress testing methods that give abstract likelihoods of particular failure instances, but cannot estimate the probability of a broader failure mode. We test our algorithm on a simple problem from the aviation domain where an autonomous aircraft lands in gusty wind conditions. The results suggest that we can find failure modes with far fewer samples than the Monte Carlo approach and simultaneously estimate the probability of failure.

reinforcement learning↗

NASA NTRSDate not supplied

Discovery and Analysis of Rare High-Impact Failure Modes using Adversarial RL-Informed Sampling

Adaptive learning agents have tremendous potential to handle critical tasks currently performed by humans. Unfortunately, due to their complexity, it can be difficult to verify that these learning agents do not have critical failure modes. Standard verification and validation methods often do not apply directly to learning agents and Monte Carlo methods have difficulty covering even a small fraction of the state space, especially in multiagent systems or over long time horizons. To overcome this difficulty, we demonstrate an adaptive stress-testing method based on reinforcement learning of correlations that raise the probability of failure. This approach has three key properties: (1) it is able to find rare failure modes with far greater sample efficiency than Monte Carlo methods, (2) it can estimate the true probability of a failure mode despite the inherent bias in the learning method, and (3) it is capable of learning and resampling compact representations of multimodal failure spaces. These properties are important in practice as we need to find disparate failure modes while accounting for their actual relevance. This is a significant advantage over traditional adaptive stress testing methods that give abstract likelihoods of particular failure instances, but cannot estimate the probability of a broader failure mode. We test our algorithm on a simple problem from the aviation domain where an autonomous aircraft lands in gusty wind conditions. The results suggest that we can find failure modes with far fewer samples than the Monte Carlo approach and simultaneously estimate the probability of failure.

Validation↗

NASA NTRSDate not supplied

Discovery and Analysis of Rare High-Impact Failure Modes using Adversarial RL-Informed Sampling

Adaptive learning agents have tremendous potential to handle critical tasks currently performed by humans. Unfortunately, due to their complexity, it can be difficult to verify that these learning agents do not have critical failure modes. Standard verification and validation methods often do not apply directly to learning agents and Monte Carlo methods have difficulty covering even a small fraction of the state space, especially in multiagent systems or over long time horizons. To overcome this difficulty, we demonstrate an adaptive stress-testing method based on reinforcement learning of correlations that raise the probability of failure. This approach has three key properties: (1) it is able to find rare failure modes with far greater sample efficiency than Monte Carlo methods, (2) it can estimate the true probability of a failure mode despite the inherent bias in the learning method, and (3) it is capable of learning and resampling compact representations of multimodal failure spaces. These properties are important in practice as we need to find disparate failure modes while accounting for their actual relevance. This is a significant advantage over traditional adaptive stress testing methods that give abstract likelihoods of particular failure instances, but cannot estimate the probability of a broader failure mode. We test our algorithm on a simple problem from the aviation domain where an autonomous aircraft lands in gusty wind conditions. The results suggest that we can find failure modes with far fewer samples than the Monte Carlo approach and simultaneously estimate the probability of failure.

Validation↗

NASA NTRS1986

Averaging analysis for discrete time and sampled data adaptive systems

Earlier continuous time averaging theorems are extended to the nonlinear discrete time case. Theorems for the study of the convergence analysis of discrete time adaptive identification and control systems are used. Instability theorems are also derived and used for the study of robust stability and instability of adaptive control schemes applied to sampled data systems. As a by product, the effects of sampling on unmodeled dynamics in continuous time systems are also studied.

Fu, Li-Chen↗

NASA NTRS1975

Stability of multirate sampled-data systems

Current adaptive sampling schemes that can be used in sampled-data systems with variable rate sampling does not guarantee the stability of the resulting closed-loop system. A study was undertaken with the objective of finding a stable control law for multirate sampled-data systems. The problem is formulated such that the sampling interval is selected from a set of fixed number of sample intervals. A necessary and sufficient condition under which these types of systems can be stabilized is given. For a certain subclass of these types of systems, a sampling selection algorithm is given which results in a stable closed-loop system.

Stanford, D. P.↗