:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Sando, Keishi, Hino, Hideitsu
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Machine Learning
Online Access:	https://arxiv.org/abs/2507.12503
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

From DPPs to $k$-DPPs: identifiability analysis via spectral decomposition
by: Hino, Hideitsu, et al.
Published: (2026)

A Family of Distributions of Random Subsets for Controlling Positive and Negative Dependence
by: Kawashima, Takahiro, et al.
Published: (2024)

Gradual Domain Adaptation via Normalizing Flows
by: Sagawa, Shogo, et al.
Published: (2022)

Misspecifying non-compensatory as compensatory IRT: analysis of estimated skills and variance
by: Tamano, Hiroshi, et al.
Published: (2025)

A Short Survey on Importance Weighting for Machine Learning
by: Kimura, Masanari, et al.
Published: (2024)

Duality induced by an embedding structure of determinantal point process
by: Hino, Hideitsu, et al.
Published: (2024)

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

Sobolev--Ricci Curvature
by: Iwasaki, Kyoichi, et al.
Published: (2026)

Defective eigenvalues of the non-backtracking matrix
by: Heysse, Kristin, et al.
Published: (2024)

Scalable Sobolev IPM for Probability Measures on a Graph
by: Le, Tam, et al.
Published: (2025)

Generalized Sobolev IPM for Graph-Based Measures
by: Le, Tam, et al.
Published: (2025)

An $(ε,δ)$-accurate level set estimation with a stopping criterion
by: Ishibashi, Hideaki, et al.
Published: (2025)

An Efficient Orlicz-Sobolev Approach for Transporting Unbalanced Measures on a Graph
by: Le, Tam, et al.
Published: (2025)

Reinforcement learning for graph theory, Parallelizing Wagner's approach
by: Bouffard, Alix, et al.
Published: (2025)

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

Non-backtracking eigenvalues and eigenvectors of random regular graphs and hypergraphs
by: Zhu, Xiangyi, et al.
Published: (2023)

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

On the Architectural Complexity of Neural Networks
by: Cooper, Nicholas J., et al.
Published: (2026)

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

The limit theorem with respect to the matrices on non-backtracking paths of a graph
by: Hasegawa, Takehiro, et al.
Published: (2020)

Orientations of graphs omitting non-edge-critical directed graphs
by: Sheats, Hannah
Published: (2025)

Combinatorial Complexes: Bridging the Gap Between Cell Complexes and Hypergraphs
by: Hajij, Mustafa, et al.
Published: (2023)

Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model
by: Fernandez V, Manuel, et al.
Published: (2026)

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

Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization
by: Cohen, Khen, et al.
Published: (2026)

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)