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

Cites Work

A decision-theoretic generalization of on-line learning and an application to boosting
An introduction to support vector machines and other kernel-based learning methods.
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
Title not available (Why is that?)
Geometric algorithms and combinatorial optimization
Learnability and the Vapnik-Chervonenkis dimension
Title not available (Why is that?)
Title not available (Why is that?)
Analysis of Boolean Functions
Mathematical problems for the next century
On a reverse form of the Brascamp-Lieb inequality
A theory of the learnable
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
Majority gates vs. general weighted threshold gates
A primal-dual interior point method whose running time depends only on the constraint matrix
A strongly polynomial minimum cost circulation algorithm
Finding minimum-cost circulations by canceling negative cycles
A linear lower bound on the unbounded error probabilistic communication complexity.
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
A simpler and faster strongly polynomial algorithm for generalized flow maximization
A Simpler and Faster Strongly Polynomial Algorithm for Generalized Flow Maximization
A strongly polynomial algorithm for generalized flow maximization
Risk bounds for statistical learning
Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
A polynomial-time algorithm for learning noisy linear threshold functions
A simple polynomial-time rescaling algorithm for solving linear programs
A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
Towards a Genuinely Polynomial Algorithm for Linear Programming
Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling
Optimal outlier removal in high-dimensional spaces
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 a class of minimum-cost flow problems with separable convex objectives
Title not available (Why is that?)
Title not available (Why is that?)
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Title not available (Why is that?)
A strongly polynomial algorithm for linear exchange markets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499337)