:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Bouffard, Alix, Breen, Jane
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Machine Learning
Online Access:	https://arxiv.org/abs/2509.01607
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Reinforcement learning for graph theory, I. Reimplementation of Wagner's approach
by: Ghebleh, Mohammad, et al.
Published: (2024)

RLGT: A reinforcement learning framework for extremal graph theory
by: Damnjanović, Ivan, et al.
Published: (2026)

Complex non-backtracking matrix for directed graphs
by: Sando, Keishi, et al.
Published: (2025)

Tropical Bisectors and Carlini-Wagner Attacks
by: Grindstaff, Gillian, et al.
Published: (2025)

Estimating the stability number of a random graph using convolutional neural networks
by: Davila, Randy
Published: (2024)

Gotta match 'em all: Solution diversification in graph matching matched filters
by: Li, Zhirui, et al.
Published: (2023)

Low-degree learning and the metric entropy of polynomials
by: Eskenazis, Alexandros, et al.
Published: (2022)

Bounds on the price of feedback for mistake-bounded online learning
by: Geneson, Jesse, et al.
Published: (2024)

An AI enhanced approach to the tree unimodality conjecture
by: Ramos, Eric, et al.
Published: (2025)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
by: Nagda, Ansh, et al.
Published: (2025)

Quality control in sublinear time: a case study via random graphs
by: Marcussen, Cassandra, et al.
Published: (2025)

On defining Kemeny's constant for non-backtracking random walks
by: Breen, Jane, et al.
Published: (2025)

Towards a General Framework for Predicting and Explaining the Hardness of Graph-based Combinatorial Optimization Problems using Machine Learning and Association Rule Mining
by: Sharman, Bharat, et al.
Published: (2025)

Neural Discovery in Mathematics: Do Machines Dream of Colored Planes?
by: Mundinger, Konrad, et al.
Published: (2025)

Optimal Mistake Bounds for Transductive Online Learning
by: Chase, Zachary, et al.
Published: (2025)

A Multi-Level Framework for Multi-Objective Hypergraph Partitioning: Combining Minimum Spanning Tree and Proximal Gradient
by: Li, Yingying, et al.
Published: (2025)

Generating Hadamard matrices with transformers
by: Williamson, Geordie, et al.
Published: (2026)

Adaptive Threshold-Driven Continuous Greedy Method for Scalable Submodular Optimization
by: Rostami, Mohammadreza, et al.
Published: (2026)

Theoretical Insights into Line Graph Transformation on Graph Learning
by: Yang, Fan, et al.
Published: (2024)

Invariant-Based Diagnostics for Graph Benchmarks
by: von Moos, Richard, et al.
Published: (2026)

An Optimal Sauer Lemma Over $k$-ary Alphabets
by: Hanneke, Steve, et al.
Published: (2026)

CSGO: Constrained-Softassign Gradient Optimization For Large Graph Matching
by: Shen, Binrui, et al.
Published: (2022)

Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them
by: Hordan, Snir, et al.
Published: (2026)

A classification model based on a population of hypergraphs
by: Barton, Samuel, et al.
Published: (2024)

Neural Algorithmic Reasoning for Approximate $k$-Coloring with Recursive Warm Starts
by: Vanderbush, Knut, et al.
Published: (2026)

Mildly Overparameterized ReLU Networks Have a Favorable Loss Landscape
by: Karhadkar, Kedar, et al.
Published: (2023)

Heating Up Quasi-Monte Carlo Graph Random Features: A Diffusion Kernel Perspective
by: Feinberg, Brooke, et al.
Published: (2024)

Scalable Structure Learning for Sparse Context-Specific Systems
by: Rios, Felix Leopoldo, et al.
Published: (2024)

Signed graphs in data sciences via communicability geometry
by: Diaz-Diaz, Fernando, et al.
Published: (2024)

Calculating the maximum number of maximum cliques for simple graphs
by: Pfeifer, Dániel
Published: (2023)

Reinforcement learning for graph theory, II. Small Ramsey numbers
by: Ghebleh, Mohammad, et al.
Published: (2024)

Weighted Random Dot Product Graphs
by: Marenco, Bernardo, et al.
Published: (2025)

Spectral Structure in Finite Free Information Inequalities and $p$-Stam Phase Transitions
by: Hashemi, Baran
Published: (2026)

Holographic functions and neural networks
by: Szegedy, Balazs
Published: (2026)

Polynomially Over-Parameterized Convolutional Neural Networks Contain Structured Strong Winning Lottery Tickets
by: da Cunha, Arthur, et al.
Published: (2023)

A Note on Asynchronous Challenges: Unveiling Formulaic Bias and Data Loss in the Hayashi-Yoshida Estimator
by: Georgiadis, Evangelos
Published: (2024)

Sparse random hypergraphs: Non-backtracking spectra and community detection
by: Stephan, Ludovic, et al.
Published: (2022)

CayleyPy Growth: Efficient growth computations and hundreds of new conjectures on Cayley graphs (Brief version)
by: Chervov, A., et al.
Published: (2025)

What makes math problems hard for reinforcement learning: a case study
by: Shehper, Ali, et al.
Published: (2024)

CayleyPy RL: Pathfinding and Reinforcement Learning on Cayley Graphs
by: Chervov, A., et al.
Published: (2025)