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

Trend · papers per month

3547081,0611,415 · Jun 202019922001200920172026
48 results for Mixture cure model

A Markov-chain model is developed for the purpose estimation of the cure rate of non-performing loans. The technique is performed collectively, on portfolios and it can be applicable in the process of calculation of credit impairment. It is efficient in terms of data manipulation costs which makes it accessible even to…

2018-05-30abs ↗pdf ↗

New model identifies cell-specific genes for cancer prognosis.

problem No statistical model to integrate multiscale cancer data.
method Bayesian generalized promotion time cure models (GPTCMs).
result Improves cancer prognosis by identifying cell-specific genes.

New method optimizes processes under constraints using bivariate Gaussian models.

problem Optimizing processes with constraints using traditional methods.
method Developed a constrained expected improvement acquisition function using bivariate Gaussian process models.
result Demonstrated improved performance in a manufacturing cure process optimization.

CURE extracts relations without supervision by clustering similar entity pairs.

problem Extracting relations unsupervised without considering sentence correlations.
method CURE uses Encoder-Decoder architecture for self-supervised learning and clustering similar relations.
result CURE outperforms state-of-the-art models on NYT and UNPC datasets.

Study identifies risk factors for subsequent suicide attempts in youth.

problem Uncertainty in suicide attempt identification from medical claims data.
method Integrative Cox cure model with regularization for survival analysis with uncertain events.
result Identifies risk factors for subsequent suicide attempts and distinguishes susceptibility from timing.

To cure the lack of predictive power of general relativity Geroch proposed to complete the theory with an additional postulate that only "hole-free" spacetimes are permitted. I argue that this postulate is too strong -- it prohibits even the Minkowski space.

2009-03-24abs ↗pdf ↗

Dan Lovallo and Daniel Kahneman must be commended for their clear identification of causes and cures to the planning fallacy in "Delusions of Success: How Optimism Undermines Executives' Decisions" (HBR July 2003). Their look at overoptimism, anchoring, competitor neglect, and the outside view in forecasting is highly …

2013-04-19abs ↗pdf ↗

We reconsider the multivariate Kyle model in a risk-neutral setting with a single, perfectly informed rational insider and a rational competitive market maker, setting the price of n correlated securities. We prove the unicity of a symmetric, positive definite solution for the impact matrix and provide insights on its …

2018-06-20abs ↗pdf ↗

Although shill bidding is a common auction fraud, it is however very tough to detect. Due to the unavailability and lack of training data, in this study, we build a high-quality labeled shill bidding dataset based on recently collected auctions from eBay. Labeling shill biding instances with multidimensional features i…

2018-08-22abs ↗pdf ↗

Divide-and-conquer method speeds sparse factorization for large matrices.

problem Sparse factorization of large matrices for statistical learning.
method Statistical problem formulation, divide-and-conquer approach, stagewise learning.
result Efficient algorithm with lower complexity than existing methods.

This essay suggests that a proper assessment of the presently unfolding financial crisis, and its cure, requires going back at least to the late 1990s, accounting for the cumulative effect of the ITC, real-estate and financial derivative bubbles. We focus on the deep loss of trust, not only in Wall Street, but more imp…

2008-10-25abs ↗pdf ↗

Optimal mixtures of generative models outperform individual models on image datasets.

problem Selecting the best single model from a group of trained generative models.
method Formulated a quadratic optimization problem and proposed the Mixture-UCB algorithm for efficient selection.
result Mixture of generative models achieves better evaluation scores than individual models on benchmark datasets.

New bounds on sample size for identifying mixture models with grouped samples.

problem Identifying mixture models with minimal sample size.
method Generalized identifiability bounds for mixture models with grouped samples.
result Identifiability with (2m1)/(k1)(2m-1)/(k-1) samples per group, with no improvement possible.

We consider unsupervised estimation of mixtures of discrete graphical models, where the class variable corresponding to the mixture components is hidden and each mixture component over the observed variables can have a potentially different Markov graph structure and parameters. We propose a novel approach for estimati…

2012-03-04abs ↗pdf ↗

When estimating finite mixture models, it is common to make assumptions on the mixture components, such as parametric assumptions. In this work, we make no distributional assumptions on the mixture components and instead assume that observations from the mixture model are grouped, such that observations in the same gro…

2016-06-30abs ↗pdf ↗

Improved VB algorithm for NIG mixtures outperforms Gaussian mixtures for non-Gaussian data.

problem Clustering non-Gaussian data, especially heavy-tailed and asymmetric.
method Proposed an improved VB algorithm for NIG mixture models and extended Dirichlet process mixture models.
result Outperforms Gaussian mixtures and existing NIG mixture models, especially for highly non-normative data.

The two most extended density-based approaches to clustering are surely mixture model clustering and modal clustering. In the mixture model approach, the density is represented as a mixture and clusters are associated to the different mixture components. In modal clustering, clusters are understood as regions of high d…

2016-09-15abs ↗pdf ↗

The parsimonious Gaussian mixture models, which exploit an eigenvalue decomposition of the group covariance matrices of the Gaussian mixture, have shown their success in particular in cluster analysis. Their estimation is in general performed by maximum likelihood estimation and has also been considered from a parametr…

2015-01-14abs ↗pdf ↗

Paper establishes universal lower bounds and optimal rates for clustering sub-exponential mixture models.

