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

1122 · Feb 202219922001200920172026
12 results for label-switching

Label switching is a phenomenon arising in mixture model posterior inference that prevents one from meaningfully assessing posterior statistics using standard Monte Carlo procedures. This issue arises due to invariance of the posterior under actions of a group; for example, permuting the ordering of mixture components …

2019-11-05abs ↗pdf ↗

Proposes a method to identify elements in a skewness matrix for multivariate skew-elliptical distributions.

problem Label switching issue in Bayesian estimation of skewness matrix.
method Imposes a positive lower-triangular constraint and uses Bayesian sparse estimation with horseshoe prior.
result Successfully estimates the true structure of skewness dependency.

Study on the limits of learning HMM parameters under various conditions.

problem Understanding the conditions under which hidden Markov model parameters can be learned.
method Nonasymptotic minimax upper and lower bounds, thresholds analysis.
result Nonasymptotic minimax bounds match up to constants, showing learnable thresholds.

Graphical model has been widely used to investigate the complex dependence structure of high-dimensional data, and it is common to assume that observed data follow a homogeneous graphical model. However, observations usually come from different resources and have heterogeneous hidden commonality in real-world applicati…

2015-12-31abs ↗pdf ↗

Quantum states can be learned efficiently using gentle measurements.

problem Efficiently learning quantum states with minimal measurements.
method Introducing α-LGM measurements and proving strong quantum DPI.
result The number of states needed for accurate learning is of order 1/(ε^2 α^2).

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.

DFMR improves robustness of learning finite mixture models in distributed settings.

problem Learning finite mixture models in distributed settings with Byzantine failures.
method DFMR leverages pairwise L2 distances to filter and retain local estimates, ensuring robust aggregation.
result DFMR achieves optimal convergence rate and asymptotic equivalence to global maximum likelihood estimate.

Improved convergence rates for MLE in mixture models using penalized log-likelihood.

problem Convergence rates for MLE in finite mixture models.
method Penalizing log-likelihood to discourage vanishing mixing weights, using Wasserstein distance and new loss functions.
result Improved convergence rates for some mixture components, faster than traditional methods.

Unified framework for binary responses using AUC loss and low-rank constraint.

problem Statistical inefficiency and shared structure in fitting multiple binary responses.
method Pairwise AUC loss aggregation with low-rank constraint, scalable projected gradient descent.
result Unified framework outperforms likelihood-based approaches in challenging settings.

Unified framework for disentangled VAEs improves latent space interpretability.

problem Challenges in evaluating and interpreting latent representations, especially for diverse data types.
method Unified bfVAE framework, FVH-LT, DBSR-LS, GAS, LSSI.
result bfVAE provides more favorable trade-off between disentanglement and reconstruction.