Rahul Panicker

Very nice!

Postdoc position in Algebraic Complexity Theory at the IT University of Copenhagen The Algorithms group at IT University of Copenhagen invites highly motivated persons for one funded postdoc position in Algebraic Complexity Theory starting 1 J

I am looking for a postdoc candidate. Here are some details. Could you please help me spread the word? Thanks! Application deadline: April 22, 2025.
candidate.hr-manager.net/ApplicationI...

@jay.bsky.team @support.bsky.team Can something please be done about these?

Congratulations! 🙂

These typically work when the graph structure is assumed, and parameters are learned. Eg for question — robot is being trained to cook. Grasping, placing, cutting, sprinkling, mixing, measuring are all tasks that apply across multiple ingredients, mixtures, or dishes. Data is 3D voxel-labeled video.

Thank you!

Trying my luck here: compositionality in learning. Automated decomposition of sequential tasks into modules that can be composed.

Structured analysis of hidden convexity. What are problems where it is possible, how to sniff them out, good reviews, etc.

Yep, I’ll go on a limb and say impossible to imagine.

Yep! Same reason applies for composition.

One might argue that it is closed form if one can do analysis and algebra on it. Composition, derivatives, etc.

#OTD Indian physicist C. V. Vishveshwara(1938-2017) was born. Vishveshwara made many important contributions to general relativity.

His seminal contribution was the discovery of quasi-normal modes in black holes.⚛️

Black hole man of India. His book was delightful.

How cool!

A touch of self-advertisement: I'll be giving a research talk next Tuesday at the Online Monte Carlo Seminar (sites.google.com/view/monte-c...) on one of my favourite topics: the convergence properties of the Random Walk Metropolis algorithm. Please join us!

Whoa! 🙂

What’s the backstory?

Congratulations, Yoshua!