Skip to main content

Using a Linear Fit to Determine Monotonicity Directions

  • Conference paper
Learning Theory and Kernel Machines

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2777))

  • 5280 Accesses

Abstract

Let f be a function on ℝd that is monotonic in every variable. There are 2d possible assignments to the directions of monotonicity (two per variable). We provide sufficient conditions under which the optimal linear model obtained from a least squares regression on f will identify the monotonicity directions correctly. We show that when the input dimensions are independent, the linear fit correctly identifies the monotonicity directions. We provide an example to illustrate that in the general case, when the input dimensions are not independent, the linear fit may not identify the directions correctly. However, when the inputs are jointly Gaussian, as is often assumed in practice, the linear fit will correctly identify the monotonicity directions, even if the input dimensions are dependent. Gaussian densities are a special case of a more general class of densities (Mahalanobis densities) for which the result holds. Our results hold when f is a classification or regression function.

If a finite data set is sampled from the function, we show that if the exact linear regression would have yielded the correct monotonicity directions, then the sample regression will also do so asymptotically (in a probabilistic sense). This result holds even if the data are noisy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sill, J., Abu-Mostafa, Y.S.: Monotonicity Hints. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems (NIPS), vol. 9, pp. 634–640. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  2. Sill, J.: The capacity of monotonic functions. Discrete Applied Mathematics Special Issue on VC Dimension (1998)

    Google Scholar 

  3. Vapnik, V.N.: Statistical Learning Theory. Adaptive and Learning Systems for Signal Processing, Communications and Control. John Wiley & Sons, Inc., New york (1998)

    Google Scholar 

  4. Bowman, A.W., Jones, M.C., Gubels, I.: Testing monotonicity of regression. Journal of Computational and Graphical Statistics 7, 489–500 (1998)

    Article  Google Scholar 

  5. Schlee, W.: Non-parametric tests of the monotony and convexity of regression. Non–Parametric Statistical Inference 2, 823–836 (1982)

    MathSciNet  Google Scholar 

  6. Ben-David, A.: Monotonicity maintenance in information theoretic machine learning algorithms. Machine Learning 19, 29–43 (1995)

    Google Scholar 

  7. Magdon-Ismail, M., Chen, J.H.C., Abu-Mostafa, Y.S.: The multilevel classification problem and a monotonicity hint. In: Yin, H., Allinson, N.M., Freeman, R., Keane, J.A., Hubbard, S. (eds.) IDEAL 2002. LNCS, vol. 2412, p. 410. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  8. Mammen, E.: Estimating a smooth monotone regression function. Annals of Statistics 19, 724–740 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Mukerjee, H.: Monotone nonparametric regression. Annals of Statistics 16, 741–750 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Mukerjee, H., Stern, S.: Feasible nonparametric estimation of multiargument monotone functions. Journal of the American Statistical Association 89, 77–80 (1994)

    Article  MathSciNet  Google Scholar 

  11. Potharst, R., Feelders, A.J.: Classification trees for problems with monotonicity constraints. SIGKDD Explorations 4, 1–10 (2002)

    Article  Google Scholar 

  12. Sill, J.: Monotonic networks. In: Advances in Neural Information Processing Systems (NIPS), vol. 10 (1998)

    Google Scholar 

  13. DeGroot, M.H.: Probability and Statistics. Addison–Wesley, Reading (1989)

    Google Scholar 

  14. Billingsley, P.: Probability and Measure. Wiley Series in Probability and Mathematical Statistics. Wiley, Chichester (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Magdon-Ismail, M., Sill, J. (2003). Using a Linear Fit to Determine Monotonicity Directions. In: Schölkopf, B., Warmuth, M.K. (eds) Learning Theory and Kernel Machines. Lecture Notes in Computer Science(), vol 2777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45167-9_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45167-9_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40720-1

  • Online ISBN: 978-3-540-45167-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics