Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bayesian Optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 829 records · Page 46

A machine learning Automated Recommendation Tool for synthetic biology

Abstract Synthetic biology allows us to bioengineer cells to synthesize novel valuable molecules such as renewable biofuels or anticancer drugs. However, traditional synthetic biology approaches involve ad-hoc engineering practices, which lead to long development times. Here, we present the Automated Recommendation Tool (ART), a tool that leverages machine learning and probabilistic modeling techniques to guide synthetic biology in a systematic fashion, without the need for a full mechanistic understanding of the biological system. Using sampling-based optimization, ART provides a set of recommended strains to be built in the next engineering cycle, alongside probabilistic predictions of their production levels. We demonstrate the capabilities of ART on simulated data sets, as well as experimental data from real metabolic engineering projects producing renewable biofuels, hoppy flavored beer without hops, fatty acids, and tryptophan. Finally, we discuss the limitations of this approach, and the practical consequences of the underlying assumptions failing.

59 BASIC BIOLOGICAL SCIENCES↗

Quantitative Validation of Control Bands Using Bayesian Statistical Analyses

Abstract This study presents a quantitative validation of 15 Similar Exposure Groups (SEGs) that were derived via control bands inherent to the Risk Level Based Management System currently being used at the Lawrence Livermore National Laboratory. For 93% of the SEGs that were evaluated, statistical analyses of personal exposure monitoring data, through Bayesian Decision Analysis (BDA), demonstrated that the controls implemented from the initial control bands assigned to these SEGs were at least as protective as the controls from the control band outcomes derived from the quantitative data. The BDA also demonstrated that for 40% of the SEGs, the controls from the initial control bands were overly protective, thus allowing controls to be downgraded, which resulted in a significant saving of environmental safety and health (ES&H) resources. Therefore, as a means to both confirm existing controls and to identify candidate SEGs for downgrading controls, efforts to continuously improve the accuracy of Control Banding (CB) strategies through the routine quantitative validation of SEGs are strongly encouraged. Targeted collaborative efforts across institutions and even countries for both the development of CB strategies and the validation of discreetly defined SEGs of commonly performed tasks will not only optimize limited ES&H resources but will also assist in providing a simplified process for essential risk communication at the worker level to the benefit of billions of workers around the world.

McCord, Tyler A.↗

Planck 2015 results: XVIII. Background geometry and topology of the Universe

We report that maps of cosmic microwave background (CMB) temperature and polarization from the 2015 release of Planck data provide the highestquality full-sky view of the surface of last scattering available to date. This enables us to detect possible departures from a globally isotropic cosmology. We present the first searches using CMB polarization for correlations induced by a possible non-trivial topology with a fundamental domain that intersects, or nearly intersects, the last-scattering surface (at comoving distance χ rec ), both via a direct scan for matched circular patterns at the intersections and by an optimal likelihood calculation for specific topologies. We specialize to flat spaces with cubic toroidal (T3) and slab (T1) topologies, finding that explicit searches for the latter are sensitive to other topologies with antipodal symmetry. These searches yield no detection of a compact topology with a scale below the diameter of the last-scattering surface. The limits on the radius R i of the largest sphere inscribed in the fundamental domain (at log-likelihood ratio ΔlnL > -5 relative to a simply-connected flat Planck best-fit model) are: R i > 0.97 χ rec for the T3 cubic torus; and R i > 0.56 χ rec for the T1 slab. The limit for the T3 cubic torus from the matched-circles search is numerically equivalent, R i > 0.97 χ rec at 99% confidence level from polarization data alone. We also perform a Bayesian search for an anisotropic global Bianchi VII h geometry. In the non-physical setting, where the Bianchi cosmology is decoupled from the standard cosmology, Planck temperature data favour the inclusion of a Bianchi component with a Bayes factor of at least 2.3 units of log-evidence. However, the cosmological parameters that generate this pattern are in strong disagreement with those found from CMB anisotropy data alone. Fitting the induced polarization pattern for this model to the Planck data requires an amplitude of -0.10 ± 0.04 compared to the value of + 1 if the model were to be correct. In the physically motivated setting, where the Bianchi parameters are coupled and fitted simultaneously with the standard cosmological parameters, we find no evidence for a Bianchi VII h cosmology and constrain the vorticity of such models to (ω/H) 0 < 7.6 × 10 -10 (95% CL).

79 ASTRONOMY AND ASTROPHYSICS↗

