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

Cites work

scientific article; zbMATH DE number 1332320 (Why is no real title available?)
scientific article; zbMATH DE number 1049353 (Why is no real title available?)
scientific article; zbMATH DE number 3314813 (Why is no real title available?)
A Faster Strongly Polynomial Minimum Cost Flow Algorithm
A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
A decision-theoretic generalization of on-line learning and an application to boosting
A deterministic algorithm for approximating the mixed discriminant and mixed volume, and a combinatorial corollary
A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
A linear lower bound on the unbounded error probabilistic communication complexity.
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 scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
A simple polynomial-time rescaling algorithm for solving 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 a class of minimum-cost flow problems with separable convex objectives
A strongly polynomial algorithm for generalized flow maximization
A strongly polynomial algorithm for linear exchange markets
A strongly polynomial minimum cost circulation algorithm
A theory of the learnable
An introduction to support vector machines and other kernel-based learning methods.
Analysis of Boolean Functions
Finding minimum-cost circulations by canceling negative cycles
Geometric algorithms and combinatorial optimization
Learnability and the Vapnik-Chervonenkis dimension
Majority gates vs. general weighted threshold gates
Mathematical problems for the next century
On a reverse form of the Brascamp-Lieb inequality
Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing
Optimal outlier removal in high-dimensional spaces
Recent progress on scaling algorithms and applications
Relaxation, new combinatorial and polynomial algorithms for the linear feasibility problem
Risk bounds for statistical learning
Superquadratic lower bound for 3-query locally correctable codes over the reals
The Paulsen problem made simple
The Paulsen problem, continuous operator scaling, and smoothed analysis
Towards a Genuinely Polynomial Algorithm for Linear Programming

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)