Jean-Marc

Is there any activity here whatsoever?

*pinging for signs of life*

Lecture slides for my "Introduction to #ComputerVision" and "#DeepLearning in Computer Vision" courses.

🆕 Gaussian Splatting
🆕 Flow Matching

The included videos do not contain voiceovers yet, planned for a future revision.

– jeremarc A blog about tech and life

blog.jeremarc.com/micro_posts/...

Relaxing Munich

"What you don't know may not hurt you, but what you don't remember always does."

👆🏻 RL agent angry about sparse rewards

I just read "Welcome to the Era of Experience", advocating for agents grounded from interacting with the real world and getting their rewards from an "open-world" instead of simulation+simple reward.

I open bluesky

You propose agents working out for you. Someone is preparing for a grant 🤔

Swagger supports OpenAPI 3.1 since 19 Jun 2023 (at least that's the blog post date announcing it).

You think you can use the latest Swagger Editor for OpenAPI 3.1 on 22 April 2025, only 673 days later?

Nope, only if you pull tag `next-v5-unprivileged` ¿¡

1. LLM-generated code tries to run code from online software packages. Which is normal but
2. The packages don’t exist. Which would normally cause an error but
3. Nefarious people have made malware under the package names that LLMs make up most often. So
4. Now the LLM code points to malware.

Help us create a vision for Rust's future | Rust Blog Empowering everyone to build reliable and efficient software.

🦀 Help us create a vision for Rust's future, by taking part in our vision survey!

Check out the blog post: blog.rust-lang.org/2025/04/04/v...

Plan wisely.

An extension could be for multi-agent systems, although way more complex to include the safety constraints (no collision)

Graph neural networks extrapolate out-of-distribution for shortest paths Neural networks (NNs), despite their success and wide adoption, still struggle to extrapolate out-of-distribution (OOD), i.e., to inputs that are not well-represented by their training dataset. Addres...

arxiv.org/abs/2503.19173

This looks like a paper worth diving in

"We __prove__ that GNNs, trained to minimize a sparsity-regularized loss over a small set of shortest path instances, exactly implement the Bellman-Ford (BF) algorithm for shortest paths."

And a great blog post David wrote here: www.davidsilver.uk/wp-content/u...

You can find the paper here: ojs.aaai.org/index.php/AI...

...For every step Agent 1 makes, you reserve 2 cells in the shared table. For every step Agent 2 makes you reserve at least 1 cell.

What if some agents are slower/faster, how would the reservation table look like?
You discretize time based on their relative speed.
Imagine agent 1 4x as fast as agent 2. The shared table has cells of unit 1. Agent 1 table has cells of unit 2 and Agent 2 table cells of unit 0.5...

The idea is explained in this figure.
Agents reserve their shortest path in sequence, and a new Space-Time A* approach is used to find the shortest non-reserved path.

Let's go even further in the past to 2005 with David Silver's "Cooperative Pathfinding" paper

Yes, the same David Silver at DeepMind who led many of the breakthrough papers including AlphaGo and AlphaZero

Conflict-based search for optimal multi-agent pathfinding In the multi-agent pathfinding problem (MAPF) we are given a set of agents each with respective start and goal positions. The task is to find paths fo…

You can find the paper here: www.sciencedirect.com/science/arti...

At this point there are so many variants of CBS someone should write a review paper called "The CBS Family"

... 1 universe, agent 1 has to give way, and in another universe agent 2 has to give way. For each of those expansions, you search for all other collisions to resolve them. As soon as you expand possibilities and can't find a collision, you actually reached an optimal solution.

Simply put, you plan the shortest path for each of the agents then check for collisions. Collision is 2 agents reaching the same node at the same time, or crossing the same edge in opposite directions at the same time. For each collision you expand your "tree of possibilities" considering that in...