Copertina

Arithmetic Circuits and Neural Networks for Regular Matroids

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hertrich, Christoph, Kober, Stefan, Loho, Georg
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Combinatorics Computational Complexity Discrete Mathematics Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Neural Networks and (Virtual) Extended Formulations
di: Hertrich, Christoph, et al.
Pubblicazione: (2024)

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

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

Decomposition Polyhedra of Piecewise Linear Functions
di: Brandenburg, Marie-Charlotte, et al.
Pubblicazione: (2024)

Diffusion-Robust Optimization over Graphs
di: Aolaritei, Liviu, et al.
Pubblicazione: (2026)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
di: Ciardo, Lorenzo, et al.
Pubblicazione: (2022)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
di: Cornect, Anders, et al.
Pubblicazione: (2024)

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

Totally $Δ$-modular IPs with two non-zeros in most rows
di: Kober, Stefan
Pubblicazione: (2024)

On complete classes of valuated matroids
di: Husić, Edin, et al.
Pubblicazione: (2021)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
di: Roberson, David E., et al.
Pubblicazione: (2023)

Efficient approximation schemes for scheduling on a stochastic number of machines
di: Epstein, Leah, et al.
Pubblicazione: (2024)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
di: Diaby, Moustapha
Pubblicazione: (2016)

Parameterized Hardness of Zonotope Containment and Neural Network Verification
di: Froese, Vincent, et al.
Pubblicazione: (2025)

On Circuit Diameter Bounds via Circuit Imbalances
di: Dadush, Daniel, et al.
Pubblicazione: (2021)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
di: Figueira, José Rui, et al.
Pubblicazione: (2024)

On the Expressibility of the Reconstructional Color Refinement
di: Arvind, V., et al.
Pubblicazione: (2024)

Total Matching and Subdeterminants
di: Ferrarini, Luca, et al.
Pubblicazione: (2023)

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

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

Maxout Polytopes
di: Balakin, Andrei, et al.
Pubblicazione: (2025)

On the Congruency-Constrained Matroid Base
di: Liu, Siyue, et al.
Pubblicazione: (2023)

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

Sparse Approximation in Lattices and Semigroups
di: Kuhlmann, Stefan, et al.
Pubblicazione: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
di: Aprile, Manuel, et al.
Pubblicazione: (2024)

The Complexity of Blocking All Solutions
di: Grüne, Christoph, et al.
Pubblicazione: (2025)

Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
di: Grüne, Christoph, et al.
Pubblicazione: (2023)

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
di: Grüne, Christoph, et al.
Pubblicazione: (2024)

Valid Cuts for the Design of Potential-based Flow Networks
di: Börner, Pascal, et al.
Pubblicazione: (2025)

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2025)

Simultaneous Network Design with Restricted Link Usage
di: Kakimura, Naonori, et al.
Pubblicazione: (2025)

The Parameterized Complexity of Computing the VC-Dimension
di: Foucaud, Florent, et al.
Pubblicazione: (2025)

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

Bond Polytope under Vertex- and Edge-sums
di: Kolman, Petr, et al.
Pubblicazione: (2026)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
di: Au, Yu Hin, et al.
Pubblicazione: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
di: Au, Yu Hin, et al.
Pubblicazione: (2024)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
di: Au, Yu Hin, et al.
Pubblicazione: (2020)

Nearest Neighbor Representations of Neural Circuits
di: Kilic, Kordag Mehmet, et al.
Pubblicazione: (2024)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
di: Nakajima, Tamio-Vesa, et al.
Pubblicazione: (2025)

Factorization norms and an inverse theorem for MaxCut
di: Balla, Igor, et al.
Pubblicazione: (2025)