Model Detail
Minimax-h3_Singularity-x-10Eros-Max_PRISM
▲ 22.9%Minimax-h3_Singularity-x-10Eros-Max_PRISM is an AI model from OliviaRossi. It has 152K downloads on Hugging Face.
Minimax-h3_Singularity-x-10Eros-Max_PRISM is an AI model released by OliviaRossi. Distributed under a other license.
Distribution is governed by the other license — review the exact terms before commercial deployment.
Downloads of Minimax-h3_Singularity-x-10Eros-Max_PRISM have moved +22.9% over the past 24 hours. That is a slight downtrend, consistent with normal cooling as newer models compete for the same workloads. 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_Singularity-x-10Eros-Max_PRISM 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 Regret for Sobolev Kernel-Based Reinforcement Learning
arXiv:2610.34045v1 Announce Type: new Abstract: We study the minimax regret rate for episodic kernel-based reinforcement learning, where the expected reward and transition density belong to a Sobolev reproducing kernel Hilbert space, with continuous state and action spaces, and adversarial initial s
Minimax Rates for Conditional Generative Learning under Wasserstein Loss
arXiv:2610.35490v1 Announce Type: cross Abstract: We study minimax rates for conditional generative learning under integrated Wasserstein loss, with H\"older continuous conditional laws and an unrestricted covariate distribution. We evaluate unrestricted generators through their conditional output d
Minimax PAC Bounds for Learning in Exogenous Contextual MDPs
arXiv:2606.25170v3 Announce Type: replace-cross Abstract: We introduce a PAC framework in which the learner can access sampling oracles both before and at decision time. Sample complexity is measured by a pair $(n,m)$, where $n$ is the learning budget spent before a query is known and $m$ is the add
Causal Inference Under Unmeasured Confounding With Negative Controls: A Minimax Learning Approach
arXiv:2103.14029v5 Announce Type: replace-cross Abstract: We study the estimation of causal parameters when not all confounders are observed and instead negative controls are available. Recent work has shown how these can enable identification and efficient estimation via two so-called bridge functi
Transient Amplification in Cascaded Gradient Methods: Exact Minimax Laws and Tracking without Resonance
arXiv:2606.04031v3 Announce Type: replace Abstract: Leader-follower gradient iterations, including bilevel and two-time-scale methods, can exhibit large finite-time excursions despite asymptotic stability. For cascaded iterations with block matrix J = [[A,0],[C,D]], symmetric diagonal blocks of norm
Exact Global Minimax Risk near Nonidentification
arXiv:2610.32546v1 Announce Type: cross Abstract: We study squared-error estimation when a nuisance parameter is unidentified on a submodel but affects a target that vanishes there. For models with higher-order profile expansions, we give sufficient conditions under which the largest critical-path m
