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.

169,181 papers · 148 categories

Trend · papers per month

3937851,1781,570 · Jun 202019922001200920182026
48 results for Maximal Expected Model Change

The paper analyzes how sensitive long-term utility of optimal portfolios is to changes in market models.

problem Sensitivity of long-term expected utility of optimal portfolios to market model changes.
method Analyzes utility maximization problem with long-time horizon under incomplete market given by a factor model, focusing on eigenpairs of operators.
result Eigenpairs determine long-term sensitivity of optimal expected utility to market model changes.

Dynamic clustering for time series data with evolving memberships.

problem Clustering multivariate time series data with dynamic membership changes.
method Dynamic Linear Models and Dirichlet evolution for mixture weights, with Gibbs sampling and efficient point estimation methods.
result Efficient dynamic clustering of time series data with evolving memberships.

In this article, we develop a model for the evolution of real estate prices. A wide range of inputs, including stochastic interest rates and changing demands for the asset, are considered. Maximizing their expected utility, home owners make optimal sale decisions given these changing market conditions. Using these opti…

2009-07-10abs ↗pdf ↗

Study examines how slight model changes affect multi-period optimization outcomes.

problem Effect of small probabilistic model changes on multi-period optimization problems.
method Adapted Wasserstein distance for measuring changes, explicit first-order approximations proved.
result Explicit first-order approximations for multi-period stochastic optimization and optimal stopping problems.

New method detects changes in complex models using hierarchical latent-class models.

problem Detecting abrupt transitions in high-dimensional or heterogeneous models.
method Hierarchical latent-class model with CRP and EM algorithm for continual learning.
result The method reliably infers the number of latent classes and performs CPD.

Paper tackles noisy annotations by considering workers' attention levels.

problem Noisy annotations from workers with varying expertise.
method Proposes a probabilistic model that incorporates workers' attention for accurate label quality estimation.
result Improves aggregated labels by quantifying the relationship between workers' attention and label quality.

Gambles are random variables that model possible changes in monetary wealth. Classic decision theory transforms money into utility through a utility function and defines the value of a gamble as the expectation value of utility changes. Utility functions aim to capture individual psychological characteristics, but thei…

2014-05-03abs ↗pdf ↗

Framework for games with uncertain parameters, ensuring no player can improve by changing strategy.

problem Non-cooperative games with globally uncertain parameters and no common prior.
method Mixed strategies and subjective priors, Extended Equilibrium defined by fixed-point argument.
result Existence of Extended Equilibrium under certain conditions.

In this paper we study the valuation problem of an insurance company by maximizing the expected discounted future dividend payments in a model with partial information that allows for a changing economic environment. The surplus process is modeled as a Brownian motion with drift. This drift depends on an underlying Mar…

2016-02-15abs ↗pdf ↗

A determinantal point process (DPP) is a probabilistic model of set diversity compactly parameterized by a positive semi-definite kernel matrix. To fit a DPP to a given task, we would like to learn the entries of its kernel matrix by maximizing the log-likelihood of the available data. However, log-likelihood is non-co…

2014-11-04abs ↗pdf ↗

A new method detects changes in mixture models quickly and accurately.

problem Detecting changes in mixture models with heavy-tailed components.
method Change-point methods based on robust and quick approach.
result The method is up to 500 times faster and more accurate than existing methods.

We propose a probabilistic modeling framework for learning the dynamic patterns in the collective behaviors of social agents and developing profiles for different behavioral groups, using data collected from multiple information sources. The proposed model is based on a hierarchical Bayesian process, in which each obse…

2016-06-24abs ↗pdf ↗

In this paper, we firstly give a brief introduction of expectation maximization (EM) algorithm, and then discuss the initial value sensitivity of expectation maximization algorithm. Subsequently, we give a short proof of EM's convergence. Then, we implement experiments with the expectation maximization algorithm (We im…

2013-05-03abs ↗pdf ↗

This paper studies the utility maximization problem with changing time horizons in the incomplete Brownian setting. We first show that the primal value function and the optimal terminal wealth are continuous with respect to the time horizon TT. Secondly, we exemplify that the expected utility stemming from applying th…

2010-06-25abs ↗pdf ↗

GOCPD detects change points by maximizing the probability of two independent models.

problem Large false discovery rates in online change point detection methods.
method GOCPD uses ternary search to find change points by maximizing the probability of two independent models.
result GOCPD accelerates CPD with logarithmic complexity for single change point detection.

