• Corpus ID: 246634499

Conditional Gradients for the Approximately Vanishing Ideal

  title={Conditional Gradients for the Approximately Vanishing Ideal},
  author={Elias Samuel Wirth and Sebastian Pokutta},
The vanishing ideal of a set of points X ⊆ R n is the set of polynomials that evaluate to 0 over all points x ∈ X and admits an efficient representation by a finite set of polynomials called generators. To accommodate the noise in the data set, we introduce the Conditional Gradients Approximately Vanishing Ideal algorithm ( CGAVI ) for the construction of the set of generators of the approximately vanishing ideal. The constructed set of generators captures polynomial structures in data and gives… 

Tables from this paper

Monomial-agnostic computation of vanishing ideals
This paper presents the first fully numerical basis computation that efficiently works in a monomial-agnostic manner without suffering from the spurious vanishing problem, which is a fundamental problem in evaluating polynomials to construct bases.
Border basis computation with gradient-weighted normalization
This study is the first to theoretically highlight the crucial effect of scaling in approximate basis computation and presents the utility of data-dependent normalization.


Foundations of Machine Learning
This graduate-level textbook introduces fundamental concepts and methods in machine learning, and provides the theoretical underpinnings of these algorithms, and illustrates key aspects for their application.
Vanishing Component Analysis
An efficient procedure is described and analyzed that constructs a set of generators of a vanishing ideal that captures nonlinear structure in data, and can for example be used within supervised learning.
An algorithm for quadratic programming
Constrained minimization methods
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the The denominator is taking on this, book interested. This book for
On the Global Linear Convergence of Frank-Wolfe Optimization Variants
This paper highlights and clarify several variants of the Frank-Wolfe optimization algorithm that have been successfully applied in practice: away-steps FW, pairwise FW, fully-corrective FW and Wolfe's minimum norm point algorithm, and proves for the first time that they all enjoy global linear convergence, under a weaker condition than strong convexity of the objective.
Constrained minimization methods. USSR Computational mathematics and mathematical physics
  • 1966
Vanishing ideal genetic programming
  • Hiroshi Kera, H. Iba
  • Computer Science
    2016 IEEE Congress on Evolutionary Computation (CEC)
  • 2016
A novel approach in which genetic trees of GP are reduced during the search using a basis of a set of polynomials that are equivalent to zero for the data points of symbolic regression, which regulates bloat and efficiently determines simple solutions.
Approximate computation of zerodimensional polynomial ideals
  • Journal of Symbolic Computation,
  • 2009