problem Achieving optimal error rates in clustering sub-exponential mixture models.
method Establishes universal lower bounds and demonstrates iterative algorithms' optimality in sub-exponential mixture models.
result Iterative algorithms achieve the universal lower bound in sub-exponential mixture models.

The paper uses Gaussian mixture models for Bayesian networks and proposes an optimization algorithm.

problem Modeling nodes in Bayesian networks with complex distributions.
method Gaussian mixture models combined with double iteration algorithm.
result The double iteration algorithm optimizes Gaussian mixture models effectively.

A new method detects outliers using ensembles of Dirichlet process mixtures.

problem Challenges in unsupervised outlier detection using Dirichlet process mixtures.
method Ensembles of Dirichlet process Gaussian mixtures with random subspace and subsampling.
result Empirically outperforms existing approaches in unsupervised outlier detection.

Deep learning is a hierarchical inference method formed by subsequent multiple layers of learning able to more efficiently describe complex relationships. In this work, Deep Gaussian Mixture Models are introduced and discussed. A Deep Gaussian Mixture model (DGMM) is a network of multiple layers of latent variables, wh…

2017-11-18abs ↗pdf ↗

Bayesian approach learns nonparametric mixture components from heterogeneous data.

problem Realistic modeling of heterogeneous data populations with nonparametric mixture components.
method Bayesian nonparametric modeling using Dirichlet process mixture priors.
result Posterior contraction rates for component densities are nearly polynomial, improving over deconvolution methods.

SMT trains generative models by estimating mixture scores, outperforming existing methods.

problem Training one-step generative models efficiently and effectively.
method Score-of-Mixture Training (SMT) estimates the score of mixture distributions between real and fake samples.
result SMT/SMD outperform existing methods on CIFAR-10 and ImageNet 64x64 datasets.

New method estimates mixture model components efficiently.

problem Estimating the number of components in finite mixture models.
method Group-Sort-Fuse (GSF) procedure for simultaneous estimation of order and mixing measure.
result GSF achieves consistent estimation of true mixture order and n1/2n^{-1/2} convergence rate.

New method for summarizing Bayesian mixture models using sliced Wasserstein distances.

problem Estimating the mixing measure in nonparametric Bayesian mixture models.
method Decision-theoretic approach using sliced Wasserstein distances for Gaussian mixtures.
result Effective estimation of the mixing measure and mixture density.

Finite mixture models are statistical models which appear in many problems in statistics and machine learning. In such models it is assumed that data are drawn from random probability measures, called mixture components, which are themselves drawn from a probability measure P over probability measures. When estimating …

2015-02-23abs ↗pdf ↗

Algorithm estimates nonparametric mixtures from grouped data.

problem Estimating identifiable nonparametric mixture models from grouped observations.
method Oracle inequality for weighted kernel density estimators and general consistency result.
result Consistent estimation of mixture components from grouped observations.

Mixture modeling is a general technique for making any simple model more expressive through weighted combination. This generality and simplicity in part explains the success of the Expectation Maximization (EM) algorithm, in which updates are easy to derive for a wide class of mixture models. However, the likelihood of…

2016-03-28abs ↗pdf ↗

The paper develops methods to create reliable prediction sets for complex mixture models in high-dimensional data.

problem Building accurate prediction sets for high-dimensional mixture models with feature-dependent weights.
method The authors introduce a debiasing procedure and a novel interval combination strategy to construct valid prediction sets.
result The proposed method provides reliable coverage guarantees for prediction sets in high-dimensional mixture models.

A new method uses Mean Field Games to optimize mixture models of Bernoulli and categorical distributions.

problem Optimizing parameters of finite mixture models of Bernoulli and categorical distributions.
method Mean Field Games theory applied to multi-population systems.
result The Mean Field Games approach provides a method to compute mixture model parameters.

The paper tackles learning mixtures of two multinomial logits, showing identifiability and presenting an algorithm.

problem Learning an arbitrary mixture of two multinomial logits.
method Reduction to solving a system of univariate quartic equations, followed by an algorithm using polynomial and linear samples.
result Identifiability of the mixture models may only fail on an algebraic variety of negligible measure.

Study uniform rates for estimating Gaussian mixtures without separation assumption.

problem Estimating parameters in two-component Gaussian mixtures without separation.
method Uniform convergence rates derived using minimax lower bounds and careful analysis of polynomial equalities.
result Phase transition in optimal estimation rate based on mixture balance.

The study bounds the stability of Gaussian mixtures under small perturbations.

problem Stability of Gaussian mixtures under small changes in distribution.
method Deriving an explicit bound on parameter stability of spherical Gaussian Mixture Models (sGMM) in a pre-defined model class.
result Upper bound on parameter distance of close sGMMs to the original sGMM, dependent only on the original model.

Mixture models are a fundamental tool in applied statistics and machine learning for treating data taken from multiple subpopulations. The current practice for estimating the parameters of such models relies on local search heuristics (e.g., the EM algorithm) which are prone to failure, and existing consistent methods …

2012-03-03abs ↗pdf ↗

Discriminative classifier for compositional data using hierarchical mixture of Generalized Dirichlet models.

problem Classifying compositional data, especially in spam detection and color space identification.
method Hierarchical mixture of discriminative Generalized Dirichlet classifiers, using variational approximation for parameter learning.
result First time a variational upper-bound for Generalized Dirichlet mixture is proposed in literature.