Is there some general theory — just in the hand-wavy “these underlying principles could apply” form of macroeconomics and not necessarily even any kind of falsifiable model — that backs up the notion that increased coupling of risks induces higher investor payouts? or something along those lines?
I feel like “coupling increases the magnitude of failure” and ”coupling increases risk” are more or less self-evident assertions (though of course deserving of study). By some kind of symmetry, it •feels• like coupling could increase payouts too — the billionaires certainly act as though it does! — but that seems less self-evident to me.
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
heise | Anytype statt Notion: Persönliches Wissen sicher speichern – auch ohne Cloud
Apps wie Notion speichern Gedanken in der Cloud. Das ist bequem, macht aber abhängig. Anytype hingegen sichert lokal und verschlüsselt konsequent.
Notion In Practice
The podcast for Notion power users, founders, and operators who want to see how real teams build and scale their workflows...
Great Australian Pods Podcast Directory: https://www.greataustralianpods.com/notion-in-practice/
thanks Notion but that's actually like, the exact opposite of what I wanted
An interview with Notion CEO Ivan Zhao on Custom Notion AI agents launching in the coming week, over 50% of Notion databases now being built by agents, and more (Sources)
https://sources.news/p/notions-next-act
If you're in #tech and struggling to figure out what your career look like now — this piece is my answer. You've heard "it's here to stay" or "it's better than nothing."
Reject these frames.
Look at the system being built around you. Manufacturing validation for "inevitable" success. Rewriting our roles from human-centered creative to featu…
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
(paywalled) The sensorimotor theory of phenomenal consciousness https://www.sciencedirect.com/science/chapter/referencework/abs/pii/B9780443292583000021 "a way of reconceptualizing the notion of qualia so that the experienced quality of phen…
Here's a thought experiment.
Imagine a stamp mark with the words "Made with #AI" on it.
If you see this mark on a picture, illustration, mobile app, song, movie, or story - do you get the notion that this product is of higher, lower or unchanged quality?
If you see two identical products for the same price, where one has an AI mark and the other doesn't - which one wo…
Five, maybe ten years too late, but full marks to the Grauniad for spotting the early trickles of fine sands and tiny pebbles starting to accumulate at the foot of the mountain of conflict, I mean the mountain of ""#AI"" hype. Haven't seen any sign of other professional news organisations working it out, yet, but it'll come.
The G doesn't seem to be comfortable with the main problem - the gulf between the general notion of what it is, and what it can act…
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
Paris-based online corporate event booking marketplace Naboo raised a $70M Series B led by Lightspeed with participation from Notion Capital, ISAI, and Ternel (Tamara Djurickovic/Tech.eu)
https://tech.eu/2026/02/10/naboo-raises-70m-from-lightspe…
This morning, President Trump unilaterally launched a regime-change war against Nicolšs Maduro of Venezuela,
ordering strikes on multiple military targets in the country and seizing its leader and his wife.
They were “captured and flown out of the country,” Trump stated on Truth Social.
“They will soon face the full wrath of American justice on American soil in American courts,” Attorney General Pam Bondi stated,
in something like an inversion of the notion that jus…
❝“Free speech culture” becomes bad and unserious when it starts telling us that speech is morally neutral, that we should not make value judgments against it, and that there is no moral component to promoting it. I am committed to the defense of the legal right to speak, but the defense of speech does not require us to refrain from speaking frankly about moral truths.
Giving Wax [a bigot] a platform to be a bigot is morally distinguishable from saying she should be free to be a bigot. “The only immoral thing you can say is that someone else’s speech is immoral” is not an ethos worthy of respect.❞
https://www.theunpopulist.net/p/the-fashionable-notion-of-free-speech
Canadians, do you think, like Canadaland's Stephen Marche, that Canadian nationalism is a 1960s - Waffle, I guess - phenomenon?
"I just don't think of that period [post-WWI] as being hyper-nationalistic. I think of nationalism as born in 1965 from Margaret Atwood's brain."
As a historian, I know that left nationalism in the 60s was an important phenomenon, but the notion that some might think that Canadian nationalism was born then hurts my brain.
Just read an article by @… and stumbles across this question:
> "...if Clawdbot can create a virtual remote for my LG television (something I did) or give me a personalized report with voice every morning (another cron job I set up) that work exactly the way I want, why should I even bother going to the App Store to look for pre-built solut…
I have a notion that my ThinkPad C13 Yoga might make a decent FreeBSD target. Let's find out!
A $5$-Approximation Analysis for the Cover Small Cuts Problem
Miles Simmons, Ishan Bansal, Joe Cheriyan
https://arxiv.org/abs/2602.01462 https://arxiv.org/pdf/2602.01462 https://arxiv.org/html/2602.01462
arXiv:2602.01462v1 Announce Type: new
Abstract: In the Cover Small Cuts problem, we are given a capacitated (undirected) graph $G=(V,E,u)$ and a threshold value $\lambda$, as well as a set of links $L$ with end-nodes in $V$ and a non-negative cost for each link $\ell\in L$; the goal is to find a minimum-cost set of links such that each non-trivial cut of capacity less than $\lambda$ is covered by a link. Bansal, Cheriyan, Grout, and Ibrahimpur (arXiv:2209.11209, Algorithmica 2024) showed that the WGMV primal-dual algorithm, due to Williamson, Goemans, Mihail, and Vazirani (Combinatorica, 1995), achieves approximation ratio $16$ for the Cover Small Cuts problem; their analysis uses the notion of a pliable family of sets that satisfies a combinatorial property. Later, Bansal (arXiv:2308.15714v2, IPCO 2025) and then Nutov (arXiv:2504.03910, MFCS 2025) proved that the same algorithm achieves approximation ratio $6$. We show that the same algorithm achieves approximation ratio $5$, by using a stronger notion, namely, a pliable family of sets that satisfies symmetry and structural submodularity.
toXiv_bot_toot
@… hey there; just sent you an e-mail about Notion.cafe, when you've got a sec. Unsure if it fell through the cracks or something!
Currently reading the collection «Practicing Embodied Thinking in Research and Learning» edited by Donata Schoeller, Sigridur Thorgeirsdottir, and Greg Walkerden and it is really very good! Not only does the concept of «embodied critical thinking» resonate with everything I’ve been working towards in my own research, but it also offers a really simple and common-sense antidote to AI in higher education, based on the notion of bringing our own embodied experiences and felt sense to critical t…
There’s a lesson here, perhaps, about the tangled relationship between what is •typical• and what is •correct•, and what it is that LLMs actually do:
When medical professionals ask medical questions in technical medical language, the answers they get are typically correct.
When non-professional ask medical questions in a perhaps medically ill-formed vernacular mode, the answers they get are typically wrong.
The LLM readily models both of these things. Despite having no notion of correctness in either case, correctness is more statistically typical in one than the other.
3/
"...who campaigned on a promise to extricate the US from decades of “endless wars” during his 2024 run for president."
It'simportant to note these are airstrikes and bombings - and that's very different from wars. It avoids the distressful images of wounded and dead service members returning to the US, while using very expensive technology, thus providing purchase orders to very important business interests, and it provides the psycological benefit of violence to imp…
"...who campaigned on a promise to extricate the US from decades of “endless wars” during his 2024 run for president."
It'simportant to note these are airstrikes and bombings - and that's very different from wars. It avoids the distressful images of wounded and dead service members returning to the US, while using very expensive technology, thus providing purchase orders to very important business interests, and it provides the psycological benefit of violence to imp…
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
During his State of the Union address on Tuesday, Donald Trump demanded that lawmakers gathered in the joint session of Congress
“approve the SAVE America Act to stop illegal aliens [from] voting in our sacred American elections.”
Republicans stood and cheered.
“The cheating is rampant in our elections,” the president continued. “It’s rampant.”
The directive was built on years of Republican bloviating about a problem that doesn’t exist:
the notion that scores of…
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
A generalization of the notion of helix
Pascual Lucas, Jos\'e Antonio Ortega-Yag\"ues
https://arxiv.org/abs/2601.18020 https://arxiv.org/pdf/2601.…
Finally isolated the alexical notion that had been flittering round the back of my mind for a few days, without my spotting it.
#Epstein, in the videos of police interviews and such that I've glimpsed, reminded me strongly of someone I couldn't place. It's the almost playful, ironically detached manner in the bit about "are you the devil himself?" When he replies som…
Rowspace, which builds AI tools for PE firms and hedge funds to organize unstructured data for decision-making, launches with $50M in seed and Series A funding (Leo Schwartz/Fortune)
https://fortune.com/2026/02/25/rowspace-sequ…
Lifting systems for finite length modules
Benjamin Katz, Nawaj KC, Kesavan Mohana Sundaram, Andrew J. Soto Levins, Ryan Watson
https://arxiv.org/abs/2602.01440 https://arxiv.org/pdf/2602.01440 https://arxiv.org/html/2602.01440
arXiv:2602.01440v1 Announce Type: new
Abstract: This paper is concerned with lifting modules along a surjective map of noetherian local rings, say $\varphi \colon R \twoheadrightarrow S$. A finitely generated $R$-module $L$ is a naive lift of an $S$-module $M$ if $L \otimes_R S \cong M$. We are concerned with the maximum depth and dimension among all naive lifts of $M$, which we call the liftable depth and liftable dimension, respectively, of $M$ along $\varphi$. We approach this via a notion of lifting systems that we introduce in this paper. We then provide a necessary and sufficient condition for a module of finite length to lift and Serre lift to a regular local ring in terms of lifting systems.
toXiv_bot_toot
Approximate Cartesian Tree Matching with Substitutions
Panagiotis Charalampopoulos, Jonas Ellert, Manal Mohamed
https://arxiv.org/abs/2602.08570 https://arxiv.org/pdf/2602.08570 https://arxiv.org/html/2602.08570
arXiv:2602.08570v1 Announce Type: new
Abstract: The Cartesian tree of a sequence captures the relative order of the sequence's elements. In recent years, Cartesian tree matching has attracted considerable attention, particularly due to its applications in time series analysis. Consider a text $T$ of length $n$ and a pattern $P$ of length $m$. In the exact Cartesian tree matching problem, the task is to find all length-$m$ fragments of $T$ whose Cartesian tree coincides with the Cartesian tree $CT(P)$ of the pattern. Although the exact version of the problem can be solved in linear time [Park et al., TCS 2020], it remains rather restrictive; for example, it is not robust to outliers in the pattern.
To overcome this limitation, we consider the approximate setting, where the goal is to identify all fragments of $T$ that are close to some string whose Cartesian tree matches $CT(P)$. In this work, we quantify closeness via the widely used Hamming distance metric. For a given integer parameter $k>0$, we present an algorithm that computes all fragments of $T$ that are at Hamming distance at most $k$ from a string whose Cartesian tree matches $CT(P)$. Our algorithm runs in time $\mathcal O(n \sqrt{m} \cdot k^{2.5})$ for $k \leq m^{1/5}$ and in time $\mathcal O(nk^5)$ for $k \geq m^{1/5}$, thereby improving upon the state-of-the-art $\mathcal O(nmk)$-time algorithm of Kim and Han [TCS 2025] in the regime $k = o(m^{1/4})$.
On the way to our solution, we develop a toolbox of independent interest. First, we introduce a new notion of periodicity in Cartesian trees. Then, we lift multiple well-known combinatorial and algorithmic results for string matching and periodicity in strings to Cartesian tree matching and periodicity in Cartesian trees.
toXiv_bot_toot
Does Order Matter : Connecting The Law of Robustness to Robust Generalization
Himadri Mandal, Vishnu Varadarajan, Jaee Ponde, Aritra Das, Mihir More, Debayan Gupta
https://arxiv.org/abs/2602.20971 https://arxiv.org/pdf/2602.20971 https://arxiv.org/html/2602.20971
arXiv:2602.20971v1 Announce Type: new
Abstract: Bubeck and Sellke (2021) pose as an open problem the connection between the law of robustness and robust generalization. The law of robustness states that overparameterization is necessary for models to interpolate robustly; in particular, robust interpolation requires the learned function to be Lipschitz. Robust generalization asks whether small robust training loss implies small robust test loss. We resolve this problem by explicitly connecting the two for arbitrary data distributions. Specifically, we introduce a nontrivial notion of robust generalization error and convert it into a lower bound on the expected Rademacher complexity of the induced robust loss class. Our bounds recover the $\Omega(n^{1/d})$ regime of Wu et al.\ (2023) and show that, up to constants, robust generalization does not change the order of the Lipschitz constant required for smooth interpolation. We conduct experiments to probe the predicted scaling with dataset size and model capacity, testing whether empirical behavior aligns more closely with the predictions of Bubeck and Sellke (2021) or Wu et al.\ (2023). For MNIST, we find that the lower-bound Lipschitz constant scales on the order predicted by Wu et al.\ (2023). Informally, to obtain low robust generalization error, the Lipschitz constant must lie in a range that we bound, and the allowable perturbation radius is linked to the Lipschitz scale.
toXiv_bot_toot
When a terrible idea comes from on high, there’s always pushback from the folks on the ground who actually understand how things work: the engineers at the computers, the teachers in the classrooms, the facilities crews, the kitchen staff, whatever. The folks who live their lives zoomed in on a specific thing may be missing the big picture, but they’re the ones who first see when a managerial notion will have execution problems.
3/
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
really good video from @… Energi Media that picks apart how the "Free Alberta Strategy", which is Danielle Smith's playbook, is trying to break up Canada based on the false notion that Ottawa is not being "fair" to Alberta... when it was the Alberta oilsands companies themselves that lobbied for the Industrial Carbon Tax.
#CanPoli #CdnPoli #AbPoli #Energy #Oil #Canada #Sovereignty
https://www.youtube.com/watch?v=4H1NlAM26xM
Diffeological Spaces with a Non-Smooth Derivation
Masaki Taho
https://arxiv.org/abs/2602.21235 https://arxiv.org/pdf/2602.21235 https://arxiv.org/html/2602.21235
arXiv:2602.21235v1 Announce Type: new
Abstract: We show that on certain diffeological spaces there exist linear derivations that satisfy the Leibniz rule but are not smooth with respect to the given diffeology. This reveals that the notion of tangent space defined via all such derivations is strictly larger than the one defined using only smooth derivations, showing that smoothness cannot be recovered from the Leibniz rule alone.
toXiv_bot_toot
Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning
Antoine Bergerault, Volkan Cevher, Negar Mehr
https://arxiv.org/abs/2602.21020 https://arxiv.org/pdf/2602.21020 https://arxiv.org/html/2602.21020
arXiv:2602.21020v1 Announce Type: new
Abstract: Multi-agent imitation learning (MA-IL) aims to learn optimal policies from expert demonstrations of interactions in multi-agent interactive domains. Despite existing guarantees on the performance of the resulting learned policies, characterizations of how far the learned polices are from a Nash equilibrium are missing for offline MA-IL. In this paper, we demonstrate impossibility and hardness results of learning low-exploitable policies in general $n$-player Markov Games. We do so by providing examples where even exact measure matching fails, and demonstrating a new hardness result on characterizing the Nash gap given a fixed measure matching error. We then show how these challenges can be overcome using strategic dominance assumptions on the expert equilibrium. Specifically, for the case of dominant strategy expert equilibria, assuming Behavioral Cloning error $\epsilon_{\text{BC}}$, this provides a Nash imitation gap of $\mathcal{O}\left(n\epsilon_{\text{BC}}/(1-\gamma)^2\right)$ for a discount factor $\gamma$. We generalize this result with a new notion of best-response continuity, and argue that this is implicitly encouraged by standard regularization techniques.
toXiv_bot_toot
Le «plus grand danger pour la sécurité de notre siècle» est le réchauffement climatique, affirme Annalena Baerbock. Avec l’ensevelissement du village de Blatten (VS) suite Š l’effondrement d’un glacier Š la fin mai, «le changement climatique n’est plus seulement une notion abstraite, mais est devenu très concret», estime-t-elle. «Si nous ne maîtrisons pas la crise climatique, nous verrons malheureusement partout des catastrophes comme celle de Blatten».
https://www.letemps.ch/suisse/geneve/pour-annalena-baerbock-la-geneve-internationale-n-est-pas-en-danger
dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph
I like this line a lot.
NDP: “Not running to babysit the Liberal Government”.
We really need to get the NDP and especially the media out of this notion that the NDP can only ever prop up the Liberals or… in a perfect world… be opposition.
No. The NDP can, and should, form government to give Canadians a real progressive alternative to the Conservatives and Con-Light-Liberals.
#canpoli #cdnpoli #canada #ndp #cpc #lpc
@inthehands@hachyderm.io
