首页/论文/2003.08072

arXiv 2003.080722020-03-18cs.DSmath.OC

Speeding up Linear Programming using Randomized Linear Algebra

Agniva Chowdhury, Palma London, Haim Avron, Petros Drineas

英文摘要：

Linear programming (LP) is an extremely useful tool and has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such as combinatorics. It is also used in many machine learning applications, such as $\ell_1$-regularized SVMs, basis pursuit, nonnegative matrix factorization, etc. Interior Point Methods (IPMs) are one of the most popular methods to solve LPs both in theory and in practice. Their underlying complexity is dominated by the cost of solving a system of linear equations at each iteration. In this paper, we consider \emph{infeasible} IPMs for the special case where the number of variables is much larger than the number of constraints. Using tools from Randomized Linear Algebra, we present a preconditioning technique that, when combined with the Conjugate Gradient iterative solver, provably guarantees that infeasible IPM algorithms (suitably modified to account for the error incurred by the approximate solver), converge to a feasible, approximately optimal solution, without increasing their iteration complexity. Our empirical evaluations verify our theoretical results on both real-world and synthetic data.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions

Dynamic programming on tree decompositions is a frequently used approach to solve otherwise intractable problems on instances of small treewidth. In recent work by Bodlaender et al., it was shown that for many connectivity problems, there exist algorithms that use time, linear in the number of vertices, and single exponential in the width of the tree decomposition that is used. The central idea is that it suffices to compute representative sets, and these can be computed efficiently with help of Gaussian elimination. In this paper, we give an experimental evaluation of this technique for the S…

2013-05-31cs.DS

Randomized Linear Programming Solves the Discounted Markov Decision Problem In Nearly-Linear (Sometimes Sublinear) Running Time

We propose a novel randomized linear programming algorithm for approximating the optimal policy of the discounted Markov decision problem. By leveraging the value-policy duality and binary-tree data structures, the algorithm adaptively samples state-action-state transitions and makes exponentiated primal-dual updates. We show that it finds an $ε$-optimal policy using nearly-linear run time in the worst case. When the Markov decision process is ergodic and specified in some special data formats, the algorithm finds an $ε$-optimal policy using run time linear in the total number of state-action …

2017-09-13cs.DSmath.OC

加速 MSM 时间序列距离计算的精确方法与启发式方法

Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation

本文针对 MSM 时间序列距离计算的 Ω(n²) 开销，提出上下界剪枝、常量序列线性算法及多种线性启发式方法，在多数 UCR 数据集上超过现有 MSM 与先进 DTW 实现。

2023-04-20cs.DS

An Improved Deterministic Rescaling for Linear Programming Algorithms

The perceptron algorithm for linear programming, arising from machine learning, has been around since the 1950s. While not a polynomial-time algorithm, it is useful in practice due to its simplicity and robustness. In 2004, Dunagan and Vempala showed that a randomized rescaling turns the perceptron method into a polynomial time algorithm, and later Peña and Soheili gave a deterministic rescaling. In this paper, we give a deterministic rescaling for the perceptron algorithm that improves upon the previous rescaling methods by making it possible to rescale much earlier. This results in a faster …

2016-12-14cs.DSmath.OC

动态规划上的随机舍入

Randomized Rounding over Dynamic Programs

针对解具有动态规划递推关系的问题，提出通过将其转化为网络设计问题并构造强LP松弛进行随机舍入的方法，在额外装箱约束下实现了多项式或准多项式时间的近似保证。

2025-11-05cs.DS

Randomized Self-Assembly for Exact Shapes

Working in Winfree's abstract tile assembly model, we show that a constant-size tile assembly system can be programmed through relative tile concentrations to build an n x n square with high probability, for any sufficiently large n. This answers an open question of Kao and Schweller (Randomized Self-Assembly for Approximate Shapes, ICALP 2008), who showed how to build an approximately n x n square using tile concentration programming, and asked whether the approximation could be made exact with high probability. We show how this technique can be modified to answer another question of Kao and …

2010-07-16cs.CCcs.DS

更多相关论文收起更多论文

Clustering with Semidefinite Programming and Fixed Point Iteration

Brown University（布朗大学）

We introduce a novel method for clustering using a semidefinite programming (SDP) relaxation of the Max k-Cut problem. The approach is based on a new methodology for rounding the solution of an SDP relaxation using iterated linear optimization. We show the vertices of the Max k-Cut relaxation correspond to partitions of the data into at most k sets. We also show the vertices are attractive fixed points of iterated linear optimization. Each step of this iterative process solves a relaxation of the closest vertex problem and leads to a new clustering problem where the underlying clusters are mor…

2022-07-05cs.DScs.LGmath.CO

鲁棒马尔可夫决策过程的线性规划表示与强多项式算法

Linear Programming Representations and Strongly Polynomial Algorithms for Robust Markov Decision Processes

Shanghai Jiao Tong University（上海交通大学）；SIMIS（上海数学与交叉学科研究院）；Stanford University（斯坦福大学）

本文提出鲁棒马尔可夫决策过程的线性规划表示，通过编码鲁棒策略迭代步骤构造单一LP，并给出强多项式算法及改进的复杂度界。

2026-10-02cs.DScs.LGmath.OC

Faster Randomized Interior Point Methods for Tall/Wide Linear Programs

Linear programming (LP) is an extremely useful tool which has been successfully applied to solve various problems in a wide range of areas, including operations research, engineering, economics, or even more abstract mathematical areas such as combinatorics. It is also used in many machine learning applications, such as $\ell_1$-regularized SVMs, basis pursuit, nonnegative matrix factorization, etc. Interior Point Methods (IPMs) are one of the most popular methods to solve LPs both in theory and in practice. Their underlying complexity is dominated by the cost of solving a system of linear equ…

2022-09-23cs.DS

加权树增强问题的一个强线性规划松弛

A Strong Linear Programming Relaxation for Weighted Tree Augmentation

Google Research（谷歌研究院）；EPFL, Switzerland（洛桑联邦理工学院）；Boston University（波士顿大学）

本文提出了一种随机近似算法，用于加权树增强问题，其近似比低于1.49，通过设计并舍入一个强线性规划松弛来实现，该松弛引入了表示边子集和覆盖它们的链接的变量。

2026-03-31cs.DS

Fast Approximations for Metric-TSP via Linear Programming

We develop faster approximation algorithms for Metric-TSP building on recent, nearly linear time approximation schemes for the LP relaxation [Chekuri and Quanrud, 2017]. We show that the LP solution can be sparsified via cut-sparsification techniques such as those of Benczur and Karger [2015]. Given a weighted graph $G$ with $m$ edges and $n$ vertices, and $ε> 0$, our randomized algorithm outputs with high probability a $(1+ε)$-approximate solution to the LP relaxation whose support has $\operatorname{O}(n \log n /ε^2)$ edges. The running time of the algorithm is $\operatorname{Õ}(m/ε^2)$. Thi…

2018-02-05cs.DS

Scaling Structured Inference with Randomization

University of Edinburgh（爱丁堡大学）；Columbia University（哥伦比亚大学）

Deep discrete structured models have seen considerable progress recently, but traditional inference using dynamic programming (DP) typically works with a small number of states (less than hundreds), which severely limits model capacity. At the same time, across machine learning, there is a recent trend of using randomized truncation techniques to accelerate computations involving large sums. Here, we propose a family of randomized dynamic programming (RDP) algorithms for scaling structured models to tens of thousands of latent states. Our method is widely applicable to classical DP-based infer…

2022-07-24cs.CLcs.DScs.LG