frontpage.
newsnewestaskshowjobs

Made with ♥ by @iamnishanth

Open Source @Github

fp.

Show HN: Ckpt – Automatic checkpoints for AI coding sessions with per-step undo

https://github.com/mohshomis/ckpt
1•mohshomis•1m ago•0 comments

Simple Self-Distillation

https://github.com/apple/ml-ssd
1•mihau•1m ago•0 comments

The Shell Is the Most Underrated Interface in AI

https://blog.nishantsoni.com/p/the-shell-is-the-most-underrated
1•sonink•2m ago•1 comments

HN: EnvGuard–VSCode extension for .env secret scanning and schema validation

https://marketplace.visualstudio.com/items?itemName=GayathriS.envguard-pro
1•Gayathri14•2m ago•0 comments

Grok scored zero on ARC-AGI-3. Every 5-year-old did better

https://aitwerp.com/signals/agi-benchmark-five-year-old-wins/
1•Inziu•5m ago•0 comments

Retraction of high-profile reproducibility study prompts soul-searching

https://www.nature.com/articles/d41586-024-03178-8
1•paulpauper•6m ago•0 comments

What I've Been Reading

https://marginalrevolution.com/marginalrevolution/2026/04/what-ive-been-reading-285.html
1•paulpauper•6m ago•0 comments

The Happiness Crash of 2020

https://papers.ssrn.com/sol3/papers.cfm?abstract_id=6465460
1•paulpauper•7m ago•0 comments

Thoughts on the SaaSpocalypse

https://www.davidbatey.com/blog/thoughts-on-the-saaspocalypse
1•davidlbatey•7m ago•1 comments

Bun OPDS Server for Xteink X4

https://github.com/rcarmo/bun-opds-server
1•rcarmo•7m ago•0 comments

Show HN: Spotlytt, Market your soft+technical skills to Hiring Team

1•pbs29•8m ago•0 comments

Anyone here attended dotJS/dotAI conferences in Paris?

1•blumebee•9m ago•0 comments

Nations priced out of Big AI are building with frugal models

https://restofworld.org/2026/frugal-ai-big-tech/
2•Brajeshwar•10m ago•0 comments

Ask HN: What are you moving on to now that Claude Code is so rate limited?

3•esperent•11m ago•1 comments

Ubiquitous data-driven framework for traffic emission estimation

https://www.nature.com/articles/s41893-026-01797-9
1•thunderbong•12m ago•0 comments

How to Win at Competitive Analysis

https://www.leadinginproduct.com/p/competitive-analysis
1•benkan•13m ago•0 comments

Wan2.7-Image Is Launched

https://wan27image.net
1•Jenny249•15m ago•0 comments

Show HN: I Built JASD – Just a Simple Downloader

https://github.com/MaRcR11/jasd
1•MaRcR11•16m ago•0 comments

New MSP platform to manage IT and cybersecurity

https://pinkduckcompany.com/docs/
1•hyperquack•16m ago•0 comments

Anthropic's next model could be a 'watershed moment' for cybersecurity

https://www.channel3000.com/news/technology/anthropic-s-next-model-could-be-a-watershed-moment-fo...
3•xbryanx•17m ago•0 comments

What happens when you don't die on time?

https://ottawacitizen.com/news/when-you-dont-die
1•speckx•17m ago•0 comments

Open-Source Edge Functions Runtime (Bun and JavaScript)

https://github.com/henriquemafra/dropfunctions
1•henriquemafra•18m ago•0 comments

Baby's Second Garbage Collector

https://www.matheusmoreira.com/articles/babys-second-garbage-collector
1•stevekemp•19m ago•0 comments

Python 3.4: Beyond Scripting – Building Scalable Systems

https://techlife.blog/posts/python-34-beyond-scripting/
1•tsenturk•19m ago•0 comments

Ask HN: Which CLI tools do you use daily?

2•elC0mpa•20m ago•3 comments

Using LLMs to build personal knowledge bases for various topics

https://twitter.com/i/status/2039805659525644595
5•redbell•21m ago•1 comments

A reproducible C toolchain rooted on POSIX shell

https://umontreal.scholaris.ca/items/2f44323a-9f4f-482a-98be-542d8ee5b9fb
2•laurenth•21m ago•0 comments