Improving the real-time probabilistic channel flood forecasting by incorporating the uncertainty of inflow using the particle filter

An accurate and reliable real-time flood forecast is crucial for mitigating flood disasters. The errors associated with the inflow boundary forcing data are considered as an important source of uncertainties in hydraulic model. In this paper, a real-time probabilistic channel flood forecasting model is developed with a novel function to incorporate the uncertainty of the forcing inflow. This new approach couples a hydraulic model with the particle filter (PF) data assimilation algorithm, a sequential Bayesian Monte Carlo method. The stage observations at hydrological stations are assimilated at each time step to update the model states in order to improve the next time step’s forecasting. This new approach is tested against a real flood event occurred in the upper Yangtze River. As compared with the open loop simulations, the evaluations of model performance with several deterministic and probabilistic metrics indicate that the accuracy of the ensemble mean prediction and the reliability of the uncertainty quantification are improved pronouncedly as a result of the PF assimilation. Further assessment of the prediction results at different lead times shows that the improvement of model performance deteriorates with the increase of the lead time due to the gradual diminishing of the updating effect for the initial conditions. Based on the analyses of the number of particles and the assimilation frequency, we find that the optimal number of particles can be determined by balancing the model performance and the computation cost, while a high assimilation frequency is preferred to incorporate the emerging observations to update the model states to match the real conditions.

Channel flood forecasting, probabilistic forecast,↗

Sequential optimal positioning of mobile sensors using mutual information

Source localization, such as detecting a nuclear source in an urban area or ascertaining the origin of a chemical plume, is generally regarded as a well-documented inverse problem; however, optimally placing sensors to collect data for such problems is a more challenging task. In particular, optimal sensor placement—that is, measurement locations resulting in the least uncertainty in the estimated source parameters—depends on the location of the source, which is typically unknown a priori. Mobile sensors are advantageous because they have the flexibility to adapt to any given source position. While most mobile sensor strategies designate a trajectory for sensor movement, we instead employ mutual information, based on Shannon entropy, to choose the next measurement location from a discrete set of design conditions.

97 MATHEMATICS AND COMPUTING↗

Application of Sequential Design of Experiments (SDoE) to Large Pilot-Scale Solvent-Based CO2 Capture Process at Technology Centre Mongstad (TCM)

The United States Department of Energy’s Carbon Capture Simulation for Industry Impact (CCSI2) program has developed a framework for sequential design of experiments (SDoE) that aims to maximize knowledge gained from budget- and schedule-limited pilot scale testing. SDoE was applied to the planning and execution of campaigns for testing CO2 capture systems at pilot-scale in order to optimally allocate resources available for the testing. In this methodology, a stochastic process model is developed by quantifying the parametric uncertainty in submodels of interest; for a solvent-based CO2 capture system, these may include physical properties and equipment performance submodels (e.g., mass transfer, interfacial area). This uncertainty is propagated through the full process model, over variable operating conditions, for estimating the resulting uncertainty in key model outputs (e.g., percentage of CO2 capture, solvent regeneration energy requirement). In developing a data collection plan, the predicted output uncertainty is incorporated into an algorithm that seeks simultaneously to select process operating conditions for which the predicted uncertainty is relatively high and to ensure that the entire space of operation is well represented. This test plan is then used to guide operation of the pilot plant at varying steady-state conditions, with resulting process data incorporated into the existing model using Bayesian inference to refine parameter distributions. The updated stochastic model, with reduced parametric uncertainty from data collected, is then used to guide additional data collection, thus the sequential nature of the experimental design. The SDoE process was implemented at the pilot test unit (12 MWe in scale) at Norway’s Technology Centre Mongstad (TCM) in a summer 2018 test campaign with aqueous monoethanolamine (MEA). During the test campaign, the varied operating conditions included the flowrates of circulated solvent, flue gas, and reboiler steam and the CO2 concentration in the flue gas. The process data were used to update probability distributions of mass transfer and interfacial area parameters of a stochastic process model developed by the CCSI2 team. Two iterations of the SDoE process were executed, resulting in the uncertainty in model predicted CO2 capture percentage decreasing by an average of 58.0 ± 4.7% over the full input space of interest. This work demonstrates the potential of the SDoE process for model refinement through reduction in process model parametric uncertainty, and ultimately risk in scale-up, in CO2 capture technology performance.

carbon capture↗

Sequential Design of Experiments to Maximize Learning from Carbon Capture Pilot Plant Testing

