Skip to content

Further reading

The sources the method builds on, by what you may want from each.

Using the package

  • scikit-learn and its API design 12: the conventions the estimators follow.
  • Boyd and Vandenberghe, Convex Optimization 3: the notation used on these pages.

Geometric programming and posynomials

  • A tutorial on geometric programming 4: posynomials and generalized posynomials, the family the multi-term fit stays inside.
  • Fitting softmax-affine functions to data so they remain compatible with geometric programming 5 is the source of the multi-term fit.
  • Fitting convex piecewise-linear functions by alternating partition and refit 6: the second source of the multi-term fit.
  • Reweighted \(\ell_1\) minimization 7: the sparsity option, penalty="reweighted_l1".

Charts and neighbouring methods

  • Isometric log-ratio transformations for compositional data 8 and principal component analysis of compositional data 9: the neighbours of the chart.
  • Kernel principal component analysis 10: the related method for the documented kernel direction, which is not built.
  • HoroPCA 11: the nearest analog in setting; how this work differs.
  • Data envelopment analysis 12: a frontier estimator from efficiency analysis, the nearest neighbour outside engineering design.

  1. Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexandre Passos, David Cournapeau, Matthieu Brucher, Matthieu Perrot, and Édouard Duchesnay. Scikit-learn: machine learning in Python. Journal of Machine Learning Research, 12:2825–2830, 2011. URL: https://jmlr.org/papers/v12/pedregosa11a.html. ↩

  2. Lars Buitinck, Gilles Louppe, Mathieu Blondel, Fabian Pedregosa, Andreas Mueller, Olivier Grisel, Vlad Niculae, Peter Prettenhofer, Alexandre Gramfort, Jaques Grobler, Robert Layton, Jake Vanderplas, Arnaud Joly, Brian Holt, and Gaël Varoquaux. API design for machine learning software: experiences from the scikit-learn project. 2013. arXiv:1309.0238. doi:10.48550/arXiv.1309.0238. ↩

  3. Stephen Boyd and Lieven Vandenberghe. Convex Optimization. Cambridge University Press, 2004. doi:10.1017/CBO9780511804441. ↩

  4. Stephen Boyd, Seung-Jean Kim, Lieven Vandenberghe, and Arash Hassibi. A tutorial on geometric programming. Optimization and Engineering, 8(1):67–127, 2007. doi:10.1007/s11081-007-9001-7. ↩

  5. Warren Hoburg, Philippe Kirschen, and Pieter Abbeel. Data fitting with geometric-programming-compatible softmax functions. Optimization and Engineering, 17(4):897–918, 2016. doi:10.1007/s11081-016-9332-3. ↩

  6. Alessandro Magnani and Stephen P. Boyd. Convex piecewise-linear fitting. Optimization and Engineering, 10(1):1–17, 2009. doi:10.1007/s11081-008-9045-3. ↩

  7. Emmanuel J. Candès, Michael B. Wakin, and Stephen P. Boyd. Enhancing sparsity by reweighted ℓ₁ minimization. Journal of Fourier Analysis and Applications, 14(5–6):877–905, 2008. doi:10.1007/s00041-008-9045-x. ↩

  8. J. J. Egozcue, V. Pawlowsky-Glahn, G. Mateu-Figueras, and C. Barceló-Vidal. Isometric logratio transformations for compositional data analysis. Mathematical Geology, 35(3):279–300, 2003. doi:10.1023/A:1023818214614. ↩

  9. J. Aitchison. Principal component analysis of compositional data. Biometrika, 70(1):57–65, 1983. doi:10.1093/biomet/70.1.57. ↩

  10. Bernhard Schölkopf, Alexander Smola, and Klaus-Robert Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299–1319, 1998. doi:10.1162/089976698300017467. ↩

  11. Ines Chami, Albert Gu, Dat P. Nguyen, and Christopher Ré. HoroPCA: hyperbolic dimensionality reduction via horospherical projections. In Proceedings of the 38th International Conference on Machine Learning, volume 139 of Proceedings of Machine Learning Research, 1419–1429. 2021. arXiv:2106.03306. URL: https://proceedings.mlr.press/v139/chami21a.html. ↩

  12. A. Charnes, W. W. Cooper, and E. Rhodes. Measuring the efficiency of decision making units. European Journal of Operational Research, 2(6):429–444, 1978. doi:10.1016/0377-2217(78)90138-8. ↩