← Back to all news
arXiv Machine Learning By Xiaoan Xu, Ethan X. Fang, Jesus A. De Loera, Junwei Lu, Luze Xu

RadonBench: A Benchmark of Classical and Learning-Guided Search Techniques for Problems in Combinatorial Geometry

Read the original on arXiv Machine Learning →

arXiv:2610. 33259v1 Announce Type: new Abstract: Classical optimization and learning-guided search offer complementary approaches to open problems in discrete mathematics, but their outputs are difficult to compare when search spaces, validity checks, and stopping rules differ.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

Hugging Face Trending Papers
Jun 24

Geometry-Aware MCTS for Extremal Problems in Combinatorial Geometry

We study certain extremal problems in combinatorial geometry that ask about configurations of points in an $n \times n$ grid that satisfy strict, global geometric constraints. Classical exact solvers suffer from combinatorial explosion for these types of problems, and standard reinforcement learning and transformer-based models struggle with the sparse reward "validity cliff" and quadratic token-consumption limits.

llmsreinforcement-learningefficiency
More like this →
arXiv Machine Learning
Jun 30

Actively Learning Halfspaces without Synthetic Data

arXiv:2509. 20848v2 Announce Type: replace-cross Abstract: In the classic point location problem, one is given an arbitrary dataset $X \subset \mathbb{R}^d$ of $n$ points with query access to an unknown halfspace $f : \mathbb{R}^d \to \{0,1\}$, and the goal is to learn the label of every point in $X$.

By Hadley Black, Kasper Green Larsen, Arya Mazumdar, Barna Saha, Geelon So
More like this →