Pilot plant test campaigns can be expensive and time-consuming. Therefore, it is of interest to maximize the amount of learning and the efficiency of the test campaign given the limited number of experiments that can be conducted. This work investigates the use of sequential design of experiments (SDOE) to overcome these challenges by demonstrating its usefulness for a recent solvent-based CO2 capture plant test campaign. Unlike traditional design of experiments methods, SDOE regularly uses information from ongoing experiments to determine the optimum locations in the design space for subsequent runs within the same experiment. However, there are challenges that need to be addressed, including reducing the high computational burden to efficiently update the model, and the need to incorporate the methodology into a computational tool. We address these challenges by applying SDOE in combination with a software tool, the Framework for Optimization, Quantification of Uncertainty and Surrogates (FOQUS) (Miller et al., 2014a, 2016, 2017). The results of applying SDOE on a pilot plant test campaign for CO2 capture suggests that relative to traditional design of experiments methods, SDOE can more effectively reduce the uncertainty of the model, thus decreasing technical risk. Future work includes integrating SDOE into FOQUS and using SDOE to support additional large-scale pilot plant test campaigns.

20 FOSSIL-FUELED POWER PLANTS↗

Photometric redshifts for the S-PLUS Survey: Is machine learning up to the task?

The Southern Photometric Local Universe Survey (S-PLUS) is a novel project that aims to map the Southern Hemisphere using a twelve filter system, comprising five broad-band SDSS-like filters and seven narrow-band filters optimized for important stellar features in the local universe. In this paper we use the photometry and morphological information from the first S-PLUS data release (S-PLUS DR1) cross-matched to unWISE data and spectroscopic redshifts from Sloan Digital Sky Survey DR15. We explore three different machine learning methods (Gaussian Processes with GPz and two Deep Learning models made with TensorFlow) and compare them with the currently used template-fitting method in the S-PLUS DR1 to address whether machine learning methods can take advantage of the twelve filter system for photometric redshift prediction. Using tests for accuracy for both single-point estimates such as the calculation of the scatter, bias, and outlier fraction, and probability distribution functions (PDFs) such as the Probability Integral Transform (PIT), the Continuous Ranked Probability Score (CRPS) and the Odds distribution, we conclude that a deep-learning method using a combination of a Bayesian Neural Network and a Mixture Density Network offers the most accurate photometric redshifts for the current test sample. In conclusion, it achieves single-point photometric redshifts with scatter (σ NMAD ) of 0.023, normalized bias of -0.001, and outlier fraction of 0.64% for galaxies with r_auto magnitudes between 16 and 21.

79 ASTRONOMY AND ASTROPHYSICS↗

Deconvolving distribution of relaxation times, resistances and inductance from electrochemical impedance spectroscopy via statistical model selection: Exploiting structural-sparsity regularization and data-driven parameter tuning

The distribution of relaxation times (DRT) has drawn increasing attention for interpreting electrochemical impedance spectroscopy (EIS). Deconvolution of DRT from EIS is a challenging ill-posed problem that requires regularization methods. In this work, we formulate DRT reconstruction task as a statistical model selection problem with structural-sparsity penalties. We utilize the Elastic net regularization that simultaneously benefits from Ridge and Lasso regularizations with optimal tuning parameter automatically determined by the information criteria. We benchmark our approach on four synthetic experiments (a ZARC element, ZARC mixtures, a RC circuit and a Fractal element) and two real EIS datasets of a Lithium ion battery and an organic-inorganic halide class of perovskites in oxygen environment at different gas pressures. We demonstrate the superiority of proposed model selection procedure, that is capable of eliminating pseudo peaks and representing asymmetries in DRT as well as precisely estimating resistances. Here, we highlight our approach is robust to reducing and subsampling EIS frequency range, making it a promising tool for timing-resolved, localized and large scale EIS data analysis. For the Lithium ion battery data analysis, we extend the classical DRT model to incorporate the inductive effect and illustrate DRT as a guidance for equivalent circuit modeling to refine impedance reconstruction at low risks of overfitting. Furthermore, the structural-sparsity regularization could be extended for multidimensional and Bayesian EIS data analysis.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal Pulse Processing, Pile-Up Decomposition, and Applications of Silicon Drift Detectors at LCLS

