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 Expectation--Conditional Maximisation

SSLfmm package improves semi-supervised learning by incorporating informative missingness in finite mixture models.

problem Improving semi-supervised learning with informative missingness in datasets.
method Estimates Bayes' classifier under a finite mixture model with MCAR and MAR missingness mechanisms.
result The classifier trained on partially labelled data can achieve lower misclassification rates than supervised methods.

Paper develops NPG for risk-averse RL with ECRMs, proving global convergence.

problem Ensuring reliable performance in stochastic RL problems with risk-averse policies.
method Developed natural policy gradient updates for ECRMs-based RL problems, proving global optimality and iteration complexity.
result Global convergence of risk-averse NPG algorithm with ECRMs.

Efficiently designs experiments without integrating posterior distributions.

problem Computational inefficiency in Bayesian experimental design for PDE-based models.
method Likelihood-free approach using ANN to approximate conditional expectation.
result Significant reduction in observation model evaluations.

We establish some subprincipal estimates for Berezin-Toeplitz operators on symplectic compact manifolds. From this, we construct a family of subprincipal symbol maps and we prove that these maps are the only ones satisfying some expected conditions.

2014-10-08abs ↗pdf ↗

A contaminated mixture model detects outliers in multivariate functional data.

problem Detecting abnormal sensor measurements in multivariate functional data.
method A contaminated mixture model that clusters and detects outliers without specifying outlier proportion.
result The model outperforms competitors and correctly detects abnormal behaviors in real data.

In recent years, a large amount of model-agnostic methods to improve the transparency, trustability and interpretability of machine learning models have been developed. We introduce local feature importance as a local version of a recent model-agnostic global feature importance method. Based on local feature importance…

2018-04-18abs ↗pdf ↗

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 ↗

Double Machine Learning estimators are asymptotically inadmissible under structure-agnostic models.

problem Minimax estimators may be inadmissible under structure-agnostic models.
method Exhibit second-order (U-statistic) estimators that asymptotically dominate DML estimators.
result Double Machine Learning estimators are asymptotically inadmissible under structure-agnostic models.

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.

Improved estimators for causal inference using cross-fitting and undersmoothing.

problem Estimating expected conditional covariance in causal inference.
method Double cross-fit doubly robust (DCDR) estimators with undersmoothing for non-smooth nuisance functions.
result DCDR estimators achieve n\sqrt{n}-consistency and asymptotic normality under minimal conditions.

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 ↗

A mixture of common skew-t factor analyzers model is introduced for model-based clustering of high-dimensional data. By assuming common component factor loadings, this model allows clustering to be performed in the presence of a large number of mixture components or when the number of dimensions is too large to be well…

2013-07-21abs ↗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.

Paper improves VaR risk allocation by avoiding zero probability events.

problem Computing VaR contributions for zero probability events.
method Reformulates Euler contributions to a ratio of conditional expectations with strictly positive probability events.
result Proposed estimator outperforms standard Monte Carlo methods in bias and variance.