-
### 🚀 The feature, motivation, and pitch
I want to contribute to the PyTorch community with my implementation of CG and BICGSTAB methods; I believe this will immensely help research students who wo…
-
I guess the question speaks for itself.
I would like to actually do block cholesky decomposition such that each of the blocks of my huge matrix fit in the memory but the matrix itself doesn't fit.
…
-
Consider the function,
> let f [m,b] = (6020.272727*m+b-23680.30303)^(2::Int) + (7254.196429*m+b-28807.61607)^(2::Int) + (6738.575342*m+b-26582.76712)^(2::Int) + (5464.658537*m+b-23894.34756)^(2::Int…
-
Hey, I am currently looking into using the IterGP algorithm and was told about this package that already contains a julia implementation.
Would you be open to extending this package to build on to…
-
The Problem appeared a couple of times now. I am using the coil-surface constraints together with the curvature constraint. FOCUS is optimizing which you can see in the nohup.out file, but after the l…
-
As a continuation of #379, in order to reduce the ambiguities, we should unify how optional elements of the objective are passed.
For example TCG has 7 signatures – the Hessian, the base point p an…
-
I was reading the discussions in #13117 and #13131 and thought this point warranted its own issue:
> I thinks this could be improved, since both ElasticNet() and Lasso() support multiple targets. I…
bnaul updated
4 years ago
-
I just reimplement GIANT in Spark and test it on real-world data for CTR prediction which is very high dimensional d = 2^26.
In order to have a better hessian approximation, each partition of RDD has…
-
In particular, the logic for merging different fixed variable descriptors for composite costs, such as SumOfCosts, is tricky.
See https://github.com/lisa-lab/pylearn2/pull/355/files#L3R311
We should …
-
Based on
https://www.otexts.org/fpp/9/1
in this issue we will implement the model
Yt = A+Bi*Xi,t +nt
where nt (residuals) are assumed to be auto regressive process of a given order q AR(q)
the steps…