Silicon drift detectors (SDDs) revolutionized spectroscopy in fields as diverse as geology and dentistry. For a subset of experiments at ultrafast, X-ray free-electron lasers (FELs), SDDs can make substantial contributions. Often the unknown spectrum is interesting, carrying science data, or the background measurement is useful to identify unexpected signals. Many measurements involve only several discrete photon energies known a priori, allowing single-event decomposition of pile-up and spectroscopic photon counting. We designed a pulse function and demonstrated that the signal amplitude (i.e., proportional to the detected energy and obtained from fitting with the pulse function), rise time, and pulse height are interrelated, and at short peaking times, the pulse height and pulse area are not optimal estimators for detected energy; instead, the signal amplitude and rise time are obtained for each pulse by fitting, thus removing the need for pulse shaping. By avoiding pulse shaping, rise times of tens of nanoseconds resulted in reduced pulse pile-up and allowed decomposition of remaining pulse pile-up at photon separation times down to hundreds of nanoseconds while yielding time-of-arrival information with the precision of 10 ns. Waveform fitting yields simultaneously high energy resolution and high counting rates (two orders of magnitude higher than current digital pulse processors). At pulsed sources or high photon rates, photon pile-up still occurs. We showed that pile-up spectrum fitting is relatively simple and preferable to pile-up spectrum deconvolution. We then developed a photon pile-up statistical model for constant intensity sources, extended it to variable intensity sources (typical for FELs), and used it to fit a complex pileup spectrum. We subsequently developed a Bayesian pile-up decomposition method that allows decomposing pile-up of single events with up to six photons from six monochromatic lines with 99% accuracy. The usefulness of SDDs will continue into the X-ray FEL era of science. Their successors, the ePixS hybrid pixel detectors, already offer hundreds of pixels, each with a similar performance to an SDD, in a compact, robust and affordable package.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimizing Neutrino Flavor Conversion Measurements through Machine Learning

The phenomenon of neutrino flavor conversion whereby the flavor of a neutrino particle can change between its time of production and later detection was the first definitive evidence of physics beyond the Standard Model. Some of the oscillation parameters used to describe this conversion are not yet well measured, leaving important questions still open regarding flavor conversion both in vacuum and as neutrinos travel through matter. NOvA is a long-baseline neutrino oscillation experiment that uses Fermilab's predominantly $\nu_\mu$ NuMI beam. A 14 kton oil-based liquid scintillator far detector 810 km away is used to measure neutrino oscillation through the $\nu_\mu$ disappearance and $\nu_e$ appearance channels. Super-K is a 50 kton water Cherenkov detector, which measures the disappearance of $\nu_e$ produced during solar fusion. The high density environment of the sun decreases the $\nu_e$ survival probability at higher energies observable in Super-K compared to the vacuum-dominated oscillations at lower energies. However, the transition region is overshadowed by radioactive background in the detector. In both of these experiments, the separation of neutrino detection events from background and classification of neutrino flavor are crucial tasks that benefit from the introduction of machine learning. Chapter 1 gives an overview of neutrinos and the context under which flavor conversion is measured in this dissertation. Chapters 2-7 present the results of a Bayesian sampling approach for the latest NOvA 3-flavor oscillation analysis with $26.6 \times 10^{20}$ protons on target in neutrino mode and $12.5 \times 10^{20}$ in antineutrino mode collected over 10 years. Chapters 8-13 present the results of extending the Super-K solar analysis to lower energies during its fourth phase with 2970 days of livetime.

Yankelevich, Alejandro Jaime [UC, Irvine]↗

Optimizing Neutrino Flavor Conversion Measurements through Machine Learning

The phenomenon of neutrino flavor conversion whereby the flavor of a neutrino particle can change between its time of production and later detection was the first definitive evidence of physics beyond the Standard Model. Some of the oscillation parameters used to describe this conversion are not yet well measured, leaving important questions still open regarding flavor conversion both in vacuum and as neutrinos travel through matter. NOvA is a long-baseline neutrino oscillation experiment that uses Fermilab's predominantly $\nu_\mu$ NuMI beam. A 14 kton oil-based liquid scintillator far detector 810 km away is used to measure neutrino oscillation through the $\nu_\mu$ disappearance and $\nu_e$ appearance channels. Super-K is a 50 kton water Cherenkov detector, which measures the disappearance of $\nu_e$ produced during solar fusion. The high density environment of the sun decreases the $\nu_e$ survival probability at higher energies observable in Super-K compared to the vacuum-dominated oscillations at lower energies. However, the transition region is overshadowed by radioactive background in the detector. In both of these experiments, the separation of neutrino detection events from background and classification of neutrino flavor are crucial tasks that benefit from the introduction of machine learning. Chapter 1 gives an overview of neutrinos and the context under which flavor conversion is measured in this dissertation. Chapters 2-7 present the results of a Bayesian sampling approach for the latest NOvA 3-flavor oscillation analysis with $26.6 \times 10^{20}$ protons on target in neutrino mode and $12.5 \times 10^{20}$ in antineutrino mode collected over 10 years. Chapters 8-13 present the results of extending the Super-K solar analysis to lower energies during its fourth phase with 2970 days of livetime.

