Miracle-dz/UniFAR-FTUs huggingface dataset:
Weighted Sampled Split Learning (WSSL): Balancing Privacy, Robustness, and Fairness in Distributed Learning Environments

This study presents Weighted Sampled Split Learning (WSSL), an innovative framework tailored to bolster privacy, robustness, and fairness in distributed machine learning systems. Unlike traditional approaches, WSSL disperses the learning process among multiple clients, thereby safeguarding data confidentiality. Central to WSSL’s efficacy is its utilization of weighted sampling. This approach ensures equitable learning by tactically selecting influential clients based on their contributions. Our evaluation of WSSL spanned various client configurations and employed two distinct datasets: Human Gait Sensor and CIFAR-10. We observed three primary benefits: heightened model accuracy, enhanced robustness, and maintained fairness across diverse client compositions. Notably, our distributed frameworks consistently surpassed centralized counterparts, registering accuracy peaks of 82.63% and 75.51% for the Human Gait Sensor and CIFAR-10 datasets, respectively. These figures contrast with the top accuracies of 81.12% and 58.60% achieved by centralized systems. Collectively, our findings champion WSSL as a potent and scalable successor to conventional centralized learning, marking it as a pivotal stride forward in privacy-focused, resilient, and impartial distributed machine learning.
Episodic Multi-Task Learning with Heterogeneous Neural Processes

This paper focuses on the data-insufficiency problem in multi-task learning within an episodic training setup. Specifically, we explore the potential of heterogeneous information across tasks and meta-knowledge among episodes to effectively tackle each task with limited data. Existing meta-learning methods often fail to take advantage of crucial heterogeneous information in a single episode, while multi-task learning models neglect reusing experience from earlier episodes. To address the problem of insufficient data, we develop Heterogeneous Neural Processes (HNPs) for the episodic multi-task setup. Within the framework of hierarchical Bayes, HNPs effectively capitalize on prior experiences as meta-knowledge and capture task-relatedness among heterogeneous tasks, mitigating data-insufficiency. Meanwhile, transformer-structured inference modules are designed to enable efficient inferences toward meta-knowledge and task-relatedness. In this way, HNPs can learn more powerful functional priors for adapting to novel heterogeneous tasks in each meta-test episode. Experimental results show the superior performance of the proposed HNPs over typical baselines, and ablation studies verify the effectiveness of the designed inference modules.
Are nonrelativistic ground state $\ell$-boson stars only stable for $\ell=0$ and $\ell=1$?

In previous work we analyzed the linear stability of non-relativistic $\ell$-boson stars with respect to radial modes and showed that ground state configurations are stable with respect to these modes, whereas excited states are unstable. In this work we extend the analysis to non-spherical linear mode perturbations. To this purpose, we expand the wave function in terms of tensor spherical harmonics which allows us to decouple the perturbation equations into a family of radial problems. By using a combination of analytic and numerical methods, we show that ground state configurations with $\ell>1$ possess exponentially in time growing non-radial modes, whereas only oscillating modes are found for $\ell=0$ and $\ell=1$. This leads us to conjecture that nonrelativistic $\ell$-boson stars in their ground state are stable for $\ell=1$ as well as $\ell=0$, while ground state and excited configurations with $\ell>1$ are unstable.
AI for Open Science: A Multi-Agent Perspective for Ethically Translating Data to Knowledge

AI for Science (AI4Science), particularly in the form of self-driving labs, has the potential to sideline human involvement and hinder scientific discovery within the broader community. While prior research has focused on ensuring the responsible deployment of AI applications, enhancing security, and ensuring interpretability, we also propose that promoting openness in AI4Science discoveries should be carefully considered. In this paper, we introduce the concept of AI for Open Science (AI4OS) as a multi-agent extension of AI4Science with the core principle of maximizing open knowledge translation throughout the scientific enterprise rather than a single organizational unit. We use the established principles of Knowledge Discovery and Data Mining (KDD) to formalize a language around AI4OS. We then discuss three principle stages of knowledge translation embedded in AI4Science systems and detail specific points where openness can be applied to yield an AI4OS alternative. Lastly, we formulate a theoretical metric to assess AI4OS with a supporting ethical argument highlighting its importance. Our goal is that by drawing attention to AI4OS we can ensure the natural consequence of AI4Science (e.g., self-driving labs) is a benefit not only for its developers but for society as a whole.
Deeper Hedging: A New Agent-based Model for Effective Deep Hedging

