:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Cacciola, Matteo, Forel, Alexandre, Frangioni, Antonio, Lodi, Andrea
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Machine Learning
Accesso online:	https://arxiv.org/abs/2411.03535
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

The Algorithm Configuration Problem
di: Iommazzo, Gabriele, et al.
Pubblicazione: (2024)

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

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

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

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

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

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

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

The Ellipsoidal Separation Machine
di: Frangioni, Antonio, et al.
Pubblicazione: (2025)

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

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

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

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

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

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

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

Evaluation of Electricity Market Clearing Mechanisms via Reinforcement Learning: Prices, Remuneration and Competitive Dynamics
di: Altamura, Andrea, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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

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

Real-time optimal control of high-dimensional parametrized systems by deep learning-based reduced order models
di: Tomasetto, Matteo, et al.
Pubblicazione: (2024)