Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dvse
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
15 ms
·
1.
▲
by
dvse
1y ago
This is already supported via listChanged. The problem is that >90% of clients currently don’t implement this - including Anthropic’s, https://modelcontextprotocol.io/clients
2.
▲
by
dvse
13y ago
The model in question is "convince small and medium businesses that they need to buy my software in order to do things the same way as large companies X and Y and have a hope of remaining competitive". For Oracle X and Y were banks, retail
3.
▲
Data science vs statistics
(masi.cscs.lsa.umich.edu)
1 points
by
dvse
14y ago
|
0 comments
4.
▲
by
dvse
14y ago
I wonder what proportion of "pure" CS algorithms can be conceptualized as an application of one of the fixed point theorems and/or properties of monotone operators. There has got to be _something_ useful about the functional analysis perspe
5.
▲
by
dvse
14y ago
Have you checked the "Articles" section on betterexplained.com? Clearly the author of the article is trying to put his ideas into practice - not perfect but rather helpful in fostering something like actual understanding of topics that are
6.
▲
by
dvse
14y ago
Some really nice suggestions in the article that for whatever reason are not often brought up while discussing maths education. A good way to bootstrap the "math avengers" website would be to get people to write up running commentary to som
7.
▲
by
dvse
14y ago
As pointed out in the comments on blogspot, CS is hardly the degree with biggest focus on optimization. Try operations research, systems & control, economics or even the MBA!
8.
▲
by
dvse
14y ago
If you don't already understand them, probably a good idea to skip the detailed derivations and look for the big picture. The course is really quite hard to follow closely if it's your first exposure to the material.
9.
▲
Data science vs. statistics
(cscs.umich.edu)
1 points
by
dvse
14y ago
|
0 comments
10.
▲
by
dvse
14y ago
Find a semi recent advanced textbook (preferably one that is used in at least one of the better schools) and use google scholar from there (both papers cited in the text and those citing it). The formal bibliometric tools such as scopus, re
11.
▲
by
dvse
14y ago
These "best paper" lists are almost comical and a very poor way to find important papers. Have a look at citation statistics for the older "winners", they are only marginally better than the average for the venue - essentially nobody still
12.
▲
by
dvse
14y ago
There is a number of really quite good applied maths courses on youtube (roughly in this order from each group): MIT 18.06, 18.085, 18.086, 6.262, 6.450 Stanford EE263, EE364A, EE261 Profs Strang, Boyd and Gallager are quite a bit better wi
13.
▲
by
dvse
14y ago
Thanks for the reply. If you are already running these private competitions it might be useful to advertise them a bit more openly (then you will need some formal criteria for joining to avoid user resentment, e.g. those in top 100). You ar
14.
▲
by
dvse
14y ago
Not surprising at all - kaggle (as currently implemented) is a fundamentally broken model. On top of the rather unpleasant "everybody pays auction" or "winner take all" system, they have a severe problem with metrics - the majority of the
15.
▲
by
dvse
14y ago
All true, but the idea that a good fraction of combinatorial algorithms that undergrads see can be replaced (albeit less efficiently) by linear programming is important. Not clear how classical CS curriculum helps to appreciate this either.
16.
▲
by
dvse
14y ago
Just for fun - "stochastic optimization" as in here: www2.isye.gatech.edu/~ashapiro/download.php?Down=book is in fact identical to "empirical risk minimization" in Vapnik's statistical learning theory. As soon as you are not 100% sure about
17.
▲
by
dvse
14y ago
I think now it is fairly generally appreciated that interior point methods constitute perhaps the most powerful class of tractable algorithms there is, yet remarkably they are hardly ever mentioned in any of the undergrad CS algorithms clas
18.
▲
by
dvse
14y ago
OR/CS is not the ultimate combination. If you want to do interesting work in this space you ideally need a background in all of optimization (ILP, convex NLP, stochastic optimization),control theory, certain areas of economics (general equ
19.
▲
by
dvse
14y ago
Do you know a reference that presents state estimation from this point of view? I have painstakingly arrived to this myself, following somewhat sketchy remarks in Gilbert Strang's "Computational Science and Engineering". The classical expos
20.
▲
Scalable Machine Learning - A. Smola's course at Berkeley (video)
(alex.smola.org)
8 points
by
dvse
15y ago
|
1 comments
21.
▲
by
dvse
15y ago
All good advice - operator theory in various guises is ubiquitous in applications but certainly not something many discern even through grad school in CS. Probably not much point trying to convince people on HN though - having perhaps suffe
22.
▲
by
dvse
15y ago
Also, to save much future grief, the undergraduate degree should be in maths.
23.
▲
by
dvse
15y ago
If you are interested in learning this topic, do not go directly to Koller/Friedman book - it sure contains a lot of material but its presentation is not well integrated (just look at the topic dependency graph at the beginning). A much mor
24.
▲
Complete set of video lectures on advanced robotics
(ocw.mit.edu)
2 points
by
dvse
15y ago
|
0 comments
25.
▲
by
dvse
15y ago
As usual, an excellent summary. Economic models based on low level data (essentially better "instrumentation", capturing bank transactions, some contracts, individual spending etc.) might be quite useful at least for short term prediction.
26.
▲
by
dvse
15y ago
Absolutely it is possible to get a good high level picture of a field without taking any particular class. Moreover things like "convex optimization" can be done in the footnotes of a serious maths course. But on the other hand until there
27.
▲
by
dvse
15y ago
Indeed, best courses on SEE by quite a wide margin.
28.
▲
by
dvse
15y ago
Certainly nothing beats a good book, but often a good lecturer can give some intuition or motivations that are not customarily written down. I think a great example of this would be material on convex optimization released by Stephen Boyd (
29.
▲
by
dvse
15y ago
These materials have actually been released in late 2008 - the three new courses will follow a completely different arrangement.
30.
▲
by
dvse
15y ago
Definitely give the courses I've mentioned in another comment a try - the material will make a lot more sense. Also keep in mind that Andrew Ng is a rather poor lecturer and many of his explanations are unclear or incomplete.
More ›