Yankelevich, Alejandro Jaime [UC, Irvine]↗

Optimizing Neutrino Flavor Conversion Measurements through Machine Learning

The phenomenon of neutrino flavor conversion whereby the flavor of a neutrino particle can change between its time of production and later detection was the first definitive evidence of physics beyond the Standard Model. Some of the oscillation parameters used to describe this conversion are not yet well measured, leaving important questions still open regarding flavor conversion both in vacuum and as neutrinos travel through matter. NOvA is a long-baseline neutrino oscillation experiment that uses Fermilab's predominantly $\nu_\mu$ NuMI beam. A 14 kton oil-based liquid scintillator far detector 810 km away is used to measure neutrino oscillation through the $\nu_\mu$ disappearance and $\nu_e$ appearance channels. Super-K is a 50 kton water Cherenkov detector, which measures the disappearance of $\nu_e$ produced during solar fusion. The high density environment of the sun decreases the $\nu_e$ survival probability at higher energies observable in Super-K compared to the vacuum-dominated oscillations at lower energies. However, the transition region is overshadowed by radioactive background in the detector. In both of these experiments, the separation of neutrino detection events from background and classification of neutrino flavor are crucial tasks that benefit from the introduction of machine learning. Chapter 1 gives an overview of neutrinos and the context under which flavor conversion is measured in this dissertation. Chapters 2-7 present the results of a Bayesian sampling approach for the latest NOvA 3-flavor oscillation analysis with $26.6 \times 10^{20}$ protons on target in neutrino mode and $12.5 \times 10^{20}$ in antineutrino mode collected over 10 years. Chapters 8-13 present the results of extending the Super-K solar analysis to lower energies during its fourth phase with 2970 days of livetime.

