Quanta Magazine

For Algorithms, a Little Memory Outweighs a Lot of Time

One July afternoon in 2024, Ryan Williams set out to prove himself wrong. Two months had passed since he’d hit upon a startling discovery about the relationship between time and memory in computing.
JSTOR Daily

Conditional Gradient Algorithms for Rank-One Matrix Approximations with a Sparsity Constraint

This is a preview. Log in through your library . Abstract The sparsity constrained rank-one matrix approximation problem is a difficult mathematical optimization problem which arises in a wide array ...
Semiconductor Engineering

More Efficient Matrix-Multiplication Algorithms with Reinforcement Learning (DeepMind)

A new research paper titled “Discovering faster matrix multiplication algorithms with reinforcement learning” was published by researchers at DeepMind. “Here we report a deep reinforcement learning ...
JSTOR Daily

A Fully Polynomial-Time Approximation Algorithm for Computing a Stationary Point of the General Linear Complementarity Problem

This is a preview. Log in through your library . Abstract We apply a potential reduction algorithm to solve the general linear complementarity problem (GLCP) minimize ...