Copertina

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cheng, Hongyu, Khalife, Sammy, Fiedorowicz, Barbara, Basu, Amitabh
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Generalization Guarantees for Learning Branch-and-Cut Policies in Integer Programming
di: Cheng, Hongyu, et al.
Pubblicazione: (2025)

Learning Cut Generating Functions for Integer Programming
di: Cheng, Hongyu, et al.
Pubblicazione: (2024)

Theoretical Challenges in Learning for Branch-and-Cut
di: Cheng, Hongyu, et al.
Pubblicazione: (2026)

Sample Complexity of Stochastic Optimization with Integer Variables
di: Cheng, Hongyu, et al.
Pubblicazione: (2026)

How hard is learning to cut? Trade-offs and sample complexity
di: Khalife, Sammy, et al.
Pubblicazione: (2025)

On the power of graph neural networks and the role of the activation function
di: Khalife, Sammy, et al.
Pubblicazione: (2023)

A Semidefinite Programming-Based Branch-and-Cut Algorithm for Biclustering
di: Sudoso, Antonio M.
Pubblicazione: (2024)

Identifying faulty edges in resistive electrical networks
di: Fiedorowicz, Barbara, et al.
Pubblicazione: (2025)

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes
di: Zhou, Duo, et al.
Pubblicazione: (2024)

Learn2Aggregate: Supervised Generation of Chvátal-Gomory Cuts Using Graph Neural Networks
di: Deza, Arnaud, et al.
Pubblicazione: (2024)

Rethinking the Capacity of Graph Neural Networks for Branching Strategy
di: Chen, Ziang, et al.
Pubblicazione: (2024)

Active Learning of Deep Neural Networks via Gradient-Free Cutting Planes
di: Zhang, Erica, et al.
Pubblicazione: (2024)

Variance-Reduced Cascade Q-learning: Algorithms and Sample Complexity
di: Boveiri, Mohammad, et al.
Pubblicazione: (2024)

Geometry of Critical Sets and Existence of Saddle Branches for Two-layer Neural Networks
di: Zhang, Leyang, et al.
Pubblicazione: (2024)

Towards Optimal Branching of Linear and Semidefinite Relaxations for Neural Network Robustness Certification
di: Anderson, Brendon G., et al.
Pubblicazione: (2021)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
di: Chen, Hao, et al.
Pubblicazione: (2026)

Linear Threshold for Oertel's Conjecture on the Mixed-Integer Volume
di: Cheng, Hongyu, et al.
Pubblicazione: (2026)

PER-DPP Sampling Framework and Its Application in Path Planning
di: Wang, Junzhe
Pubblicazione: (2025)

Practical Bayesian Algorithm Execution via Posterior Sampling
di: Cheng, Chu Xin, et al.
Pubblicazione: (2024)

Heuristic Optimal Transport in Branching Networks
di: Andrecut, M.
Pubblicazione: (2023)

Data Clustering and Visualization with Recursive Goemans-Williamson MaxCut Algorithm
di: Ly, An, et al.
Pubblicazione: (2024)

SPABA: A Single-Loop and Probabilistic Stochastic Bilevel Algorithm Achieving Optimal Sample Complexity
di: Chu, Tianshu, et al.
Pubblicazione: (2024)

Online Uniform Sampling: Randomized Learning-Augmented Approximation Algorithms with Application to Digital Health
di: Liu, Xueqing, et al.
Pubblicazione: (2024)

A Universal Transfer Theorem for Convex Optimization Algorithms Using Inexact First-order Oracles
di: Kerger, Phillip, et al.
Pubblicazione: (2024)

A Generic Branch-and-Bound Algorithm for $\ell_0$-Penalized Problems with Supplementary Material
di: Elvira, Clément, et al.
Pubblicazione: (2025)

Towards Guided Descent: Optimization Algorithms for Training Neural Networks At Scale
di: Nagwekar, Ansh
Pubblicazione: (2025)

Neighbor-Sampling Based Momentum Stochastic Methods for Training Graph Neural Networks
di: Noel, Molly, et al.
Pubblicazione: (2025)

An Efficient Spatial Branch-and-Bound Algorithm for Global Optimization of Gaussian Process Posterior Mean Functions
di: Tang, Wei-Ting, et al.
Pubblicazione: (2026)

Sample-Free Safety Assessment of Neural Network Controllers via Taylor Methods
di: Evans, Adam, et al.
Pubblicazione: (2026)

A Learned Proximal Alternating Minimization Algorithm and Its Induced Network for a Class of Two-block Nonconvex and Nonsmooth Optimization
di: Chen, Yunmei, et al.
Pubblicazione: (2024)

A Rolling-Space Branch-and-Price Algorithm for the Multi-Compartment Vehicle Routing Problem with Multiple Time Windows
di: Raqabi, El Mehdi Er, et al.
Pubblicazione: (2026)

Homotopy Relaxation Training Algorithms for Infinite-Width Two-Layer ReLU Neural Networks
di: Yang, Yahong, et al.
Pubblicazione: (2023)

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
di: Livni, Roi
Pubblicazione: (2024)

The Sample Complexity of Parameter-Free Stochastic Convex Optimization
di: Lawrence, Jared, et al.
Pubblicazione: (2025)

Modified Meta-Thompson Sampling for Linear Bandits and Its Bayes Regret Analysis
di: Li, Hao, et al.
Pubblicazione: (2024)

Neural Network Training Techniques Regularize Optimization Trajectory: An Empirical Study
di: Chen, Cheng, et al.
Pubblicazione: (2020)

Verifying Properties of Binary Neural Networks Using Sparse Polynomial Optimization
di: Yang, Jianting, et al.
Pubblicazione: (2024)

Low-Complexity Algorithm for Restless Bandits with Imperfect Observations
di: Liu, Keqin, et al.
Pubblicazione: (2021)

Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates
di: Mana, Kyle, et al.
Pubblicazione: (2023)

Efficient Reachability Analysis for Convolutional Neural Networks Using Hybrid Zonotopes
di: Zhang, Yuhao, et al.
Pubblicazione: (2025)