Copertina

Scalable Structure Learning for Sparse Context-Specific Systems

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Rios, Felix Leopoldo, Markham, Alex, Solus, Liam
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Representation of Context-Specific Causal Models with Observational and Interventional Data
di: Duarte, Eliana, et al.
Pubblicazione: (2021)

Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
di: Deligeorgaki, Danai, et al.
Pubblicazione: (2022)

Intervening to Learn and Compose Causally Disentangled Representations
di: Markham, Alex, et al.
Pubblicazione: (2025)

Colored Multiset Eulerian Polynomials
di: Deligeorgaki, Danai, et al.
Pubblicazione: (2024)

Ehrhart theory of cosmological polytopes
di: Bruckamp, Justus, et al.
Pubblicazione: (2024)

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

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

Coarsening Causal DAG Models
di: Madaleno, Francisco, et al.
Pubblicazione: (2026)

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

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

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

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

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

Hyperplane Representations of Interventional Characteristic Imset Polytopes
di: Hollering, Benjamin, et al.
Pubblicazione: (2024)

Interpretable Machine Learning for Kronecker Coefficients
di: Butbaia, Giorgi, et al.
Pubblicazione: (2025)

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

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

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

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

Generating Hadamard matrices with transformers
di: Williamson, Geordie, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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

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

Efficient Algorithms for Learning and Compressing Monophonic Halfspaces in Graphs
di: Bressan, Marco, et al.
Pubblicazione: (2025)

Efficient $1$-bit tensor approximations
di: Riasanovsky, Alex W. Neal, et al.
Pubblicazione: (2024)

Toric Ideals of Characteristic Imsets via Quasi-Independence Gluing
di: Hollering, Benjamin, et al.
Pubblicazione: (2022)

Efficient Dynamic Structured Sparse Training with Learned Shuffles
di: Tyagi, Abhishek, et al.
Pubblicazione: (2025)

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

The Low-Degree Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs
di: Dhawan, Abhishek, et al.
Pubblicazione: (2024)

Noise Sensitivity and Learning Lower Bounds for Hierarchical Functions
di: Li, Rupert, et al.
Pubblicazione: (2025)

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

Weighted Random Dot Product Graphs
di: Marenco, Bernardo, et al.
Pubblicazione: (2025)

Holographic functions and neural networks
di: Szegedy, Balazs
Pubblicazione: (2026)

The Ubiquitous Sparse Matrix-Matrix Products
di: Buluç, Aydın
Pubblicazione: (2025)