A Survey of Quantum Theory Inspired Approaches to Information Retrieval

https://arxiv.org/abs/2007.04357
1•9wzYQbTYsAIc•22m ago•0 comments

2026 Emoji Submissions

https://jenniferdaniel.substack.com/p/emoji-season-is-open
2•lacieargyle•26m ago•0 comments

Life Before Unicode – Character Sets and Code Pages at the Push of a Button

http://www.i18nguy.com/unicode/codepages.html#msftdos
1•shrikaranhanda•27m ago•0 comments
Open in hackernews

Numerical Linear Algebra Class in Julia TUM

https://venkovic.github.io/NLA-for-CS-and-IE.html
145•darboux•11mo ago

Comments

staplung•11mo ago
Not exactly the same material but U. Michigan has their Robotics 101 course up as well: Computational Linear Algebra, also in Julia.

https://github.com/michiganrobotics/rob101/tree/main

ted_dunning•11mo ago
This is a nicely comprehensive course, but it looks like it is pretty fast paced, especially in the last few lectures (some of those later slides definitely aren't finished).

As a reference, it looks very useful.

stabbles•11mo ago
A good resource is Gerard Sleijpen's course: https://webspace.science.uu.nl/~sleij101/Opgaven/NumLinAlg/
me3meme•11mo ago
I just selected lecture 07 to take a look: Lecture 07 is about QR factorizacion and Householder reflections. The author proves how to construct a reflection to make zeros in the first column and then he just claims that following this procedure for the other columns finish the proof. But he should prove or justify why the other reflections do not destroy the zeros of previous reflections. Also he proves that a vector v is the vector to construct the reflection (but there is a factor of 2 that was not correctly simplified, maybe a latex error), but I think that it should be more general and easier to prove that for any w the vector from w to its image f(w) is the orthogonal vector to the plane of the reflection.

I thank the author for the slides, but this little proof need some more care, I don't know about the quality of other sections or the overall quality of the slides. Anyway I like how he tries to make things easy but good work is hard.

Edited: I was wondering whether a LLM reading Lecture 7 would detect what was missing in the proof. I tried with deepseek but its first feedback on the Lecture 7 was positive, then when prompted about the incomplete proof it recognized it as a common error and explained how to complete the proof. Also I have to prompt it about the bad factor 2 for it to detect it. So it seems that deepseek is not a useful tool to judge quality of math content without very expert guidance, deepseek suggested to ask the LLM to compare this proof with another proof to detect important or vital differences.

Certhas•11mo ago
That's an absolutely obvious step though? As in, detailed lecture notes should maybe elaborate with a sentence, but in a lecture I would not put this on the slides but mention the core point and expect students at this level (who should have seen some amount of more theoretical LinAlg courses by then) to understand how to do the 1 line calculation.

There aren't even any real details to fill in, you iterate on the lower right block so anything you do is orthogonal to the upper left block. Do a 2x2 block matrix multiplication to convince yourself that this preserves the form achieved so far.

me3meme•11mo ago
-- Do a 2x2 block matrix multiplication to convince yourself that this preserves the form achieved so far.

I don't consider this a proof. Perhaps you have in mind two simple but key properties of reflections about the hyperplane orthogonal to a vector v: (a) The hyperplane of a reflection is the fixed point of the reflection (b) the hyperplane is the orthogonal vector space to the vector space spanned by v. From this two properties it follows that each step of making zeroes does not change previous zeroes.

Your claim that for advanced students there is no need to comment about details it is not falsifiable. Citing Mac Lane: A monad is just a monoid in the category of endofunctors.

But from a practical point of view one can see the very basic level and simplicity of the definitions and calculations prior to the proof. So at this level of detail I consider that noticing that one must be careful to not destroy previous zeros is matching the level of discourse at the proper level.

Certhas•11mo ago
10 LB = LB' 0Q 0A 0A'

The proof says iterate on A, so that obviously creates a lower dimensional rotation Q that will act on the full space as above.

Absolutely mention this in lecture notes/during the lecture.

slwvx•11mo ago
I guess the title would better be "Numerical Linear Algebra Class in Julia at TUM". I.e. the "TUM" in the title does not mean that there's some new "TUM" version of Julia, rather that the class is at the Technical University of Munich.