A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
Risk bounds for statistical learning
A strongly polynomial minimum cost circulation algorithm
On a reverse form of the Brascamp-Lieb inequality
Majority gates vs. general weighted threshold gates
Geometric algorithms and combinatorial optimization
A polynomial-time algorithm for learning noisy linear threshold functions
A primal-dual interior point method whose running time depends only on the constraint matrix
A decision-theoretic generalization of on-line learning and an application to boosting
Mathematical problems for the next century
A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
A linear lower bound on the unbounded error probabilistic communication complexity.
Optimal outlier removal in high-dimensional spaces
A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
Towards a Genuinely Polynomial Algorithm for Linear Programming
Finding minimum-cost circulations by canceling negative cycles
Learnability and the Vapnik-Chervonenkis dimension
A theory of the learnable
A simpler and faster strongly polynomial algorithm for generalized flow maximization
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Analysis of Boolean Functions
A strongly polynomial algorithm for linear exchange markets
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
The Paulsen problem, continuous operator scaling, and smoothed analysis
A strongly polynomial algorithm for generalized flow maximization
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
A simple polynomial-time rescaling algorithm for solving linear programs
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents

This page was built for publication: A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning