Enhanced evolutionary algorithms solve NP-hard portfolio optimization with cardinality constraints.
problem Portfolio optimization under cardinality constraints with real-world conditions.
method Strengthened multi-objective evolutionary algorithms with new representations, operators, and repair mechanisms.
result The proposed algorithms converge faster and provide better approximations with no performance loss.
Paper proposes EMO-based AE generation for black-box settings.
problem Designing robust adversarial examples for black-box models.
method Evolutionary Multi-objective Optimization (EMO) for generating various types of adversarial examples.
result EMO-based method generates AEs that are robust and applicable to high-resolution images.
Paper introduces an efficient comparison operator for robust multi-objective optimization with uncertain objectives.
problem Optimizing with uncertain objectives in multi-objective problems.
method Empirical approach to compare solutions with arbitrary distributions of uncertain objectives.
result Higher optimization quality achieved at lower overheads compared to existing techniques.
This paper introduces multi-objective hyperparameter optimization in machine learning.
problem Optimizing machine learning pipelines for multiple objectives, not just accuracy.
method Survey of optimization strategies and applications in multi-objective hyperparameter optimization.
result The importance and utility of multi-objective hyperparameter optimization in applied machine learning.
Paper withdrawn; AI game behavior needs diversity.
problem Creating varied human-like playing styles in games.
method Evolutionary multi-objective deep reinforcement learning.
result Generated diverse AI behaviors for games.
Framework optimizes model performance and interpretability for tabular data.
problem Balancing model performance and interpretability in machine learning models.
method Model-agnostic multi-objective optimization framework with evolutionary algorithm.
result Framework generates diverse models that trade off performance and interpretability efficiently.
Adaptive algorithm for multi-objective optimization with binary constraints.
problem Optimization of black-box problems with binary constraints.
method Bayesian optimization using regression and classification models.
result Significantly faster expected hypervolume calculation.
New method finds coresets for faster machine learning.
problem Improving training speed and understanding results.
method Iterative optimization using multi-objective evolutionary algorithms.
result Results deliver lower error and better generalization.
Multi-objective optimization for hyperparameters and features.
problem Optimizing hyperparameters and selecting features for machine learning models.
method Two approaches: model-based optimization and NSGA-II-based wrapper approach using filter ensembles.
result NSGA-II approach is computationally less expensive but may require more evaluations.
Federated learning is an emerging technique used to prevent the leakage of private information. Unlike centralized learning that needs to collect data from users and store them collectively on a cloud server, federated learning makes it possible to learn a global model while the data are distributed on the users' devic…
Abstaining classifiers have been widely used in cost-sensitive applications to avoid ambiguous classification and reduce the cost of misclassification. Previous abstaining classification models rely on cost information, such as a cost matrix or cost ratio. However, it is difficult to obtain or estimate costs in practic…
In the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms (EMOAs). MOBGO utilizes Gaussian Process models learned from previous objective function evaluations to decide the nex…
CAPO optimizes LLM prompts more efficiently and cost-effectively.
problem Costly and inefficient automatic prompt optimization for LLMs.
method Integrates AutoML techniques for evolutionary optimization of instructions and few-shot examples.
result Significantly improves prompt optimization efficiency and accuracy.
Neural Architecture Search aims at automatically finding neural architectures that are competitive with architectures designed by human experts. While recent approaches have achieved state-of-the-art predictive performance for image recognition, they are problematic under resource constraints for two reasons: (1)the ne…
Proof shows imitation of expert's reward and solutions in multi-objective optimization.
problem Multi-objective optimization with reward and solution imitation.
method Wasserstein inverse reinforcement learning.
result Wasserstein inverse reinforcement learning enables imitation of expert's reward and solutions in multi-objective optimization.
Proof of convergence for multi-objective optimization using inverse reinforcement learning.
problem Proving convergence in multi-objective optimization problems.
method Wasserstein inverse reinforcement learning with projective subgradient method and gradient descent.
result Convergence of inverse reinforcement learning for multi-objective optimization.
Pessimistic estimator improves multi-objective policy optimization.
problem Optimizing multi-objective policies from existing data.
method Pessimistic estimator based on inverse propensity scores (IPS).
result Pessimistic estimator outperforms naive IPS estimator in theory and experiments.
Enhances portfolio optimization under uncertainty using robust multi-objective methods.
problem Uncertainties in real-world portfolio optimization scenarios.
method Robust multi-objective optimization with benchmark comparisons.
result More reliable and adaptable portfolio strategies for market uncertainties.
In multi-objective Bayesian optimization and surrogate-based evolutionary algorithms, Expected HyperVolume Improvement (EHVI) is widely used as the acquisition function to guide the search approaching the Pareto front. This paper focuses on the exact calculation of EHVI given a nondominated set, for which the existing …
Study on Pareto optimality in multi-objective bandit problems.
problem Pareto optimality in multi-objective multi-armed bandit problems.
method Formulated adversarial multi-objective multi-armed bandit, defined Pareto regrets, presented algorithms, established upper and lower bounds.
result New algorithms are optimal in adversarial settings and nearly optimal in stochastic settings.
Study KKT conditions for multi-objective optimization on Hadamard manifolds.
problem Optimizing multi-objective interval-valued functions on Hadamard manifolds.
method Developed KKT conditions for Pareto optimal solutions under different ordering and convexity notions.
result Results are more general than on Euclidean spaces.
This paper surveys gradient-based multi-objective deep learning methods.
problem Balancing multiple conflicting objectives in deep learning models.
method Gradient-based techniques adapted from Multi-Objective Optimization.
result Comprehensive survey of gradient-based multi-objective deep learning algorithms.
New method improves neural architecture search by optimizing for both performance and diversity.
problem Traditional multi-objective NAS fails to address practical constraints and niches.
method Formulated as quality diversity optimization, introduces multifidelity optimizers.
result Quality diversity NAS outperforms multi-objective NAS in quality and efficiency.
A new Adamize method improves multi-objective recommender systems.
problem Improving recommendation systems with multiple conflicting objectives.
method Developed a multi-objective model-agnostic Adamize method that corrects and stabilizes gradients.
result Significant improvements in recommendation systems, measured by hypervolume, coverage, and spacing.
Develops a new method to improve performance in multi-objective learning problems.
problem Gradient bias in multi-objective learning leading to degraded performance.
method Stochastic Multi-objective gradient Correction (MoCo) method that guarantees convergence without increasing batch size.
result Demonstrates effectiveness of MoCo method in simulations on multi-task learning.
A new method for multi-objective Bayesian optimization.
problem Finding optimal compromises between competing objectives.
method Joint Entropy Search (JES) acquisition function for multi-objective Bayesian optimization.
result JES outperforms existing methods in terms of hypervolume and its variants.
This paper develops a method to approximate the whole Pareto set for expensive multi-objective optimization.
problem Finding an approximate Pareto front with limited expensive evaluations.
method A novel learning-based method to approximate the whole Pareto set for multi-objective Bayesian optimization (MOBO).
result The method approximates the whole Pareto set, not just a finite set, for MOBO.
This work fills the gap in understanding multi-objective learning generalization.
problem Lack of statistical learning theory insights into multi-objective learning generalization.
method Established generalization bounds and excess bounds for multi-objective learning.
result Showed that all Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.
FanG-HPO optimizes machine learning models for fairness and low energy consumption.
problem Bias in machine learning models and high energy consumption in hyperparameter optimization.
method Combines multi-objective and multiple information source Bayesian optimization.
result FanG-HPO identifies fair and energy-efficient machine learning models.
Unified pipeline detects multi-turn deception using geometric signals.
problem Detecting multi-turn deceptive interactions in LLMs.
method Geometric signaturization via genetic prompt optimization.
result Compact geometric model achieves high recall and F1 scores.
MO-CBO optimizes multiple outcomes in causal systems with minimal data.
problem Optimizing multiple outcomes in causal systems with limited data.
method Decomposes MO-CBO into multi-objective optimization tasks and uses relative hypervolume improvement for sequential intervention balancing.
result MO-CBO outperforms traditional multi-objective Bayesian optimization in causal settings.
Bayesian optimization is an effective method to efficiently optimize unknown objective functions with high evaluation costs. Traditional Bayesian optimization algorithms select one point per iteration for single objective function, whereas in recent years, Bayesian optimization for multi-objective optimization or multi…
A new parallel BO method with exact gradients for multi-objective optimization.
problem Efficiently optimizing multiple objectives in a sample-efficient manner.
method Derive q-Expected Hypervolume Improvement (qEHVI) for parallel, constrained evaluation.
result qEHVI is computationally tractable and outperforms state-of-the-art methods.
MESMOC optimizes constrained multi-objective problems efficiently.
problem Constrained multi-objective optimization with expensive function evaluations.
method Max-value Entropy Search in the output space.
result MESMOC selects high-quality Pareto solutions efficiently.
The paper classifies various higher moments portfolio optimization methods.
problem Optimizing portfolios with higher moments like skewness and kurtosis.
method Review of different optimization paradigms including utility and multi-objective approaches.
result Comparison of advantages and disadvantages of various methods.
MOSS optimizes decision rules for accuracy and stability.
problem Constructing stable sets of decision rules.
method Multi-objective optimization framework incorporating sparsity, accuracy, and stability.
result MOSS outperforms state-of-the-art rule ensembles in predictive performance and stability.
CoNES optimizes blackbox functions using convex optimization and information geometry.
problem Optimizing high-dimensional blackbox functions efficiently.
method Formulated as a convex program that adapts evolutionary strategies gradient estimates.
result Vastly outperforms conventional blackbox optimization methods on benchmarks and MuJoCo tasks.
This article addresses the problem of derivative-free (single- or multi-objective) optimization subject to multiple inequality constraints. Both the objective and constraint functions are assumed to be smooth, non-linear and expensive to evaluate. As a consequence, the number of evaluations that can be used to carry ou…
Many real world applications can be framed as multi-objective optimization problems, where we wish to simultaneously optimize for multiple criteria. Bayesian optimization techniques for the multi-objective setting are pertinent when the evaluation of the functions in question are expensive. Traditional methods for mult…
YAHPO Gym introduces a new benchmark for evaluating hyperparameter optimization methods.
problem Evaluating and comparing hyperparameter optimization methods on well-curated benchmark suites.
method Surrogate-based benchmark collection of 14 scenarios, each with multi-fidelity and multi-objective hyperparameter optimization problems.
result Surrogate-based benchmarks produce more faithful results than tabular benchmarks.
The paper introduces a new metric to quantify uncertainty's impact on multiple objectives.
problem Quantifying the impact of uncertainty on multiple objectives in complex systems.
method Proposes the mean multi-objective cost of uncertainty (multi-objective MOCU) to quantify uncertainty.
result Demonstrates the effectiveness of the multi-objective MOCU in real-world applications.
Novel evolutionary strategy solves stochastic constrained optimization problems.
problem Optimizing objective functions with stochastic constraints in reinforcement learning.
method Design of a novel optimization algorithm with a sufficient decrease mechanism for stochastic constrained problems.
result Demonstrated convergence of the algorithm on control tasks and constrained optimization problems.
MORBO improves multi-objective BO for high-dimensional problems.
problem Optimizing multiple objectives in high-dimensional spaces with expensive evaluations.
method Parallel local BO in multiple regions with coordinated strategy.
result Significant improvement in sample efficiency for high-dimensional problems.
The growing interest in both the automation of machine learning and deep learning has inevitably led to the development of a wide variety of automated methods for neural architecture search. The choice of the network architecture has proven to be critical, and many advances in deep learning spring from its immediate im…
MWGraD solves multi-objective distributional optimization using particle-based gradient descent.
problem Simultaneously minimize multiple objective functionals over probability distributions.
method Iterative particle-based algorithm MWGraD, estimating and aggregating Wasserstein gradients.
result Demonstrates effectiveness on synthetic and real-world datasets.
Proposes MOGFNs for generating diverse Pareto optimal solutions in multi-objective optimization.
problem Generating diverse candidates in multi-objective optimization with conflicting objectives.
method Introduces MOGFNs based on GFlowNets, with two variants: MOGFN-PC and MOGFN-AL.
result Improved candidate diversity compared to existing methods.
In this note, we extend an evolutionary stochastic portfolio optimization framework to include probabilistic constraints. Both the stochastic programming-based modeling environment as well as the evolutionary optimization environment are ideally suited for an integration of various types of probabilistic constraints. W…
Improved MESMOC+ optimizes constrained multi-objective problems efficiently.
problem Optimizing constrained multi-objective problems with expensive evaluations.
method Minimizes entropy of Pareto frontier to guide search, using linear cost and decoupled evaluation.
result Significantly faster than alternatives, with more accurate entropy estimation.