Image de couverture de livre

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hertrich, Christoph, Skutella, Martin
Format:	Preprint
Publié:	2020
Sujets:	Machine Learning Computational Complexity Discrete Mathematics Neural and Evolutionary Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards Lower Bounds on the Depth of ReLU Neural Networks
par: Hertrich, Christoph, et autres
Publié: (2021)

Parameterized Hardness of Zonotope Containment and Neural Network Verification
par: Froese, Vincent, et autres
Publié: (2025)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
par: Stargalla, Moritz, et autres
Publié: (2025)

Depth-Bounds for Neural Networks via the Braid Arrangement
par: Grillo, Moritz, et autres
Publié: (2025)

Nearest Neighbor Representations of Neural Circuits
par: Kilic, Kordag Mehmet, et autres
Publié: (2024)

Better Neural Network Expressivity: Subdividing the Simplex
par: Bakaev, Egor, et autres
Publié: (2025)

On the Depth of Monotone ReLU Neural Networks and ICNNs
par: Bakaev, Egor, et autres
Publié: (2025)

Nearest Neighbor Representations of Neurons
par: Kilic, Kordag Mehmet, et autres
Publié: (2024)

ReLU Neural Networks of Polynomial Size for Exact Maximum Flow Computation
par: Hertrich, Christoph, et autres
Publié: (2021)

Complexity of Injectivity and Verification of ReLU Neural Networks
par: Froese, Vincent, et autres
Publié: (2024)

Decomposition Polyhedra of Piecewise Linear Functions
par: Brandenburg, Marie-Charlotte, et autres
Publié: (2024)

Training Fully Connected Neural Networks is $\exists\mathbb{R}$-Complete
par: Bertschinger, Daniel, et autres
Publié: (2022)

Training Neural Networks is NP-Hard in Fixed Dimension
par: Froese, Vincent, et autres
Publié: (2023)

Weisfeiler-Leman at the margin: When more expressivity matters
par: Franks, Billy J., et autres
Publié: (2024)

Items or Relations -- what do Artificial Neural Networks learn?
par: Krause, Renate, et autres
Publié: (2024)

Neural Networks and (Virtual) Extended Formulations
par: Hertrich, Christoph, et autres
Publié: (2024)

Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent Geometries
par: Borde, Haitz Sáez de Ocáriz, et autres
Publié: (2023)

Neural Spacetimes for DAG Representation Learning
par: Borde, Haitz Sáez de Ocáriz, et autres
Publié: (2024)

Arithmetic Circuits and Neural Networks for Regular Matroids
par: Hertrich, Christoph, et autres
Publié: (2025)

A Denoising Diffusion-Based Evolutionary Algorithm Framework: Application to the Maximum Independent Set Problem
par: Soler, Joan Salvà, et autres
Publié: (2025)

Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey
par: Talbi, El-Ghazali
Publié: (2024)

Future Directions in the Theory of Graph Machine Learning
par: Morris, Christopher, et autres
Publié: (2024)

Approximately Optimal Search on a Higher-dimensional Sliding Puzzle
par: Merleau, Nono SC, et autres
Publié: (2024)

Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS
par: Guigues, Laurent
Publié: (2026)

A reinforcement learning guided hybrid evolutionary algorithm for the latency location routing problem
par: Zou, Yuji, et autres
Publié: (2024)

Covered Forest: Fine-grained generalization analysis of graph neural networks
par: Vasileiou, Antonis, et autres
Publié: (2024)

Non-Spatial Hash Chemistry as a Minimalistic Open-Ended Evolutionary System
par: Sayama, Hiroki
Publié: (2024)

A Memetic Algorithm To Find a Hamiltonian Cycle in a Hamiltonian Graph
par: Ali, Sarwan, et autres
Publié: (2024)

High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study
par: Junior, Carlos Alberto da Silva, et autres
Publié: (2024)

PARWiS: Winner determination under shoestring budgets using active pairwise comparisons
par: Bhandari, Shailendra
Publié: (2026)

Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
par: Bournez, Olivier
Publié: (2026)

Mistake-bounded online learning with operation caps
par: Geneson, Jesse, et autres
Publié: (2025)

Quantization in Spiking Neural Networks
par: Moser, Bernhard A., et autres
Publié: (2023)

Local search for valued constraint satisfaction parameterized by treedepth
par: Kaznatcheev, Artem
Publié: (2024)

Comparing Quantum Annealing and Spiking Neuromorphic Computing for Sampling Binary Sparse Coding QUBO Problems
par: Henke, Kyle, et autres
Publié: (2024)

On the Expressibility of the Reconstructional Color Refinement
par: Arvind, V., et autres
Publié: (2024)

Property Testing in Bounded Degree Hypergraphs
par: Aaronson, Hugo, et autres
Publié: (2025)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

Mode Connectivity in Auction Design
par: Hertrich, Christoph, et autres
Publié: (2023)

Position: Scaling LLM Agents Requires Asymptotic Analysis with LLM Primitives
par: Meyerson, Elliot, et autres
Publié: (2025)