"France’s largest rewilding project"
#France #Rewilding #Environment
Micron introduces the first mass-produced PCIe 6.0 SSDs, with read speeds up to 28GB/s, double that of PCIe 5.0 SSDs, optimized for AI/data center deployments (Aaron Klotz/Tom's Hardware)
https://www.
🇺🇦 #NowPlaying on #KEXP's #AfternoonShow
Jill Scott:
🎵 Beautiful People
#JillScott
https://orlandovoorn2.bandcamp.com/album/goat-series-jill-scott-beautiful-people-dba-remixes
https://open.spotify.com/track/6S37ilrmjAKT7hq63NSylw
🎶 show playlist 👇
https://open.spotify.com/playlist/2Ivj2i9BbyMoJmb0ZucUM2
🎶 KEXP playlist 👇
https://open.spotify.com/playlist/6VNALrOa3gWbk794YuIrwg
The Hole in Trump's Rationale for Acquiring Greenland (The Atlantic)
https://www.theatlantic.com/national-security/2026/01/pentagon-arctic-greenland-china-russia/685553/?gift=YomuSz8U7hgV6-iiBzXx_DUBUJLpiEJkNSXs5GxZeDo&utm_source=copy-link&utm_medium=social&utm_campaign=share
http://www.memeorandum.com/260109/p112#a260109p112
Prune, Don't Rebuild: Efficiently Tuning $\alpha$-Reachable Graphs for Nearest Neighbor Search
Tian Zhang, Ashwin Padaki, Jiaming Liang, Zack Ives, Erik Waingarten
https://arxiv.org/abs/2602.08097 https://arxiv.org/pdf/2602.08097 https://arxiv.org/html/2602.08097
arXiv:2602.08097v1 Announce Type: new
Abstract: Vector similarity search is an essential primitive in modern AI and ML applications. Most vector databases adopt graph-based approximate nearest neighbor (ANN) search algorithms, such as DiskANN (Subramanya et al., 2019), which have demonstrated state-of-the-art empirical performance. DiskANN's graph construction is governed by a reachability parameter $\alpha$, which gives a trade-off between construction time, query time, and accuracy. However, adaptively tuning this trade-off typically requires rebuilding the index for different $\alpha$ values, which is prohibitive at scale. In this work, we propose RP-Tuning, an efficient post-hoc routine, based on DiskANN's pruning step, to adjust the $\alpha$ parameter without reconstructing the full index. Within the $\alpha$-reachability framework of prior theoretical works (Indyk and Xu, 2023; Gollapudi et al., 2025), we prove that pruning an initially $\alpha$-reachable graph with RP-Tuning preserves worst-case reachability guarantees in general metrics and improved guarantees in Euclidean metrics. Empirically, we show that RP-Tuning accelerates DiskANN tuning on four public datasets by up to $43\times$ with negligible overhead.
toXiv_bot_toot
Study: AI's 2025 power demand could hit 23GW, above 2024 Bitcoin mining levels, and AI carbon emissions could hit 32.6M to 79.7M tons, compared to NYC's 50M (Justine Calma/The Verge)
https://www.theverge.com/news/845831/ai-chips-data-center-power-water