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,657 papers · 148 categories

Trend · papers per month

2579 · Oct 201919922001200920172026
48 results for maximisation

This paper explores optimising acquisition functions in Bayesian optimisation.

problem Optimising acquisition functions in Bayesian optimisation is challenging due to their non-convex nature.
method The authors derive compositional forms for acquisition functions and use them to recast maximisation as a compositional optimisation problem.
result The compositional approach to maximising acquisition functions shows empirical advantages across various tasks.

Two deep learning algorithms solve utility maximisation problems in finance.

problem Solving utility maximisation problems in finance with deep learning.
method Two algorithms: one for Markovian problems via HJB equation and 2BSDE, the other for non-Markovian problems via adjoint BSDE.
result Highly accurate results with low computational cost, solving problems with power, log, and non-HARA utilities in various models.

We study the existence and properties of metrics maximising the first Laplace eigenvalue among conformal metrics of unit volume on Riemannian surfaces. We describe a general approach to this problem and its higher eigenvalue versions via the direct method of calculus of variations. The principal results include the gen…

2011-03-12abs ↗pdf ↗

The study proves properties of optimizers for sets maximizing perimeter under fixed volume constraints.

problem Existence and properties of bounded convex sets in Riemannian manifolds maximizing perimeter under fixed volume constraints.
method Analyzes the properties of optimizers for sets maximizing perimeter under fixed volume constraints in Euclidean, spherical, and hyperbolic spaces.
result Proves that there are no C2C^{2}-maximisers of perimeter with prescribed volume and that the smallest principal curvature is constant in regions where the set is of class C2C^{2}.

The paper addresses optimal control in modern tontines with bequest preferences, showing a linear investment strategy.

problem Optimal controls and decreasing allocation in modern tontines with bequest preferences.
method Dual approach to solve optimal control problems with power utilities, modeling bequest preferences.
result Investment strategy almost linearly adjusts from 0% to 100% over time.

Study optimal reinsurance pricing under model uncertainty for multiple insurers.

problem Optimal reinsurance pricing in the presence of multiple sources of model uncertainty.
method Solves a continuous-time Stackelberg game for general reinsurance contracts, considering entropy penalties and ambiguity in insurers' models.
result Reinsurer prices under a distortion of the barycentre of insurers' models, maximizing expected wealth with an entropy penalty.

The notion of utility maximising entropy (u-entropy) of a probability density, which was introduced and studied by Slomczynski and Zastawniak (Ann. Prob 32 (2004) 2261-2285, arXiv:math.PR/0410115 v1), is extended in two directions. First, the relative u-entropy of two probability measures in arbitrary probability space…

2007-09-09abs ↗pdf ↗

Study optimizes trading strategies in markets with transaction costs and uncertain models.

problem Optimizing trading strategies in markets with transaction costs and model uncertainty.
method Maximizing worst-case expected utility over a class of models on a filtered probability space.
result Existence of optimal trading strategies for general càdlàg price processes and incomplete filtrations.

This article is devoted to the maximisation of HARA utilities of L{é}vy switching process on finite time interval via dual method. We give the description of all f-divergence minimal martingale measures in initially enlarged filtration, the expression of their Radon-Nikodym densities involving Hellinger and Kulback-Lei…

2018-07-24abs ↗pdf ↗

We introduce a new online learning framework where, at each trial, the learner is required to select a subset of actions from a given known action set. Each action is associated with an energy value, a reward and a cost. The sum of the energies of the actions selected cannot exceed a given energy budget. The goal is to…

2018-10-28abs ↗pdf ↗

This paper argues that the fundamental principle of contemporary financial economics is balanced reciprocity, not the principle of utility maximisation that is important in economics more generally. The argument is developed by analysing the mathematical Fundamental Theory of Asset Pricing with reference to the emergen…

2013-10-10abs ↗pdf ↗

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

