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

Trend · papers per month

3617221,0821,443 · Jun 202019922001200920172026
48 results for Binary Mixture Model

New method predicts activity coefficients for binary mixtures without using physical descriptors.

problem Predicting activity coefficients for unexplored binary mixtures.
method Probabilistic matrix factorization model.
result Method outperforms state-of-the-art models requiring less training effort.

The paper optimizes hyperplanes for binary classification in high-dimensional data with latent Gaussian mixtures.

problem Binary classification in high-dimensional data with latent Gaussian mixtures.
method Generalized least squares estimator for estimating the direction of the optimal separating hyperplane. Simple correction for intercept estimation.
result The procedure is minimax optimal in many scenarios and can retain the interpolation property.

New method estimates hidden binary mixture model centers efficiently.

problem Estimating centers in high-dimensional binary mixture models with hidden Markov structure.
method Proposes a minimax optimal procedure and an adaptive variant.
result Achieves optimal rate of order δd/n+d/n\sqrt{δd/n} + d/n.

We propose a new blind source separation algorithm based on mixtures of alpha-stable distributions. Complex symmetric alpha-stable distributions have been recently showed to better model audio signals in the time-frequency domain than classical Gaussian distributions thanks to their larger dynamic range. However, infer…

2017-11-13abs ↗pdf ↗

Paper analyzes adversarial training's performance in binary classification.

problem Understanding the generalization performance of adversarial training.
method Derives precise theoretical predictions for adversarial training performance.
result Provides exact asymptotics for test errors of adversarial training.

BIND removes background noise from binary matrices, improving detection accuracy and fairness.

problem Real data often violates the i.i.d assumption for binary matrix entries, leading to inaccurate detection.
method BIND optimizes detection by estimating row- and column-wise mixture distributions and eliminating background noise.
result BIND effectively removes background noise and increases detection accuracy and fairness.

We compare two statistical models of three binary random variables. One is a mixture model and the other is a product of mixtures model called a restricted Boltzmann machine. Although the two models we study look different from their parametrizations, we show that they represent the same set of distributions on the int…

2017-09-15abs ↗pdf ↗

Our paper examines binary linear classification under Gaussian mixtures, revealing conditions for optimal performance.

problem Understanding the conditions for optimal performance of binary linear classifiers under Gaussian mixtures.
method We study max-margin SVM and min-norm interpolating classifiers, deriving bounds and conditions for optimal performance.
result Interpolating estimators achieve asymptotically optimal performance under certain conditions, emphasizing the role of SNR and covariance.

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.

A Bernoulli Mixture Model (BMM) is a finite mixture of random binary vectors with independent dimensions. The problem of clustering BMM data arises in a variety of real-world applications, ranging from population genetics to activity analysis in social networks. In this paper, we analyze the clusterability of BMMs from…

2017-10-05abs ↗pdf ↗

We propose a mixture of latent trait models with common slope parameters (MCLT) for model-based clustering of high-dimensional binary data, a data type for which few established methods exist. Recent work on clustering of binary data, based on a dd-dimensional Gaussian latent variable, is extended by incorporating com…

2014-04-11abs ↗pdf ↗

In binary-transaction data-mining, traditional frequent itemset mining often produces results which are not straightforward to interpret. To overcome this problem, probability models are often used to produce more compact and conclusive results, albeit with some loss of accuracy. Bayesian statistics have been widely us…

2012-09-26abs ↗pdf ↗

Binary PheNorm extends phenotype labeling for EHRs using binary silver labels.

problem Lack of gold-standard phenotype labels in EHR studies.
method Proposes Binary PheNorm, an extension that uses binary silver labels directly in phenotype scoring.
result Binary PheNorm achieved strong discrimination using binary labels alone and improved performance when combined with count labels.

Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven approach for the learning, modeling, and prediction of phase segregation. A direct …

2018-03-23abs ↗pdf ↗

Defines diversification as a binary relationship between financial portfolios.

problem Defines diversification in a new binary relationship for financial portfolios.
method Proposes a new definition of diversification based on convex linear combinations and second order stochastic dominance.
result The proposed definition coincides with second order stochastic dominance.

Study shows optimal self-distillation improves model performance on noisy data.

problem Improving model performance on noisy Gaussian mixture data.
method Hyperparameter-tuned multi-stage self-distillation with a linear classifier, using replica method.
result Primary driver of SD's performance improvement is denoising through hard pseudo-labels.

This paper optimizes retraining models using their own predictions and noisy labels.

problem Improving model performance through optimal retraining of noisy labels.
method Developed a principled framework based on approximate message passing (AMP) to analyze iterative retraining procedures.
result Derivation of the Bayes optimal aggregator function to minimize prediction error.

Optimal classifiers derived from GMMs are approximated by deep neural networks.

problem Binary classification of high-dimensional overlapping Gaussian mixtures.
method Closed-form expressions for Bayes optimal decision boundaries derived from GMMs' eigenstructure. Empirical validation through synthetic and real-world data.
result Deep neural networks approximate optimal classifiers for GMMs, with decision thresholds related to covariance eigenvectors.

