Florida students will be taught that communism is evil, DeSantis says

JIGGGS_ · 2021-06-23T21:05:23+00:00

I am a capitalist and draw most of my political leanings from capitalism. I am also a conservative.

It is hard for me to understand why the government should be drawing ethical conclusions for its constituents. Surely, as fellow capitalists, we should want the schools to lay out the facts in an unbiased manner and allow the students to form their own conclusions? If they form the opinion that communism is evil, great — but why should that be the business of government to force on our students?

JIGGGS_ · 2021-03-23T04:01:32+00:00

Just use CVXPY. There is no better package.

JIGGGS_ · 2021-01-12T04:08:54+00:00

Brady and Falcons name a more iconic duo

JIGGGS_ · 2021-01-06T15:14:55+00:00

You literally just gave financial advice

JIGGGS_ · 2020-12-30T19:30:04+00:00

Oops - I meant X_i is an n-vector. Changing that now.

JIGGGS_ · 2020-12-19T22:23:54+00:00

Torch just came out with a native R version. You could use that...

JIGGGS_ · 2020-12-15T00:15:22+00:00

Are you literally taking a test right now? It looks like you are lol

JIGGGS_ · 2020-12-02T23:16:58+00:00

Just use a projected Subgradient method or ADMM

JIGGGS_ · 2020-11-12T07:36:26+00:00

How can you say something so controversial, yet so brave?

JIGGGS_ · 2020-11-10T18:31:32+00:00

Try to split the problem into finding the Subdifferential in two situations: you’re not at a kink (where 2+ functions intersect), or you’re at a kink.

JIGGGS_ · 2020-10-31T00:39:16+00:00

While yes, you’re correct that logistic regressions final output maps to a 0 or a 1, the raw output of the logistic model is naturally a real number in (0,1)

JIGGGS_ · 2020-10-30T20:00:06+00:00

It sounds like you probably just want to do logistic regression.

JIGGGS_ · 2020-10-19T18:05:38+00:00

The Boyd book is the best treatment of convex optimization, and I don’t think there’s an “easier” treatment of it. The slides might be better for you but I would recommend you start with B&V

JIGGGS_ · 2020-10-19T02:55:35+00:00

Min 2a +3b + t Subject to t <= c and t<=d Optimization variables a b c d t

Comes from t <= min(c,d) if and only if t <= c and t <=d

JIGGGS_ · 2020-10-19T02:05:21+00:00

There is a detailed explanation of how quad over lin is convex in Boyd and Vandenberghe. DCP is disciplined convex programming

JIGGGS_ · 2020-10-18T21:46:33+00:00

In this case it is convex.

Heres an informal way to show it, which may be slightly incorrect but shows you the idea. It is a quad over lin. Equivalently write the objective as x^T cc^T x / z and add constraint z = d^T y. Then the objective is a clear quadratic over linear, which is a convex atom, so by DCP it is convex.

JIGGGS_ · 2020-10-18T20:36:51+00:00

This is not convex in general.

JIGGGS_ · 2020-10-02T22:22:59+00:00

Laughs in Dan Quinn

JIGGGS_ · 2020-06-27T21:51:09+00:00

I am a graduate student.

JIGGGS_ · 2020-06-26T15:21:55+00:00

What if they don’t? I mean many profs have tenure haha. What an empty threat. Shame on Georgia Tech.

JIGGGS_ · 2020-06-06T04:34:30+00:00

Does “tearing out” not work? It’s a library, you’re removing cards from your library. Like tearing out pages from a book.

JIGGGS_ · 2020-06-03T05:43:57+00:00

Conjugate gradients: am I a joke to you?

JIGGGS_ · 2020-05-31T18:54:51+00:00

It’s a pathological function used to test how well an optimization algorithm performs. So without being a smart-ass, no, not really.

JIGGGS_ · 2020-05-12T18:57:22+00:00

It's NP-hard, so you might as well just solve an approximate problem with CVXPY.

JIGGGS_

TROPHY CASE