problem Value-based reinforcement learning struggles with stochastic state transitions.
method Demonstrated using a multiobjective Markov Decision Process (MOMDP).
result Approaches may converge to Pareto-dominated solutions instead of optimal ones.

We introduce a methodology for efficiently computing a lower bound to empowerment, allowing it to be used as an unsupervised cost function for policy learning in real-time control. Empowerment, being the channel capacity between actions and states, maximises the influence of an agent on its near future. It has been sho…

2017-10-13abs ↗pdf ↗

We present a general method for fitting finite mixture models (FMM). Learning in a mixture model consists of finding the most likely cluster assignment for each data-point, as well as finding the parameters of the clusters themselves. In many mixture models, this is difficult with current learning methods, where the mo…

2019-12-18abs ↗pdf ↗

A new algorithm detects changes in data with constant cost per iteration.

problem Detecting changes in data with low computational cost.
method Adapting pruning and maximisation techniques from Gaussian data to exponential family models.
result The algorithm can detect changes in a wide range of models with a constant per-iteration cost.

Bayesian Inference and Information Bottleneck are the two most popular objectives for neural networks, but they can be optimised only via a variational lower bound: the Variational Information Bottleneck (VIB). In this manuscript we show that the two objectives are actually equivalent to the InfoMax: maximise the infor…

2020-03-07abs ↗pdf ↗

Develops deep learning methods for solving S-shaped utility maximisation problems.

problem Optimizing portfolios with S-shaped utility and random benchmarks.
method Uses deep learning and duality methods to solve the Hamilton-Jacobi-Bellman equation and adjoint equation.
result Demonstrates the accuracy of deep learning methods for non-concave utility maximisation problems.

CSAC enables cooperative reinforcement learning for multi-stage tasks.

problem Coordinating consecutive reinforcement learning agents for long-term multi-stage tasks.
method CSAC modifies each agent's policy to maximize both current and next agent's critic.
result CSAC outperforms uncooperative policies and single-agent training in multi-room maze domain.

The paper tackles robust control for insurance contracts under uncertain transition rates.

problem Maximizing utility in insurance contracts with uncertain transition rates.
method Novel robust utility maximization problem under bounded cumulative transition rate uncertainty, using worst-case scenario analysis.
result Existence and uniqueness of worst-case and best-case reserves for insurance contracts.

Bayesian active learning method improved for censored regression data.

problem Challenges in estimating BALD for censored regression data.
method Derived entropy and mutual information for censored distributions, developed C\mathcal{C}-BALD objective, proposed novel modelling approach.
result Demonstrated C\mathcal{C}-BALD outperforms other methods in censored regression.

Study optimizes option pricing with robust strategies, ensuring consistency with vanilla option prices.

problem Optimizing exotic option pricing with robust strategies.
method Introduces semistatic strategies and robust convex integral functionals on bounded continuous functions.
result Consistent indifference prices with observed vanilla option prices.

Currently, pension providers are running into trouble mainly due to the ultra-low interest rates and the guarantees associated to some pension benefits. With the aim of reducing the pension volatility and providing adequate pension levels with no guarantees, we carry out mathematical analysis of a new pension design in…

2019-12-26abs ↗pdf ↗

Clarifies EM algorithm and variational Bayesian inference concepts.

problem Gaps in AI literature understanding of EM and variational concepts.
method Tutorial presentation of EM algorithm, variational Bayesian inference, and autoencoded variational Bayes.
result Establishes clear links between EM and variational methods.

Paper derives second variation formula for eigenvalue functionals on surfaces.

problem Determine if a critical metric is a local maximizer for eigenvalue functionals.
method Derive second variation formula for critical metrics and apply to specific cases.
result Flat metric on non-rhombic torus cannot be a conformal maximizer for first eigenvalue.

Improved Gaussian process regression with tighter log marginal likelihood bounds.

problem Improving predictive performance in Gaussian process regression models.
method Lower bound on log marginal likelihood using conjugate gradients.
result Improved predictive performance compared to other conjugate gradient based approaches.