Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,738 papers · 148 categories

Trend · papers per month

0111 · Mar 201419922001200920172026
12 results for MOBO

MOBO-OSD optimizes multi-objective functions using orthogonal search directions.

problem Challenging multi-objective optimization problem.
method Solves multiple constrained optimization problems along orthogonal search directions.
result Consistently outperforms state-of-the-art algorithms.

Proposes a new MOBO framework for better estimation of uncertain parameters in expensive black-box functions.

problem Estimating the unknown utopia in multi-objective optimization problems with expensive black-box functions.
method Nested weighted Tchebycheff Multi-objective Bayesian Optimization (WTB-MOBO) with ensemble model selection.
result Improves MOBO performance by selecting the best model from an ensemble of predictive models.

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.

A new approach for efficient batch multiobjective optimization using Thompson sampling.

problem Inefficient batch multiobjective optimization due to expensive oracles and hard inner optimization.
method Proposes a Thompson sampling approach (qextttPOTSq exttt{POTS}) that chooses Pareto optimal candidates sequentially.
result Empirically superior performance compared to classical evolutionary approaches and MOBO.

Novel MOBO method for risk measures under input uncertainty.

problem Efficiently identifying Pareto front for black-box functions with input uncertainty.
method Assumes Gaussian process model and constructs bounding boxes for risk measures.
result The method can return an arbitrary-accurate solution with high probability.

Parallel Bayesian optimization tackles noisy multi-objective problems.

problem Optimizing multiple objectives with noisy data.
method NEHVI and qqNEHVI acquisition functions, integrating Bayesian treatment over uncertainty.
result Parallel qqNEHVI is one-step Bayes-optimal and robust to noise.

Many objective Bayesian optimization tackles redundant objectives in expensive black-box functions.

problem Efficiently optimizing multiple expensive and noisy black-box functions with redundant objectives.
method Proposes a metric to identify redundant objectives and a Bayesian optimization algorithm to stop evaluating them.
result Reduces computational cost by stopping evaluation of redundant objectives, improving efficiency.

A new method for multi-objective Bayesian optimization using entropy search and variational lower bound maximization.

problem Efficiently optimizing multiple objectives in continuous domains.
method Approximates the Pareto-frontier using a mixture distribution and optimizes the balance through variational lower bound maximization.
result Demonstrated effectiveness especially with many objective functions.

Traditional nearest points methods use all the samples in an image set to construct a single convex or affine hull model for classification. However, strong artificial features and noisy data may be generated from combinations of training samples when significant intra-class variations and/or noise occur in the image s…

2014-03-03abs ↗pdf ↗