Comments for Artificial Intelligence Blog » Artificial Intelligence Blog »

Comment on Most popular posts by hundalhh

hundalhh — Wed, 15 Jan 2025 16:08:06 +0000

I have an idea, then I just start writing when I have the time to write. Then I revise my first draft a lot.

I suggest that you read “Bird By Bird” if you are having trouble getting started.

Comment on Most popular posts by dog food

dog food — Fri, 10 Jan 2025 18:35:30 +0000

First off I would like to say awesome blog! I had a quick question which I’d like to ask
if you don’t mind. I was curious to find out how you center yourself and clear your head
prior to writing. I’ve had difficulty clearing my mind in getting my thoughts out there.

I do enjoy writing however it just seems like the first 10 to 15 minutes
are usually lost simply just trying to figure out how to begin. Any suggestions or tips?
Kudos!

Comment on “Category Theory for Programmers” by hundalhh

hundalhh — Tue, 14 Jul 2020 15:20:45 +0000

On reddit, someone pointed out that you can always find an arrow from (A*B)+(A*C) to A*(B+C). Here is a proof.

Def: If X+Y is the coproduct of X and Y, let inj(X, X+Y) and inj(Y,X+Y) be the associated injection arrows.

Def: If X*Y is the product of X and Y, let pro(X*Y,X) and pro(X*Y, Y) be the associated projection arrows.

Def: If aXY is an arrow from X to Y and aYZ is an arrow from Y to Z, then let

comp(aYZ, aXY)

be the composition of aYZ and aXY. comp(aYZ, aXY) is an arrow from X to Z.

Notation: If you have two arrows f:Z->X, and g:Z->Y, the let be the unique arrow from Z to X*Y such that

comp( pro(X*Y,X) , ) = f and
comp( pro(X*Y,Y) , ) = g. (The existence of comes from the definition of X*Y.)

Notation: If you have two arrows f:X->Z, and g:Y->Z, the let [f,g] be the unique arrow from X+Y to Z such that

comp( [f,g], inj(X,X+Y) ) = f and
comp( [f,g], inj(Y,X+Y) ) = g. (The existence of [f,g] comes from the definition of X+Y.)

1) Let a_1 = comp( inj(B, B+C), pro(A*B, B). a_1: A*B -> B+C.
2) Let a_2 = comp( inj(B, B+C), pro(A*C, C). a_2: A*C -> B+C.
3) Let a_3 = [a_1, a_2]. a_3:(A*B)+(A*C) -> B+C.
4) Let a_4 = [pro(A*B,A), pro(A*C,A)]. a_4:(A*B)+(A*C) -> A.
5) Let a_5 = . a_5:(A*B)+(A*C) -> A*(B+C).

a_5 is jagr2808’s arrow.

(I am not a category theorist, so this notation may be totally non-standard, or maybe I saw it somewhere.)

Comment on Automatic Differentiation by hundalhh

hundalhh — Mon, 17 Mar 2014 05:34:03 +0000

The derivative of x^x with respect to x is x^x *(log(x) + 1).
The derivative of x^k with respect to x is k*x^(k-1).
The derivative of k^x with respect to x is k^x *log(k).

If f(x) and g(x) are a functions of x, with derivatives f'(x) and g'(x)
The derivative of f(x)^g(x) with respect to x is

f(x)^g(x)( g(x)*f'(x)/f(x) + log(f(x))*g'(x))

The derivative of f(x)^k is k*f(x)^(k-1)*f'(x).
The derivative of k^(f(x)) is k^f(x) *log(k)*f'(x).

You might want to check out wolframalpha.com.

Comment on Automatic Differentiation by Young

Young — Tue, 25 Feb 2014 08:55:32 +0000

Hi, I also discovered automatic differentiation today, and it was really interesting. I studied about it for a while. But I couldn’t find out how I can hadle the function,’y=x^x’. Could you tell me about it or inform me any sites that handles the function?

Comment on “Basic Concepts in Information Theory” by Zoltan Szabo

Zoltan Szabo — Mon, 13 Jan 2014 18:50:09 +0000

Some estimators;) : Information Theoretical Estimators (ITE) Toolbox

Comment on Assorted Links Dec 2013 by antianticamper

antianticamper — Mon, 23 Dec 2013 15:44:03 +0000

Thank you for your continuing work on the blog, Hein. You’ve pointed me in lots of interesting directions, including deep learning, which I finally buckled down and grokked.

Comment on “13 NIPS Papers that caught our eye” by My favourite papers and talks at Nips 2013 | DavideChicco.it

My favourite papers and talks at Nips 2013 | DavideChicco.it — Tue, 17 Dec 2013 17:42:33 +0000

[…] check out these blog posts by Paul Mineiro, hundalhh, Yisong Yue, Sebastien Bubeck, […]

Comment on “13 NIPS Papers that caught our eye” by NIPS 2013 | Memming

NIPS 2013 | Memming — Sun, 15 Dec 2013 03:19:03 +0000

[…] There were many more interesting things, but I’m going to stop here! [EDIT: check out this blog post by Paul Mineiro, and this one by hundalhh] […]

Comment on The Big O writes on Scientific Error, Bias, and Self-(peer)-review. by hundalhh

hundalhh — Thu, 21 Nov 2013 19:54:44 +0000

The scientific computing community is trying to help the peer review and audience review process through reproducible computing. See e.g. 15 Years of Reproducible Research in Computational Harmonic Analysis A Year in Reproducible Research in Compressive Sensing, Advanced Matrix Factorization and more http://blog.reproducibleresearch.org/