We propose the Chiarella-Heston model, a new agent-based model for improving the effectiveness of deep hedging strategies. This model includes momentum traders, fundamental traders, and volatility traders. The volatility traders participate in the market by innovatively following a Heston-style volatility signal. The proposed model generalises both the extended Chiarella model and the Heston stochastic volatility model, and is calibrated to reproduce as many empirical stylized facts as possible. According to the stylised facts distance metric, the proposed model is able to reproduce more realistic financial time series than three baseline models: the extended Chiarella model, the Heston model, and the Geometric Brownian Motion. The proposed model is further validated by the Generalized Subtracted L-divergence metric. With the proposed Chiarella-Heston model, we generate a training dataset to train a deep hedging agent for optimal hedging strategies under various transaction cost levels. The deep hedging agent employs the Deep Deterministic Policy Gradient algorithm and is trained to maximize profits and minimize risks. Our testing results reveal that the deep hedging agent, trained with data generated by our proposed model, outperforms the baseline in most transaction cost levels. Furthermore, the testing process, which is conducted using empirical data, demonstrates the effective performance of the trained deep hedging agent in a realistic trading environment.
M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering

Existing graph matching methods typically assume that there are similar structures between graphs and they are matchable. However, these assumptions do not align with real-world applications. This work addresses a more realistic scenario where graphs exhibit diverse modes, requiring graph grouping before or along with matching, a task termed mixture graph matching and clustering. We introduce Minorize-Maximization Matching and Clustering (M3C), a learning-free algorithm that guarantees theoretical convergence through the Minorize-Maximization framework and offers enhanced flexibility via relaxed clustering. Building on M3C, we develop UM3C, an unsupervised model that incorporates novel edge-wise affinity learning and pseudo label selection. Extensive experimental results on public benchmarks demonstrate that our method outperforms state-of-the-art graph matching and mixture graph matching and clustering approaches in both accuracy and efficiency. Source code will be made publicly available.
Matching of Descriptive Labels to Glossary Descriptions

Semantic text similarity plays an important role in software engineering tasks in which engineers are requested to clarify the semantics of descriptive labels (e.g., business terms, table column names) that are often consists of too short or too generic words and appears in their IT systems. We formulate this type of problem as a task of matching descriptive labels to glossary descriptions. We then propose a framework to leverage an existing semantic text similarity measurement (STS) and augment it using semantic label enrichment and set-based collective contextualization where the former is a method to retrieve sentences relevant to a given label and the latter is a method to compute similarity between two contexts each of which is derived from a set of texts (e.g., column names in the same table). We performed an experiment on two datasets derived from publicly available data sources. The result indicated that the proposed methods helped the underlying STS correctly match more descriptive labels with the descriptions.
Signs of Similar Stellar Obliquity Distributions for Hot and Warm Jupiters Orbiting Cool Stars

Transiting giant planets provide a natural opportunity to examine stellar obliquities, which offer clues about the origin and dynamical histories of close-in planets. Hot Jupiters orbiting Sun-like stars show a tendency for obliquity alignment, which suggests that obliquities are rarely excited or that tidal realignment is common. However, the stellar obliquity distribution is less clear for giant planets at wider separations where realignment mechanisms are not expected to operate. In this work, we uniformly derive line-of-sight inclinations for 47 cool stars (T eff < 6200 K) harboring transiting hot and warm giant planets by combining rotation periods, stellar radii, and vsini measurements. Among the systems that show signs of spin–orbit misalignment in our sample, three are identified as being misaligned here for the first time. Of particular interest are Kepler-1654, one of the longest-period (1047 days; 2.0 au) giant planets in a misaligned system, and Kepler-30, a multiplanet misaligned system. By comparing the reconstructed underlying inclination distributions, we find that the inferred minimum misalignment distributions of hot Jupiters spanning a/R * = 3–20 (≈0.01–0.1 au) and warm Jupiters spanning a/R * = 20–400 (≈0.1–1.9 au) are in good agreement. With 90% confidence, at least 24−10+7% of warm Jupiters and 14−8+5% of hot Jupiters around cool stars are misaligned by at least 10°. Most stars harboring warm Jupiters are therefore consistent with spin–orbit alignment. The similarity of the hot and warm Jupiter misalignment rates suggests that either the occasional misalignments are primordial and originate in misaligned disks, or the same underlying processes that create misaligned hot Jupiters also lead to misaligned warm Jupiters.
Feature Guided Masked Autoencoder for Self-supervised Learning in Remote Sensing

