ICE invading Minny is like when Hitler invaded Russia in winter.
That metro has a high concentration of motivated liberals with the means to organize and act.
https://bsky.app/profile/resnikoff.bsky.social/post/3mcfyff5ugs2x
from my link log —
The Julian Period and Modified Julian Dates.
https://www.researchgate.net/publication/234215919_The_Julian_and_Modified_Julian_Dates
saved 2026-01-11
Grow & Glow With Martine
We'll talk mindset, motivation, and the messy middle, with a mix of laughter, inspiration, and honest conversations...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/grow-glow-with-martine/
RE: https://techhub.social/@meteopedagogie/115542926657446361
Pois é, pš. Tou a vê-lo da janela, e tš mesmo mau.
Jag har blivit rostad, debunkad och gjort en halmgubbe - enligt carnivorsnubbar https://traningslara.se/carnivorsverige-olle-gor-bort-sig/
Fick svar från Loopia ang att de hostar vit makt sidor (salem marchen). Fick detta svar:
'> Uppskattar att du hör av dig om detta. Jag svarar dig i kraft av supportansvarig här på Loopia och vill bekräfta att vi är medvetna om detta och för dialog med kunden i fråga om dennes fortsatta användade av våra tjänster.
> '
Juste med feedback. Sen kan jag inte förstå vad dialog ska leda till...
Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
Ilyas Fatkhullin, Niao He, Guanghui Lan, Florian Wolf
https://arxiv.org/abs/2511.10626 https://arxiv.org/pdf/2511.10626 https://arxiv.org/html/2511.10626
arXiv:2511.10626v1 Announce Type: new
Abstract: Constrained non-convex optimization is fundamentally challenging, as global solutions are generally intractable and constraint qualifications may not hold. However, in many applications, including safe policy optimization in control and reinforcement learning, such problems possess hidden convexity, meaning they can be reformulated as convex programs via a nonlinear invertible transformation. Typically such transformations are implicit or unknown, making the direct link with the convex program impossible. On the other hand, (sub-)gradients with respect to the original variables are often accessible or can be easily estimated, which motivates algorithms that operate directly in the original (non-convex) problem space using standard (sub-)gradient oracles. In this work, we develop the first algorithms to provably solve such non-convex problems to global minima. First, using a modified inexact proximal point method, we establish global last-iterate convergence guarantees with $\widetilde{\mathcal{O}}(\varepsilon^{-3})$ oracle complexity in non-smooth setting. For smooth problems, we propose a new bundle-level type method based on linearly constrained quadratic subproblems, improving the oracle complexity to $\widetilde{\mathcal{O}}(\varepsilon^{-1})$. Surprisingly, despite non-convexity, our methodology does not require any constraint qualifications, can handle hidden convex equality constraints, and achieves complexities matching those for solving unconstrained hidden convex optimization.
toXiv_bot_toot
McCarthy hits 'Griddy' before TD, irking O'Connell https://www.espn.com/nfl/story/_/id/47311552/jj-mccarthy-td-dance-irks-vikings-coach-kevin-oconnell
»Over 67,000 Fake npm Packages Flood Registry in Worm-Like Spam Attack:
Cybersecurity researchers are calling attention to a large-scale spam campaign that has flooded the npm registry with thousands of fake packages since early 2024 as part of a likely financially motivated effort.«
How do you check if the JavaScript libraries and their libraries on which they are based are now safe?!??
🧑💻