arXiv research

Paper proposes a robust method for inferring parameters in multiobjective optimization.

Scalarizing functions have been widely used to convert a multiobjective optimization problem into a single objective optimization problem. However, their use in solving (computationally) expensive multi- and many-objective optimization problems in Bayesian multiobjective optimization is scarce. Scalarizing functions ca…

New issue found in value-based reinforcement learning for stochastic environments.

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

Refined theorem on linear perturbations with applications in singularity theory and optimization.

Algorithm approximates regularization path for deep neural networks efficiently.

Multi-task learning is a powerful method for solving multiple correlated tasks simultaneously. However, it is often impossible to find one single solution to optimize all the tasks, since different tasks might conflict with each other. Recently, a novel method is proposed to find one single Pareto optimal solution with…

A multiobjective optimization problem is simplicial if the Pareto set and front are homeomorphic to a simplex and, under the homeomorphisms, each face of the simplex corresponds to the Pareto set and front of a subproblem. In this paper, we show that strongly convex problems are simplicial under a mild assumption on th…

Optimizes deep learning models for ocean dynamics using Fourier neural operators.

Hybrid Bayesian MOT uses neural networks to improve model aspects, achieving state-of-the-art performance.

A novel neural network approach for optimization problems.

We consider a multiobjective multiarmed bandit problem with lexicographically ordered objectives. In this problem, the goal of the learner is to select arms that are lexicographic optimal as much as possible without knowing the arm reward distributions beforehand. We capture this goal by defining a multidimensional for…

Selecting the best policy to keep the balance between what a company holds in cash and what is placed in alternative investments is by no means straightforward. We here introduce PyCaMa, a Python module for multiobjective cash management based on linear programming that allows to derive optimal policies for cash manage…

Strong geodesic convex function and strong monotone vector field of order $m$ on Riemannian manifolds have been established. A characterization of strong geodesic convex function of order $m$ for the continuously differentiable functions has been discussed. The relation between the solution of a new variational inequal…

New method optimizes ML models under poisoned data, improving robustness.

Given a set of human's decisions that are observed, inverse optimization has been developed and utilized to infer the underlying decision making problem. The majority of existing studies assumes that the decision making problem is with a single objective function, and attributes data divergence to noises, errors or bou…

Bayesian method reduces misclassification errors in ranking Pareto-optimal solutions.

A new framework enables real-time task trade-off control.

Regularisation improves ML classifier stability against poisoning attacks.

Three approaches learn personalized treatment policies for UTI patients.

Portfolio managers are typically constrained by turnover limits, minimum and maximum stock positions, cardinality, a target market capitalization and sometimes the need to hew to a style (such as growth or value). In addition, portfolio managers often use multifactor stock models to choose stocks based upon their respe…

The authors define a class of functions on Riemannian manifolds, which is called geodesic semilocal E-preinvex functions, as a generalization of geodesic semilocal E-convex and geodesic semi E-preinvex functions and some of its properties are established. Furthermore, a nonlinear fractional multiobjective programming i…

New method optimizes PCA for better prediction and variance.

Proposes a generalized XGBoost method for nonconvex loss functions.

We introduce COCO, an open source platform for Comparing Continuous Optimizers in a black-box setting. COCO aims at automatizing the tedious and repetitive task of benchmarking numerical optimization algorithms to the greatest possible extent. The platform and the underlying methodology allow to benchmark in the same f…

A common practice in most of deep convolutional neural architectures is to employ fully-connected layers followed by Softmax activation to minimize cross-entropy loss for the sake of classification. Recent studies show that substitution or addition of the Softmax objective to the cost functions of support vector machin…

Deep reinforcement learning approaches have shown impressive results in a variety of different domains, however, more complex heterogeneous architectures such as world models require the different neural components to be trained separately instead of end-to-end. While a simple genetic algorithm recently showed end-to-e…

A multiobjective optimization problem is $C^r$ simplicial if the Pareto set and the Pareto front are $C^r$ diffeomorphic to a simplex and, under the $C^r$ diffeomorphisms, each face of the simplex corresponds to the Pareto set and the Pareto front of a subproblem, where $0\leq r\leq \infty$. In the paper titled "Topolo…

Pareto optimal centralized risk sharing with multiple agents

An ongoing aim of research in multiobjective Bayesian optimization is to extend its applicability to a large number of objectives. While coping with a limited budget of evaluations, recovering the set of optimal compromise solutions generally requires numerous observations and is less interpretable since this set tends…

Bayesian method helps decision-makers find preferred solutions in multi-objective optimization.

In this paper we introduce a new classification algorithm called Optimization of Distributions Differences (ODD). The algorithm aims to find a transformation from the feature space to a new space where the instances in the same class are as close as possible to one another while the gravity centers of these classes are…

Biological and cellular systems are often modeled as graphs in which vertices represent objects of interest (genes, proteins, drugs) and edges represent relational ties among these objects (binds-to, interacts-with, regulates). This approach has been highly successful owing to the theory, methodology and software that …

DOCKSTRING simplifies docking simulations for better drug design benchmarks.

The goal of lossy data compression is to reduce the storage cost of a data set $X$ while retaining as much information as possible about something ($Y$) that you care about. For example, what aspects of an image $X$ contain the most information about whether it depicts a cat? Mathematically, this corresponds to finding…