Cover Image

Learning Decision-Sufficient Representations for Linear Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ye, Yuhan, Amin, Saurabh, Ozdaglar, Asuman
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control Computational Complexity Machine Learning 90C05 (Primary), 90C60, 68Q32, 90C31, 52B55 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Geometry of Linear Program Compression: An Exact Characterization and Learning Algorithm
by: Ye, Yuhan, et al.
Published: (2026)

Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses
by: Ye, Yuhan
Published: (2026)

On Tail Decay and Moment Estimates of a Condition Number for Random Linear Conic Systems
by: Cheung, Dennis, et al.
Published: (2003)

Efficient Learning for Entropy-Regularized Markov Decision Processes via Multilevel Monte Carlo
by: Meunier, Matthieu, et al.
Published: (2025)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

Blended Conditional Gradients: the unconditioning of conditional gradients
by: Braun, Gábor, et al.
Published: (2018)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

The global convergence time of stochastic gradient descent in non-convex landscapes: Sharp estimates via large deviations
by: Azizian, Waïss, et al.
Published: (2025)

Efficiency and Convergence Insights in Large-Scale Optimization Using the Improved Inexact-Newton-Smart Algorithm and Interior-Point Framework
by: Renani, Neda Bagheri, et al.
Published: (2025)

On the Hardness of Short and Sign-Compatible Circuit Walks
by: Borgwardt, Steffen, et al.
Published: (2024)

Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods
by: Kitaoka, Akira
Published: (2024)

On the Curvature of the Central Path of Linear Programming Theory
by: Dedieu, Jean-Pierre, et al.
Published: (2003)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)

What is the long-run distribution of stochastic gradient descent? A large deviations analysis
by: Azizian, Waïss, et al.
Published: (2024)

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
by: Nozawa, Ryota, et al.
Published: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

Average-case thresholds for exact regularization of linear programs
by: Friedlander, Michael P., et al.
Published: (2025)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

A Comparison of Models for Rolling Stock Scheduling
by: Grimm, Boris, et al.
Published: (2023)

On the Wasserstein alignment problem
by: Pal, Soumik, et al.
Published: (2025)

Machine Learning-Based Model for Postoperative Stroke Prediction in Coronary Artery Disease
by: Pan, Haonan, et al.
Published: (2025)

Proof-Carrying Verification for ReLU Networks via Rational Certificates
by: Gokavarapu, Chandrasekhar
Published: (2025)

An Inexact Feasible Interior Point Method for Linear Optimization with High Adaptability to Quantum Computers
by: Mohammadisiahroudi, Mohammadhossein, et al.
Published: (2023)

Second-order cone programming for distributionally robust compliance optimization of trusses considering input distribution uncertainty
by: Fujiyama, Takumi, et al.
Published: (2025)

Zeroes and Extrema of Functions via Random Measures
by: Micheas, Athanasios Christou
Published: (2025)

Continuity in Parametric Linear Programming
by: Lahiri, Somdeb
Published: (2024)

Constraint Qualification for Generic Parameter Families of Constraints in Optimization
by: Hamada, Naoki, et al.
Published: (2025)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
by: Chu, Hong T. M.
Published: (2026)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Lexicographic Extensions preserve Euclideaness
by: Hochstättler, Winfried, et al.
Published: (2025)

Vertex-shellings of Euclidean Oriented Matroids
by: Hochstättler, Winfried, et al.
Published: (2023)

Developing heuristic solution techniques for large-scale unit commitment models
by: Kempke, Nils-Christian, et al.
Published: (2025)

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

How a Small Amount of Data Sharing Benefits Distributed Optimization and Learning : The Upside of Data Heterogeneity
by: Zhu, Mingxi, et al.
Published: (2022)

Sailing League Problems
by: Schüler, Robert, et al.
Published: (2022)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
by: Kempke, Nils-Christian, et al.
Published: (2025)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
by: Lahiri, Somdeb
Published: (2024)

Scaling limits of multi-period distributionally robust optimization problems
by: Nendel, Max, et al.
Published: (2025)