Name
Abstract | ||
|---|---|---|
We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal regression directly without resorting to numerical optimization. Ideal regression is useful whenever the solution to a learning problem can be described by a system of polynomial equations. As an example, we demonstrate how to formulate Stationary Subspace Analysis (SSA), a source separation problem, in terms of ideal regression, which also yields a consistent estimator for SSA. We then compare this estimator in simulations with previous optimization-based approaches for SSA. |
Year | Venue | Field |
|---|---|---|
2012 | AISTATS | Algebraic geometry,Mathematical optimization,Polynomial,Regression,Polynomial regression,System of polynomial equations,Source separation,Mathematics,Consistent estimator,Estimator |
DocType | ISSN | Citations |
Journal | Journal of Machine Learning Research Workshop and Conference
Proceedings Vol.22: Proceedings on the Fifteenth International Conference on
Artificial Intelligence and Statistics, 22:628-637. 2012 | 5 |
PageRank | References | Authors |
0.87 | 13 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Franz J. Király | 1 | 50 | 14.98 |
| Paul Von Bünau | 2 | 304 | 15.80 |
| Jan Saputra Müller | 3 | 12 | 1.76 |
| Duncan A. J. Blythe | 4 | 48 | 4.85 |
| Frank C. Meinecke | 5 | 447 | 29.21 |
| Klaus-Robert Müller | 6 | 12756 | 1615.17 |