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…
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
48 results for “Expectation maximization”
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 approximation algorithm for general .
result Characterizes optimal variance allocation and provides approximation algorithms.
We provide an economic interpretation of the practice consisting in incorporating risk measures as constraints in a classic expected return maximization problem. For what we call the infimum of expectations class of risk measures, we show that if the decision maker (DM) maximizes the expectation of a random return unde…
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.
Active inference minimizes expected free energy for optimal behavior.
problem Understanding and optimizing behavior in complex systems.
method Combines Bayesian decision theory, optimal Bayesian design, and the free energy principle.
result Active inference emerges as a unified framework for information-seeking, utility maximization, and goal-directed behavior.
DO-EM framework for quantum models improves generative tasks.
problem Lack of Expectation-Maximization framework for density operators.
method Demonstrated inequality for density operators, derived DO-EM framework.
result DO-EM framework outperforms probabilistic models in generative tasks.
Study optimal investment and consumption in incomplete markets with nonlinear expectations.
problem Utility maximization in incomplete markets with general constraints.
method Utilizes -martingale method to solve optimization problem for various utility functions.
result Characterizes optimal investment-consumption strategy through quadratic BSDE solutions.
We present a noise-injected version of the Expectation-Maximization (EM) algorithm: the Noisy Expectation Maximization (NEM) algorithm. The NEM algorithm uses noise to speed up the convergence of the EM algorithm. The NEM theorem shows that injected noise speeds up the average convergence of the EM algorithm to a local…
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.
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.
Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field …
We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. The expectation-maximization (EM) algorithm is an established algorithm to compute maximum likelihood estimates and appl…
In this paper, we use replica analysis to determine the investment strategy that can maximize the net present value for portfolios containing multiple development projects. Replica analysis was developed in statistical mechanical informatics and econophysics to evaluate disordered systems, and here we use it to formula…
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.
Fast convergence of the Expectation Maximization algorithm under a logarithmic Sobolev inequalitystat.ML
New framework improves EM algorithm convergence under log-Sobolev inequality.
problem Improving convergence of the EM algorithm.
method Extending gradient flow techniques to EM algorithm, using free energy representation.
result Exponential convergence of EM algorithm under log-Sobolev inequality.
In this paper we study a robust expected utility maximization problem with random endowment in discrete time. We give conditions under which an optimal strategy exists and derive a dual representation for the optimal utility. Our approach is based on a general representation result for monotone convex functionals, a fu…
Clustering algorithms are a cornerstone of machine learning applications. Recently, a quantum algorithm for clustering based on the k-means algorithm has been proposed by Kerenidis, Landman, Luongo and Prakash. Based on their work, we propose a quantum expectation-maximization (EM) algorithm for Gaussian mixture models…
Establishes geometric convergence of iterative optimization algorithms.
problem Analyzes convergence of iterative optimization algorithms under general assumptions.
method General framework for iterative optimization algorithms, proving asymptotic geometric convergence and providing convergence rates.
result Asymptotic geometric convergence of iterative optimization algorithms with exact rate.
A new EM algorithm improves inference from large datasets.
problem Efficient inference in latent variable models with large datasets.
method Introduces SPIDER-EM, a novel EM algorithm using SPIDER estimator.
result Finite-time complexity bounds for smooth non-convex likelihood.
We show that a large class of Estimation of Distribution Algorithms, including, but not limited to, Covariance Matrix Adaption, can be written as a Monte Carlo Expectation-Maximization algorithm, and as exact EM in the limit of infinite samples. Because EM sits on a rigorous statistical foundation and has been thorough…
Study optimizes insurance investment to maximize utility across all capital levels.
problem Maximizing expected utility across all capital levels in an insurance company's investment strategy.
method Dynamic Programming Principle and Hamilton-Jacobi-Bellman (HJB) equation to prove existence of optimal strategy.
result Existence of optimal investment strategy proven under certain conditions.
QEM uses parallel importance weighting for fast approximate Bayesian inference.
problem Bayesian inference challenges in large models with many observations and latent variables.
method Expectation Maximization (EM) with massively parallel importance weighting.
result QEM is faster and more scalable than RWS and VI.
Markov Observation Modelsstat.ML
Expands Hidden Markov Model to include Markov chain observations.
problem Handling Markov chain observations in Hidden Markov Models.
method Developed Expectation-Maximization algorithm and Viterbi algorithm analogs.
result Estimates transition probabilities for hidden states and observations.
Motivated by the AIG bailout case in the financial crisis of 2007-2008, we consider an insurer who wants to maximize the expected utility of the terminal wealth by selecting optimal investment and risk control strategies. The insurer's risk process is modelled by a jump-diffusion process and is negatively correlated wi…
The paper introduces SuccessProbaMax to optimize policy success probability in online advertising.
problem Optimizing policy success probability in online advertising systems.
method SuccessProbaMax algorithm that optimizes for the probability of success rather than expected value.
result SuccessProbaMax outperforms conventional algorithms in terms of success rate.
Training deep generative models with maximum likelihood remains a challenge. The typical workaround is to use variational inference (VI) and maximize a lower bound to the log marginal likelihood of the data. Variational auto-encoders (VAEs) adopt this approach. They further amortize the cost of inference by using a rec…
In recent years, the evaluation of the minimal investment risk of the quenched disordered system of a portfolio optimization problem and the investment concentration of the optimal portfolio has been actively investigated using the analysis methods of statistical mechanical informatics. However, the work to date has no…
New RL formulation for maximizing maximum reward in molecule generation.
problem Traditional RL frameworks do not fit real-world applications like drug discovery.
method Formulated a new objective function to maximize maximum reward, derived Bellman equation, introduced operators, and proved convergence.
result Achieved state-of-the-art results in molecule generation.
Optimal insurance strategy for maximizing RDEU under various premium principles.
problem Maximizing a risk-averse individual's RDEU with insurance priced by a distortion-deviation principle.
method Proved necessary and sufficient conditions for the optimal solution, considered ambiguity orders, and analyzed specific examples.
result Conditions for no insurance or deductible insurance to be optimal.
New approach to multi-armed bandit problem aims to maximize highest total reward.
problem Traditional multi-armed bandit problem objective of maximizing total reward is not suitable in certain applications.
method Adaptive explore-then-commit policy with confidence bounds and adaptive stopping criterion.
result Achieves asymptotic and worst-case regret bounds for the new objective.
Bayesian quadrature optimization (BQO) maximizes the expectation of an expensive black-box integrand taken over a known probability distribution. In this work, we study BQO under distributional uncertainty in which the underlying probability distribution is unknown except for a limited set of its i.i.d. samples. A stan…
New method estimates Gaussian copulas with missing data using EM algorithm.
problem Estimating Gaussian copulas with missing data and prior assumptions.
method Rigorous application of the Expectation Maximization (EM) algorithm for marginal distributions and dependence structure.
result Joint distribution learned is closer to the underlying distribution.
SEMF predicts prediction intervals for ML models using latent variables.
problem Uncertainty quantification in ML models, especially for diverse data distributions.
method Supervised Expectation-Maximization Framework (SEMF) extending EM algorithm for latent variable modeling.
result SEMF produces narrower prediction intervals with desired coverage probability.
Fast Incremental Expectation Maximization for finite-sum optimization: nonasymptotic convergencecs.LG
FIEM accelerates EM for large datasets with nonasymptotic convergence bounds.
problem Efficiently optimizing large datasets using EM framework.
method FIEM recasts EM in Stochastic Approximation framework and provides nonasymptotic convergence bounds.
result Nonasymptotic bounds for convergence in expectation as a function of and $\kmax$.
This dissertation shows that careful injection of noise into sample data can substantially speed up Expectation-Maximization algorithms. Expectation-Maximization algorithms are a class of iterative algorithms for extracting maximum likelihood estimates from corrupted or incomplete data. The convergence speed-up is an e…
We consider a discrete-time financial market model with finite time horizon and give conditions which guarantee the existence of an optimal strategy for the problem of maximizing expected terminal utility. Equivalent martingale measures are constructed using optimal strategies.
A new Bayesian method optimizes time-dependent expensive functions with lookahead.
problem Maximizing a time-dependent, expensive oracle with limited evaluations.
method Recursive, two-step lookahead expected payoff (r2LEY) acquisition function.
result r2LEY outperforms myopic methods in synthetic and real-world datasets.
Integrates VAEs into EM for deep clustering and generation.
problem Clustering and generating new samples from complex distributions.
method Combines VAEs and EM, updating model parameters and refining cluster assignments.
result Superior clustering performance on MNIST and FashionMNIST.
The Expectation-Maximization (EM) algorithm is one of the most popular methods used to solve the problem of parametric distribution-based clustering in unsupervised learning. In this paper, we propose to analyze a generalized EM (GEM) algorithm in the context of Gaussian mixture models, where the maximization step in t…
Improves EM algorithm for better local optima in mixture models.
problem EM algorithm's sensitivity to initialization and bad local optima.
method Big Learning principle applied to upgrade EM algorithm.
result BigLearn-EM delivers optimal solution with high probability.
We present a novel active learning algorithm for community detection on networks. Our proposed algorithm uses a Maximal Expected Model Change (MEMC) criterion for querying network nodes label assignments. MEMC detects nodes that maximally change the community assignment likelihood model following a query. Our method is…
New method corrects active learning for distribution shifts and outliers.
problem Conventional active learning methods fail to account for test-time distribution.
method JEPIG, a hybrid of BALD and EPIG, maximizes expected predictive information gain.
result JEPIG outperforms conventional methods in active learning with distribution shifts.
Proposes a novel graph self-training method with EM regularization for semi-supervised node classification.
problem Handles noisy graph structures and feature spaces in semi-supervised node classification.
method Introduces an Expectation-Maximization (EM) regularization scheme for uncertainty-aware pseudo-label generation and model retraining.
result Significantly outperforms strong baselines by up to 2.5% in accuracy.
EM algorithm speeds up convergence in federated learning with heterogenous data.
problem Understanding convergence rates of federated learning algorithms under data heterogeneity.
method Characterized convergence rate of EM algorithm for FMLR model under various regimes.
result EM algorithm converges to ground truth with SNR ≥ √K in all regimes.
This paper improves SNN training by using multiple sample compartments.
problem Training SNNs with single-sample estimators leads to inaccurate log-likelihood estimates.
method Proposes a GEM-based online learning algorithm that uses multiple independent spiking signals.
result Significant improvements in log-likelihood, accuracy, and calibration with multiple compartments.
New method for LLMs to learn reasoning by optimizing latent variables.
problem Teaching LLMs to generate logical justifications for answers.
method Formalized reasoning as latent variable model, derived FEM objective, designed sampling schemes.
result Prompt Posterior Sampling (PPS) outperforms other schemes in learning to reason.
NoMoPy models noise as HMM/FHMM in Python.
problem Modeling noise in data.
method Approximate and exact EM algorithms, cross-validation, confidence region estimation.
result Validated on example problems.
DCEM algorithm reduces bias in machine learning models trained on selective labels.
problem Bias in machine learning models trained on selective labels.
method Disparate Censorship Expectation-Maximization (DCEM) algorithm.
result DCEM improves bias mitigation without sacrificing discriminative performance.