yeast_transcription: Yeast transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the yeast Saccharomyces cerevisiae.
This network has 916 nodes and 1094 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.sk…
The Trump administration cannot force public universities in 17 U.S. states to turn over sweeping amounts of data so it can examine whether they have ceased considering race as an admissions factor, a federal judge ruled on Friday.
The department requested the data through an Integrated Postsecondary Education Data System survey that it created at the direction of Donald Trump.
In an August memorandum, he cited a lack of data to assess whether race remained an admissions fact…
With #GrapheneOS announcing support for presumably more smartphones by #Motorola starting with with 2027 models, I can finally dream of getting a clamshell flip phone that combines good HW, a nice OS with a small form factor: #RazrUltra
yeast_transcription: Yeast transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the yeast Saccharomyces cerevisiae.
This network has 916 nodes and 1094 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.sk…
So I'm wondering if long term it might make sense to move the VM server from a 2U to a 4U form factor.
I'd need to move the storage cluster and core router each down 2U into a currently vacant spot to free up another 2U next to where the VM server is, but that would let me fit a much taller (and less noisy) heatsink/fan on the CPU and also enable use of full height GPUs.
Not a "now" thing but if I'm targeting a many-year service lifetime for the platform it…
Doing some basic math on tuition in Ontario for this week's course on the history of the university. While not surprising, it's still worth noting that domestic tuition has increased by a factor of 10 over the past 50 years and international tuition by a factor of 80.
#onpoli #Ontario
Wall Street Journal:
Trump Is Preparing to Fire Kristi Noem
The Homeland Security secretary’s combative Senate hearing this week was a key factor, advisers say
https://www.wsj.com/politics/policy/trump-iuis-preparing-to-fire-kristi-noem-85815…
The Hidden Backdoor to 200 Airports: A Supply Chain Failure in Aviation
A single leaked credential from a fourth-party vendor recently exposed the digital infrastructure of 200 global airports. This security failure highlights how a lack of Multi-Factor Authentication can jeopardize critical systems, including baggage reconciliation and passenger kiosks. Discover how SVigil identified this backdoor before it cost the industry billions.
✈️
The “luggable” form factor but with flat display (this one has a plasma display) is my favorite 80s computer design
Nou ik heb zojuist de slappe-hap-reactie van Jetten gehoord.
Niks geen veroordeling alleen ‘zorgen over escalatie’ en #Iran beschuldigen van een ‘destabiliserende rol in de regio’ terwijl de echte destabiliserende factor daar natuurlijk aggressor Israel is.
Licht op groen voor Lelystad Airport, maar één cruciale factor blijft keer op keer onbereikbaar: ‘Overheid al jaren bottleneck’
https://www.destentor.nl/lelystad/licht-op-groen-voor-lelystad-airport-maar-een-cruciale-factor-blijft-keer-op-keer-onbereikbaar-overheid-al-jaren-bottleneck~a12eb9b1/
Bij elke opmerking over 'Lelystad' even terugkoppelen aan deze twee blokjes en je weet hoe ver het er mee staat.
Aangezien vliegen pas kan -na- verbetering vliegt er dus de komende jaren nog geen enkel toestel.
Daarnaast wordt bijzonder interessant wat de gevolgen van defensie op de neerslag is. Als die door defensie toeneemt .... 😇🥴
"As part of the BUILD Act announcement, Lurie also said city departments had been convened to determine “a more effective source of funding” for affordable housing within three months."
Nothing says good planning and a complete strategy than cutting revenues while waiting for people to dream up a new source of funds.
Plan to halve SF transfer taxes on big deals awaits details | Politics | sfexaminer.com
"As part of the BUILD Act announcement, Lurie also said city departments had been convened to determine “a more effective source of funding” for affordable housing within three months."
Nothing says good planning and a complete strategy than cutting revenues while waiting for people to dream up a new source of funds.
Plan to halve SF transfer taxes on big deals awaits details | Politics | sfexaminer.com
I love my X4 with the Crosspoint firmware. I would love even more if Amazon shipped a Kindle in this form factor.
https://www.theverge.com/tech/921552/xteink-x3-x4-e-reader-third-party-crosspoint-firmware-usb-blocked
Sources: Amazon is in talks to acquire Globalstar to bolster its low Earth orbit satellite business; Apple's 20% stake in Globalstar is a complicating factor (Financial Times)
https://www.ft.com/content/abace066-fe93-4ff0-8378-d3c3eb49519c
Trump announced a fresh crackdown on “fraud” in Democratic states
and tapped JD Vance to lead the charge.
Officials swiftly announced a string of arrests in California.
In a Truth Social post on Friday, the US president announced that his vice-president was now
“in charge of ‘fraud’ in the United States”,
claiming the problem is “massive and pervasive”
and that Vance’s new role as “fraud czar” will be “a major factor in how great the future of our country …
Adaptive Block-Scaled Data Types
Jack Cook, Hyemin S. Lee, Kathryn Le, Junxian Guo, Giovanni Traverso, Anantha P. Chandrakasan, Song Han
https://arxiv.org/abs/2603.28765 https://arxiv.org/pdf/2603.28765 https://arxiv.org/html/2603.28765
arXiv:2603.28765v1 Announce Type: new
Abstract: NVFP4 has grown increasingly popular as a 4-bit format for quantizing large language models due to its hardware support and its ability to retain useful information with relatively few bits per parameter. However, the format is not without limitations: recent work has shown that NVFP4 suffers from its error distribution, resulting in large amounts of quantization error on near-maximal values in each group of 16 values. In this work, we leverage this insight to design new Adaptive Block-Scaled Data Types that can adapt to the distribution of their input values. For four-bit quantization, our proposed IF4 (Int/Float 4) data type selects between FP4 and INT4 representations for each group of 16 values, which are then scaled by an E4M3 scale factor as is done with NVFP4. The selected data type is denoted using the scale factor's sign bit, which is currently unused in NVFP4, and we apply the same insight to design formats for other bit-widths, including IF3 and IF6. When used to quantize language models, we find that IF4 outperforms existing 4-bit block-scaled formats, achieving lower loss during quantized training and achieving higher accuracy on many tasks in post-training quantization. We additionally design and evaluate an IF4 Multiply-Accumulate (MAC) unit to demonstrate that IF4 can be implemented efficiently in next-generation hardware accelerators. Our code is available at https://github.com/mit-han-lab/fouroversix.
toXiv_bot_toot
No, you did not send a numeric code to my email to help me sign in "for my security." You did it because you couldn't be arsed to implement proper app-based authentication.
Control of any email address collapses down to a single factor for authentication. Do better.
#TuesdayCyberGrouse
From 2028 onwards, larger grid users connected to the distribution network in the Netherlands (e.g. EV fast-charging sites) will have time-varying network charges applied to them. The current price level will be maintained for weekday peaks, while summer midday hours will be discounted by 90%.
#Wordle 1,721 5/6*
⬜⬜🟨⬜⬜ <1% of 222,450 (193)
🟨🟨⬜⬜⬜ 0 of 59 (17)
⬜🟩🟩⬜⬜ 0 of 0 (5)
⬜🟩🟩🟨⬜ 0 of 0 (1)
🟩🟩🟩🟩🟩
WordleBot
Skill 92/99
Luck 45/99
I knew it was going to be a tough one, and it was. That was probably a factor in my 4th guess being a word I knew wasn't going to be the answer but provided key clues.
Fun bug of the day I need to chase once I finish some $dayjob stuff: same ngscopeclient binary, same scopesession decoding 100baseT1. Same Xeon 8362 so CPU feature flags are no factor.
On an nvidia 3070 in the lab it works flawlessly.
On the amd 9700 i just put in my office workstation the 100baseT1 scrambler consistently fails to lock and I get no decode, but the eye patterns look fine so it's not failing too badly.
If i run on live streaming data from the thunderscope…
So much focus on drinking, but if you take a step back, the entire working culture of Parliament is absolutely broken. The long hours and late night votes are almost always the result of its own processes rather than some external factor.
And a culture of gentlemen's club tradition, mixed with karoshi machismo, that has been resistant to change.
TIL: There are drastic differences in the sugar content of internationally sold drinks like Fanta. Acc. to Spiegel UK 4.5g vs. Germany 7.6g. This map comments indicate that upper end (US, 12g) to lower end is factor of three (4.1g some eastern baltic states) https…
A multi-factor experimental test of hypothesized selection on the cyanogenesis trait in white clover finds a much more complicated picture than expected
#science …
RE: https://flipboard.com/@aljazeera/middle-east-news-oapkqap7z/-/a-qymQoGixQkK7S8DsnRhvNA:a:3199698-/0
In de reacties op het vertrek van de UAE uit OPEC lees ik bijzonder weinig 'inhoud'.
Ja ... 'After the Iran war' is een belangrijke factor, maar daarnaast zijn de peakoil situatie en Paris 2050 ook van groot belang.
De UAE schrijven er zelf dit* over. Gedeeltelijk verklaart dat ook de diversificatie van olie/gas naar andere industrie.
* UAE Energy Strategy 2050 | The Official Platform of the UAE Government
https://u.ae/en/about-the-uae/strategies-initiatives-and-awards/strategies-plans-and-visions/environment-and-energy/uae-energy-strategy-2050
Imagine the world had we kept this form factor instead of miniature USB thumb drives and SD cards that get misplaced all the time.
Imagine the satisfying click whenever you insert such a cartridge.
People would mod their spring-loaded drives so ejecting would look like a toaster… https://mastodon.social/@256/116251252…
@… Frankly the only reason I’m considering replacing my M1 Mac Mini with a MBP is the form factor and the FOMO.
I’ve not once run into “ugh, I wish this computer was faster” since ordering it on launch (I *did* get 16 GB of memory FWIW).
If you ever doubt the danger inherent in the waters of the Central and Northern Coast of B.C. (ie. “The Inside Passage”, Hecate Strait, Queen Charlotte Sound and Dixon Entrance) look no further than the experience of BC Ferries. Things happen. They lost a ship 20 years ago including two passengers.
And they just announced that this March they almost ran aground, with barely metres to spare!
Traverse the same dangerous areas enough, and one time, something will happen.
Update: The description of the incident also emphasizes the point that the weather is a major contributing factor to that danger.
“The Northern Adventure… hit bad weather, and deliberately changed course to navigate around the difficult conditions… the ship… sailed into an area of shallower water near Milbanke Sound, travelling "at its shallowest point over a shoal in approximately nine metres of water… the crew took quick "corrective measures" to veer back on course.”
#bcpoli #LNG #NorthCoast #BC
Last week I made GF cardamom buns as part of my Easter dinner. But I had a first pass where I put the psyllium husk into the dry ingredients instead of the proofed yeast & milk (where it would gel). I held onto that batch of dry ingredients and salvaged it yesterday.
The buns came out well, but spread quite a lot. They still had a good texture and density, so I don’t know how much my psyllium oops was a factor.
Still learning GF yeasted baking.
tl;dr Using https://thi.ng/column-store to accelerate tag intersection queries by a factor of 880x...
Working on the static website generator/export plugin for my personal knowledge tool has been one of the main projects this past month. A key part of this setup is tagging, not just simple flat keywords/cate…
Ah yes, the touchscreen mac that runs iOS and the laptop-form-factor iPad that runs macOS. Incredible.
Anybody know if there are AMD MxGPU / SR-IOV capable GPUs that are available in a half height PCIe card form factor?
The critical role of negative-energy states in the Land\'{e} $g$-factor of lithium-like ions
Chang-Xian Song, Yong-Bo Tang
https://arxiv.org/abs/2604.25515 https://
Incremental (k, z)-Clustering on Graphs
Emilio Cruciani, Sebastian Forster, Antonis Skarlatos
https://arxiv.org/abs/2602.08542 https://arxiv.org/pdf/2602.08542 https://arxiv.org/html/2602.08542
arXiv:2602.08542v1 Announce Type: new
Abstract: Given a weighted undirected graph, a number of clusters $k$, and an exponent $z$, the goal in the $(k, z)$-clustering problem on graphs is to select $k$ vertices as centers that minimize the sum of the distances raised to the power $z$ of each vertex to its closest center. In the dynamic setting, the graph is subject to adversarial edge updates, and the goal is to maintain explicitly an exact $(k, z)$-clustering solution in the induced shortest-path metric.
While efficient dynamic $k$-center approximation algorithms on graphs exist [Cruciani et al. SODA 2024], to the best of our knowledge, no prior work provides similar results for the dynamic $(k,z)$-clustering problem. As the main result of this paper, we develop a randomized incremental $(k, z)$-clustering algorithm that maintains with high probability a constant-factor approximation in a graph undergoing edge insertions with a total update time of $\tilde O(k m^{1 o(1)} k^{1 \frac{1}{\lambda}} m)$, where $\lambda \geq 1$ is an arbitrary fixed constant. Our incremental algorithm consists of two stages. In the first stage, we maintain a constant-factor bicriteria approximate solution of size $\tilde{O}(k)$ with a total update time of $m^{1 o(1)}$ over all adversarial edge insertions. This first stage is an intricate adaptation of the bicriteria approximation algorithm by Mettu and Plaxton [Machine Learning 2004] to incremental graphs. One of our key technical results is that the radii in their algorithm can be assumed to be non-decreasing while the approximation ratio remains constant, a property that may be of independent interest.
In the second stage, we maintain a constant-factor approximate $(k,z)$-clustering solution on a dynamic weighted instance induced by the bicriteria approximate solution. For this subproblem, we employ a dynamic spanner algorithm together with a static $(k,z)$-clustering algorithm.
toXiv_bot_toot
A One-Step Cascade Symmetric Model: Rank-$1$ Packets, Binary Shielding, and the Even Exact-Cardinality Profile
Frank Gilson
https://arxiv.org/abs/2603.25950 https://arxiv.org/pdf/2603.25950 https://arxiv.org/html/2603.25950
arXiv:2603.25950v1 Announce Type: new
Abstract: We introduce a one-step cascade symmetric system whose local symmetry geometry is organized by finite $\rho$-closed windows and one-step stars rather than by rowwise-independent toggles. The resulting symmetric model isolates a new $ZF DC \neg \mathrm{BPI}$ geometry in which rank-$1$ hereditarily symmetric reals admit a packet normalization theorem over countable $\rho$-closed supports.
The technical center of the paper is the finite star-span lemma and the associated rank-$1$ packet calculus. From this we obtain a normalization theorem and a two-layer coding consequence for rank-$1$ reals (in the metatheory, via a well-orderable base of packets). We then apply the same binary fresh-support shielding pattern to prove $\neg C_2$, hence $\neg AC_{\mathrm{fin}}$, and therefore the failure of every even $C_n$ (where $C_n$ denotes the principle that every family of nonempty $n$-element sets admits a choice function). On the odd side, the present bounded packet calculus remains dyadic: support-fixed local actions factor through finite $2$-groups, bounded support-equivariant quotients of finite local orbits have power-of-two size, and trace-separated bounded rigid ternary families admit canonical selectors within a fixed finite trace window. Accordingly, the odd exact-cardinality profile remains open beyond the current local binary machinery.
toXiv_bot_toot
RE LB: “Double Opt-In” isn’t really double. It’s 2-factor. Or mutual handshake, if you prefer. You ask to subscribe an address, and the sender emails you a request to confirm that before they send anything else.
There ARE other ways to handle subscriptions ethically, but they ALL include a mechanism confirmingin a reliable way that the user knows what they are asking for and is in control of the subscribed address.
Exploring the Impact of Parameter Update Magnitude on Forgetting and Generalization of Continual Learning
JinLi He, Liang Bai, Xian Yang
https://arxiv.org/abs/2602.20796 https://arxiv.org/pdf/2602.20796 https://arxiv.org/html/2602.20796
arXiv:2602.20796v1 Announce Type: new
Abstract: The magnitude of parameter updates are considered a key factor in continual learning. However, most existing studies focus on designing diverse update strategies, while a theoretical understanding of the underlying mechanisms remains limited. Therefore, we characterize model's forgetting from the perspective of parameter update magnitude and formalize it as knowledge degradation induced by task-specific drift in the parameter space, which has not been fully captured in previous studies due to their assumption of a unified parameter space. By deriving the optimal parameter update magnitude that minimizes forgetting, we unify two representative update paradigms, frozen training and initialized training, within an optimization framework for constrained parameter updates. Our theoretical results further reveals that sequence tasks with small parameter distances exhibit better generalization and less forgetting under frozen training rather than initialized training. These theoretical insights inspire a novel hybrid parameter update strategy that adaptively adjusts update magnitude based on gradient directions. Experiments on deep neural networks demonstrate that this hybrid approach outperforms standard training strategies, providing new theoretical perspectives and practical inspiration for designing efficient and scalable continual learning algorithms.
toXiv_bot_toot
Anecdotal information seems to suggest that the cost of posting a #preprint is less than 0.25% of the cost of a typical APC. In other words, publishing in a typical peer reviewed journal is some 400 times more expensive than posting a preprint. Does pre-publication peer review really improve scientific information by a factor of 400? Might post-publication perhaps offer more cost-efficient poss…
@… I can recommend LiPos with AA form factor: E.g. Dracutum Rechargeable Lithium Batteries 3600 mWh 🔋🔋🔋🔋
Random outburst of frustration and resentment: FUCK YOU MICROSOFT!
Stop it with your invasive, intrusive, heavy-handed, fuckery!
Whoever is behind the latest UX can take credit for driving more people to Linux than any other factor in history.
FUCK MICROSOFT!
Thank you for your attention to this matter...
#random
Adaptive transitions in FitzHugh-Nagumo networks with Hebb-Oja coupling rules
Astero Provata, George C. Boulougouris, Johanne Hizanidis
https://arxiv.org/abs/2602.18198 https://arxiv.org/pdf/2602.18198 https://arxiv.org/html/2602.18198
arXiv:2602.18198v1 Announce Type: new
Abstract: Adaptive coupling in networks of interacting neurons has gained recent attention due to the many applications both in biological and in artificial neural networks, where adaptive coupling or synaptic plasticity is considered as a key factor in learning processes. In the present study, we apply adaptive connectivity rules in networks of interacting FitzHugh-Nagumo oscillators. Adaptive coupling, here, is realized via Hebbian learning adjusted by the Oja rule to prevent the network link weights from growing without bounds. Numerical investigations demonstrate that during the adaptation process the FitzHugh-Nagumo network undergoes adaptive transitions realizing traveling waves, synchronized states and chimera states transiting through various multiplicities. These transitions become more evident when the time scales governing the coupling dynamics are much slower than the ones governing the nodal dynamics (nodal potentials). Namely, when the coupling time scales are slow, the network has the time to realize and demonstrate different synchronization regimes before reaching the final steady state. The transitions can be observed not only in the spacetime plots but also in the abrupt changes of the average coupling weights as the network evolves in time. Regarding the asymptotic coupling distributions, we show that the limiting average coupling strength follows an inverse power law with respect to the Oja parameter (also called "forgetting" parameter) which balances the learning growth. We also report abrupt transitions in the asymptotic coupling strengths when the parameter related to adaptive coupling crosses from fast to slow time scales. These findings are in line with previous studies on spiking neural networks.
toXiv_bot_toot
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas Andr\'e, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman
https://arxiv.org/abs/2603.24553 https://arxiv.org/pdf/2603.24553 https://arxiv.org/html/2603.24553
arXiv:2603.24553v1 Announce Type: new
Abstract: We solve the orientation recovery of a tumbling protein in the gas phase from single-event measurements of the spatial positions of its ions after an X-ray laser induced explosion. We simulate diffracted X-ray signal and ion dynamics under experimental conditions and compare our method to conventional orientation recovery in single-particle imaging with X-ray free-electron lasers using only diffraction data. We reconstruct 3D diffraction intensities using orientations recovered from the ion signatures and retrieve the electron density with established phase-retrieval algorithms. We test our orientation recovery procedure on 56 proteins ranging from 14 to 52 kDa (1800 to 6500 atoms), achieving roughly an angular error of around 5{\deg}. The resulting 3D electron-density reconstructions are compared to ground-truth volumes simulated at the same nominal resolution, and achieve the resolution at the edge of the detector in conditions similar to current single-particle imaging setups. We investigate the reconstruction quality and demonstrate that ion data can be used for reliable orientation recovery of particles in single-particle imaging, achieving orientation on par or better than currently used recovery techniques. This work shows the potential of ion detection for retrieving additional information from the sample fragmentation, and boost single particle imaging with X-ray lasers in the cases where the diffraction signal is a limiting factor.
toXiv_bot_toot
You know the Drake equation that estimates how many alien civilizations should be out there?
My boy Drake forgot to factor in how all civilizations crumble to dust because a majority of beings get chatbot psychosis and eventually nothing works anymore and everyone dies.
This is absolutely bonkers (when you elect the worst people they - surprise! - keep doing the worst things). My employer - a university in Ontario - expressly prevents us from using attendance as a factor in grading - participation, yes, mere physical presence, no. Why would high school be any different?
Dementia is tragically common among the elderly.
In 2021 57m people worldwide were thought to have the condition.
Ageing is a risk factor for many other ailments too,
ranging from chronic inflammation to a decline in organ function.
A growing body of work, however, suggests that simply taking a course of the #shingles
ecoli_transcription: E. coli transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the bacteria Escherichia coli.
This network has 424 nodes and 577 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.s…
Demonstration of High-Gain Harmonic Lasing in a Terahertz Free-Electron Laser
Yin Kang, Cheng Yu, Yue Wang, Weiyi Yin, Zhangfeng Gao, Hanghua Xu, Hang Luo, Jian Chen, Taihe Lan, Xiaoqing Liu, Jinguo Wang, Huan Zhao, Fei Gao, Liping Sun, YanYan Zhu, Yongmei Wen, Chengcheng Xiao, Yongfang Liu, Yixuan Liu, Xingtao Wang, Jiaqiang Xu, Zheng Qi, Tao Liu, Bin Li, Kaiqing Zhang, Zhen Wang, Chao Feng, Bo Liu, Zhentang Zhao
https://arxiv.org/abs/2602.13743 https://arxiv.org/pdf/2602.13743 https://arxiv.org/html/2602.13743
arXiv:2602.13743v1 Announce Type: new
Abstract: Compact Free-Electron Lasers (FELs) offering broad, continuous spectral tunability are traditionally constrained by fixed-parameter magnetic structures and the necessity for high-energy electron beams. High-gain Harmonic Lasing (HL) has long been proposed as a solution to overcome these limitations; however, a robust experimental verification of this principle has remained absent. Here, we report the first experimental demonstration of high-gain HL. By employing a frequency-tunable electron beam density modulation to dominate the fundamental instability, we achieved sustained FEL amplification at the 3rd and 5th harmonics of the wiggler. The HL mode generated output power comparable to conventional fundamental operation with enhanced stability and narrower spectral bandwidth. Notably, we demonstrate that HL extends the spectral coverage by a factor of two under fixed facility constraints, achieving pulse energies up to 540 {\mu}J. These results establish high-gain HL as a versatile mechanism for advancing compact, wavelength-flexible FEL facilities.
toXiv_bot_toot
Disentangling orbital and confinement contributions to $g$-factor in Ge/SiGe hole quantum dots
L. Sommer, I. Seidler, F. J. Schupp, S. Paredes, N. W. Hendrickx, L. Massai, S. W. Bedell, G. Salis, M. Mergenthaler, P. Harvey-Collard, A. Fuhrer, T. Ihn
https://arxiv.org/abs/2602.09913
LOL. Just managed to configure 2 passkeys such that both are required for a NextCloud account. Probably should kill the one that is only for use as a 2nd factor.
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
Early testing of the $40 USB microscope camera: i need to work out a better mount than the piece of trash it came with but the actual image isn't half bad for the price. I can definitely make this work for recording/streaming.
ecoli_transcription: E. coli transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the bacteria Escherichia coli.
This network has 423 nodes and 578 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.s…
Polls have closed in Illinois, where a series of bitterly contested primaries will decide which members of a new generation of politicians will try to replace several Democratic mainstays
-- including Senator Richard J. Durbin, the party’s No. 2 in the Senate.
The Senate primary and down-ballot races in deep-blue Illinois have seized national attention as longtime lawmakers step aside and Democrats hope to gain momentum heading into midterm elections that have been reshaped by …
High-Dimensional Robust Mean Estimation with Untrusted Batches
Maryam Aliakbarpour, Vladimir Braverman, Yuhan Liu, Junze Yin
https://arxiv.org/abs/2602.20698 https://arxiv.org/pdf/2602.20698 https://arxiv.org/html/2602.20698
arXiv:2602.20698v1 Announce Type: new
Abstract: We study high-dimensional mean estimation in a collaborative setting where data is contributed by $N$ users in batches of size $n$. In this environment, a learner seeks to recover the mean $\mu$ of a true distribution $P$ from a collection of sources that are both statistically heterogeneous and potentially malicious. We formalize this challenge through a double corruption landscape: an $\varepsilon$-fraction of users are entirely adversarial, while the remaining ``good'' users provide data from distributions that are related to $P$, but deviate by a proximity parameter $\alpha$.
Unlike existing work on the untrusted batch model, which typically measures this deviation via total variation distance in discrete settings, we address the continuous, high-dimensional regime under two natural variants for deviation: (1) good batches are drawn from distributions with a mean-shift of $\sqrt{\alpha}$, or (2) an $\alpha$-fraction of samples within each good batch are adversarially corrupted. In particular, the second model presents significant new challenges: in high dimensions, unlike discrete settings, even a small fraction of sample-level corruption can shift empirical means and covariances arbitrarily.
We provide two Sum-of-Squares (SoS) based algorithms to navigate this tiered corruption. Our algorithms achieve the minimax-optimal error rate $O(\sqrt{\varepsilon/n} \sqrt{d/nN} \sqrt{\alpha})$, demonstrating that while heterogeneity $\alpha$ represents an inherent statistical difficulty, the influence of adversarial users is suppressed by a factor of $1/\sqrt{n}$ due to the internal averaging afforded by the batch structure.
toXiv_bot_toot
Crosslisted article(s) found for q-bio.GN. https://arxiv.org/list/q-bio.GN/new
[1/1]:
- A Multi-Label Temporal Convolutional Framework for Transcription Factor Binding Characterization
Pietro Demurtas, Ferdinando Zanchetta, Giovanni Perini, Rita Fioresi
Interesting observation from today (a beautiful, cloudless day): We got *less* solar power than a few days ago, when it was partly cloudy. Significantly less, by almost a factor of two vs the previous peak (and closer to what we got on fairly rainy days).
My working hypothesis at this point: the sun is low in the sky because it's winter, and spends a significant fraction of its time partly occluded by trees.
On a cloudy day, shading isn't really a thing because you have t…
ecoli_transcription: E. coli transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the bacteria Escherichia coli.
This network has 423 nodes and 578 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.s…
Towards Efficient Data Structures for Approximate Search with Range Queries
Ladan Kian, Dariusz R. Kowalski
https://arxiv.org/abs/2602.06860 https://arxiv.org/pdf/2602.06860 https://arxiv.org/html/2602.06860
arXiv:2602.06860v1 Announce Type: new
Abstract: Range queries are simple and popular types of queries used in data retrieval. However, extracting exact and complete information using range queries is costly. As a remedy, some previous work proposed a faster principle, {\em approximate} search with range queries, also called single range cover (SRC) search. It can, however, produce some false positives. In this work we introduce a new SRC search structure, a $c$-DAG (Directed Acyclic Graph), which provably decreases the average number of false positives by logarithmic factor while keeping asymptotically same time and memory complexities as a classic tree structure. A $c$-DAG is a tunable augmentation of the 1D-Tree with denser overlapping branches ($c \geq 3$ children per node). We perform a competitive analysis of a $c$-DAG with respect to 1D-Tree and derive an additive constant time overhead and a multiplicative logarithmic improvement of the false positives ratio, on average. We also provide a generic framework to extend our results to empirical distributions of queries, and demonstrate its effectiveness for Gowalla dataset. Finally, we quantify and discuss security and privacy aspects of SRC search on $c$-DAG vs 1D-Tree, mainly mitigation of structural leakage, which makes $c$-DAG a good data structure candidate for deployment in privacy-preserving systems (e.g., searchable encryption) and multimedia retrieval.
toXiv_bot_toot
yeast_transcription: Yeast transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the yeast Saccharomyces cerevisiae.
This network has 916 nodes and 1094 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.sk…
Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
Sharareh Alipour
https://arxiv.org/abs/2602.07720 https://arxiv.org/pdf/2602.07720 https://arxiv.org/html/2602.07720
arXiv:2602.07720v1 Announce Type: new
Abstract: Many multiagent tasks -- such as reviewer assignment, coalition formation, or fair resource allocation -- require selecting a group of agents such that collaboration remains effective even in the worst case. The \emph{weighted max-min $T$-join problem} formalizes this challenge by seeking a subset of vertices whose minimum-weight matching is maximized, thereby ensuring robust outcomes against unfavorable pairings.
We advance the study of this problem in several directions. First, we design an algorithm that computes an upper bound for the \emph{weighted max-min $2k$-matching problem}, where the chosen set must contain exactly $2k$ vertices. Building on this bound, we develop a general algorithm with a \emph{$2 \ln n$-approximation guarantee} that runs in $O(n^4)$ time. Second, using ear decompositions, we propose another upper bound for the weighted max-min $T$-join cost. We also show that the problem can be solved exactly when edge weights belong to $\{1,2\}$.
Finally, we evaluate our methods on real collaboration datasets. Experiments show that the lower bounds from our approximation algorithm and the upper bounds from the ear decomposition method are consistently close, yielding empirically small constant-factor approximations. Overall, our results highlight both the theoretical significance and practical value of weighted max-min $T$-joins as a framework for fair and robust group formation in multiagent systems.
toXiv_bot_toot
yeast_transcription: Yeast transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the yeast Saccharomyces cerevisiae.
This network has 916 nodes and 1094 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.sk…
ecoli_transcription: E. coli transcription network (2002)
Network of operons and their pairwise interactions, via transcription factor-based regulation, within the bacteria Escherichia coli.
This network has 423 nodes and 578 edges.
Tags: Biological, Gene regulation, Unweighted
https://networks.s…
🇺🇦 #NowPlaying on KEXP's #MiddayShow
Nina Simone & Lauryn Hill:
🎵 Ex-Factor
#NinaSimone #LaurynHill