Yan Junjie, the billionaire founder, chairman and CEO of Chinese AI model developer MiniMax Group, has seen his fortune more than double to $7.8 billion on Forbes' World’s Real-Time Billionaires List ...

Photo source: MiniMax. Investors are taking an upbeat view as the AI firm delivers its first earnings report following its Hong Kong listing. No longer content with being merely another large model ...

Anthropic accused three Chinese AI firms of engaging in concerted "distillation attack" campaigns. U.S. companies like Anthropic and OpenAI are concerned with ceding a competitive advantage to such ...

In this episode of eSpeaks, Jennifer Margles, Director of Product Management at BMC Software, discusses the transition from traditional job scheduling to the era of the autonomous enterprise. eSpeaks’ ...

The Minimax M2.5 is a compact yet capable AI model that combines affordability with competitive performance, as detailed by Sam Witteveen. With a processing cost of just $1 per hour for 100 tokens per ...

Chinese artificial intelligence stocks rallied Thursday as several companies unveiled upgraded models. The wave of releases comes amid intensifying competition in AI as Chinese developers race to ...

HONG KONG, Feb. 11, 2026 /PRNewswire/ -- MiniMax Global ("MiniMax" or the "Company"; HKEX: 00100), a global AI foundation model company, today announced that it will report its financial results for ...

This article was co-authored with Emma Myer, a student at Washington and Lee University who studies Cognitive/Behavioral Science and Strategic Communication. In today’s digital age, social media has ...

An unbeatable Tic Tac Toe AI implementation using the Minimax algorithm with alpha-beta pruning. This project demonstrates professional Python development practices including comprehensive testing, CI ...

What if you could replace an expensive AI coworking assistant with something just as powerful, but at a fraction of the cost? In this walkthrough, Universe of AI shows how MiniMax M2.2 Agent is ...

Abstract: A nonconvex-concave minimax quadratic problem is studied in this paper. An efficient alternating algorithm is proposed without any convexification procedures and constraint relaxations. By ...