Yankelevich, Alejandro Jaime [UC, Irvine] (ORCID:0↗

astroABC : An Approximate Bayesian Computation Sequential Monte Carlo sampler for cosmological parameter estimation

Given the complexity of modern cosmological parameter inference where we arefaced with non-Gaussian data and noise, correlated systematics and multi-probecorrelated data sets, the Approximate Bayesian Computation (ABC) method is apromising alternative to traditional Markov Chain Monte Carlo approaches in thecase where the Likelihood is intractable or unknown. The ABC method is called"Likelihood free" as it avoids explicit evaluation of the Likelihood by using aforward model simulation of the data which can include systematics. Weintroduce astroABC, an open source ABC Sequential Monte Carlo (SMC) sampler forparameter estimation. A key challenge in astrophysics is the efficient use oflarge multi-probe datasets to constrain high dimensional, possibly correlatedparameter spaces. With this in mind astroABC allows for massive parallelizationusing MPI, a framework that handles spawning of jobs across multiple nodes. Akey new feature of astroABC is the ability to create MPI groups with differentcommunicators, one for the sampler and several others for the forward modelsimulation, which speeds up sampling time considerably. For smaller jobs thePython multiprocessing option is also available. Other key features include: aSequential Monte Carlo sampler, a method for iteratively adapting tolerancelevels, local covariance estimate using scikit-learn's KDTree, modules forspecifying optimal covariance matrix for a component-wise or multivariatenormal perturbation kernel, output and restart files are backed up everyiteration, user defined metric and simulation methods, a module for specifyingheterogeneous parameter priors including non-standard prior PDFs, a module forspecifying a constant, linear, log or exponential tolerance level,well-documented examples and sample scripts. This code is hosted online athttps://github.com/EliseJ/astroABC

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scalable quantum computational science: A perspective from block-encodings and polynomial transformations

Significant developments made in quantum hardware and error correction recently have been driving quantum computing toward practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications in computational sciences. In this perspective article, we propose several properties that scalable quantum computational science methods should possess. We further discuss how block-encodings and polynomial transformations can potentially serve as a unified framework with the desired properties. Recent advancements on these topics are presented, including the construction and assembly of block-encodings, and various generalizations of quantum signal processing (QSP) algorithms to perform polynomial transformations. The scalability of QSP methods on parallel and distributed quantum architectures is also highlighted. Promising applications in simulation and observable estimation in chemistry, physics, and optimization problems are presented. We hope this perspective serves as a gentle introduction to state-of-the-art quantum algorithms for the computational science community and inspires future development of scalable quantum computational science methodologies that bridge theory and practice.

Bayesian inference↗

Accuracy of Some Approximate Gaussian Filters for the Navier--Stokes Equation in the Presence of Model Error

Bayesian state estimation of a dynamical system from a stream of noisy measurements is important in many geophysical and engineering applications where high dimensionality of the state space, sparse observations, and model error pose key challenges. In this work, three computationally feasible, approximate Gaussian data assimilation/filtering algorithms are considered in various regimes of turbulent 2D Navier--Stokes dynamics in the presence of model error. The first source of error arises from the necessary use of reduced models for the forward dynamics of the filters, while a particular type of representation error arises from the finite resolution of observations which mix up information about resolved and unresolved dynamics. Two stochastically parameterized filtering algorithms, referred to as cSPEKF and GCF, are compared with 3DVAR---a prototypical time-sequential algorithm known to be accurate for filtering dissipative systems for a suitably inflated “background” covariance. We provide the first evidence that the stochastically parameterized algorithms, which do not rely on detailed knowledge of the underlying dynamics and do not require covariance inflation, can compete with or outperform an optimally tuned 3DVAR algorithm, and they can overcome competing sources of error in a range of dynamical scenarios.

97 MATHEMATICS AND COMPUTING↗

Uncertainty Analysis in 3D Equilibrium Reconstruction

Reconstruction is an inverse process where a parameter space is searched to locate a set of parameters with the highest probability of describing experimental observations. Due to systematic errors and uncertainty in experimental measurements, this optimal set of parameters will contain some associated uncertainty. This uncertainty in the optimal parameters leads to uncertainty in models derived using those parameters. V3FIT is a three-dimensional (3D) equilibrium reconstruction code that propagates uncertainty from the input signals, to the reconstructed parameters, and to the final model. Here in this paper, we describe the methods used to propagate uncertainty in V3FIT. Using the results of whole shot 3D equilibrium reconstruction of the Compact Toroidal Hybrid, this propagated uncertainty is validated against the random variation in the resulting parameters. Two different model parameterizations demonstrate how the uncertainty propagation can indicate the quality of a reconstruction. As a proxy for random sampling, the whole shot reconstruction results in a time interval that will be used to validate the propagated uncertainty from a single time slice.

97 MATHEMATICS AND COMPUTING↗

The impact of non-uniform thermal structure on the interpretation of exoplanet emission spectra

The determination of atmospheric structure and molecular abundances of planetary atmospheres via spectroscopy involves direct comparisons between models and data. While varying in sophistication, most model spectra comparisons fundamentally assume one-dimensional (1D) model physics. However, knowledge from general circulation models and of solar system planets suggests that planetary atmospheres are inherently three-dimensional in their structure and composition. We explore the potential biases resulting from standard “1D” assumptions within a Bayesian atmospheric retrieval framework. Specifically, we show how the assumption of a single 1D thermal profile can bias our interpretation of the thermal emission spectrum of a hot Jupiter atmosphere that is composed of two thermal profiles. We retrieve spectra of unresolved model planets as observed with a combination of the Hubble Space Telescope Wide Field Camera 3 (WFC3)+Spitzer Infrared Array Camera (IRAC) as well as the James Webb Space Telescope (JWST) under varying differences in the two thermal profiles. For WFC3+IRAC, there is a significantly biased estimate of CH{sub 4} abundance using a 1D model when the contrast is 80%. For JWST, two thermal profiles are required to adequately interpret the data and estimate the abundances when contrast is greater than 40%. We also apply this preliminary concept to the recent WFC3+IRAC phase curve data of the hot Jupiter WASP-43b. We see similar behavior as present in our simulated data: while the H{sub 2}O abundance determination is robust, CH{sub 4} is artificially well-constrained to incorrect values under the 1D assumption. Our work demonstrates the need to evaluate model assumptions in order to extract meaningful constraints from atmospheric spectra and motivates exploration of optimal observational setups.

79 ASTRONOMY AND ASTROPHYSICS↗