Tootfinder

Copywriters reveal how AI has decimated their industry https://simonwillison.net/2025/Dec/14/copywriters-reveal-how-ai-has-decimated-their-industry/

🇺🇦 #NowPlaying on KEXP's #DriveTime
The Cure:
🎵 Disintegration
#TheCure
https://mrlckmshp.bandcamp.com/track/disko-cure-hey-disintegration-ascii-disko-hey-vs-the-cure-disintegration

'We have a right to do this': DeSantis wants Florida to move ahead with AI policies (Andrew Atterbury/Politico)
https://www.politico.com/news/2025/12/15/we-have-a-right-to-do-this-desantis-wants-florida-to-move-ahead-with-ai-policies-00690680
http://www.memeorandum.com/251215/p117#a251215p117

Microsoft signs a deal with a legal advocacy group to resolve claims it denied discounts to conservative religious nonprofits; OpenAI and Asana also made deals (Jeff Green/Bloomberg)
https://www.bloomberg.com/news/articles/20

Good photos.
This is my city here: the bad and the good. I recognize it — which is always a strong compliment to journalistic work.
https://www.motherjones.com/politics/2026/01/ice-descends-on-minneapolis/

Mars 2020 Entry Descent Landing
A 3D animation in real time on your web browser from NASA's Mars exploration in 2020.
🌌 #nasa

Minimizing smooth Kurdyka-{\L}ojasiewicz functions via generalized descent methods: Convergence rate and complexity
Masoud Ahookhosh, Susan Ghaderi, Alireza Kabgani, Morteza Rahimi
https://arxiv.org/abs/2511.10414 https://arxiv.org/pdf/2511.10414 https://arxiv.org/html/2511.10414
arXiv:2511.10414v1 Announce Type: new
Abstract: This paper addresses the generalized descent algorithm (DEAL) for minimizing smooth functions, which is analyzed under the Kurdyka-{\L}ojasiewicz (KL) inequality. In particular, the suggested algorithm guarantees a sufficient decrease by adapting to the cost function's geometry. We leverage the KL property to establish the global convergence, convergence rates, and complexity. A particular focus is placed on the linear convergence of generalized descent methods. We show that the constant step-size and Armijo line search strategies along a generalized descent direction satisfy our generalized descent condition. Additionally, for nonsmooth functions by leveraging the smoothing techniques such as forward-backward and high-order Moreau envelopes, we show that the boosted proximal gradient method (BPGA) and the boosted high-order proximal-point (BPPA) methods are also specific cases of DEAL, respectively. It is notable that if the order of the high-order proximal term is chosen in a certain way (depending on the KL exponent), then the sequence generated by BPPA converges linearly for an arbitrary KL exponent. Our preliminary numerical experiments on inverse problems and LASSO demonstrate the efficiency of the proposed methods, validating our theoretical findings.
toXiv_bot_toot

If you're in Austin and want to attend #LonghornPHP next week but can't swing the ticket price, we still have some donated in-person tickets available. Pay $20 now, then get that $20 refunded when you show up. https:/…

🇺🇦 #NowPlaying on KEXP's #SeekAndDestroy
Këkht Aräkh:
🎵 Night Descends
#KëkhtAräkh
https://sacredbonesrecords.bandcamp.com/track/k-kht-ar-kh-night-descends
https://open.spotify.com/track/7lddJnkY1evqrfFIBcxEaZ

🇺🇦 #NowPlaying on KEXP's #MechanicalBreakdown
Desinteresse:
🎵 Silhouet
#Desinteresse
https://desinteresse.bandcamp.com/track/silhouet
https://open.spotify.com/track/2cqLoD7WuYOGn8TQrBzMDb