Model Detail
MiniMax-M2.7-NVFP4
—MiniMax-M2.7-NVFP4 is an AI model from lukealonso. It has 39K downloads on Hugging Face.
MiniMax-M2.7-NVFP4 is a code generation model with 65.2B parameters released by lukealonso. Distributed under the permissive mit license.
MiniMax-M2.7-NVFP4 ships with 65.2B parameters. Total weight footprint is approximately 130.4 GB, which is the relevant figure when planning local-inference VRAM. The mit license is permissive, allowing commercial deployment and derivative work without per-seat fees, though attribution requirements still apply.
MiniMax-M2.7-NVFP4 is best fit for code completion, repository-scale Q&A, and pair-programming integrations. It is a less obvious choice for one-shot generation of security-critical code without review. 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.
Exploring Explainable Multi-agent MCTS-minimax Hybrids in Board Game Using Process Mining
arXiv:2503.23326v4 Announce Type: replace Abstract: Monte-Carlo Tree Search (MCTS) is a family of sampling-based search algorithms widely used for online planning in sequential decision-making domains and at the heart of many recent advances in artificial intelligence. Understanding the behavior of
Simultaneous Near-Optimal Region Identification in Continuous Simulation Optimization: Minimax Complexity and Adaptive Sampling
arXiv:2611.13489v1 Announce Type: cross Abstract: Simulation optimization typically returns a single estimated optimal point. When decisions also depend on criteria evaluated independently of simulation, such as resource cost, the decision maker instead needs the set of designs whose expected perfor
Minimax Rates and Spectral Distillation for Tree Ensembles
arXiv:2605.11841v3 Announce Type: replace-cross Abstract: Tree ensembles such as random forests (RFs) and gradient boosting machines (GBMs) are among the most widely used supervised learners, yet their theoretical properties remain incompletely understood. We adopt a spectral perspective on these al
Near-Minimax Sample Complexity for Multi-Objective Reinforcement Learning under Generative Models
arXiv:2611.05562v1 Announce Type: cross Abstract: In multi-objective reinforcement learning, preferences may be specified only after data collection, requiring one dataset to support a continuum of reward trade-offs. We study finite discounted Markov decision processes with unknown transitions, $S$
Neural Actor--Critic Learning with Minimax Critics and Reflected Langevin Sampling
arXiv:2611.03352v2 Announce Type: replace-cross Abstract: Actor--critic methods rely on critic gradients to improve continuous-action policies, yet finite-sample guarantees must control both value and gradient errors and their propagation through the actor. We develop a neural actor-critic procedure
Minimax Alternating Regret for the Experts Problem and Online Convex Optimization
arXiv:2608.25182v2 Announce Type: replace-cross Abstract: In this paper, we study alternating regret in online convex optimization (OCO), motivated by the success of alternating learning dynamics in two-player games. Although previous works have shown that $o(\sqrt{T})$ alternating regret is achieva