Viewing profile — orange3xchicken

You probably couldn't find much evidence re Krugman + Charlatan, because he's not. He's an accomplished economist who's influential and respected among the academic community. He's…

At least on the quant side, I think the typical sentiment is that most researchers aren't interested in ops / developing infrastructure / curating datasets.

It sounds like you aren't really interested in a rational discussion by the second half of your post, but the typical arguments (incl in the post) for are that market makers reduce…

I know, I've been waiting so long for this! I will not miss having to render and reference pngs of equations / api requests.

I think K is usually interpreted as the # of gaussians from which the data has been assumed to be sampled. Not immediately related to # of latent variables unless you invoke kernel…

The term "labeled graph" just means a graph with each node labeled differently (but arbitrarily). It just allows for reasoning & enumerating the vertex set. It's a typical assumpti…

That's really cool. These days similar strategies based on graph coarsening and vertex ordering are really popular for improving the sparsity pattern of preconditioners- e.g. incom…

Just last night I noticed that the zoom program on my mac has been suffering from this bug, which is ~4 months old. Both are up to date. https://community.zoom.com/t5/Meetings/Why-…

I'm less familiar with poisoning, but at least for test-time robustness, the current benchmark for image classifiers is AutoAttack [0,1]. It's an ensemble of adaptive & parameter-f…

A new subfield of adversarial ML that considers similar challenges to adversarial NLP: topological attacks on graphs for attacking graph/node classifiers. Both problems (NLP & grap…

Recommend Russel's Human Compatible. Three principles to guide AI development: 1. The machine's only objective is to maximize the realization of human preferences. 2. The machine i…

Maybe Bosch? Prof. Zico Kolter from CMU is a chief scientist associated with them, and his group does a lot of really good work in the ml verification space (e.g. the first randomi…

For anyone interested in elegant implementations of state of the art algorithms for verification, there is a nice library in Jax: https://deepmind.com/research/open-source/efficien…

Not sure if this is what you mean, but I found an ongoing Wikimedia research project & preprint: https://meta.wikimedia.org/wiki/Research:Link_recommendation... https://arxiv.org/a…

Not arguing with your point, but the blame shouldn't entirely be attributed to the research community. It's easy to read about the various parasitic practices conducted by academic…

I think emulating existing darknet market infrastructure makes sense to address a couple of the issues you mentioned- like public reviews & messaging for employment + moderation & …

There is a lot of fundamental work on random projections [0] from Dasgupta et al., Achlioptas et al., etc. For example, while random projections produced by sampling normal random …

This is basically adversarial training, which is a typical (& very practical) benchmark heuristic defense for this problem. An ongoing question is to precisely characterize when an…

It turns out that a similar technique, where you basically apply noise multiple times to a single image, and average predictions over all noisy images- equivalent to convolving you…

fyi the founder Igor Carron runs a pretty nice academic blog on compressive sensing (a bit less academic in recent months) https://nuit-blanche.blogspot.com/ Also hosts the advance…

Someone correct me, but I think hMetis is one popular software/algorithm for multi-level graph/hypergraph partitioning. There is also KaHyPar which is a bit more academic.

Practical edge crossing minimization for large graphs (e.g. a billion nodes) is a really hard problem. An alternative formulations that's seen some use in graph drawing & circuit d…