arXiv (All)
open access
Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters
Gaussian Mixture Models (GMMs) range among the most frequently used models in machine learning. However, training large, general GMMs becomes computationally prohibitive for data sets that have many data points $N$ of high-dimensionality $D$. For GMMs with arbitrary covariances, we here derive a hig
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- PSM: Dataset Distillation Based on Precise Statistical Matching by Difficulty#1119372
- Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion#1083719
- Improving machine learning models through enrichment of training data#247969
- Weak-to-Strong Generalization via Bregman Bias-Variance Decomposition#635596
- Weak-to-Strong Generalization via Bregman Bias-Variance Decomposition#633247
Record · ID 997944
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive