Unclear to me why no one ever mentions Strongbox in #PasswordManager reviews. It is a perfectly fine PM for macOS/iOS/iPadOS that has a rich set of sync options, most of which don't involve any 2nd/3rd party storage. It stores its databases in KeePass2.x (kdbx v4) format, so it is data-compatible with the many variations of KeePass.
(I use it with SSH/SCP sync, so as long as I’m at…

A judge denies Fox's motion to dismiss a wrongful death lawsuit filed by the parents of Oleksandra Kuvshynova, killed while working for Fox in Ukraine in 2022 (Jeremy Barr/@jeremymbarr)
https://x.com/jeremymbarr/status/2006065989511750010

Jeremy Barr (@jeremymbarr) on X
A New York judge today denied Fox's motion to dismiss a lawsuit filed by the parents of the Ukrainian journalist killed while working for the network (in 2022) despite the fact that her father signed a release to receive benefits. Judge: "When the Kuvshynovs signed the waiver

On fundamental properties of high-order forward-backward envelope
Alireza Kabgani, Masoud Ahookhosh
https://arxiv.org/abs/2511.10421 https://arxiv.org/pdf/2511.10421 https://arxiv.org/html/2511.10421
arXiv:2511.10421v1 Announce Type: new
Abstract: This paper studies the fundamental properties of the high-order forward-backward splitting mapping (HiFBS) and its associated forward-backward envelope (HiFBE) through the lens of high-order regularization for nonconvex composite functions. Specifically, we (i) establish the boundedness and uniform boundedness of HiFBS, along with the H\"older and Lipschitz continuity of HiFBE; (ii) derive an explicit form for the subdifferentials of HiFBE; and (iii) investigate necessary and sufficient conditions for the differentiability and weak smoothness of HiFBE under suitable assumptions. By leveraging the prox-regularity of $g$ and the concept of $p$-calmness, we further demonstrate the local single-valuedness and continuity of HiFBS, which in turn guarantee the differentiability of HiFBE in neighborhoods of calm points. This paves the way for the development of gradient-based algorithms tailored to nonconvex composite optimization problems.
toXiv_bot_toot

📣 PhD Position in Computational & Systems Neuroscience (Marseille, France)

⏰ Deadline: January 28, 2026
We are recruiting a PhD student to work on neuromodulatory control of predictive processing in mouse vision, co-supervised by Ede Rancz (INMED) and myself.
This CENTURI project com…

Ede Rancz (@ederancz.bsky.social)
neuroscientist, free will denier

🔊 #NowPlaying on #BBCRadio3:
#Radio3InConcert
- Shostakovich from Manchester
BBC Philharmonic and Chief Conductor John Storgårds in Shostakovich. They are joined by Anastasia Kobekina for Dvořšk's Cello Concerto.
Relisten now 👇
https://www.bbc.co.uk/programmes/m002mw41

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

🇺🇦 #NowPlaying on #KEXP's #DriveTime
Prince:
🎵 Sign "O" the Times
#Prince
https://ericfaria.bandcamp.com/track/prince-sign-o-the-times-eric-faria-remix
https://open.spotify.com/track/4Yenz5JZZOUiZSeyKY8bDz
🎶 show playlist 👇
https://open.spotify.com/playlist/2KW4FxNKVGpVTgIJYolnNY
🎶 KEXP playlist 👇
https://open.spotify.com/playlist/6VNALrOa3gWbk794YuIrwg

🇺🇦 #NowPlaying on BBCRadio3's #EssentialClassics
Maurice Ravel, Ittai Shapira & Jeremy Denk:
🎵 Sonata for Violin & Piano No. 2 in G Major, M. 77: I. Allegretto
#MauriceRavel #IttaiShapira #JeremyDenk
https://open.spotify.com/track/7K3Cp2xzZm1v5xEcsqFLGC