Stupid question: I want to do ML application but I have no (or not enough) training data; is this possible? Maybe you should consider the same approach than the one used for the curse of dimensionality : just do the best possible with your training data and see if it is enough. I think that classic...

Stupid question: I want to do ML application but I have no (or not enough) training data; is this possible?

Maybe you should consider the same approach than the one used for the curse of dimensionality : just do the best possible with your training data and see if it is enough.

A.I. can’t solve this: The coronavirus could be highlighting just how overhyped the industry is https://www.cnbc.com/2020/04/29/ai-has-limited-role-coronavirus-pandemic.html?__source=sharebar|linkedin&par=sharebar “It’s fascinating how quiet it is,” said Neil Lawrence, the former director of machin...

Have you tried Kaggle, for example? I had a look. All I found are scikit-learn SVM implementation like this one . I tested it, and witnessed something like 94% accuracy for the MNIST test for 42000 images in the training set. they are using an easier set than the 60000 original LeCunn one. So I am ...

Hello, I am benchmarking a classifier method based on kernel methods. I benchmarked it against the standard Tensorflow neural network (described here ), results are published here . So far so good, both methods gives equivalent results for classifying handwritten digits. Since I am using kernel meth...

Hi Farid, yes the link is broken sorry. Moreover the code is lost - this was a 8 years old code, and I did not kept any archive of it :/ If needed, I could rewrite it  - AFAR I needed a special matrix factorization (I could provide the code) and a convex hull algorithm (I was using qhull but I thin...

Trying to be useful there, I just mention that we proposed some years ago   in this paper  a method to compute explicitly solutions to these equations : more precisely one can compute explicitly (entropic or conservative) multi-dimensional solutions for conservation laws or Hamilton-Jacobi type equ...

Take any (intro) book on numerical schemes for conservative laws. You can go with Roe, HLLC or FCT and you are done. That's not the main goal, really. See it more as a benchmark case as it were. We can test many methods on it. But we want to test Roe et al (mainly Laney) against other schemes. I am...

The original Crank-Nicolson article for a nonlinear heat equation

http://citeseerx.ist.psu.edu/viewdoc/do ... 1&type=pdf

It seems that that they did not realized that their scheme is energy conservative in this paper. Very impressive work for a 1947 paper.

Indeed. De udder one gives '404'. Fixed. Thank you for pointing this out to me. What is fixed? The first link is not working (the website was redesigned and articles before 2018 are gone). For the second link, it sems that you didn't renew your domain name and it was taken by "others". Links are fi...

You can benchmark your code with exact solutions or NS equations: "Exact Fully 3D Navier Stokes Solutions For Benchmarking". IJNMF, vol 19, 1994. More challenging example is the driven cavity. Just google the article title, you find it free of charge. Thx, I will benchmark it, although I only imple...

Indeed. De udder one gives '404'.

Fixed. Thank you for pointing this out to me.

I would like to share this post . It is simply a Navier Stokes equation, AKA CFD (Computational Fluid Dynamic), but the numerical simulation is done with ... a finance oriented framework . Maybe it could be a warm-up to discuss Navier Stokes type modeling for Finance equations ? For instance, we cou...

By the way, reading the posts, I am not sure to understand your point. Is not SGD an optimization method, as all those present in boost::odeint ?  Boost odeint is a generic ODE solver...(?) It can be used to solve optimisation problems in dynamical systems as my example above shows. The authors of ...

Test code  // Interval strategy on (O,inf): // // 1. Truncation to large finite T //  2. Transform (0,inf) to (0,1) // // 2. tends to give more accurate rounded results. // // (C) Datasim Education BV 2020 // #include "LinearSystemGradientDescent.hpp" #include <boost/numeric/ublas/vector.hpp> #incl...