Self-supervised learning guided by masked image modelling, such as Masked AutoEncoder (MAE), has attracted wide attention for pretraining vision transformers in remote sensing. However, MAE tends to excessively focus on pixel details, thereby limiting the model's capacity for semantic understanding, in particular for noisy SAR images. In this paper, we explore spectral and spatial remote sensing image features as improved MAE-reconstruction targets. We first conduct a study on reconstructing various image features, all performing comparably well or better than raw pixels. Based on such observations, we propose Feature Guided Masked Autoencoder (FG-MAE): reconstructing a combination of Histograms of Oriented Graidents (HOG) and Normalized Difference Indices (NDI) for multispectral images, and reconstructing HOG for SAR images. Experimental results on three downstream tasks illustrate the effectiveness of FG-MAE with a particular boost for SAR imagery. Furthermore, we demonstrate the well-inherited scalability of FG-MAE and release a first series of pretrained vision transformers for medium resolution SAR and multispectral images.
On the Accuracy of Hotelling-Type Asymmetric Tensor Deflation: A Random Tensor Analysis

This work introduces an asymptotic study of Hotelling-type tensor deflation in the presence of noise, in the regime of large tensor dimensions. Specifically, we consider a low-rank asymmetric tensor model of the form $\sum_{i=1}^{r} \beta_{i} \mathcal{A}_{i}+\mathcal{W}$ where $\beta_{i}\geq 0$ and the $\mathcal{A}_{i}^{\prime}$ s are unit-norm rank-one tensors such that $\left\vert\langle\mathcal{A}_{i}, \mathcal{A}_{j}\rangle\right\vert \in[0,1]$ for $i\neq j$ and $\mathcal{W}$ is an additive noise term. Assuming that the dominant components are succes-sively estimated from the noisy observation and subsequently subtracted, we leverage recent advances in random tensor theory in the regime of asymptotically large tensor dimensions to analytically characterize the estimated singular values and the alignment of estimated and true singular vectors at each step of the deflation procedure. Furthermore, this result can be used to construct estimators of the signal-to-noise ratios $\beta_{i}$ and the alignments between the estimated and true rank-1 signal components.
Ultralong‐Term High‐Density Data Storage with Atomic Defects in SiC

There is an urgent need to increase the global data storage capacity, as current approaches lag behind the exponential growth of data generation driven by the Internet, social media, and cloud technologies. In addition to increasing storage density, new solutions should provide long‐term data archiving that goes far beyond traditional magnetic memory, optical disks, and solid‐state drives. Here, a concept of energy‐efficient, ultralong, high‐density data archiving is proposed, based on optically active atomic‐size defects in a radiation resistance material, silicon carbide (SiC). The information is written in these defects by focused ion beams and read using photoluminescence or cathodoluminescence. The temperature‐dependent deactivation of these defects suggests a retention time minimum over a few generations under ambient conditions. With near‐infrared laser excitation, grayscale encoding and multi‐layer data storage, the areal density corresponds to that of Blu‐ray discs. Furthermore, it is demonstrated that the areal density limitation of conventional optical data storage media due to the light diffraction can be overcome by focused electron‐beam excitation.
Weakly Coupled Deep Q-Networks

