February 2026

I wanted to share a project I’ve been building called Sovereign Mohawk. It’s a Go-based runtime (using Wasmtime) designed to solve the scaling and trust issues in edge-heavy federated learning. Most FL setups hit a wall at a few thousand nodes due to $O(dn)$ communication overhead and vulnerability to model poisoning. What’s different here: O(d log n) Scaling: Using a hierarchical tree-based aggregation that I’ve empirically validated up to 10M nodes. This reduced metadata overhead from ~40 TB […]

Ver mais

Alleviating catastrophic forgetting while enabling further learning is a primary challenge in continual learning (CL). Orthogonal-based training methods have gained attention for their efficiency and strong theoretical properties, and many existing approaches enforce orthogonality through gradient projection. In this paper, we revisit orthogonality and exploit the fact that small singular values correspond to directions that are nearly orthogonal to the input space of previous tasks. Building on this principle, we introduce NESS (Null-space Estimated from Small Singular values), […]

Ver mais

Lossless compression is essential for efficient data storage and transmission. Although learning-based lossless compressors achieve strong results, most of them are designed for a single modality, leading to redundant compressor deployments in multi-modal settings. Designing a unified multi-modal compressor is critical yet challenging, as different data types vary largely in format, dimension, and statistics. Multi-modal large language models offer a promising resolution but remain too complex for practical use. Thus, we propose textbf{OmniZip}, textbf{a unified and lightweight lossless […]

Ver mais

Objective: The objective of this study is to develop a machine learning (ML)-based framework for early risk stratification of clinical trials (CTs) according to their likelihood of exhibiting a high rate of dosing errors, using information available prior to trial initiation. Materials and Methods: We constructed a dataset from ClinicalTrials.gov comprising 42,112 CTs. Structured, semi-structured trial data, and unstructured protocol-related free-text data were extracted. CTs were assigned binary labels indicating elevated dosing error rate, derived from adverse event […]

Ver mais

Federated learning (FL) facilitates the secure utilization of decentralized images, advancing applications in medical image recognition and autonomous driving. However, conventional FL faces two critical challenges in real-world deployment: ineffective knowledge fusion caused by model updates biased toward majority-class features, and prohibitive communication overhead due to frequent transmissions of high-dimensional model parameters. Inspired by the human brain’s efficiency in knowledge integration, we propose a novel Generative Federated Prototype Learning (GFPL) framework to address these issues. Within this framework, […]

Ver mais

Differentially private federated learning faces a fundamental tension: privacy protection mechanisms that safeguard client data simultaneously create quantifiable privacy costs that discourage participation, undermining the collaborative training process. Existing incentive mechanisms rely on unbiased client selection, forcing servers to compensate even the most privacy-sensitive clients ("privacy stragglers"), leading to systemic inefficiency and suboptimal resource allocation. We introduce JSAM (Joint client Selection and privacy compensAtion Mechanism), a Bayesian-optimal framework that simultaneously optimizes client selection probabilities and privacy compensation to […]

Ver mais

I got 4/3/2. The 3 and 2 reviews were mostly asking about why have not done some extra statistical tests. All reviews agreed that paper is novel and theory is good. We have given rebuttal reporting the statistical tests to prove why our results are reliable, but we have not got any acknowledgement from the reviewers. Is this normal? submitted by /u/Distinct_Relation129 [link] [comments]

Ver mais

Fast matrix multiplication can be described as searching for low-rank decompositions of the matrix–multiplication tensor. We design a neural architecture, textsc{StrassenNet}, which reproduces the Strassen algorithm for $2times 2$ multiplication. Across many independent runs the network always converges to a rank-$7$ tensor, thus numerically recovering Strassen’s optimal algorithm. We then train the same architecture on $3times 3$ multiplication with rank $rin{19,dots,23}$. Our experiments reveal a clear numerical threshold: models with $r=23$ attain significantly lower validation error than those […]

Ver mais