Giter VIP home page Giter VIP logo

Comments (6)

brtang63 avatar brtang63 commented on May 9, 2024 1

Actually, abess checks whether max(support.size) < nobs, but not rank(X). The following code will produce an error. However, when rank(X) < smax < nrow(X), there is no warning reported.

library(abess)
data <- generate.data(n = 10, p = 100, support.size = 10)
abess(data$x, data$y, support.size = 0:15)

#> Error in abess.default(data$x, data$y, support.size = 0:15) :  max(support.size) < nobs is not TRUE

from abess.

Mamba413 avatar Mamba413 commented on May 9, 2024

@brtang63 , I am confused about this question. In this example, n is 30, i.e., rank(X) = 30; on the contrary, the maximum support size is 15 such that rank(X) >= support size. So, what warning shall be thrown?

from abess.

Mamba413 avatar Mamba413 commented on May 9, 2024

@brtang63 , I am confused about this question. In this example, n is 30, i.e., rank(X) = 30; on the contrary, the maximum support size is 15 such that rank(X) >= support size. So, what warning shall be thrown?

Oh... I see... Let me simplify this code.

from abess.

Mamba413 avatar Mamba413 commented on May 9, 2024

@brtang63 , I am confused about this question. In this example, n is 30, i.e., rank(X) = 30; on the contrary, the maximum support size is 15 such that rank(X) >= support size. So, what warning shall be thrown?

Oh... I see... Let me simplify this code.

Shall you do this since I cannot obtain the newest result shown in the screenshot. Also, simplify this code to a minimal one. And paste the results in code chunck... Many thanks!

from abess.

Mamba413 avatar Mamba413 commented on May 9, 2024

Thanks for this comment and your clarification!

It is an excellent comment in view of numerical analysis, but we will not address this issue temporarily. This is because computing/estimating the rank of a matrix, actually, is very time-consuming. To my knowledge, computing rank has to obtain all of the eigenvalues of this matrix which has a time complexity of N^3 where N is the matrix size.

So, until a fast rank determination algorithm is well developed, we will incorporate this fast algorithm into my implementation. Or if you know about such a fast algorithm for computing rank, we are glad to implement it into our project.

from abess.

brtang63 avatar brtang63 commented on May 9, 2024

I get it. Thanks for your clear and helpful explanation!

from abess.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.