MiniMax shares surged after revenue beat expectations in its first set of results following its listing. Shares of the Chinese artificial-intelligence company rose 18% to 884.00 Hong Kong dollars, or ...

United States artificial intelligence firm Anthropic is accusing three prominent Chinese AI labs of illegally extracting capabilities from its Claude model to advance their own, claiming it raises ...

Anthropic dropped a bombshell on the artificial intelligence industry Monday, publicly accusing three prominent Chinese AI laboratories — DeepSeek, Moonshot AI, and MiniMax — of orchestrating ...

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 ...

MiniMax Group Inc. shares surged in Hong Kong, buoyed by growing investor confidence in the technology offered by China’s generative AI startups. The stock gained as much as 30%, before closing up 25% ...

The MiniMax M2.5 is an advanced AI model designed to balance high performance with cost efficiency, as explained by Caleb Writes Code. Building on its predecessor, the M2.1, this model incorporates a ...

People often blame social media algorithms that prioritize extreme content for increasing political polarization, but this effect has been difficult to prove. Only the platform owners have access to ...

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 ...

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 ...

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 ...