https://www.bibsonomy.org/concept/user/jil/learningBibSonomy RSS Feed for /concept/user/jil/learningA very common workflow is to index some data based on its embeddings and then given a new query embedding retrieve the most similar examples with k-Nearest Neighbor search. For example, you can imagine embedding a large collection of papers by their abstracts and then given a new paper of interest retrieve the most similar papers to it. TLDR in my experience it ~always works better to use an SVM instead of kNN, if you can afford the slight computational hithttps://github.com/karpathy/randomfun/blob/master/knn_vs_svm.ipynbjil2023-11-15T16:18:31+01:00knn most qa ranking similar svm vector <span itemprop="description">A very common workflow is to index some data based on its embeddings and then given a new query embedding retrieve the most similar examples with k-Nearest Neighbor search. For example, you can imagine embedding a large collection of papers by their abstracts and then given a new paper of interest retrieve the most similar papers to it. TLDR in my experience it ~always works better to use an SVM instead of kNN, if you can afford the slight computational hit</span>http://scikit-learn.org/jil2015-12-12T21:13:49+01:00classifier clustering learning library machine python regression <a itemprop="url" data-versiondate="2015-12-12T21:13:49+01:00" href="http://scikit-learn.org/" rel="nofollow" class="description-link">http://scikit-learn.org/</a>http://nlp.stanford.edu/courses/NAACL2013/jil2015-12-06T21:38:53+01:00deep learning naacl socher tutorial <a itemprop="url" data-versiondate="2015-12-06T21:38:53+01:00" href="http://nlp.stanford.edu/courses/NAACL2013/" rel="nofollow" class="description-link">http://nlp.stanford.edu/courses/NAACL2013/</a>http://people.tuebingen.mpg.de/burger/neural_denoising/jil2015-12-04T12:34:05+01:00deep denoising image layer learning mlp multi network neural <a itemprop="url" data-versiondate="2015-12-04T12:34:05+01:00" href="http://people.tuebingen.mpg.de/burger/neural_denoising/" rel="nofollow" class="description-link">http://people.tuebingen.mpg.de/burger/neural_denoising/</a>https://piotrmirowski.wordpress.com/2014/05/01/tutorial-on-neural-language-models/jil2015-05-22T11:56:47+02:00blog deep language learning models neural <a itemprop="url" data-versiondate="2015-05-22T11:56:47+02:00" href="https://piotrmirowski.wordpress.com/2014/05/01/tutorial-on-neural-language-models/" rel="nofollow" class="description-link">https://piotrmirowski.wordpress.com/2014/05/01/tutorial-on-neural-language-models/</a>http://videolectures.net/mlss07_teh_dp/jil2014-11-28T13:47:48+01:00bayesian dirichlet learning lecture machin nonparametric online process tutorial video <a itemprop="url" data-versiondate="2014-11-28T13:47:48+01:00" href="http://videolectures.net/mlss07_teh_dp/" rel="nofollow" class="description-link">http://videolectures.net/mlss07_teh_dp/</a>http://research.microsoft.com/apps/pubs/?id=217165jil2014-10-31T00:51:51+01:00deep learning slides tutorial <a itemprop="url" data-versiondate="2014-10-31T00:51:51+01:00" href="http://research.microsoft.com/apps/pubs/?id=217165" rel="nofollow" class="description-link">http://research.microsoft.com/apps/pubs/?id=217165</a>http://ufldl.stanford.edu/wiki/index.php/UFLDL_Recommended_Readingsjil2014-10-30T22:20:09+01:00deep learning links list reading <a itemprop="url" data-versiondate="2014-10-30T22:20:09+01:00" href="http://ufldl.stanford.edu/wiki/index.php/UFLDL_Recommended_Readings" rel="nofollow" class="description-link">http://ufldl.stanford.edu/wiki/index.php/UFLDL_Recommended_Readings</a>http://ufldl.stanford.edu/wiki/index.php/UFLDL_Tutorialjil2014-10-30T22:19:47+01:00belief deep learning networks tutorial <a itemprop="url" data-versiondate="2014-10-30T22:19:47+01:00" href="http://ufldl.stanford.edu/wiki/index.php/UFLDL_Tutorial" rel="nofollow" class="description-link">http://ufldl.stanford.edu/wiki/index.php/UFLDL_Tutorial</a>http://www.dagm.de/ausschreibungen/deutscher-mustererkennungspreis/jil2014-05-06T13:49:05+02:00informatik learning machine pattern preis <a itemprop="url" data-versiondate="2014-05-06T13:49:05+02:00" href="http://www.dagm.de/ausschreibungen/deutscher-mustererkennungspreis/" rel="nofollow" class="description-link">http://www.dagm.de/ausschreibungen/deutscher-mustererkennungspreis/</a>http://stats.stackexchange.com/questions/24437/advantages-and-disadvantages-of-svmjil2012-11-22T01:21:29+01:00disadvantages feature features ignores ignoring kernel sparse support svm vector <a itemprop="url" data-versiondate="2012-11-22T01:21:29+01:00" href="http://stats.stackexchange.com/questions/24437/advantages-and-disadvantages-of-svm" rel="nofollow" class="description-link">http://stats.stackexchange.com/questions/24437/advantages-and-disadvantages-of-svm</a>http://www.no-free-lunch.org/jil2012-10-29T17:49:59+01:00bias free function learning lunch machine no one other theorems worse <a itemprop="url" data-versiondate="2012-10-29T17:49:59+01:00" href="http://www.no-free-lunch.org/" rel="nofollow" class="description-link">http://www.no-free-lunch.org/</a>http://svmlight.joachims.org/jil2012-05-04T23:04:32+02:00joachims light software svm <a itemprop="url" data-versiondate="2012-05-04T23:04:32+02:00" href="http://svmlight.joachims.org/" rel="nofollow" class="description-link">http://svmlight.joachims.org/</a>http://en.wikipedia.org/wiki/Support_vector_machinejil2011-05-22T21:19:30+02:00formula lagrange maximization minimization svm wikipedia wrong <a itemprop="url" data-versiondate="2011-05-22T21:19:30+02:00" href="http://en.wikipedia.org/wiki/Support_vector_machine" rel="nofollow" class="description-link">http://en.wikipedia.org/wiki/Support_vector_machine</a>http://www.num.uni-sb.de/iam/veroeffentlichungen/downloads/abschlussarbeiten/diplom_bechtel.pdfjil2011-05-22T21:13:22+02:00book buch diplomarbeit linear literature optimierung optimization programming quadratic svm <a itemprop="url" data-versiondate="2011-05-22T21:13:22+02:00" href="http://www.num.uni-sb.de/iam/veroeffentlichungen/downloads/abschlussarbeiten/diplom_bechtel.pdf" rel="nofollow" class="description-link">http://www.num.uni-sb.de/iam/veroeffentlichungen/downloads/abschlussarbeiten/diplom_bechtel.pdf</a>http://www.tristanfletcher.co.uk/SVM%20Explained.pdfjil2011-05-22T20:49:46+02:00derivation dual explained explanation good lagrange optimization pdf problem svm tutorial <a itemprop="url" data-versiondate="2011-05-22T20:49:46+02:00" href="http://www.tristanfletcher.co.uk/SVM%20Explained.pdf" rel="nofollow" class="description-link">http://www.tristanfletcher.co.uk/SVM%20Explained.pdf</a>http://code.google.com/p/cleartk/jil2010-11-23T00:42:51+01:00cleartk code google java lib nlp svm uima <a itemprop="url" data-versiondate="2010-11-23T00:42:51+01:00" href="http://code.google.com/p/cleartk/" rel="nofollow" class="description-link">http://code.google.com/p/cleartk/</a>http://www.aifb.uni-karlsruhe.de/WBS/pci/OL_Tutorial_ECML_PKDD_05/jil2010-02-13T00:12:57+01:00learning nlp ontology tutorial <a itemprop="url" data-versiondate="2010-02-13T00:12:57+01:00" href="http://www.aifb.uni-karlsruhe.de/WBS/pci/OL_Tutorial_ECML_PKDD_05/" rel="nofollow" class="description-link">http://www.aifb.uni-karlsruhe.de/WBS/pci/OL_Tutorial_ECML_PKDD_05/</a>http://www.csie.ntu.edu.tw/~cjlin/libsvm/jil2008-04-23T03:29:20+02:00classification lib libsvm svm <a itemprop="url" data-versiondate="2008-04-23T03:29:20+02:00" href="http://www.csie.ntu.edu.tw/~cjlin/libsvm/" rel="nofollow" class="description-link">http://www.csie.ntu.edu.tw/~cjlin/libsvm/</a>http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-text-classification-1.htmljil2008-02-19T19:22:57+01:00begriff buch definition effectiveness efficiency evaluation ir klassifikation learning machine online performance <a itemprop="url" data-versiondate="2008-02-19T19:22:57+01:00" href="http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-text-classification-1.html" rel="nofollow" class="description-link">http://nlp.stanford.edu/IR-book/html/htmledition/evaluation-of-text-classification-1.html</a>