Latent variable models with hidden binary units appear in various applications. Learning such models, in particular in the presence of noise, is a challenging computational problem. In this paper we propose a novel spectral approach to this problem, based on the eigenvectors of both the second order moment matrix and t…

2018-02-27abs ↗pdf ↗

The paper analyzes the score field of diffusion models using Burgers dynamics.

problem Understanding the evolution of score fields in diffusion models.
method Analyzes the score field through Burgers-type evolution law for diffusion models.
result Identifies a universal \( anh\) interfacial term in the score field.

ETM models improve efficiency in semi-supervised logistic regression.

problem Improving efficiency in logistic regression with limited labeled data.
method Developed exponential tilt mixture (ETM) models for semi-supervised estimation.
result ETM-based estimation demonstrates improved efficiency over supervised logistic regression.

Deep neural networks classify unbounded Gaussian mixture data without dimensionality issues.

problem Binary classification of unbounded Gaussian mixture data.
method Deep ReLU neural networks with non-asymptotic upper bounds and convergence rates.
result Deep ReLU networks can classify unbounded Gaussian mixture data without dimensionality constraints.

Many different methods to train deep generative models have been introduced in the past. In this paper, we propose to extend the variational auto-encoder (VAE) framework with a new type of prior which we call "Variational Mixture of Posteriors" prior, or VampPrior for short. The VampPrior consists of a mixture distribu…

2017-05-19abs ↗pdf ↗

Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.

problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.

Hierarchical structure is ubiquitous in data across many domains. There are many hierarchical clustering methods, frequently used by domain experts, which strive to discover this structure. However, most of these methods limit discoverable hierarchies to those with binary branching structure. This limitation, while com…

2012-03-15abs ↗pdf ↗

Federated learning for Bayesian clustering of large datasets.

problem Bayesian model-based clustering of large-scale binary and categorical data.
method Federated variational inference with local merge and delete moves in parallel batches, followed by global merge moves.
result Empirical validation shows superior performance compared to existing algorithms.

Algorithm identifies probability distributions from noisy moments with minimal samples.

problem Identifying a probability distribution from its first mm noisy moments.
method Uses m=2km=2k samples to identify a kk-mixture with O(k2+o(1))O(k^{2+o(1)}) runtime.
result Achieves optimal sample complexity and runtime for identifying kk-mixtures.

This article investigates the eigenspectrum of the inner product-type kernel matrix pK={f(xiTxj/p)}i,j=1n\sqrt{p} \mathbf{K}=\{f( \mathbf{x}_i^{\sf T} \mathbf{x}_j/\sqrt{p})\}_{i,j=1}^n under a binary mixture model in the high dimensional regime where the number of data nn and their dimension pp are both large and comparable. Based on…

2019-09-15abs ↗pdf ↗

The paper confirms two groups of gamma-ray bursts using a new nonparametric metric.

problem Determining the number of inherent groups in gamma-ray bursts.
method A new nonparametric interpoint distance-based measure, combined with clustering methods.
result Confirms two groups of short and long gamma-ray bursts.

In regression tasks the distribution of the data is often too complex to be fitted by a single model. In contrast, partition-based models are developed where data is divided and fitted by local models. These models partition the input space and do not leverage the input-output dependency of multimodal-distributed data,…

2019-03-18abs ↗pdf ↗

We present a new approach for learning compact and intuitive distributed representations with binary encoding. Rather than summing up expert votes as in products of experts, we employ for each variable the opinion of the most reliable expert. Data points are hence explained through a partitioning of the variables into …

2017-02-16abs ↗pdf ↗

Method reveals dissimilarity in alloys' Curie temperatures.

problem Tackles the dissimilarity between rare-earth transition metal binary alloys.
method Ensemble learning with Kernel ridge regression.
result Reveals meaningful relations between alloys' structure and Curie temperature.

Regularized linear regression improves binary classification performance, especially with ridge and 1\ell_1 regularization.

problem Improving binary classification accuracy with noisy labels.
method Systematic study of regularization strengths on linear classifiers trained on noisy binary classification data.
result Ridge regression consistently improves classification error, while 1\ell_1 regularization can induce sparsity and \ell_\infty regularization can concentrate weights to two values.

Transformers for binary decisions are sensitive to evidence order, leading to unreliable outcomes.

problem Order sensitivity in Transformers for binary decisions leads to unreliable outcomes.
method Formalized an expectation-realization gap and developed QMV and EDFL bounds.
result Uniform permutation mixtures reduce dispersion and improve reliability.

MMM model clusters mixed-type longitudinal data efficiently.

problem Challenges in clustering multivariate longitudinal mixed-type data.
method MMM model reorganizes data into a three-way structure, using a mixture of matrix-variate normal distributions.
result MMM model handles various data types (continuous, ordinal, binary, nominal, count) and temporal dependence.