We consider an infinite dimensional optimization problem motivated by mathematical economics. Within the celebrated "Arbitrage Pricing Model", we use probabilistic and functional analytic techniques to show the existence of optimal strategies for investors who maximize their expected utility.

2015-08-31abs ↗pdf ↗

Mixture of Experts (MoE) is a popular framework for modeling heterogeneity in data for regression, classification and clustering. For continuous data which we consider here in the context of regression and cluster analysis, MoE usually use normal experts, that is, expert components following the Gaussian distribution. …

2015-06-22abs ↗pdf ↗

Designs efficient algorithms to maximize the expectation of Gaussian random variables.

problem Maximizing the expectation of the supremum of Gaussian random variables.
method Polynomial time approximation scheme and O(logn)O(\log n) approximation algorithm for general m>1m>1.
result Characterizes optimal variance allocation and provides approximation algorithms.

The paper proposes a method to trim Bayesian network classifiers robustly.

problem Removing costly features from Bayesian network classifiers while maintaining robustness.
method Introduces an expected classification agreement (ECA) metric and a branch-and-bound search algorithm to find optimal feature subsets and thresholds.
result The proposed method maximizes expected agreement between the original and trimmed classifiers, subject to a budgetary constraint.

New method improves robustness of Bayesian experimental design.

problem Bayesian experimental design's sensitivity to prior distribution changes.
method Introduces robust expected information gain (REIG) and uses KL-divergence ambiguity sets.
result REIG stabilizes sampling-based EIG estimation and compensates for prior variability.

Optimal financial strategies minimize risk under uncertain models.

problem Maximizing utility in financial markets with model uncertainty.
method Optimized strategies converge to those with minimal norm as uncertainty increases.
result Optimal strategies with minimal norm emerge as uncertainty grows.

We consider a model in which a trader aims to maximize expected risk-adjusted profit while trading a single security. In our model, each price change is a linear combination of observed factors, impact resulting from the trader's current and prior activity, and unpredictable random effects. The trader must learn coeffi…

2012-07-26abs ↗pdf ↗

Optimal reinsurance contracts designed for a continuum of risk types.

problem Designing optimal reinsurance contracts with a continuum of risk types.
method Principal-agent model, VaR at risk tolerance level, change of variables, univariate approach.
result Optimal reinsurance contracts are in stop-loss form, classifying agents into high and low risk groups.

DiEM trains diffusion models from noisy data using EM.

problem Training diffusion models requires clean data, which is often unavailable.
method DiEM uses expectation-maximization algorithm to train diffusion models from incomplete and noisy observations.
result DiEM leads to proper diffusion models suitable for downstream tasks.

A new EM-based algorithm improves deep generative model training.

problem Training deep generative models with maximum likelihood is challenging.
method The paper proposes reweighted expectation maximization (REM), a new algorithm that directly maximizes the log marginal likelihood of the data.
result REM learns better generative models than the IWAE, leading to significantly better performance in density estimation benchmarks.

New algorithm robustly estimates sparse models in high dimensions with corrupted data.

problem Estimating latent variable models with arbitrarily corrupted samples in high dimensional space.
method Trimmed (Gradient) Expectation Maximization with trimming gradients and hard thresholding steps.
result The algorithm converges to near optimal statistical rate geometrically under certain conditions.

New algorithm detects and adapts to changes in multi-armed bandit problems.

problem Adaptive learning in multi-armed bandit problems with piecewise-stationary reward distributions.
method Incorporates change detection with classic UCB algorithms to achieve nearly optimal regret bound.
result Achieves nearly optimal regret bound of O(MKTlogT)O(\sqrt{MKT\log T}).

We consider a multi-armed bandit problem in a setting where each arm produces a noisy reward realization which depends on an observable random covariate. As opposed to the traditional static multi-armed bandit problem, this setting allows for dynamically changing rewards that better describe applications where side inf…

2011-10-27abs ↗pdf ↗

Paper analyzes a generalized EM algorithm for Gaussian mixtures in control systems.

problem Parametric distribution-based clustering in unsupervised learning.
method Proposes a generalized EM (GEM) algorithm for Gaussian mixture models, analyzing its convergence properties using control theory.
result GEM algorithm can be understood as a linear time-invariant system with feedback nonlinearity.

Two neural network-based mixture models with E-M learning for efficient likelihood computation.

problem Efficiently computing likelihood in mixture models with complex structures.
method Explicit mixture models with flow-based neural networks, E-M algorithm for parameter learning.
result Demonstrated efficiency in generating samples and maximum likelihood classification.