CompSci Weekend SuperThread (October 30, 2020) Computer Science |
- CompSci Weekend SuperThread (October 30, 2020)
- [R] DeepMind Introduces Algorithms for Causal Reasoning in Probability Trees
- Microsoft/MITRE group declares war on machine learning vulnerabilities with Adversarial ML Threat Matrix
- Github Student Developer Pack: Get Free Access to MS Azure, AWS Educate, DataDog, MongoDB, and more
- I asked AI expert friends of mine working at DeepMind, MILA, OpenAI and more their advice to those just starting out in AI or thinking of pursuing a career in the field. Thoughts? What would you add?
- Possibly stupid question about satisfiability
- sorting algorithms visualization
- [Discussion/Question] Can AIs Evolve Like Living Organisms?
- How to version data structures
- Language Books
- Does event handler face the same safety issue as Linux's signal handler?
CompSci Weekend SuperThread (October 30, 2020) Posted: 29 Oct 2020 06:04 PM PDT /r/compsci strives to be the best online community for computer scientists. We moderate posts to keep things on topic. This Weekend SuperThread provides a discussion area for posts that might be off-topic normally. Anything Goes: post your questions, ideas, requests for help, musings, or whatever comes to mind as comments in this thread. Pointers
Caveats
[link] [comments] |
[R] DeepMind Introduces Algorithms for Causal Reasoning in Probability Trees Posted: 29 Oct 2020 12:49 PM PDT Probability trees may have been around for decades, but they have received little attention from the AI and ML community. Until now. "Probability trees are one of the simplest models of causal generative processes," explains the new DeepMind paper Algorithms for Causal Reasoning in Probability Trees, which the authors say is the first to propose concrete algorithms for causal reasoning in discrete probability trees. Here is a quick read: DeepMind Introduces Algorithms for Causal Reasoning in Probability Trees The paper Algorithms for Causal Reasoning in Probability Trees is on arXiv, and an interactive tutorial is available on GitHub. [link] [comments] |
Posted: 29 Oct 2020 11:30 AM PDT |
Github Student Developer Pack: Get Free Access to MS Azure, AWS Educate, DataDog, MongoDB, and more Posted: 30 Oct 2020 04:00 AM PDT |
Posted: 29 Oct 2020 10:16 AM PDT |
Possibly stupid question about satisfiability Posted: 29 Oct 2020 09:07 AM PDT If I have a boolean CNF formula \phi, I can take a variable x, set it to true, remove any clause containing x, and remove ¬x from any clause containing it, and get a new formula \phi_x^1. I can do the opposite, set x false, remove any clause containing ¬x and remove x from all clauses, and obtain \phi_x^0. \phi is satisfiable if and only if at least one of \phi_x^0, \phi_x^1 is satisfiable. Now obviously this does not yield an efficient algorithm, but as long as I do it at most log N times, I am allowed to do this at some point of an efficient algorithm. Using the above, I can "get rid" of some small subsets of the variables that I don't like (for whatever reason) My question is: is there a similar thing I can do to get rid of a small set of clauses? [link] [comments] |
sorting algorithms visualization Posted: 29 Oct 2020 04:50 PM PDT Hi, I would really appreciate if any of you can help me answer this question, I've been thinking about it but I don't think I quite understand because I'm also a bit confused about what the thin and thick bars represent. I'd be very thankful for any help :) How could this video be skewed to show something that is incorrect? The Video: https://www.youtube.com/watch?v=kPRA0W1kECg [link] [comments] |
[Discussion/Question] Can AIs Evolve Like Living Organisms? Posted: 29 Oct 2020 02:55 PM PDT I was reading an article on genetic algorithms and it had me wonder:
What I don't understand is why this effectiveness of GAs doesn't translate as well into AIs as it does to living organisms. :) Any thoughts? [link] [comments] |
How to version data structures Posted: 29 Oct 2020 08:09 AM PDT At many different jobs, I've had to deal with old data laying around without any documentation about its format. Are there any tools, specs, or best practices for handling this? I don't have a fully formed idea for what I need, but the problem I'm trying to avoid is someone adds a new integer to the data format, without specifying that older serialized versions of the data will be lacking this field. Perhaps all that's needed is a version control plug-in that verifies changes to a data structure or spec, requiring that the new field be added as "Optional[int]" rather than just "int", or something like that. Can anyone point me in the right direction? Surely there must be some best practices in this area. Thanks! [link] [comments] |
Posted: 29 Oct 2020 11:44 AM PDT Anyone have any recommendations on books about learning languages? [link] [comments] |
Does event handler face the same safety issue as Linux's signal handler? Posted: 29 Oct 2020 05:39 AM PDT |
You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States |
No comments:
Post a Comment