Model Detail
Minimax-h3-Turbo
▼ 0.0%Minimax-h3-Turbo is an AI model released by lightx2v. It has accumulated 1.5M downloads on Hugging Face since publication.
Minimax-h3-Turbo is published on Hugging Face but our pipeline has not yet captured architecture, license, or parameter-count metadata for this entry. The data is refreshed daily, so these fields typically populate within 24–48 hours of release.
Downloads of Minimax-h3-Turbo have moved -0.0% over the past 24 hours, +0.9% over the trailing seven days. The trend is mildly positive, consistent with a model that is being picked up incrementally rather than going viral. These numbers are signal, not guarantee — week-over-week download counts on Hugging Face also reflect mirror traffic, CI scrapes, and one-off benchmarking runs.
Minimax-h3-Turbo is best fit for general-purpose AI workloads. Treat this as a starting matrix rather than a benchmark verdict — the right deployment usually depends on the specific evaluation suite that mirrors your workload.
Minimax-Optimal Predictive Flow Matching under Distribution Drift
arXiv:2610.28898v1 Announce Type: new Abstract: Flow matching learns a generative velocity field by regression, but under distribution drift a field must be deployed before the current data arrive. We study this predictive problem for a fixed, possibly nonconvex, neural class, with dynamic regret ag
Near Minimax Rate for Quantile Distributional Reinforcement Learning
arXiv:2610.29595v1 Announce Type: cross Abstract: In this paper, we study quantile distributional policy evaluation, where the return distribution under a given policy is approximated by the quantile Bellman fixed point $\bm\eta_m$. We investigate the statistical accuracy of estimating $\bm\eta_m$ a
Minimax Optimality of the NPMLE for Gaussian Mixtures in Hellinger Distance
arXiv:2610.30109v1 Announce Type: cross Abstract: We analyze the problem of estimating univariate Gaussian mixture densities using the nonparametric maximum likelihood estimator (NPMLE) based on $n$ independent and identically distributed samples. We show that the unconstrained NPMLE achieves the mi
Minimax-optimal Scaling Laws in Ridge Regression via Transfer Learning
arXiv:2610.23337v1 Announce Type: new Abstract: Pretrained models are often reused across downstream tasks, motivating the question of whether this transfer learning procedure can provide a substantial performance improvement, namely, in terms of the scaling law. We address this question in the prot
Two Sample Sizes in Test-Time LLM Ensembling: Buffered ERM and Minimax Theory
arXiv:2610.21363v1 Announce Type: cross Abstract: Test-time scaling can improve the performance of large language models by generating multiple answers to a question and aggregating them. Weighted ensembles extend this idea by drawing answers from several models, with the weights determining how oft
When Is Muon Optimal? Radial Fragility and Minimax Geometry
arXiv:2610.21549v1 Announce Type: cross Abstract: Muon replaces a matrix gradient by an approximate polar factor and has shown strong empirical performance in neural-network training. The Isotropic Curvature Model (ICM) provides a curvature-based explanation for this update by asking when gradient o
