Imagen de Portada

The Differentiable Feasibility Pump

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cacciola, Matteo, Forel, Alexandre, Frangioni, Antonio, Lodi, Andrea
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles
por: Forel, Alexandre, et al.
Publicado: (2022)

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

Free Lunch in the Forest: Functionally-Identical Pruning of Boosted Tree Ensembles
por: Emine, Youssouf, et al.
Publicado: (2024)

DistrictNet: Decision-aware learning for geographical districting
por: Ahmed, Cheikh, et al.
Publicado: (2024)

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

From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs
por: Liu, Jiachang, et al.
Publicado: (2026)

A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
por: Iommazzo, Gabriele, et al.
Publicado: (2024)

Learning to Configure Mathematical Programming Solvers by Mathematical Programming
por: Iommazzo, Gabriele, et al.
Publicado: (2024)

SMiLE: Provably Enforcing Global Relational Properties in Neural Networks
por: Francobaldi, Matteo, et al.
Publicado: (2025)

Scalable First-order Method for Certifying Optimal k-Sparse GLMs
por: Liu, Jiachang, et al.
Publicado: (2025)

Learning to Handle Parameter Perturbations in Combinatorial Optimization: an Application to Facility Location
por: Lodi, Andrea, et al.
Publicado: (2019)

GPU-friendly and Linearly Convergent First-order Methods for Certifying Optimal $k$-sparse GLMs
por: Liu, Jiachang, et al.
Publicado: (2026)

A Survey of Contextual Optimization Methods for Decision Making under Uncertainty
por: Sadana, Utsav, et al.
Publicado: (2023)

The Algorithm Configuration Problem
por: Iommazzo, Gabriele, et al.
Publicado: (2024)

Solving 0-1 Integer Programs with Unknown Knapsack Constraints Using Membership Oracles
por: Messana, Rosario, et al.
Publicado: (2024)

Bundle Network: a Machine Learning-Based Bundle Method
por: Demelas, Francesca, et al.
Publicado: (2025)

Machine Learning Augmented Branch and Bound for Mixed Integer Linear Programming
por: Scavuzzo, Lara, et al.
Publicado: (2024)

Batched First-Order Methods for Parallel LP Solving in MIP
por: Blin, Nicolas, et al.
Publicado: (2026)

Single- vs. Dual-Policy Reinforcement Learning for Dynamic Bike Rebalancing
por: Liang, Jiaqi, et al.
Publicado: (2024)

An improved column-generation-based matheuristic for learning classification trees
por: Patel, Krunal Kishor, et al.
Publicado: (2023)

A Survey on Design-space Dimensionality Reduction Methods for Shape Optimization
por: Serani, Andrea, et al.
Publicado: (2024)

From Inverse Optimization to Feasibility to ERM
por: Mishra, Saurabh, et al.
Publicado: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
por: Hutchinson, Spencer, et al.
Publicado: (2025)

Conformal Mixed-Integer Constraint Learning with Feasibility Guarantees
por: Ovalle, Daniel, et al.
Publicado: (2025)

Improving Feasibility via Fast Autoencoder-Based Projections
por: Chzhen, Maria, et al.
Publicado: (2026)

The Ellipsoidal Separation Machine
por: Frangioni, Antonio, et al.
Publicado: (2025)

Probabilistic Iterative Hard Thresholding for Sparse Learning
por: Bergamaschi, Matteo, et al.
Publicado: (2024)

Randomized Feasibility Methods for Constrained Optimization with Adaptive Step Sizes
por: Chakraborty, Abhishek, et al.
Publicado: (2026)

FSNet: Feasibility-Seeking Neural Network for Constrained Optimization with Guarantees
por: Nguyen, Hoang T., et al.
Publicado: (2025)

Effective Generation of Feasible Solutions for Integer Programming via Guided Diffusion
por: Zeng, Hao, et al.
Publicado: (2024)

Learning to Optimize for Mixed-Integer Non-linear Programming with Feasibility Guarantees
por: Tang, Bo, et al.
Publicado: (2024)

Recursively Feasible Probabilistic Safe Online Learning with Control Barrier Functions
por: Castañeda, Fernando, et al.
Publicado: (2022)

Koopman Data-Driven Predictive Control with Robust Stability and Recursive Feasibility Guarantees
por: de Jong, Thomas, et al.
Publicado: (2024)

A Hyper-Transformer model for Controllable Pareto Front Learning with Split Feasibility Constraints
por: Tuan, Tran Anh, et al.
Publicado: (2024)

Differentiable Integer Linear Programming is not Differentiable & it's not a mere technical problem
por: Sornwanee, Thanawat
Publicado: (2026)

QCQP-Net: Reliably Learning Feasible Alternating Current Optimal Power Flow Solutions Under Constraints
por: Zeng, Sihan, et al.
Publicado: (2024)

Binary Kernel Logistic Regression: a sparsity-inducing formulation and a convergent decomposition training algorithm
por: Consolo, Antonio, et al.
Publicado: (2025)

Soft regression trees: a model variant and a decomposition training algorithm
por: Consolo, Antonio, et al.
Publicado: (2025)

Wasserstein Barycenter Gaussian Process based Bayesian Optimization
por: Candelieri, Antonio, et al.
Publicado: (2025)

Navigating Demand Uncertainty in Container Shipping: Deep Reinforcement Learning for Enabling Adaptive and Feasible Master Stowage Planning
por: van Twiller, Jaike, et al.
Publicado: (2025)