Image de couverture de livre

How hard is learning to cut? Trade-offs and sample complexity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Khalife, Sammy, Lodi, Andrea
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Sample Complexity of Algorithm Selection Using Neural Networks and Its Applications to Branch-and-Cut
par: Cheng, Hongyu, et autres
Publié: (2024)

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
par: Liu, Jiachang, et autres
Publié: (2026)

An improved column-generation-based matheuristic for learning classification trees
par: Patel, Krunal Kishor, et autres
Publié: (2023)

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
par: Liu, Jiachang, et autres
Publié: (2025)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
par: Lodi, Andrea, et autres
Publié: (2019)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
par: Liu, Jiachang, et autres
Publié: (2026)

Reinforcement Learning for Corporate Bond Trading: A Sell Side Perspective
par: Atkins, Samuel, et autres
Publié: (2024)

The Differentiable Feasibility Pump
par: Cacciola, Matteo, et autres
Publié: (2024)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
par: Messana, Rosario, et autres
Publié: (2024)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
par: Scavuzzo, Lara, et autres
Publié: (2024)

Batched First-Order Methods for Parallel LP Solving in MIP
par: Blin, Nicolas, et autres
Publié: (2026)

Solving Max-Cut to Global Optimality via Feasibility-Preserving Graph Neural Networks
par: Chen, Hao, et autres
Publié: (2026)

SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
par: Francobaldi, Matteo, et autres
Publié: (2025)

When to Forget? Complexity Trade-offs in Machine Unlearning
par: Van Waerebeke, Martin, et autres
Publié: (2025)

Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
par: Liang, Jiaqi, et autres
Publié: (2024)

Trade-off in Estimating the Number of Byzantine Clients in Federated Learning
par: Chen, Ziyi, et autres
Publié: (2025)

The Sample-Communication Complexity Trade-off in Federated Q-Learning
par: Salgia, Sudeep, et autres
Publié: (2024)

A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage
par: Bach, Francis
Publié: (2025)

How to unlearn a learned Machine Learning model ?
par: Achour, Seifeddine
Publié: (2024)

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints
par: Wen, Yilin, et autres
Publié: (2026)

Online Experimental Design With Estimation-Regret Trade-off Under Network Interference
par: Zhang, Zhiheng, et autres
Publié: (2024)

Optimization Trade-offs in Asynchronous Federated Learning: A Stochastic Networks Approach
par: Alahyane, Abdelkrim, et autres
Publié: (2026)

Convergence and stability of Q-learning in Hierarchical Reinforcement Learning
par: Manenti, Massimiliano, et autres
Publié: (2025)

How Neural Networks Learn the Support is an Implicit Regularization Effect of SGD
par: Beneventano, Pierfrancesco, et autres
Publié: (2024)

Finite sample learning of moving targets
par: Vertovec, Nikolaus, et autres
Publié: (2024)

Pinet: Optimizing hard-constrained neural networks with orthogonal projection layers
par: Grontas, Panagiotis D., et autres
Publié: (2025)

Equity-Transformer: Solving NP-hard Min-Max Routing Problems as Sequential Generation with Equity Context
par: Son, Jiwoo, et autres
Publié: (2023)

The impact of machine learning forecasting on strategic decision-making for Bike Sharing Systems
par: Angelelli, Enrico, et autres
Publié: (2026)

Meta-learning for sample-efficient Bayesian optimisation of fed-batch processes
par: Langdon, Becky, et autres
Publié: (2026)

Derivative-free tree optimization for complex systems
par: Wei, Ye, et autres
Publié: (2024)

On characterizing optimal learning trajectories in a class of learning problems
par: Befekadu, Getachew K
Publié: (2025)

Improved sampling via learned diffusions
par: Richter, Lorenz, et autres
Publié: (2023)

Embedding generalization within the learning dynamics: An approach based-on sample path large deviation theory
par: Befekadu, Getachew K.
Publié: (2024)

Surrogate-assisted multi-objective design of complex multibody systems
par: Amakor, Augustina C., et autres
Publié: (2024)

Accelerated windowing for the crew rostering problem with machine learning
par: Racette, Philippe, et autres
Publié: (2025)

Convergence and complexity of block majorization-minimization for constrained block-Riemannian optimization
par: Li, Yuchen, et autres
Publié: (2023)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
par: Li, Shuyao, et autres
Publié: (2023)

Counterfactual optimization for fault prevention in complex wind energy systems
par: Carrizosa, Emilio, et autres
Publié: (2025)

Restarted contractive operators to learn at equilibrium
par: Davy, Leo, et autres
Publié: (2025)

What is the objective of reasoning with reinforcement learning?
par: Davis, Damek, et autres
Publié: (2025)