Copertina

On the Expressiveness of Rational ReLU Neural Networks With Bounded Depth

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Averkov, Gennadiy, Hojny, Christopher, Merkert, Maximilian
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Topological Expressivity of ReLU Neural Networks
di: Ergen, Ekin, et al.
Pubblicazione: (2023)

Towards Lower Bounds on the Depth of ReLU Neural Networks
di: Hertrich, Christoph, et al.
Pubblicazione: (2021)

On the Depth of Monotone ReLU Neural Networks and ICNNs
di: Bakaev, Egor, et al.
Pubblicazione: (2025)

Complexity of Injectivity and Verification of ReLU Neural Networks
di: Froese, Vincent, et al.
Pubblicazione: (2024)

ReLU Networks for Exact Generation of Similar Graphs
di: Ghafoor, Mamoona, et al.
Pubblicazione: (2026)

The Symmetries of Three-Layer ReLU Networks
di: Gegenfurtner, Johanna Marie, et al.
Pubblicazione: (2026)

Designing ReLU Generative Networks to Enumerate Trees with a Given Tree Edit Distance
di: Ghafoor, Mamoona, et al.
Pubblicazione: (2025)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
di: Stargalla, Moritz, et al.
Pubblicazione: (2025)

Depth-Bounds for Neural Networks via the Braid Arrangement
di: Grillo, Moritz, et al.
Pubblicazione: (2025)

Better Neural Network Expressivity: Subdividing the Simplex
di: Bakaev, Egor, et al.
Pubblicazione: (2025)

Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
di: Zhou, Junru, et al.
Pubblicazione: (2024)

Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks
di: Shafi, Zohair, et al.
Pubblicazione: (2023)

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

On the Expressive Power of Spectral Invariant Graph Neural Networks
di: Zhang, Bohang, et al.
Pubblicazione: (2024)

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

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

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size
di: Hertrich, Christoph, et al.
Pubblicazione: (2020)

On Minimal Depth in Neural Networks
di: Valerdi, Juan L.
Pubblicazione: (2024)

Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
di: Zhang, Bohang, et al.
Pubblicazione: (2024)

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation
di: Kang, Wonwoo, et al.
Pubblicazione: (2024)

An Effective Branch-and-Bound Algorithm with New Bounding Methods for the Maximum $s$-Bundle Problem
di: Xue, Jinghui, et al.
Pubblicazione: (2024)

Deep Learning for Unrelated-Machines Scheduling: Handling Variable Dimensions
di: Hitzges, Diego, et al.
Pubblicazione: (2025)

Feature-Aware (Hyper)graph Generation via Next-Scale Prediction
di: Gailhard, Dorian, et al.
Pubblicazione: (2025)

Polynomial Regret Concentration of UCB for Non-Deterministic State Transitions
di: Cömer, Can, et al.
Pubblicazione: (2025)

Isolation Forest in Novelty Detection Scenario
di: Ulrich, Adam, et al.
Pubblicazione: (2025)

On Local Limits of Sparse Random Graphs: Color Convergence and the Refined Configuration Model
di: Pluska, Alexander, et al.
Pubblicazione: (2025)

HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs
di: Xu, Ning, et al.
Pubblicazione: (2025)

Partial Optimality in Cubic Correlation Clustering for General Graphs
di: Stein, David, et al.
Pubblicazione: (2025)

GraphOmni: A Comprehensive and Extensible Benchmark Framework for Large Language Models on Graph-theoretic Tasks
di: Xu, Hao, et al.
Pubblicazione: (2025)

UniCO: Towards a Unified Model for Combinatorial Optimization Problems
di: Zong, Zefang, et al.
Pubblicazione: (2025)

Graphon Mixtures
di: Kandanaarachchi, Sevvandi, et al.
Pubblicazione: (2025)

Sample compression schemes for balls in graphs
di: Chalopin, Jérémie, et al.
Pubblicazione: (2022)

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
di: Baumann, Philipp, et al.
Pubblicazione: (2026)

MILP-StuDio: MILP Instance Generation via Block Structure Decomposition
di: Liu, Haoyang, et al.
Pubblicazione: (2024)

Adaptive Combinatorial Maximization: Beyond Approximate Greedy Policies
di: Weitzman, Shlomi, et al.
Pubblicazione: (2024)

Machine Learning Optimal Ordering in Global Routing Problems in Semiconductors
di: Choi, Heejin, et al.
Pubblicazione: (2024)

Contradiction Graphs Determine VC Dimension
di: Campbell, Jesse, et al.
Pubblicazione: (2026)

Differentiable Quadratic Optimization For The Maximum Independent Set Problem
di: Alkhouri, Ismail, et al.
Pubblicazione: (2024)

A Unified Approach to Inferring Chemical Compounds with the Desired Aqueous Solubility
di: Batool, Muniba, et al.
Pubblicazione: (2024)

HYGENE: A Diffusion-based Hypergraph Generation Method
di: Gailhard, Dorian, et al.
Pubblicazione: (2024)