paper-with-me

홈 › Papers

A Polylog Pivot Steps Simplex Algorithm for Classification

2012-12-01 · NeurIPS 2012 12 · Elad Hazan, Zohar Karnin

We present a simplex algorithm for linear programming in a linear classification formulation. The paramount complexity parameter in linear classification problems is called the margin. We prove that for margin values of practical interest our simplex variant performs a polylogarithmic number of pivot steps in the worst case, and its overall running time is near linear. This is in contrast to general linear programming, for which no sub-polynomial pivot rule is known.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

ClassificationGeneral Classification

Similar Papers 제목 키워드 기반

DeepSimplex: Reinforcement Learning of Pivot Rules Improves the Efficiency of Simplex Algorithm in Solving Linear Programming Problems

2019-09-25 · Varun Suriyanarayana, Onur Tavaslioglu, Ankit B. Patel, Andrew J. Schaefer

Linear Programs (LPs) are a fundamental class of optimization problems with a wide variety of applications. Fast algorithms for solving LPs are the workhorse of many combinatorial optimization algorithms, especially thos…

Combinatorial OptimizationTraveling Salesman Problem

High-accuracy sampling for diffusion models and log-concave distributions

2026-02-01 · Fan Chen, Sinho Chewi, Constantinos Daskalakis, Alexander Rakhlin arxiv

We present algorithms for diffusion model sampling which obtain $δ$-error in $\mathrm{polylog}(1/δ)$ steps, given access to $\widetilde O(δ)$-accurate score estimates in $L^2$. This is an exponential improvement over all…

(Machine) Learning to Improve the Empirical Performance of Discrete Algorithms

2021-09-29 · Imran Adham, Jesus De Loera, Zhenyang Zhang

This paper discusses a data-driven, empirically-based framework to make algorithmic decisions or recommendations without expert knowledge. We improve the performance of two algorithmic case studies: the selection of a pi…

BIG-bench Machine Learning

Convex optimization over a probability simplex

2023-05-15 · James Chok, Geoffrey M. Vasil

We propose a new iteration scheme, the Cauchy-Simplex, to optimize convex problems over the probability simplex $\{w\in\mathbb{R}^n\ |\ \sum_i w_i=1\ \textrm{and}\ w_i\geq0\}$. Specifically, we map the simplex to the pos…

The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems

2014-05-30 · Carsten Gottschlich, Dominic Schuhmacher

Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is use…

Content-Based Image RetrievalImage RetrievalObject TrackingRetrieval