Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alaleh Ahmadianshalchi

dblp:344/1106 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2024
0000-0002-1904-6215ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Optimization for machine learning · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
multi-objective bayesian optimization
1.522024
Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract) · AAAI 2024
Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization · AAAI 2024
Machine learning › Optimization for machine learning › black-box optimization
batch acquisition
0.812024
Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization · AAAI 2024
Machine learning › Optimization for machine learning
constrained optimization
0.812024
Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract) · AAAI 2024
Machine learning › Optimization for machine learning › model-based optimization
bayesian optimization
0.522024
Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract) · AAAI 2024
Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization · AAAI 2024
Machine learning › Optimization for machine learning › model-based optimization › bayesian optimization
surrogate model
0.212024
Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract) · AAAI 2024

Methods — techniques the papers use, named apart from their topics

surrogate model · 0.8multi-armed bandit · 0.8determinantal point process · 0.8bayesian optimization · 0.8acquisition function selection · 0.8
YearPublicationVenuePosition
2024 Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization
abstract
We consider the problem of multi-objective optimization (MOO) of expensive black-box functions with the goal of discovering high-quality and diverse Pareto fronts where we are allowed to evaluate a batch of inputs. This problem arises in many real-world applications including penicillin production where diversity of solutions is critical. We solve this problem in the framework of Bayesian optimization (BO) and propose a novel approach referred to as Pareto front-Diverse Batch Multi-Objective BO (PDBO). PDBO tackles two important challenges: 1) How to automatically select the best acquisition function in each BO iteration, and 2) How to select a diverse batch of inputs by considering multiple objectives. We propose principled solutions to address these two challenges. First, PDBO employs a multi-armed bandit approach to select one acquisition function from a given library. We solve a cheap MOO problem by assigning the selected acquisition function for each expensive objective function to obtain a candidate set of inputs for evaluation. Second, it utilizes Determinantal Point Processes (DPPs) to choose a Pareto-front-diverse batch of inputs for evaluation from the candidate set obtained from the first step. The key parameters for the methods behind these two steps are updated after each round of function evaluations. Experiments on multiple MOO benchmarks demonstrate that PDBO outperforms prior methods in terms of both the quality and diversity of Pareto solutions.
Alaleh Ahmadianshalchi, Syrine Belakaria, Janardhan Rao Doppa
AAAI1
2024 Preference-Aware Constrained Multi-Objective Bayesian Optimization (Student Abstract)
abstract
We consider the problem of constrained multi-objective optimization over black-box objectives, with user-defined preferences, with a largely infeasible input space. Our goal is to approximate the optimal Pareto set from the small fraction of feasible inputs. The main challenges include huge design space, multiple objectives, numerous constraints, and rare feasible inputs identified only through expensive experiments. We present PAC-MOO, a novel preference-aware multi-objective Bayesian optimization algorithm to solve this problem. It leverages surrogate models for objectives and constraints to intelligently select the sequence of inputs for evaluation to achieve the target goal.
Alaleh Ahmadianshalchi, Syrine Belakaria, Janardhan Rao Doppa
AAAI1