We propose weakly coupled deep Q-networks (WCDQN), a novel deep reinforcement learning algorithm that enhances performance in a class of structured problems called weakly coupled Markov decision processes (WCMDP). WCMDPs consist of multiple independent subproblems connected by an action space constraint, which is a structural property that frequently emerges in practice. Despite this appealing structure, WCMDPs quickly become intractable as the number of subproblems grows. WCDQN employs a single network to train multiple DQN"subagents", one for each subproblem, and then combine their solutions to establish an upper bound on the optimal action value. This guides the main DQN agent towards optimality. We show that the tabular version, weakly coupled Q-learning (WCQL), converges almost surely to the optimal action value. Numerical experiments show faster convergence compared to DQN and related techniques in settings with as many as 10 subproblems, $3^{10}$ total actions, and a continuous state space.
Minimax Optimal Submodular Optimization with Bandit Feedback

We consider maximizing a monotonic, submodular set function $f: 2^{[n]} \rightarrow [0,1]$ under stochastic bandit feedback. Specifically, $f$ is unknown to the learner but at each time $t=1,\dots,T$ the learner chooses a set $S_t \subset [n]$ with $|S_t| \leq k$ and receives reward $f(S_t) + \eta_t$ where $\eta_t$ is mean-zero sub-Gaussian noise. The objective is to minimize the learner's regret over $T$ times with respect to ($1-e^{-1}$)-approximation of maximum $f(S_*)$ with $|S_*| = k$, obtained through greedy maximization of $f$. To date, the best regret bound in the literature scales as $k n^{1/3} T^{2/3}$. And by trivially treating every set as a unique arm one deduces that $\sqrt{ {n \choose k} T }$ is also achievable. In this work, we establish the first minimax lower bound for this setting that scales like $\mathcal{O}(\min_{i \le k}(in^{1/3}T^{2/3} + \sqrt{n^{k-i}T}))$. Moreover, we propose an algorithm that is capable of matching the lower bound regret.
Fusion of the Power from Citations: Enhance your Influence by Integrating Information from References

Influence prediction plays a crucial role in the academic community. The amount of scholars' influence determines whether their work will be accepted by others. Most existing research focuses on predicting one paper's citation count after a period or identifying the most influential papers among the massive candidates, without concentrating on an individual paper's negative or positive impact on its authors. Thus, this study aims to formulate the prediction problem to identify whether one paper can increase scholars' influence or not, which can provide feedback to the authors before they publish their papers. First, we presented the self-adapted ACC (Average Annual Citation Counts) metric to measure authors' impact yearly based on their annual published papers, paper citation counts, and contributions in each paper. Then, we proposed the RD-GAT (Reference-Depth Graph Attention Network) model to integrate heterogeneous graph information from different depth of references by assigning attention coefficients on them. Experiments on AMiner dataset demonstrated that the proposed ACC metrics could represent the authors influence effectively, and the RD-GAT model is more efficiently on the academic citation network, and have stronger robustness against the overfitting problem compared with the baseline models. By applying the framework in this work, scholars can identify whether their papers can improve their influence in the future.
Wavelet-based Ramsey magnetometry enhancement of a single NV center in diamond

Nitrogen-vacancy (NV) centers in diamond constitute a solid-state nanosensing paradigm. Specifically for high-precision magnetometry, the so-called Ramsey interferometry is the prevalent choice where the sensing signal is extracted from time-resolved spin-state-dependent photoluminescence (PL) data. Its sensitivity is ultimately limited by the photon shot noise, which cannot be sufficiently removed by averaging or frequency filtering. Here, we propose Ramsey DC magnetometry of a single NV center enhanced by a wavelet-denoising scheme specifically tailored to suppress photon shot noise. It simply operates as a classical post-processing applied on a collected PL time series. Our implementation is based on a method that we named template margin thresholding which enables not only frequency but also time-dependent denoising. We computationally benchmark its DC magnetic field sensing signal-to-noise-ratio improvement over the raw PL data around an order of magnitude.
Peer-to-Peer Deep Learning for Beyond-5G IoT

