← Search

Aryan Deshwal

17 accepted papers

2026

Discovery of Feasible 3D Printing Configurations for Metal Alloys via AI-Driven Adaptive Experimental Design

AAAI 2026technical

Configuring the parameters of additive manufacturing processes for metal alloys is a challenging problem due to complex relationships between input parameters (e.g., laser power, scan speed) and quality of printed outputs. The standard trial-and-error approach to find feasible parameter configuratio

Cited by 0SourcePDFScholar
2025

BO4Mob: Bayesian Optimization Benchmarks for High-Dimensional Urban Mobility Problem

NeurIPS 2025poster

We introduce BO4Mob, a new benchmark framework for high-dimensional Bayesian Optimization (BO), driven by the challenge of origin-destination (OD) travel demand estimation in large urban road networks. Estimating OD travel demand from limited traffic sensor data is a difficult inverse optimization p…

Cited by 0SourcecodeScholar
2025

COM-BOM: Bayesian Exemplar Search for Efficiently Exploring the Accuracy-Calibration Pareto Frontier

EMNLP 2025

Selecting an optimal set of exemplars is critical for good performance of in-context learning. However, prior exemplar search methods narrowly optimize for predictive accuracy, critically neglecting model calibration—a key determinant of trustworthiness and safe deployment. In this paper, we formula

Cited by 0SourcePDFScholar
2025

Constraint-Adaptive Policy Switching for Offline Safe Reinforcement Learning

AAAI 2025technical

Offline safe reinforcement learning (OSRL) involves learning a decision-making policy to maximize rewards from a fixed batch of training data to satisfy pre-defined safety constraints. However, adapting to varying safety constraints during deployment without retraining remains an under-explored chal…

2025

Online Optimization for Offline Safe Reinforcement Learning

NeurIPS 2025poster

We study the problem of Offline Safe Reinforcement Learning (OSRL), where the goal is to learn a reward-maximizing policy from fixed data under a cumulative cost constraint. We propose a novel OSRL approach that frames the problem as a minimax objective and solves it by combining offline RL with onl…

Cited by 0SourcecodeScholar
2024

Learning Surrogates for Offline Black-Box Optimization via Gradient Matching

ICML 2024poster

Offline design optimization problem arises in numerous science and engineering applications including material and chemical design, where expensive online experimentation necessitates the use of *in silico* surrogate functions to predict and maximize the target objective over candidate designs. Alth…

Cited by 6SourcePDFScholar
2024

Offline Model-Based Optimization via Policy-Guided Gradient Search

AAAI 2024technical

Offline optimization is an emerging problem in many experimental engineering domains including protein, drug or aircraft design, where online experimentation to collect evaluation data is too expensive or dangerous. To avoid that, one has to optimize an unknown function given only its offline evalua…

2024

Streamflow Prediction with Uncertainty Quantification for Water Management: A Constrained Reasoning and Learning Approach

IJCAI 2024poster

Predicting the spatiotemporal variation in streamflow along with uncertainty quantification enables decision-making for sustainable management of scarce water resources. Process-based hydrological models (aka physics-based models) are based on physical laws, but use simplifying assumptions which can…

2023

Bayesian Optimization over High-Dimensional Combinatorial Spaces via Dictionary-based Embeddings

AISTATS 2023poster

We consider the problem of optimizing expensive black-box functions over high-dimensional combinatorial spaces which arises in many science, engineering, and ML applications. We use Bayesian Optimization (BO) and propose a novel surrogate modeling approach for efficiently handling a large number of…

2023

GAUCHE: A Library for Gaussian Processes in Chemistry

NeurIPS 2023poster

We introduce GAUCHE, an open-source library for GAUssian processes in CHEmistry. Gaussian processes have long been a cornerstone of probabilistic machine learning, affording particular advantages for uncertainty quantification and Bayesian optimisation. Extending Gaussian processes to molecular repr…

2022

Bayesian Optimization over Permutation Spaces

AAAI 2022technical

Optimizing expensive to evaluate black-box functions over an input space consisting of all permutations of d objects is an important problem with many real-world applications. For example, placement of functional blocks in hardware design to optimize performance via simulations. The overall goal is…

2021

Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces

NeurIPS 2021poster

We consider the problem of optimizing combinatorial spaces (e.g., sequences, trees, and graphs) using expensive black-box function evaluations. For example, optimizing molecules for drug design using physical lab experiments. Bayesian optimization (BO) is an efficient framework for solving such prob…

2021

Mercer Features for Efficient Combinatorial Bayesian Optimization

AAAI 2021technical

Bayesian optimization (BO) is an efficient framework for solving black-box optimization problems with expensive function evaluations. This paper addresses the BO problem setting for combinatorial spaces (e.g., sequences and graphs) that occurs naturally in science and engineering applications. A pro…

2019

Max-value Entropy Search for Multi-Objective Bayesian Optimization

NeurIPS 2019poster

We consider the problem of multi-objective (MO) blackbox optimization using expensive function evaluations, where the goal is to approximate the true Pareto-set of solutions by minimizing the number of function evaluations. For example, in hardware design optimization, we need to find the designs th…