All articles
arxiv arXiv cs.LG · 5h ago

Polynomial Kolmogorov-Arnold Networks Learn Game of Life Dynamics

This study demonstrates that neural networks can reliably learn Conway's Game of Life dynamics using minimal architectures by employing specific inductive biases rather than relying on large-scale search processes. The authors show that network variants with alternative activation functions significantly outperform standard Rectified Linear Units, particularly through the use of second-degree polynomial activations.

arxiv arXiv cs.LG · 5h ago

Quantifying Agreement Between Data-Influence and Data-Similarity in LLMs

This study quantifies the agreement between data-similarity and data-influence measures used for tracing LLM outputs back to training data, revealing a significant overlap with an asymmetry where data-influence ranks top similar documents more consistently. Experiments across models including OLMo2-1B, Qwen3-1.7B, LlaMa3.2-1B, Gemma3-1B, and GPT2 demonstrate that this asymmetry allows for a favorable cost-accuracy trade-off by using data-influence to refine cheaper data-similarity results.

arxiv arXiv cs.LG · 6h ago

Learning Process Rewards via Success Visitation Matching for Efficient RL

The authors propose a method to transform inherently sparse outcome rewards in reinforcement learning into dense process rewards by training a discriminator to distinguish between successful and unsuccessful episodes. This approach incentivizes the policy to match the state-action visitations of successful episodes while avoiding those of unsuccessful ones, providing dense feedback on progress without altering the optimal policy.