Federated learning (FL) enables distributed clients to collaboratively train a global model using local private data. Nevertheless, recent studies show that conventional FL algorithms still exhibit deficiencies in privacy protection, and the server lacks a reliable and stable aggregation rule for updating the global model. This situation creates opportunities for adversaries: on the one hand, they may eavesdrop on uploaded gradients or model parameters, potentially leaking benign clients’ private data; on the other hand, they may compromise clients […]

Ver mais

arXiv:2601.21012v1 Announce Type: new Abstract: Test-Time Adaptation (TTA) enables pre-trained models to adjust to distribution shift by learning from unlabeled test-time streams. However, existing methods typically treat these streams as independent samples, overlooking the supervisory signal inherent in temporal dynamics. To address this, we introduce Order-Aware Test-Time Adaptation (OATTA). We formulate test-time adaptation as a gradient-free recursive Bayesian estimation task, using a learned dynamic transition matrix as a temporal prior to refine the base model’s predictions. To ensure […]

Ver mais

Trust shouldn’t be trapped inside apps. When you switch Nostr clients, your context disappears and you rebuild the same trust layer from scratch. I built an extension and oracle that compute Web of Trust scores from your social graph once, making them portable across every client. Users control trust, not apps.

Ver mais

arXiv:2604.18722v1 Announce Type: new Abstract: Cross-lingual transfer in NLP is often hindered by the “script barrier” where differences in writing systems inhibit transfer learning between languages. Transliteration, the process of converting the script, has emerged as a powerful technique to bridge this gap by increasing lexical overlap. This paper provides a comprehensive survey of the application of transliteration in cross-lingual NLP. We present a taxonomy of key motivations to utilize transliterations in language models, and provide an overview […]

Ver mais

Victoria, Seychelles, March 17, 2026 CoinGecko recently released its CEX & DEX Trading Activity Report 2026, offering a comprehensive review of the new listings, trading volume, and market share performance of major exchanges from January 2025 to January 2026. The report highlights that MEXC ranked among the top in all three key metrics—number of listings, spot market share, and perpetual futures market share—reinforcing its strong competitive edge in both token coverage and trading volume. 1,281 New Listings in […]

Ver mais

A central challenge in scientific machine learning (ML) is the correct representation of physical systems governed by multi-regime behaviours. In these scenarios, standard data analysis techniques often fail to capture the nature of the data, as the system’s response varies significantly across the state space due to its stochasticity and the different physical regimes. Uncertainty quantification (UQ) should thus not be viewed merely as a safety assessment, but as a support to the learning task itself, guiding the […]

Ver mais

arXiv:2603.20217v1 Announce Type: new Abstract: Reward models are a standard tool to score responses from LLMs. Reward models are built to rank responses to a fixed prompt sampled from a single model, for example to choose the best of n sampled responses. In this paper, we study whether scores from response-level reward models lifted to score a model’s suitability for a prompt, prior to seeing responses from that model. Specifically, we show that it is straightforward to predict […]

Ver mais

arXiv:2602.06361v1 Announce Type: cross Abstract: We introduce a problem of fairly allocating indivisible goods (items) in which the agents’ valuations cannot be observed directly, but instead can only be accessed via noisy queries. In the two-agent setting with Gaussian noise and bounded valuations, we derive upper and lower bounds on the required number of queries for finding an envy-free allocation in terms of the number of items, $m$, and the negative-envy of the optimal allocation, $Delta$. In particular, […]

Ver mais

This paper addresses complex decision-making scenarios characterized by high uncertainty and high-cost errors, researching a risk-sensitive decision-oriented reinforcement learning mining method. It focuses on resolving the reliability issues arising from tail instability in the reward distribution and out-of-distribution actions under offline data conditions. Methodologically, the decision-making process is modeled using a Markov framework, with the reward distribution as the learning object to retain value information under adverse conditions. Based on this, a conditional risk-value metric is introduced to […]

Ver mais