arXiv research

A new acquisition function RMES improves Bayesian optimization performance.

Entropy Search (ES) and Predictive Entropy Search (PES) are popular and empirically successful Bayesian Optimization techniques. Both rely on a compelling information-theoretic motivation, and maximize the information gained about the $\arg\max$ of the unknown function; yet, both are plagued by the expensive computatio…

VES-Gamma adapts EI using information-theoretic principles.

JES optimizes expensive functions by considering joint entropy over input and output spaces.

Unified framework connects EI and information-theoretic acquisition functions.

MESMOC optimizes constrained multi-objective problems efficiently.

Bayesian optimization (BO) is a model-based approach to sequentially optimize expensive black-box functions, such as the validation error of a deep neural network with respect to its hyperparameters. In many real-world scenarios, the optimization is further subject to a priori unknown constraints. For example, training…

Improved MESMOC+ optimizes constrained multi-objective problems efficiently.

MUMBO optimizes multiple tasks efficiently, even with low-cost related functions.

In a standard setting of Bayesian optimization (BO), the objective function evaluation is assumed to be highly expensive. Multi-fidelity Bayesian optimization (MFBO) accelerates BO by incorporating lower fidelity observations available with a lower sampling cost. In this paper, we focus on the information-based approac…

BMBO-DARN optimizes expensive functions with varying fidelities.

GIBBON unifies Bayesian optimization for various problem types.

A novel Python framework for Bayesian optimization known as GPflowOpt is introduced. The package is based on the popular GPflow library for Gaussian processes, leveraging the benefits of TensorFlow including automatic differentiation, parallelization and GPU computations for Bayesian optimization. Design goals focus on…

We characterize the Zoll Riemannian metrics on a given simply connected spin closed manifold as those Riemannian metrics for which two suitable min-max values in a finite dimensional loop space coincide. We also show that on odd dimensional Riemannian spheres, when certain pairs of min-max values in the loop space coin…

We use the theory of rectifiable metric spaces to define a Dirichlet energy of Lipschitz functions defined on the support of integral currents. This energy is obtained by integration of the square of the norm of the tangential derivative, or equivalently of the approximate local dilatation, of the Lipschitz functions. …

We prove that in a closed manifold of dimension between 3 and 7 with a bumpy metric, the min-max minimal hypersurfaces associated with the volume spectrum introduced by Gromov, Guth, Marques-Neves, are two-sided and have multiplicity one. This confirms a conjecture by Marques-Neves. We prove that in a bumpy metric each…

Grosjean proved that the $(1/p)$-th power of the first eigenvalue of the $p$-Laplacian on a closed Riemannian manifold converges to the twice of the inverse of the diameter of the space, as $p \to \infty$. Before this, a corresponding result for the Dirichlet first eigenvalues was also obtained by Juutinen, Lindqvist a…

Bayesian optimisation (BO) is widely used to optimise stochastic black box functions. While most BO approaches focus on optimising conditional expectations, many applications require risk-averse strategies and alternative criteria accounting for the distribution tails need to be considered. In this paper, we propose ne…

BDC uses Distance Correlation for efficient Bayesian optimization of expensive functions.

This paper presents a new approach, called perturb-max, for high-dimensional statistical inference that is based on applying random perturbations followed by optimization. This framework injects randomness to maximum a-posteriori (MAP) predictors by randomly perturbing the potential function for the input. A classic re…

We present the min-max construction of critical points of the area using penalization arguments. Precisely, for any immersion of a closed surface $Σ$ into a given closed manifold, we add to the area Lagrangian a term equal to the $L^q$ norm of the second fundamental form of the immersion times a "viscosity" parameter. …

Unified framework for active learning problems using information theory.

Learning robot controllers by minimizing a black-box objective cost using Bayesian optimization (BO) can be time-consuming and challenging. It is very often the case that some roll-outs result in failure behaviors, causing premature experiment detention. In such cases, the designer is forced to decide on heuristic cost…

We consider the problem of two-player zero-sum games. This problem is formulated as a min-max Markov game in the literature. The solution of this game, which is the min-max payoff, starting from a given state is called the min-max value of the state. In this work, we compute the solution of the two-player zero-sum game…

We perform a replacement procedure in order to produce a free boundary minimal surface whose area achieves the min-max value over all disk sweepouts of a manifold whose boundary lie in a submanifold. Our result is based on a proof of the convexity of the energy for free boundary harmonic maps and a generalization of Co…

The paper explores heat flow and constants on graphs, proving properties and proposing new concepts.

In this paper, we build up a min-max theory for minimal surfaces using sweepouts of surfaces of genus $g\geq 2$. We develop a direct variational methods similar to the proof of the famous Plateau problem by J. Douglas and T. Rado. As a result, we show that the min-max value for the area functional can be achieved by a …

Adapts viscosity method for free boundary minimal surfaces.

Paper finds algorithms with both low regret and high exploitation.

Proves existence of special 2-spheres in curved 3-spaces.

Enhances RL by controlling policy stochasticity through trajectory entropy constraints.

SurVAE Flows combine VAEs and flows using surjective transformations.

The paper calculates bounds for risk metrics and entropies under partial information constraints.

The paper analyzes worst-case distortion risk metrics and weighted entropy under partial information.

Entropy measures geodesic flow complexity.

HCLM framework uses entropy regularization for open learning systems.

ZOSPI improves RL policies with global value function exploitation.

Coupled entropy corrects flaws in Tsallis entropy for complex systems.

The paper examines robustness of topological entropy in geodesic flows.

Entropy rigidity for Finsler flows but collapse for Reeb flows.

We give a notion of entropy for general gemetric structures, which generalizes well-known notions of topological entropy of vector fields and geometric entropy of foliations, and which can also be applied to singular objects, e.g. singular foliations, singular distributions, and Poisson structures. We show some basic p…

Generic low-entropy hypersurfaces in 4-6D flow with only generic singularities.

Study shows rigidity for entropy minimizers in non-monotone cases.

Entropy study of geodesic flow on convex projective surfaces.

DAC enhances exploration in reinforcement learning with entropy regularization.

Study bounds self-shrinker entropy using Li-Yau volume and Colding-Minicozzi entropy.

This paper controls a boundary term in Huisken's formula for entropy.

In 1870s, L. Boltzmann proved the famous $H$-theorem for the Boltzmann equation in the kinetic theory of gas and gave the statistical interpretation of the thermodynamic entropy. In 2002, G. Perelman introduced the notion of $W$-entropy and proved the $W$-entropy formula for the Ricci flow. This plays a crucial role in…