arXiv Machine Learning
Reinforcement Learning-Guided Graph Transformations for SpTRSV Optimization
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
Hugging Face Trending Papers
3d ago
Reinforcement Learning-Guided Graph Transformations for SpTRSV Optimization
Sparse triangular solve (SpTRSV) is a fundamental kernel in numerous scientific and engineering applications. However, the data dependencies inherent in sparse triangular matrices significantly limit...
arXiv Machine Learning
Aug 17
Learning-Guided Sparsification of Dynamic Graphs in Robotic Exploration
arXiv:2604. 16509v2 Announce Type: replace-cross Abstract: Many robotic exploration algorithms rely on graph structures for frontier-based exploration and dynamic path planning.
arXiv AI
Jun 4
Outcome-Based RL Provably Leads Transformers to Reason, but Only With the Right Data
arXiv:2601. 15158v4 Announce Type: replace-cross Abstract: Transformers trained via Reinforcement Learning (RL) with outcome-based supervision can spontaneously develop the ability to generate intermediate reasoning steps (Chain-of-Thought).
arXiv AI
Jun 16
StarOR: Synergizing Tree Search and Test-Time Reinforcement Learning for Optimization Modeling
arXiv:2606. 15197v1 Announce Type: cross Abstract: Optimization modeling is inherently hierarchical, requiring a precise sequence of symbolic commitments.
arXiv Machine Learning
Aug 11
Beyond Binary: Continuous State Optimization with Graph-Structured Objectives
arXiv:2608. 09366v1 Announce Type: new Abstract: Large-scale learning systems often face the challenge of balancing multiple, potentially competing objectives, such as fairness, accuracy, and latency.
arXiv Machine Learning
Sep 23
Deep Reinforcement Learning on Item-Compatibility Graphs for One-Dimensional Bin Packing
The paper introduces a novel end‑to‑end, size‑agnostic graph reinforcement learning framework for the one‑dimensional bin packing problem (1D‑BPP). It models packing as a Markov decision process on an item‑compatibility graph, where a graph neural network actor‑critic policy learns to merge compatible partial bins. Empirical results on the BPPLIB benchmark show that the learned policy reduces the mean optimality gap of a constructive heuristic from 2.66 % to 2.31 %, performs competitively against other learned methods, and outperforms a state‑of‑the‑art learned solver on the hardest benchmark family.