Cover Image

BLISS: Bandit Layer Importance Sampling Strategy for Efficient Training of Graph Neural Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alsaqa, Omar, Hoang, Linh Thi, Balin, Muhammed Fatih
Format:	Preprint
Published:	2025
Subjects:	Machine Learning Artificial Intelligence Social and Information Networks Optimization and Control 68T05, 05C85, 62L05, 68T07 I.2.6; G.2.2; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Scaling Higher-Order Graph Learning with Maximal Clique Complexes
by: Vialle, Antoine, et al.
Published: (2026)

Understanding and Tackling Over-Dilution in Graph Neural Networks
by: Lee, Junhyun, et al.
Published: (2025)

Caterpillar GNN: Replacing Message Passing with Efficient Aggregation
by: Černý, Marek
Published: (2025)

Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)

Exact Algorithms for MaxCut on Split Graphs
by: Lalovic, Marko
Published: (2024)

Batched Nonparametric Bandits via k-Nearest Neighbor UCB
by: Arya, Sakshi
Published: (2025)

A Systematic Evaluation Protocol of Graph-Derived Signals for Tabular Machine Learning
by: Heidrich, Mario, et al.
Published: (2026)

Emotion-Inspired Learning Signals (EILS): A Homeostatic Framework for Adaptive Autonomous Agents
by: Tiwari, Dhruv
Published: (2025)

Implicit Bias and Invariance: How Hopfield Networks Efficiently Learn Graph Orbits
by: Murray, Michael, et al.
Published: (2025)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Unlocking Advanced Graph Machine Learning Insights through Knowledge Completion on Neo4j Graph Database
by: Napoli, Rosario, et al.
Published: (2025)

Primal-Dual Sample Complexity Bounds for Constrained Markov Decision Processes with Multiple Constraints
by: Buckley, Max, et al.
Published: (2025)

Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026)

DAG Scheduling in the BSP Model
by: Papp, Pál András, et al.
Published: (2023)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
by: Haslebacher, Sebastian
Published: (2025)

A Constant-factor Approximation for Weighted Bond Cover
by: Kim, Eun Jung, et al.
Published: (2021)

Shortest two disjoint paths in conservative graphs
by: Schlotter, Ildikó
Published: (2023)

Can Computational Reducibility Lead to Transferable Models for Graph Combinatorial Optimization?
by: Cantürk, Semih, et al.
Published: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
by: Krishnaswamy, Ravishankar, et al.
Published: (2014)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

T3former: Temporal Graph Classification with Topological Machine Learning
by: Uddin, Md. Joshem, et al.
Published: (2025)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
by: Huber, Michael Kiran
Published: (2024)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)

Ember: An Extensible Benchmark Suite for Quantum Annealing Embedding Algorithms
by: Macaskill-Smith, Zachary, et al.
Published: (2026)

Identification to Subclasses of Chordal Graphs
by: Golovach, Petr A., et al.
Published: (2026)

Graph modification of bounded size to minor-closed classes as fast as vertex deletion
by: Morelle, Laure, et al.
Published: (2025)

Sparse Knowledge Distillation: A Mathematical Framework for Probability-Domain Temperature Scaling and Multi-Stage Compression
by: Flouro, Aaron R., et al.
Published: (2026)

Traffic-Oblivious Multi-Commodity Flow Network Design
by: Chimani, Markus, et al.
Published: (2025)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)

Recognizing Penny and Marble Graphs is Hard for Existential Theory of the Reals
by: Lubiw, Anna, et al.
Published: (2025)

On the Diameter of Arrangements of Topological Disks
by: Abiad, Aida, et al.
Published: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
by: Sau, Ignasi, et al.
Published: (2026)

SLEAN: Simple Lightweight Ensemble Analysis Network for Multi-Provider LLM Coordination: Design, Implementation, and Vibe Coding Bug Investigation Case Study
by: Vargas, Matheus J. T.
Published: (2025)

Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
by: Zhang, Wenjing, et al.
Published: (2025)

Dynamic programming on bipartite tree decompositions
by: Jaffke, Lars, et al.
Published: (2023)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Synthetic data for ratemaking: imputation-based methods vs adversarial networks and autoencoders
by: Havrylenko, Yevhen, et al.
Published: (2025)