We present P2PL, a practical multi-device peer-to-peer deep learning algorithm that, unlike the federated learning paradigm, does not require coordination from edge servers or the cloud. This makes P2PL well-suited for the sheer scale of beyond-5G computing environments like smart cities that otherwise create range, latency, bandwidth, and single point of failure issues for federated approaches. P2PL introduces max norm synchronization to catalyze training, retains on-device deep model training to preserve privacy, and leverages local inter-device communication to implement distributed consensus. Each device iteratively alternates between two phases: 1) on-device learning and 2) distributed cooperation where they combine model parameters with nearby devices. We empirically show that all participating devices achieve the same test performance attained by federated and centralized training -- even with 100 devices and relaxed singly stochastic consensus weights. We extend these experimental results to settings with diverse network topologies, sparse and intermittent communication, and non-IID data distributions.
AnomalyCLIP: Object-agnostic Prompt Learning for Zero-shot Anomaly Detection

Zero-shot anomaly detection (ZSAD) requires detection models trained using auxiliary data to detect anomalies without any training sample in a target dataset. It is a crucial task when training data is not accessible due to various concerns, \eg, data privacy, yet it is challenging since the models need to generalize to anomalies across different domains where the appearance of foreground objects, abnormal regions, and background features, such as defects/tumors on different products/organs, can vary significantly. Recently large pre-trained vision-language models (VLMs), such as CLIP, have demonstrated strong zero-shot recognition ability in various vision tasks, including anomaly detection. However, their ZSAD performance is weak since the VLMs focus more on modeling the class semantics of the foreground objects rather than the abnormality/normality in the images. In this paper we introduce a novel approach, namely AnomalyCLIP, to adapt CLIP for accurate ZSAD across different domains. The key insight of AnomalyCLIP is to learn object-agnostic text prompts that capture generic normality and abnormality in an image regardless of its foreground objects. This allows our model to focus on the abnormal image regions rather than the object semantics, enabling generalized normality and abnormality recognition on diverse types of objects. Large-scale experiments on 17 real-world anomaly detection datasets show that AnomalyCLIP achieves superior zero-shot performance of detecting and segmenting anomalies in datasets of highly diverse class semantics from various defect inspection and medical imaging domains. Code will be made available at https://github.com/zqhang/AnomalyCLIP.
Jamming modulates coalescence dynamics of shear-thickening colloidal droplets

Recent investigations into coalescence dynamics of complex fluid droplets revealed the existence of sub-Newtonian behaviour for polymeric fluids (elastic and shear thinning). We hypothesize that such delayed coalescence or sub-Newtonian coalescence dynamics may be extended to the general class of shear thickening fluids. To investigate this droplets of aqueous corn-starch suspensions were chosen and its coalescence in sessile pendant configuration was probed by high-speed real time imaging. Temporal evolution of the neck (growth) during coalescence was quantified as a function of suspended particle weight fraction \phi_w. The necking behaviour was found to evolve as the power-law relation $R=at^b$ where R is neck radius with exponent $\b\le0.5$ implying it is a subset of the generic sub-Newtonian coalescence. Second significant delay in the coalescence dynamics is observed for particle fractions beyond the jamming fraction {\ \phi}_w>\ \phi_J\geq0.35}. Our proposed theoretical model captures this delay implicitly through altered suspension viscosity stemming from increased particle content.
A Zeroth-Order Variance-Reduced Method for Decentralized Stochastic Non-convex Optimization

In this paper, we consider a distributed stochastic non-convex optimization problem, which is about minimizing a sum of $n$ local cost functions over a network with only zeroth-order information. A novel single-loop Decentralized Zeroth-Order Variance Reduction algorithm, called DZOVR, is proposed, which combines two-point gradient estimation, momentum-based variance reduction technique, and gradient tracking. Under mild assumptions, we show that the algorithm is able to achieve $\mathcal{O}(dn^{-1}\epsilon^{-3})$ sampling complexity at each node to reach an $\epsilon$-accurate stationary point and also exhibits network-independent and linear speedup properties. To the best of our knowledge, this is the first stochastic decentralized zeroth-order algorithm that achieves this sampling complexity. Numerical experiments demonstrate that DZOVR outperforms the other state-of-the-art algorithms and has network-independent and linear speedup properties.