Apple unveils Mini Apps Partner Program, offering a reduced 15% commission on IAPs for mini apps, or "self-contained" experiences built with web tech like HTML5 (Sarah Perez/TechCrunch)
https://techcrunch.com/2025/11/13/apple-halves-commissions-for-m…
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
Parece que España estš desarrollando un sistema de identificación de edad de "conocimiento cero" para evitar que menores de 16 años "accedan" a redes sociales. https://www.eldiario.es/tecnologia/gobiern
OK, das ist ziemlich cool: Der Macher des sowieso ganz großartigen Podcasts #SearchEngine - @… - hat zusammen mit @… und
Become a piece on an immersive life-sized Monopoly™ board in Union Station, Washington, DC, January 10-12
https://www.visitatlanticcity.com/articles/post/visit-ac-invites-consumers-to-discover-the-de…
Ex-NFL commissioner Tagliabue dies at age 84 https://www.espn.com/nfl/story/_/id/46905612/former-nfl-commissioner-paul-tagliabue-dies-age-84
Perché la maggior parte dei siti web non ha effettivamente bisogno dei banner di consenso ai #cookie
La maggior parte dei siti web delle piccole imprese non ha effettivamente bisogno di quei fastidiosi banner di consenso ai cookie che interrompono l'esperienza dell'utente. Il vero colpevole non sono le leggi sulla privacy, ma gli strumenti di tracciamento pesantemente sorvegliati…
Today was #satisfying:
- arranged a unique & "life changing" experience for someone
- watched someone vely change attitude toward me
- was in a meeting w awesome people
- saw someone one whose sight always makes me happy
All in, feels like the day was worth living for, whatever tomorrow brings. 🙇♂️
The chanciness of time
John M. Myers, Hadi Madjid
https://arxiv.org/abs/2511.08611 https://arxiv.org/pdf/2511.08611 https://arxiv.org/html/2511.08611
arXiv:2511.08611v1 Announce Type: new
Abstract: Digital network failures stemming from instabilities in measurements of temporal order motivate attention to concurrent events. A century of attempts to resolve the instabilities have never eliminated them. Do concurrent events occur at indeterminate times, or are they better seen as events to which the very concept of temporal order cannot apply? Logical dependencies of messages propagating through digital networks can be represented by marked graphs on which tokens are moved in formal token games. However, available mathematical formulations of these token games invoke "markings"-- global snapshots of the locations of tokens on the graph. The formulation in terms of global snapshots is misleading, because distributed networks are never still: they exhibit concurrent events inexpressible by global snapshots. We reformulate token games used to represent digital networks so as to express concurrency. The trick is to replace global snapshots with "local snapshots." Detached from any central clock, a local snapshot records an action at a node during a play of a token game. Assemblages of local records define acyclic directed graphs that we call history graphs. We show how history graphs represent plays of token games with concurrent motions, and, importantly, how history graphs can represent the history of a network operating while undergoing unpredictable changes.
toXiv_bot_toot
Elon Musk says Apple and Google's Gemini deal "seems like an unreasonable concentration of power for Google given that [they] also have Android and Chrome" (Joe Rossignol/MacRumors)
https://www.macrumors.com/2026/01/12/elon-musk-reacts-to-gemini-siri/