latest news

in this website, we will provide you all new latest news

Sunday, 30 April 2023

Saturday, 29 April 2023

Friday, 28 April 2023

Thursday, 27 April 2023

Wednesday, 26 April 2023

Tuesday, 25 April 2023

Monday, 24 April 2023

Sunday, 23 April 2023

Saturday, 22 April 2023

Friday, 21 April 2023

Thursday, 20 April 2023

Wednesday, 19 April 2023

Tuesday, 18 April 2023

Monday, 17 April 2023

Sunday, 16 April 2023

Saturday, 15 April 2023

Friday, 14 April 2023

Thursday, 13 April 2023

New top story on Hacker News: Coding Jobs and GPT-4

                No comments   

Coding Jobs and GPT-4
16 by bb1234 | 11 comments on Hacker News.
Do you believe that GPT-4 will significantly reduce the demand for coders? If not, why not? I am curious to get your sense of this. I am not a professional coder. I write code for scientific work. But I am really curious.

Wednesday, 12 April 2023

Tuesday, 11 April 2023

Monday, 10 April 2023

Sunday, 9 April 2023

Saturday, 8 April 2023

Friday, 7 April 2023

Thursday, 6 April 2023

Wednesday, 5 April 2023

New top story on Hacker News: Show HN: Quadratic – Open-Source Spreadsheet with Python, AI (WASM and WebGL)

                No comments   

Show HN: Quadratic – Open-Source Spreadsheet with Python, AI (WASM and WebGL)
38 by davidkircos | 13 comments on Hacker News.
Hi, I am David Kircos. The Founder of Quadratic ( https://QuadraticHQ.com ), an open-source spreadsheet application that supports Python, SQL (coming soon), AI Prompts, and classic Formulas. Unlike other spreadsheets, Quadratic has an infinite canvas (like Figma). As a result, you can pinch and zoom to navigate large data sets, and everything renders smoothly at 60fps. Our vision is to build a place where your team can collaborate on data analysis. You can write Python, AI Prompts, and Formulas in one spreadsheet feeding each other data and updating automatically. Quadratic is built using WebGL and Rust WASM. To render a large grid of cells smoothly, we tile the spreadsheet similar to google maps. If you are interested in the technical details, check us out on GitHub ( https://ift.tt/FqY6zf5 ) You can use AI to help you write Python and then run the code directly in Quadratic. Then, we feed the result back to the AI model so it can follow along, help you debug, and modify your existing code. AI can also be used to directly generate data onto the sheet with prompts. It knows the context of what's on the sheet and how the data it's inserting fits in. Try it out. SQL is coming soon... stay tuned!

New top story on Hacker News: Show HN: Want something better than k-means? Try BanditPAM

                No comments   

Show HN: Want something better than k-means? Try BanditPAM
21 by motiwari | 0 comments on Hacker News.
Want something better than k-means? I'm happy to announce our SOTA k-medoids algorithm from NeurIPS 2020, BanditPAM, is now publicly available! `pip install banditpam` or `install.packages("banditpam")` and you're good to go! k-means is one of the most widely-used algorithms to cluster data. However, it has several limitations: a) it requires the use of L2 distance for efficient clustering, which also b) restricts the data you're clustering to be vectors, and c) doesn't require the means to be datapoints in the dataset. Unlike in k-means, the k-medoids problem requires cluster centers to be actual datapoints, which permits greater interpretability of your cluster centers. k-medoids also works better with arbitrary distance metrics, so your clustering can be more robust to outliers if you're using metrics like L1. Despite these advantages, most people don't use k-medoids because prior algorithms were too slow. In our NeurIPS 2020 paper, BanditPAM, we sped up the best known algorithm from O(n^2) to O(nlogn) by using techniques from multi-armed bandits. We were inspired by prior research that demonstrated many algorithms can be sped up by sampling the data intelligently, instead of performing exhaustive computations. We've released our implementation, which is pip- and CRAN-installable. It's written in C++ for speed, but callable from Python and R. It also supports parallelization and intelligent caching at no extra complexity to end users. Its interface also matches the sklearn.cluster.KMeans interface, so minimal changes are necessary to existing code. PyPI: https://ift.tt/ueg5LWJ CRAN: https://ift.tt/8tZ9LnE Repo: https://ift.tt/leVhwGk Paper: https://ift.tt/mid4FX1 If you find our work valuable, please consider starring the repo or citing our work. These help us continue development on this project. I'm Mo Tiwari (motiwari.com), a PhD student in Computer Science at Stanford University. A special thanks to my collaborators on this project, Martin Jinye Zhang, James Mayclin, Sebastian Thrun, Chris Piech, and Ilan Shomorony, as well as the author of the R package, Balasubramanian Narasimhan. (This is my first time posting on HN; I've read the FAQ before posting, but please let me know if I broke any rules)

Tuesday, 4 April 2023

Monday, 3 April 2023

Sunday, 2 April 2023

Saturday, 1 April 2023

Popular Posts

Recent Posts

Unordered List

Pages

Text Widget

Blog Archive

Powered by Blogger.

Sample Text