Tag
This paper revisits the theoretical foundations for detecting commutative factors in factor graphs, correcting a previously mistaken sufficient condition and presenting corrected algorithms.
A video demonstrates an AI that analyzes user search history to generate an algorithm, enabling it to predict and answer questions before they are asked, showcasing surprisingly predictive capabilities.
An article discussing a technique to convert an integer to a decimal string in under two nanoseconds, focusing on performance optimization.
This article explains the technical architecture of a real-time chord recognizer, detailing a four-stage pipeline using pitch-class bitmasks, candidate generation, score normalization, and musical heuristics.
The user observed that the new algorithm on X platform recommends tweets more to people who may interact, resulting in lower traffic but higher interaction rate.
Musk has open-sourced X's (formerly Twitter) For You recommendation algorithm on GitHub. The algorithm uses a Grok-based transformer to predict user interaction preferences.
Elon Musk announces monthly open-source updates of the X (formerly Twitter) algorithm on GitHub with release notes, inviting critique and reminding users they can opt out of the algorithm via the Following tab.
A creator describes how Twitter's algorithm drastically reduces reach after a viral post, with a 85-95% drop in metrics, and asks for transparency on how to recover from this suppression.
This article describes a constant-space linear-time algorithm using a min-priority queue to delete all but the 10 most recent files in a directory, avoiding the O(n) space of sorting all entries.
This paper introduces DOSER, a framework using diffusion models for out-of-distribution detection and selective regularization in offline reinforcement learning. It aims to improve performance on static datasets by distinguishing between beneficial and detrimental OOD actions.
This paper introduces a composite-move Tabu search algorithm for spatial redistricting that improves solution quality and efficiency while preserving contiguity constraints.
An interactive web application designed to visualize the Shunting Yard algorithm, though the provided content suggests the demo may be non-functional.
A single-pass method combines online k-means palette refinement with ordered Bayer dithering, eliminating the separate pixel-mapping step and yielding slight speedups while producing visually interesting results.
An AI coding contest compares Claude and Gemini on a weighted knight's tour problem variant where the cost of each move depends on accumulated load from visited squares.
OpenAI researchers introduce E-MAML and E-RL², two meta-reinforcement learning algorithms designed to improve exploration in tasks where discovering optimal policies requires significant exploration. The work demonstrates these algorithms' effectiveness on novel environments including Krazy World and maze tasks.