{"total":31,"rows":[{"id":"2305.05080","title":"Scalable Optimal Transport Methods in Machine Learning: A Contemporary Survey","created":"2023-05-08","cited_by_count":27,"area":null},{"id":"2406.01908","title":"PDHG-Unrolled Learning-to-Optimize Method for Large-Scale Linear Programming","created":"2024-06-04","cited_by_count":17,"area":null},{"id":"2411.01803","title":"Gradient Methods with Online Scaling","created":"2024-11-04","cited_by_count":11,"area":null},{"id":"2111.01842","title":"Coordinate Linear Variance Reduction for Generalized Linear Programming","created":"2021-11-02","cited_by_count":10,"area":null},{"id":"2309.00203","title":"Generalization Bound and Learning Methods for Data-Driven Projections in Linear Programming","created":"2023-09-01","cited_by_count":10,"area":null},{"id":"2512.11087","title":"Clip-and-Verify: Linear Constraint-Driven Domain Clipping for Accelerating Neural Network Verification","created":"2025-12-11","cited_by_count":9,"area":null},{"id":"2310.11845","title":"Accelerate Presolve in Large-Scale Linear Programming via Reinforcement Learning","created":"2023-10-18","cited_by_count":7,"area":null},{"id":"2401.05960","title":"Machine Learning Insides OptVerse AI Solver: Design Principles and Applications","created":"2024-01-11","cited_by_count":7,"area":null},{"id":"2412.09734","title":"MPAX: Mathematical Programming in JAX","created":"2024-12-12","cited_by_count":7,"area":null},{"id":"2509.04524","title":"Provably data-driven projection method for quadratic programming","created":"2025-09-03","cited_by_count":5,"area":null},{"id":"2402.02596","title":"Dual Interior Point Optimization Learning","created":"2024-02-04","cited_by_count":4,"area":null},{"id":"2502.02446","title":"Towards graph neural networks for provably solving convex optimization problems","created":"2025-02-04","cited_by_count":4,"area":null},{"id":"2505.23081","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","created":"2025-05-29","cited_by_count":3,"area":null},{"id":"2506.13150","title":"Federated ADMM from Bayesian Duality","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2510.11227","title":"Enforcing convex constraints in Graph Neural Networks","created":"2025-10-13","cited_by_count":2,"area":null},{"id":"2604.22746","title":"Relaxation-Informed Training of Neural Network Surrogate Models","created":"2026-04-24","cited_by_count":2,"area":null},{"id":"2111.05530","title":"Nearly Optimal Linear Convergence of Stochastic Primal-Dual Methods for Linear Programming","created":"2021-11-10","cited_by_count":1,"area":null},{"id":"2502.09502","title":"Scalable First-order Method for Certifying Optimal k-Sparse GLMs","created":"2025-02-13","cited_by_count":1,"area":null},{"id":"2509.22462","title":"Nonlinear Optimization with GPU-Accelerated Neural Network Constraints","created":"2025-09-26","cited_by_count":1,"area":null},{"id":"2601.16510","title":"Learning to Optimize by Differentiable Programming","created":"2026-01-23","cited_by_count":1,"area":null},{"id":"2601.21990","title":"Batched First-Order Methods for Parallel LP Solving in MIP","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2206.01857","title":"Design and Implementation of an Heuristic-Enhanced Branch-and-Bound Solver for MILP","created":"2022-06-04","cited_by_count":0,"area":null},{"id":"2405.10490","title":"Neural Optimization with Adaptive Heuristics for Intelligent Marketing System","created":"2024-05-17","cited_by_count":0,"area":null},{"id":"2509.02476","title":"Perturbing the Derivative: Wild Refitting for Model-Free Evaluation of Machine Learning Models under Bregman Losses","created":"2025-09-02","cited_by_count":0,"area":null},{"id":"2509.21000","title":"Feature Augmentation of GNNs for ILPs: Local Uniqueness Suffices","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2602.22094","title":"Petri Net Relaxation for Infeasibility Explanation and Sequential Task Planning","created":"2026-02-25","cited_by_count":0,"area":null},{"id":"2605.22188","title":"From Sequential Nodes to GPU Batches: Parallel Branch and Bound for Optimal $k$-Sparse GLMs","created":"2026-05-21","cited_by_count":0,"area":null},{"id":"2606.08638","title":"Parameter Tuning with Generalization Guarantees for GPU-Accelerated Linear Programming","created":"2026-06-07","cited_by_count":0,"area":null},{"id":"2609.08136","title":"GPU-Enabled Large-Scale Optimization Using Randomized Linear Algebra","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.13010","title":"Dual-guided Hierarchical Edge Localization for Large-scale Optimal Transport Across Dimensions","created":"2026-09-11","cited_by_count":0,"area":null},{"id":"2610.04715","title":"GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}