The true geeks among you will appreciate this:
How to convert a day number (and, transitively) a number of seconds since an calendar start date ("epoch", e.g. 1970-01-01) into a readable date in only 24 CPU cycles.
https://www.benjoffe.com/fast-date-64
TikTok says the new US entity has not updated its algorithm since the joint venture was announced, after users accused it of suppressing posts related to ICE (David McCabe/New York Times)
https://www.nytimes.com/2026/01/27/us/tiktok-ice-minneapolis-techni…
More than 20% of the videos that YouTube’s algorithm shows to new users are “AI slop”
– low-quality AI-generated content designed to farm views, research has found.
The video-editing company Kapwing surveyed 15,000 of the world’s most popular YouTube channels
– the top 100 in every country
– and found that 278 of them contain only AI slop.
Together, these AI slop channels have amassed more than 63 billion views and 221 million subscribers,
-- generating ab…
Is anyone are of good tools for "the attacker knows the key but not the system" cryptanalysis?
I'm thinking scenarios like "I've dumped external flash and efuses off a target with encrypted firmware, but I don't know the algorithm or image format".
So ciphertext and key are believed to be known, but bit ordering, endianness, algorithm, headers, etc are unknown.
Gizmodo reports on X recently releasing a significant part of the source code for its ordered post display algorithm. Elon Musk characterizes the algorithm as "dumb."
"Elon Musk Makes Part of X Algorithm Open Source, Says It ‘Sucks’"
https://gizmodo.co…
This is a really good assessment (why people are complaining BlueSky is “mean”), IMO.
It’s also true of Mastodon, for very similar reasons.
If I may mangle a line from “Grosse Pointe Blank”:
“if people are hot in your mentions, you did something to bring them there”
OTOH, BS and Masto have tools to manage that. (though they need improvement)
Here is an updated version of the #NFDI graph: large nodes are consortia, small nodes are institutions. Graph created with data from #Wikidata, visualized with #Gephi, using force atlas algorithm and modularity class c…
@… following up on our chat at #SDSL2025, I finally found some time to see how a #QGIS Processing Algorithm Provider plugin can be unit tested. Here's what I've …
China's Cyberspace Administration requires firms to file their AI tools in a public algorithm registry, creating a detailed map of the country's AI ecosystem (Yi-Ling Liu/Wired)
https://www.wired.com/story/china-ai-boom-algorithm-registry/
by accident i stumbled on this review by the #NSA on Bruce Schneiers "Applied Crypto" book from long ago.
Matching Algorithm with Recursively Implemented StorAge (MARISA) is a space-efficient, fairly fast, and static trie data structure. MARISA serves as a dictionary structure, and by definition, it supports exact match lookup, which is the basic operation of dictionary. In addition, MARISA supports reverse lookup, common prefix search, and predictive search.
Thanks to @…
2/2
> "They are in charge of the #algorithm. … For me, we don't speak about #FreeSpeech when the algorithm is hidden and in the hands of very few players."
YouTube, 18.11.2025: https://www.youtube.com/watch?v=TLRMy6xC3Mo
TikTok US says it is working to restore services after a power outage at a data center and any algorithm changes users noticed were likely due to the outage (Dan Whateley/Business Insider)
https://www.businessinsider.com/tiktok-outage-data-cent…
I love taking the train, but the weaponized incompetence of VIA Rail makes wish I'd taken another type of transportation, nearly every time.
Current status: “I, like the other two agents you spoke to, can't actually help you in any way, but I assure you that once you're on the train, the staff will be able to help. It's *the algorithm* not us!”
Internal documents: Instagram execs have waged an aggressive campaign to win back teens, boosting teen-friendly influencers, adjusting its algorithm, and more (Naomi Nix/Washington Post)
https://www.washingtonpost.com/technology/2025/12/26/meta-instagram-te…
It’s late 2025 and Sitepoint is still advocating for the document outline algorithm:
https://www.sitepoint.com/headings-in-html-structure/
The algorithm was never implemented, removed from WHATWG HTML in 2022:
There are 3 fundamental freedoms outlined in Dawn of Everything:
(1) the freedom to move away or relocate from one’s surroundings;
(2) the freedom to ignore or disobey commands issued by others; and
(3) the freedom to shape entirely new social realities, or shift back and forth between different ones.
I think these can all be captured in one statement when reframed as a system constraint: for a system to be free, participation must be optional for all members.
People must be part of *some* system. Even individualistic survivalism is itself a system (if not a very good one). Then there is a corollary as well: any system that is not free, that is not optional, can turn optional systems into mandatory ones, and thus (adopted from the MLK quote) un-freedom anywhere is a threat to freedom everywhere.
Edit:
I'm gonna drop the #Philosophy tag on here because apparently that's where I went with it. Challenges and push-back welcome.
Edit:
Aaaaand Its a blog post
https://anarchoccultism.org/building-zion/an-algorithm-for-liberation
As usual, comments, typos, and questions are always welcome.
How to survive Instagram's algorithm as a creative
- "Instagram is wrecking my head. I have a fairly decent number of followers. But hardly anyone sees my work"
- "I have a completely organic audience, yet my posts don't reach most of my followers"
- "Instagram hides your posts unless you post a selfie or anything personal"
- "You have something new? Post it, leave and focus on more important things."
- "Do o…
Occasionally, the YouTube algorithm recommends a fascinating video from a really obscure channel and this time I got this #math video about proving whether all 197 flags in the Sporcle flag quiz are constructible in #PowerPoint or Google Slides.
I have MANY issues with the #YouTube algorithm, but every now and then it just recommends me a #video of some random person with 6 views and 92 subscribers looking absolutely delighted as they review the #books they’re reading.
And I can’t stop smiling watching these videos every now and then because they are so human, earnest, and wonderfully awkward.
Scattering in Time-Varying Drude-Lorentz Models
Bryce Dixon, Calvin M. Hooper, Ian R. Hooper, Simon A. R. Horsley
https://arxiv.org/abs/2511.19322 https://arxiv.org/pdf/2511.19322 https://arxiv.org/html/2511.19322
arXiv:2511.19322v1 Announce Type: new
Abstract: Motivated by recent experiments, the theoretical study of wave propagation in time varying materials is of current interest. Although significant in nearly all such experiments, material dispersion is commonly neglected in theoretical studies. Yet, as we show here, understanding the precise microscopic model for the material dispersion is crucial for predicting experimental outcomes. Here we study the temporal scattering coefficients of four different time-varying Drude-Lorentz models, exploring how an incident continuous wave splits into forward and backward waves due to an abrupt change in plasma frequency. The differences in the predicted scattering are unique to time-varying media, and arise from the exact way in which the time variation appears in the various model parameters. We verify our results using a custom finite difference time domain algorithm, concluding with a discussion of the limitations that arise from using these models with an abrupt change in plasma frequency.
toXiv_bot_toot
Riccati-ZORO: An efficient algorithm for heuristic online optimization of internal feedback laws in robust and stochastic model predictive control
Florian Messerer, Yunfan Gao, Jonathan Frey, Moritz Diehl
https://arxiv.org/abs/2511.10473 https://arxiv.org/pdf/2511.10473 https://arxiv.org/html/2511.10473
arXiv:2511.10473v1 Announce Type: new
Abstract: We present Riccati-ZORO, an algorithm for tube-based optimal control problems (OCP). Tube OCPs predict a tube of trajectories in order to capture predictive uncertainty. The tube induces a constraint tightening via additional backoff terms. This backoff can significantly affect the performance, and thus implicitly defines a cost of uncertainty. Optimizing the feedback law used to predict the tube can significantly reduce the backoffs, but its online computation is challenging.
Riccati-ZORO jointly optimizes the nominal trajectory and uncertainty tube based on a heuristic uncertainty cost design. The algorithm alternates between two subproblems: (i) a nominal OCP with fixed backoffs, (ii) an unconstrained tube OCP, which optimizes the feedback gains for a fixed nominal trajectory. For the tube optimization, we propose a cost function informed by the proximity of the nominal trajectory to constraints, prioritizing reduction of the corresponding backoffs. These ideas are developed in detail for ellipsoidal tubes under linear state feedback. In this case, the decomposition into the two subproblems yields a substantial reduction of the computational complexity with respect to the state dimension from $\mathcal{O}(n_x^6)$ to $\mathcal{O}(n_x^3)$, i.e., the complexity of a nominal OCP.
We investigate the algorithm in numerical experiments, and provide two open-source implementations: a prototyping version in CasADi and a high-performance implementation integrated into the acados OCP solver.
toXiv_bot_toot
X says it has open sourced its "core recommendation system" on GitHub and that the system "ranks everything using a Grok-based transformer model" (Lucas Ropek/TechCrunch)
https://techcrunch.com/2026/01/20/x-op
Crosslisted article(s) found for physics.atom-ph. https://arxiv.org/list/physics.atom-ph/new
[1/1]:
- The Harrow-Hassidim-Lloyd algorithm with qutrits
Tushti Patel, V. S. Prasannaa
I went to see the Claude Desktop announcement, and they embed a YouTube Video, and this is what the algorithm thinks I should watch next:
„Only in the world of AI algorithm training can you claim that you were torrenting 2,400 porn videos for personal use and have that seem like the lesser of two evils.“ 😂
https://www.vice.com/en/article/meta-says-the-2400-ad…
"A new investigation of Elon #Musk’s X by Sky News found that every account set up by reporters, 'no matter their political orientation, was fed a glut of rightwing content', much of which was extreme. The experts it consulted believe this pattern could have resulted only from an algorithm engineered for this purpose, and that 'an algorithmic bias must be decided by senior people at …
Once limited to policing the nation’s boundaries,
the Border Patrol has built a surveillance system stretching into the country’s interior
that can monitor ordinary Americans’ daily actions and connections for anomalies instead of simply targeting wanted suspects.
The U.S. Border Patrol is monitoring millions of American drivers nationwide in a secretive program to identify and detain people whose travel patterns it deems suspicious, The Associated Press has found.
The …
The YouTube algorithm took me from the wonderful Deborah Ann Woll passionately talking about DnD to how to play DnD solo ...
Crosslisted article(s) found for cs.LG. https://arxiv.org/list/cs.LG/new
[1/3]:
- Optimizing Text Search: A Novel Pattern Matching Algorithm Based on Ukkonen's Approach
Xinyu Guan, Shaohua Zhang
https://arxiv.org/abs/2512.16927 https://mastoxiv.page/@arXiv_csDS_bot/115762062326187898
- SpIDER: Spatially Informed Dense Embedding Retrieval for Software Issue Localization
Shravan Chaudhari, Rahul Thomas Jacob, Mononito Goswami, Jiajun Cao, Shihab Rashid, Christian Bock
https://arxiv.org/abs/2512.16956 https://mastoxiv.page/@arXiv_csSE_bot/115762248476963893
- MemoryGraft: Persistent Compromise of LLM Agents via Poisoned Experience Retrieval
Saksham Sahai Srivastava, Haoyu He
https://arxiv.org/abs/2512.16962 https://mastoxiv.page/@arXiv_csCR_bot/115762140339109012
- Colormap-Enhanced Vision Transformers for MRI-Based Multiclass (4-Class) Alzheimer's Disease Clas...
Faisal Ahmed
https://arxiv.org/abs/2512.16964 https://mastoxiv.page/@arXiv_eessIV_bot/115762196702065869
- Probing Scientific General Intelligence of LLMs with Scientist-Aligned Workflows
Wanghan Xu, et al.
https://arxiv.org/abs/2512.16969 https://mastoxiv.page/@arXiv_csAI_bot/115762050529328276
- PAACE: A Plan-Aware Automated Agent Context Engineering Framework
Kamer Ali Yuksel
https://arxiv.org/abs/2512.16970 https://mastoxiv.page/@arXiv_csAI_bot/115762054461584205
- A Women's Health Benchmark for Large Language Models
Elisabeth Gruber, et al.
https://arxiv.org/abs/2512.17028 https://mastoxiv.page/@arXiv_csCL_bot/115762049873946945
- Perturb Your Data: Paraphrase-Guided Training Data Watermarking
Pranav Shetty, Mirazul Haque, Petr Babkin, Zhiqiang Ma, Xiaomo Liu, Manuela Veloso
https://arxiv.org/abs/2512.17075 https://mastoxiv.page/@arXiv_csCL_bot/115762077400293945
- Disentangled representations via score-based variational autoencoders
Benjamin S. H. Lyo, Eero P. Simoncelli, Cristina Savin
https://arxiv.org/abs/2512.17127 https://mastoxiv.page/@arXiv_statML_bot/115762251753966702
- Biosecurity-Aware AI: Agentic Risk Auditing of Soft Prompt Attacks on ESM-Based Variant Predictors
Huixin Zhan
https://arxiv.org/abs/2512.17146 https://mastoxiv.page/@arXiv_csCR_bot/115762318582013305
- Application of machine learning to predict food processing level using Open Food Facts
Arora, Chauhan, Rana, Aditya, Bhagat, Kumar, Kumar, Semar, Singh, Bagler
https://arxiv.org/abs/2512.17169 https://mastoxiv.page/@arXiv_qbioBM_bot/115762302873829397
- Systemic Risk Radar: A Multi-Layer Graph Framework for Early Market Crash Warning
Sandeep Neela
https://arxiv.org/abs/2512.17185 https://mastoxiv.page/@arXiv_qfinRM_bot/115762275982224870
- Do Foundational Audio Encoders Understand Music Structure?
Keisuke Toyama, Zhi Zhong, Akira Takahashi, Shusuke Takahashi, Yuki Mitsufuji
https://arxiv.org/abs/2512.17209 https://mastoxiv.page/@arXiv_csSD_bot/115762341541572505
- CheXPO-v2: Preference Optimization for Chest X-ray VLMs with Knowledge Graph Consistency
Xiao Liang, Yuxuan An, Di Wang, Jiawei Hu, Zhicheng Jiao, Bin Jing, Quan Wang
https://arxiv.org/abs/2512.17213 https://mastoxiv.page/@arXiv_csCV_bot/115762574180736975
- Machine Learning Assisted Parameter Tuning on Wavelet Transform Amorphous Radial Distribution Fun...
Deriyan Senjaya, Stephen Ekaputra Limantoro
https://arxiv.org/abs/2512.17245 https://mastoxiv.page/@arXiv_condmatmtrlsci_bot/115762447037143855
- AlignDP: Hybrid Differential Privacy with Rarity-Aware Protection for LLMs
Madhava Gaikwad
https://arxiv.org/abs/2512.17251 https://mastoxiv.page/@arXiv_csCR_bot/115762396593872943
- Practical Framework for Privacy-Preserving and Byzantine-robust Federated Learning
Baolei Zhang, Minghong Fang, Zhuqing Liu, Biao Yi, Peizhao Zhou, Yuan Wang, Tong Li, Zheli Liu
https://arxiv.org/abs/2512.17254 https://mastoxiv.page/@arXiv_csCR_bot/115762402470985707
- Verifiability-First Agents: Provable Observability and Lightweight Audit Agents for Controlling A...
Abhivansh Gupta
https://arxiv.org/abs/2512.17259 https://mastoxiv.page/@arXiv_csMA_bot/115762225538364939
- Warmer for Less: A Cost-Efficient Strategy for Cold-Start Recommendations at Pinterest
Saeed Ebrahimi, Weijie Jiang, Jaewon Yang, Olafur Gudmundsson, Yucheng Tu, Huizhong Duan
https://arxiv.org/abs/2512.17277 https://mastoxiv.page/@arXiv_csIR_bot/115762214396869930
- LibriVAD: A Scalable Open Dataset with Deep Learning Benchmarks for Voice Activity Detection
Ioannis Stylianou, Achintya kr. Sarkar, Nauman Dawalatabad, James Glass, Zheng-Hua Tan
https://arxiv.org/abs/2512.17281 https://mastoxiv.page/@arXiv_csSD_bot/115762361858560703
- Penalized Fair Regression for Multiple Groups in Chronic Kidney Disease
Carter H. Nakamoto, Lucia Lushi Chen, Agata Foryciarz, Sherri Rose
https://arxiv.org/abs/2512.17340 https://mastoxiv.page/@arXiv_statME_bot/115762446402738033
toXiv_bot_toot
on my blog!
doubly dual shuffles
https://dotat.at/@/2025-12-25-shuffle.html
polishing a classic algorithm to a pearlescent sheen as a gift to you this winter holiday
i wrote three lines of code in four different ways, but i tried to highlight how similar the four vari…
quantum computers become available. Algorithms like RSA/ECDH are vulnerable to Shor's algorithm.
🛡️ Post-quantum cryptography uses algorithms resistant to quantum attacks. OpenSSH now supports sntrup761x25519-sha512@openssh.com which combines classical
(Curve25519) and post-quantum (NTRU Prime) security for hybrid protection against both threats.
Facebook, whose algorithm is one sick SOB, shoved a "Trump for President" thread into my face this morning.
OMG. Crazy magats are practically shouting for civil war.
🇦🇹 Austria: In Vienna, the police is trialing an automated software to predict crime. Every day, the system outputs hotspots to patrol [Kurier, 3 Dec 🔒, in German]. via Algorithm Watch
#ai #privacy
For all newcomers: please use hashtags. (reasonable ones would be cool 😉). There is no algorithm that will push your content.
Maybe in 2026 we can start to agree that "a complex algorithm selects content" is an editorial stance and platforms should be responsible to a certain degree.
Someone asked me, “Have you read the latest Dan Brown?” There’s actually a mention of MISP in The Secret of Secrets. And yes, it fits surprisingly well within the story. Alex Conan (who assists Jonas Faukman in the investigation) mentions that he detected the activity using FTK, and that the indicators were later reused by the threat actor (having a hit on a MISP instance).
“But before I could build the algorithm, my FTK scan returned a hit. One of
the IoCs from th…
Did you know it's possible for two lines to appear to diverge in a 2D perspective view, but actually converge in 3D? Kind of the opposite of parallel lines in 3D converging in 2D.
I discovered this while trying to implement a clipping algorithm. At first I didn't believe it was possible, it felt so foreign to everyday experience. It actually happens whenever two lines converge behind the center of projection, but we rarely see that IRL.
(Image rendered from pov of came…
Need some data to test a plot idea or algorithm? On #rstats #synthetic…
Simply not compatible with their optimisation function
This loop explains well why commercial algorithms are incompatible with creativity.
"According to this employee, Spotify leadership didn’t see themselves as a music company, but as a time filler. The employee explained that, “the vast majority of music listeners, they’re not really interested in listening to music per se. They just need a soundtrack to a moment in their day.”
Simply providing a soundtrack to your d…
Crosslisted article(s) found for cond-mat.dis-nn. https://arxiv.org/list/cond-mat.dis-nn/new
[1/1]:
- Partitioning networks into clusters of synchronized nodes via the message-passing algorithm: an u...
Massimo Ostilli
A year since I cautioned about using APCA and calling it WCAG3’s next contrast algorithm:
https://toot.cafe/@aardrian/113801092971854851
As recent as last week, it seems WCAG3 contrast is still an open item:
Today, Youtube's ad algorithm seems to think that I am a black woman.
Perfect.
This was fun. But I can clearly optimize the algorithm once I learn #Gleam better.
I just completed "Playground" - Day 8 - Advent of Code 2025 #AdventOfCode
The US' TikTok deal is a win for ByteDance: it will keep and license the algorithm instead of selling it, and continue to run TikTok's commercial activities (Jim Secreto/Financial Times)
https://www.ft.com/content/59b91fc8-03a1-48df-9821-e2fdff24bd33
<…
"The last hit song of Belgian singer Stromae, called “Santé”, is a tribute to all those workers behind the scenes in our modern world; the ones growing or catching the food we eat; the ones transporting us; the ones building and cleaning our facilities; those who more often than not, we simply do not see.
How long until Stromae releases an update to this song including software workers among those groups? Not very long."
Replaced article(s) found for math.OC. https://arxiv.org/list/math.OC/new
[1/1]:
- A robust BFGS algorithm for unconstrained nonlinear optimization problems
Yaguang Yang
https://arxiv.org/abs/1212.5929
- Quantum computing and the stable set problem
Alja\v{z} Krpan, Janez Povh, Dunja Pucher
https://arxiv.org/abs/2405.12845 https://mastoxiv.page/@arXiv_mathOC_bot/112483516437815686
- Mean Field Game with Reflected Jump Diffusion Dynamics: A Linear Programming Approach
Zongxia Liang, Xiang Yu, Keyu Zhang
https://arxiv.org/abs/2508.20388 https://mastoxiv.page/@arXiv_mathOC_bot/115111048711698998
- Differential Dynamic Programming for the Optimal Control Problem with an Ellipsoidal Target Set a...
Sungjun Eom, Gyunghoon Park
https://arxiv.org/abs/2509.07546 https://mastoxiv.page/@arXiv_mathOC_bot/115179281556444440
- On the Moreau envelope properties of weakly convex functions
Marien Renaud, Arthur Leclaire, Nicolas Papadakis
https://arxiv.org/abs/2509.13960 https://mastoxiv.page/@arXiv_mathOC_bot/115224514482363803
- Automated algorithm design via Nevanlinna-Pick interpolation
Ibrahim K. Ozaslan, Tryphon T. Georgiou, Mihailo R. Jovanovic
https://arxiv.org/abs/2509.21416 https://mastoxiv.page/@arXiv_mathOC_bot/115286533597711930
- Optimal Control of a Bioeconomic Crop-Energy System with Energy Reinvestment
Othman Cherkaoui Dekkaki
https://arxiv.org/abs/2510.11381 https://mastoxiv.page/@arXiv_mathOC_bot/115372322896073250
- Point Convergence Analysis of the Accelerated Gradient Method for Multiobjective Optimization: Co...
Yingdong Yin
https://arxiv.org/abs/2510.26382 https://mastoxiv.page/@arXiv_mathOC_bot/115468018035252078
- History-Aware Adaptive High-Order Tensor Regularization
Chang He, Bo Jiang, Yuntian Jiang, Chuwen Zhang, Shuzhong Zhang
https://arxiv.org/abs/2511.05788
- Equivalence of entropy solutions and gradient flows for pressureless 1D Euler systems
Jos\'e Antonio Carrillo, Sondre Tesdal Galtung
https://arxiv.org/abs/2312.04932 https://mastoxiv.page/@arXiv_mathAP_bot/111560077272113052
- Kernel Modelling of Fading Memory Systems
Yongkang Huo, Thomas Chaffey, Rodolphe Sepulchre
https://arxiv.org/abs/2403.11945 https://mastoxiv.page/@arXiv_eessSY_bot/112121123836064435
- The Maximum Theoretical Ground Speed of the Wheeled Vehicle
Altay Zhakatayev, Mukatai Nemerebayev
https://arxiv.org/abs/2502.15341 https://mastoxiv.page/@arXiv_physicsclassph_bot/114057765769441123
- Hessian stability and convergence rates for entropic and Sinkhorn potentials via semiconcavity
Giacomo Greco, Luca Tamanini
https://arxiv.org/abs/2504.11133 https://mastoxiv.page/@arXiv_mathPR_bot/114346453424694503
- Optimizing the ground state energy of the three-dimensional magnetic Dirichlet Laplacian with con...
Matthias Baur
https://arxiv.org/abs/2504.21597 https://mastoxiv.page/@arXiv_mathph_bot/114431404740241516
- A localized consensus-based sampling algorithm
Arne Bouillon, Alexander Bodard, Panagiotis Patrinos, Dirk Nuyens, Giovanni Samaey
https://arxiv.org/abs/2505.24861 https://mastoxiv.page/@arXiv_mathNA_bot/114612580684567066
- A Novel Sliced Fused Gromov-Wasserstein Distance
Moritz Piening, Robert Beinert
https://arxiv.org/abs/2508.02364 https://mastoxiv.page/@arXiv_csLG_bot/114976243138728278
- Minimal Regret Walras Equilibria for Combinatorial Markets via Duality, Integrality, and Sensitiv...
Alo\"is Duguet, Tobias Harks, Martin Schmidt, Julian Schwarz
https://arxiv.org/abs/2511.09021 https://mastoxiv.page/@arXiv_csGT_bot/115541243299714775
toXiv_bot_toot
Why TF am I getting Seattle Police recruitment ads?
(I thought The Algorithm knew me pretty well by now. Is Google finally choking on its own AI slop? Or is this SPD being super-desperate and completely indiscriminate in its targeting [or being scammed by somebody?]?)
The Communication Complexity of Combinatorial Auctions with Additional Succinct Bidders
Frederick V. Qiu, S. Matthew Weinberg, Qianfan Zhang
https://arxiv.org/abs/2512.06585 https://arxiv.org/pdf/2512.06585 https://arxiv.org/html/2512.06585
arXiv:2512.06585v1 Announce Type: new
Abstract: We study the communication complexity of welfare maximization in combinatorial auctions with bidders from either a standard valuation class (which require exponential communication to explicitly state, such as subadditive or XOS), or arbitrary succinct valuations (which can be fully described in polynomial communication, such as single-minded). Although succinct valuations can be efficiently communicated, we show that additional succinct bidders have a nontrivial impact on communication complexity of classical combinatorial auctions. Specifically, let $n$ be the number of subadditive/XOS bidders. We show that for SA $\cup$ SC (the union of subadditive and succinct valuations): (1) There is a polynomial communication $3$-approximation algorithm; (2) As $n \to \infty$, there is a matching $3$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $2$ for SA, and (b) holds even for SA $\cup$ SM (the union of subadditive and single-minded valuations); and (3) For all $n \geq 3$, there is a constant separation between the optimal approximation ratios for SA $\cup$ SM and SA (and therefore between SA $\cup$ SC and SA as well). Similarly, we show that for XOS $\cup$ SC: (1) There is a polynomial communication $2$-approximation algorithm; (2) As $n \to \infty$, there is a matching $2$-hardness of approximation, which (a) is larger than the optimal approximation ratio of $e/(e-1)$ for XOS, and (b) holds even for XOS $\cup$ SM; and (3) For all $n \geq 2$, there is a constant separation between the optimal approximation ratios for XOS $\cup$ SM and XOS (and therefore between XOS $\cup$ SC and XOS as well).
toXiv_bot_toot
I discovered Reviewbrah on YouTube a month ago. Not sure why it took the algorithm so long to connect us given that I love non sequitur / absurdist humor.
“My disappointment is immeasurable, and my day is ruined.”
#ReviewBrah #ScottHumor
from my link log —
HTML5 genetic algorithm 2D car thingy.
https://rednuht.org/genetic_cars_2/
saved 2021-03-10 https://dotat.at/:/4M01I.html<…
#MorePerfectUnion and #ConsumerReports has put out a video on their investigation into algorithm-driven prices or otherwise known as surveillance pricing.
https://
In times like these I'm just SO grateful that the fediverse doesn't operate through algorithms AND that I never wanted to make a business out of my social media presence.
Just posting whatever I want, whenever I want. And you folks are just there and interact (or not). And for every interaction, I know that it's a genuine one, not "for the algorithm". - And THIS is just SO precious to ME.
It simply feels so honest.
Thank you for being there.
Instagram launches Your Algorithm, which shows users an AI analysis of their activity to let them customize the topics shaping their Reels recommendations (Reece Rogers/Wired)
https://www.wired.com/story/instagram-lets-you-pick-what-shows-up-in-reels/
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
A classic. I've implemented the sweep-merge-interval algorithm in more languages than I can remember. #Gleam
I just completed "Cafeteria" - Day 5 - Advent of Code 2025 #AdventOfCode
Memo: the TikTok US deal is set to close on Jan. 22; terms include retraining the recommendation algorithm on US user data and Oracle overseeing data protection (Alex Weprin/The Hollywood Reporter)
https://www.hollywoodreporter.com/business
Seeing with sound in safe virtual environments: A walk-in-place #VR #training system for users with visual impairment using the vOICe algorithm https://dl.a…
from my link log —
Four ways to improve a perfect SQL join algorithm.
https://remy.wang/blog/ya-fast.html
saved 2026-01-04 https://dotat.at/:/QZ8MM.…
They told the poor white man:
"You may be starving,
you may be broke,
but at least you aren't one of Them."
It worked.
The poor whites stopped fighting the rich.
They started guarding the rich.
They accepted their poverty -- because they had been given a false sense of superiority.
The "Divide and Rule" algorithm was born.
350 years later, the campaign is still running.
The Elite are still terrified of Unity…
An inexact semismooth Newton-Krylov method for semilinear elliptic optimal control problem
Shiqi Chen, Xuesong Chen
https://arxiv.org/abs/2511.10058 https://arxiv.org/pdf/2511.10058 https://arxiv.org/html/2511.10058
arXiv:2511.10058v1 Announce Type: new
Abstract: An inexact semismooth Newton method has been proposed for solving semi-linear elliptic optimal control problems in this paper. This method incorporates the generalized minimal residual (GMRES) method, a type of Krylov subspace method, to solve the Newton equations and utilizes nonmonotonic line search to adjust the iteration step size. The original problem is reformulated into a nonlinear equation through variational inequality principles and discretized using a second-order finite difference scheme. By leveraging slanting differentiability, the algorithm constructs semismooth Newton directions and employs GMRES method to inexactly solve the Newton equations, significantly reducing computational overhead. A dynamic nonmonotonic line search strategy is introduced to adjust stepsizes adaptively, ensuring global convergence while overcoming local stagnation. Theoretical analysis demonstrates that the algorithm achieves superlinear convergence near optimal solutions when the residual control parameter $\eta_k$ approaches to 0. Numerical experiments validate the method's accuracy and efficiency in solving semilinear elliptic optimal control problems, corroborating theoretical insights.
toXiv_bot_toot
Benders Decomposition for Passenger-Oriented Train Timetabling with Hybrid Periodicity
Zhiyuan Yao, Anita Sch\"obel, Lei Nie, Sven J\"ager
https://arxiv.org/abs/2511.09892 https://arxiv.org/pdf/2511.09892 https://arxiv.org/html/2511.09892
arXiv:2511.09892v1 Announce Type: new
Abstract: Periodic timetables are widely adopted in passenger railway operations due to their regular service patterns and well-coordinated train connections. However, fluctuations in passenger demand require varying train services across different periods, necessitating adjustments to the periodic timetable. This study addresses a hybrid periodic train timetabling problem, which enhances the flexibility and demand responsiveness of a given periodic timetable through schedule adjustments and aperiodic train insertions, taking into account the rolling stock circulation. Since timetable modifications may affect initial passenger routes, passenger routing is incorporated into the problem to guide planning decisions towards a passenger-oriented objective. Using a time-space network representation, the problem is formulated as a dynamic railway service network design model with resource constraints. To handle the complexity of real-world instances, we propose a decomposition-based algorithm integrating Benders decomposition and column generation, enhanced with multiple preprocessing and accelerating techniques. Numerical experiments demonstrate the effectiveness of the algorithm and highlight the advantage of hybrid periodic timetables in reducing passenger travel costs.
toXiv_bot_toot
An interview with Nikita Bier, who wants to lure journalists back to X with a rebuilt recommendation algorithm with no keyword suppression or manual downranking (Alex Heath/Sources)
https://sources.news/p/x-wants-its-haters-back
S-D-RSM: Stochastic Distributed Regularized Splitting Method for Large-Scale Convex Optimization Problems
Maoran Wang, Xingju Cai, Yongxin Chen
https://arxiv.org/abs/2511.10133 https://arxiv.org/pdf/2511.10133 https://arxiv.org/html/2511.10133
arXiv:2511.10133v1 Announce Type: new
Abstract: This paper investigates the problems large-scale distributed composite convex optimization, with motivations from a broad range of applications, including multi-agent systems, federated learning, smart grids, wireless sensor networks, compressed sensing, and so on. Stochastic gradient descent (SGD) and its variants are commonly employed to solve such problems. However, existing algorithms often rely on vanishing step sizes, strong convexity assumptions, or entail substantial computational overhead to ensure convergence or obtain favorable complexity. To bridge the gap between theory and practice, we integrate consensus optimization and operator splitting techniques (see Problem Reformulation) to develop a novel stochastic splitting algorithm, termed the \emph{stochastic distributed regularized splitting method} (S-D-RSM). In practice, S-D-RSM performs parallel updates of proximal mappings and gradient information for only a randomly selected subset of agents at each iteration. By introducing regularization terms, it effectively mitigates consensus discrepancies among distributed nodes. In contrast to conventional stochastic methods, our theoretical analysis establishes that S-D-RSM achieves global convergence without requiring diminishing step sizes or strong convexity assumptions. Furthermore, it achieves an iteration complexity of $\mathcal{O}(1/\epsilon)$ with respect to both the objective function value and the consensus error. Numerical experiments show that S-D-RSM achieves up to 2--3$\times$ speedup compared to state-of-the-art baselines, while maintaining comparable or better accuracy. These results not only validate the algorithm's theoretical guarantees but also demonstrate its effectiveness in practical tasks such as compressed sensing and empirical risk minimization.
toXiv_bot_toot
on my blog!
a hybrid quota-linear rate limiter
https://dotat.at/@/2026-01-12-hqlr.html
i was wondering if there's a "best of both worlds" algorithm, but on balance i think not
a pure linear rate limiter is better, if you can persuade your product managers to let yo…
Paris prosecutors open a probe into TikTok's algorithm and compliance with requirements to police and report suicide content, after a French government report (Gaspard Sebag/Bloomberg)
https://www.bloomberg.com/news/articles/20
from my link log —
The CVM algorithm for count-distinct cardinality estimation.
https://www-cs-faculty.stanford.edu/~knuth/papers/cvm-note.pdf
saved 2025-11-02