Readit Newswoodglyst commented on Show HN: I built a task manager that separates "do" and "due" dates apps.apple.com/us/app/zes... · Posted by u/zesfy
NotePlan is my favorite comparable app. It has super nice apps for Mac desktop and iOS. It also syncs your data to your iCloud account in text files so very good for privacy in that you are not storing you data on their servers.
I was looking for something like Noteplan as well. The subscription model and the price was a deterrent to me and I went with Agenda [0]
DVC does a lot more than git.
It essentially makes sure that your results can reproducibly be generated from your original data. If any script or data file is changed, the parts of your pipeline that depend on it, possibly recursively, get re-run and the relevant results get updated automatically.
There's no chance of e.g. changing the structure of your original dataset slightly, forgetting to regenerate one of the intermediate models by accident, not noticing that the script to regenerate it doesn't work any more due to the new dataset structure, and then getting reminded a year later when moving to a new computer and trying to regen everything from scratch.
It's a lot like Unix make, but with the ability to keep track of different git branches and the data / intermediates they need, which saves you from needing to regen everything every time you make a new checkout, lets you easily exchange large datasets with teammates etc.
In theory, you could store everything in git, but then every time you made a small change to your scripts that e.g. changed the way some model works and slightly adjusted a score for each of ten million rows, your diff would be 10m LOC, and all versions of that dataset would be stored in your repo, forever, making it unbelievably large.
This sounds a lot like the experimental project Jacquard [0] from Ink & Switch.
woodglyst commented on Show HN: A journaling service that runs over WhatsApp todayhasbeen.com... · Posted by u/rahulg
> amazing private collection of your life stories
I guess it's technically not "public" but then again it's shipping your most private thoughts to WhatsApp and an unknown person and "privacy" isn't mentioned on the landing page once.
Personally I can recommend DayOne which is built by a trusted entity Automattic (Wordpress etc.) and they do have a big focus on privacy: https://dayoneapp.com/privacy-pledge/
End to end encryption is not really a pledge. That is expected of companies like such. Nevertheless, their promise to not sell any data is interesting. If they don’t sell data (which cannot be sold anyways for an E2EE system) I wonder why they collect so much data related to one’s identity as disclosed by them in the App Store Page? Is the behaviour of journaling then becomes a data point to be sold by these companies? Makes you wonder. And as mentioned in their privacy policy page, they are also not except from disclosing information the the US Govt if mandated by a warrant.
woodglyst commented on I won't be renewing my Pinboard subscription notes.kateva.org/2024/09/... · Posted by u/leotravis10
How are others storing their bookmarks now? I've moved to Google Sheets for some cases, but it's much less powerful
I got Anybox[0] with the lifetime subscription (40$) and have been happy with it (Only for Apple devices unfortunately)
I can choose to automatically download a web archive when I bookmark. Also has a trial version. Can be a bit overwhelming to set things up. But works seamlessly once done.
Dead Comment
woodglyst commented on Show HN: Optigraph – optimum graph network generator github.com/LovetheFrogs/O... · Posted by u/LovetheFrogs
https://news.ycombinator.com/item?id=36942305#36946741 :
> Is re-planning routes for regenerative braking solvable with the Modified Snow Plow Problem (variation on TSP Traveling Salesman Problem), on a QC Quantum Computer; with Quantum Algorithmic advantage due to the complexity of the problem?
FWIU the Modified Snow Plow Problem is a variant of TSP the Traveling Salesman Problem which takes topological grade into account; only plow downhill.
Regenerative braking charges on downhills.
TSP can be implemented with quantum algorithms for a quantum computer.
There could be a call for and/or an ml competition for QC algos for TSP and similar:
> - QISkit tutorials > Max-Cut and Traveling Salesman Problem: docs/tutorials/06_examples_max_cut_and_tsp.ipynb: https://qiskit.org/ecosystem/optimization/tutorials/06_examp...
Quantum Algorithm Zoo probably lists existing quantum algorithms that might be useful for this application
The statement that this can be implemented with a quantum algorithm is a bit ambiguous. If you look in detail, the problem is only formulated on the quantum computer while the optimization routine which essential solves the problem is left to a classical computer. There are some notions of quantum gradients. But I wouldn’t know how it applies to such problems
woodglyst commented on New design of the OpenAI blog page openai.com/news... · Posted by u/Wasserpuncher
Still missing RSS feed
woodglyst commented on RSS Feed Organization Strategies and New Feed Cost yukinu.com/blog/2024/02/0... · Posted by u/surprisetalk
Yep. That would be a classic sort of k-means problem. Just throw them all into a standard embedding, like the OA API embeddings, run k-means from sci-kit, then convert them into a list-of-lists: one RSS item (containing a list of title-URLs) per cluster.
The problem with this approach is determining the what k is for the k-means. But again, we could use the “elbow” technique to determine what’s the optimal k and then start grouping them together. I wonder if there are any automatic sophisticated clustering algorithms?
> MacBook Air: The World’s Most Popular Laptop Now Starts at 16GB
> MacBook Air is the world’s most popular laptop, and with Apple Intelligence, it’s even better. Now, models with M2 and M3 double the starting memory to 16GB, while keeping the starting price at just $999 — a terrific value for the world’s best-selling laptop.