Miracle-dz/UniFAR-FTUs huggingface dataset:
Lyman Continuum Leaker Candidates at $z\sim3-4$ in the HDUV Based on a Spectroscopic Sample of MUSE LAEs

In recent years, a number of Lyman continuum (LyC) leaker candidates at intermediate redshifts have been found, providing insight into how the Universe was reionised at early cosmic times. Here we identify new LyC leaker candidates at $z\approx 3-4.5$ and compare them to objects from the literature to get an overview of the different observed escape fractions and their relation to the properties of the Lyman $\alpha$ (Ly$\alpha$) emission line. The aim of this work is to test indicators for LyC leakage and to improve our understanding of the kind of galaxies from which LyC radiation can escape. We use data from the Hubble Deep Ultraviolet (HDUV) legacy survey to search for LyC emission based on a sample of $\approx 2000$ Ly$\alpha$ emitters (LAEs) detected previously in two surveys with the Multi-Unit Spectroscopic Explorer (MUSE), MUSE-Deep and MUSE-Wide. Based on their known redshifts and positions, we look for potential LyC leakage in the WFC3/UVIS F336W band of the HDUV. The escape fractions are measured and compared based on spectral energy distribution (SED) fitting performed using the CIGALE software. We add twelve objects to the sample of known LyC leaker candidates, one of which was previously known, and compare their Ly$\alpha$ properties to their escape fractions. We find escape fractions between $\sim 20\%$ and $\sim 90\%$, assuming a high transmission in the intergalactic medium (IGM). We show a method to use the number of LyC leaker candidates we find to infer the underlying average escape fraction of galaxies, which is $\approx 12\%$. Based on their Ly$\alpha$ properties, we conclude that LyC leakers are not very different from other high-z LAEs and suggest that most LAEs could be leaking LyC even if this can not always be detected due to the direction of emission and the transmission properties of the IGM.
CMOSE: Comprehensive Multi-Modality Online Student Engagement Dataset with High-Quality Labels

Online learning is a rapidly growing industry due to its convenience. However, a major challenge in online learning is whether students are as engaged as they are in face-to-face classes. An engagement recognition system can significantly improve the learning experience in online classes. Current challenges in engagement detection involve poor label quality in the dataset, intra-class variation, and extreme data imbalance. To address these problems, we present the CMOSE dataset, which contains a large number of data in different engagement levels and high-quality labels generated according to the psychological advice. We demonstrate the advantage of transferability by analyzing the model performance on other engagement datasets. We also developed a training mechanism, MocoRank, to handle the intra-class variation, the ordinal relationship between different classes, and the data imbalance problem. MocoRank outperforms prior engagement detection losses, achieving a 1.32% enhancement in overall accuracy and 5.05% improvement in average accuracy. We further demonstrate the effectiveness of multi-modality by conducting ablation studies on features such as pre-trained video features, high-level facial features, and audio features.
N-Gram Unsupervised Compoundation and Feature Injection for Better Symbolic Music Understanding

The first step to apply deep learning techniques for symbolic music understanding is to transform musical pieces (mainly in MIDI format) into sequences of predefined tokens like note pitch, note velocity, and chords. Subsequently, the sequences are fed into a neural sequence model to accomplish specific tasks. Music sequences exhibit strong correlations between adjacent elements, making them prime candidates for N-gram techniques from Natural Language Processing (NLP). Consider classical piano music: specific melodies might recur throughout a piece, with subtle variations each time. In this paper, we propose a novel method, NG-Midiformer, for understanding symbolic music sequences that leverages the N-gram approach. Our method involves first processing music pieces into word-like sequences with our proposed unsupervised compoundation, followed by using our N-gram Transformer encoder, which can effectively incorporate N-gram information to enhance the primary encoder part for better understanding of music sequences. The pre-training process on large-scale music datasets enables the model to thoroughly learn the N-gram information contained within music sequences, and subsequently apply this information for making inferences during the fine-tuning stage. Experiment on various datasets demonstrate the effectiveness of our method and achieved state-of-the-art performance on a series of music understanding downstream tasks. The code and model weights will be released at https://github.com/CinqueOrigin/NG-Midiformer.
Multi-Scene Generalized Trajectory Global Graph Solver with Composite Nodes for Multiple Object Tracking

The global multi-object tracking (MOT) system can consider interaction, occlusion, and other ``visual blur'' scenarios to ensure effective object tracking in long videos. Among them, graph-based tracking-by-detection paradigms achieve surprising performance. However, their fully-connected nature poses storage space requirements that challenge algorithm handling long videos. Currently, commonly used methods are still generated trajectories by building one-forward associations across frames. Such matches produced under the guidance of first-order similarity information may not be optimal from a longer-time perspective. Moreover, they often lack an end-to-end scheme for correcting mismatches. This paper proposes the Composite Node Message Passing Network (CoNo-Link), a multi-scene generalized framework for modeling ultra-long frames information for association. CoNo-Link's solution is a low-storage overhead method for building constrained connected graphs. In addition to the previous method of treating objects as nodes, the network innovatively treats object trajectories as nodes for information interaction, improving the graph neural network's feature representation capability. Specifically, we formulate the graph-building problem as a top-k selection task for some reliable objects or trajectories. Our model can learn better predictions on longer-time scales by adding composite nodes. As a result, our method outperforms the state-of-the-art in several commonly used datasets.
A COLREGs-Compliant Conflict Resolution Strategy for Autonomous Surface Vehicles

This paper presents a novel conflict resolution strategy for autonomous surface vehicles (ASVs) to safely navigate and avoid collisions in a multi-vessel environment at sea. Collisions between two or more marine vessels must be avoided by following the International Regulations for Preventing Collisions at Sea (COLREGs). We propose strategy a two-phase strategy called as COLREGs Compliant Conflict-Resolving (COMCORE) strategy, that generates collision-free trajectories for ASVs while complying with COLREGs. In phase-1, a shortest path for each agent is determined, while in phase-2 conflicts are detected and resolved by modifying the path in compliance with COLREGs. COMCORE solution optimises vessel trajectories for lower costs while also providing a safe and collision-free plan for each vessel. Simulation results are presented to show the applicability of COMCORE for larger number agents with very low computational requirement and hence scalable. Further, we experimentally demonstrate COMCORE for two ASVs in a lake to show its ability to determine solution and implementation capability in the real-world.
Federated Learning for Wireless Applications: A Prototype

Wireless embedded edge devices are ubiquitous in our daily lives, enabling them to gather immense data via onboard sensors and mobile applications. This offers an amazing opportunity to train machine learning (ML) models in the realm of wireless devices for decision-making. Training ML models in a wireless setting necessitates transmitting datasets collected at the edge to a cloud parameter server, which is infeasible due to bandwidth constraints, security, and privacy issues. To tackle these challenges, Federated Learning (FL) has emerged as a distributed optimization approach to the decentralization of the model training process. In this work, we present a novel prototype to examine FL's effectiveness over bandwidth-constrained wireless channels. Through a novel design consisting of Zigbee and NI USRP devices, we propose a configuration that allows clients to broadcast synergistically local ML model updates to a central server to obtain a generalized global model. We assess the efficacy of this prototype using metrics such as global model accuracy and time complexity under varying conditions of transmission power, data heterogeneity and local learning.
OMG: Towards Open-vocabulary Motion Generation via Mixture of Controllers

We have recently seen tremendous progress in realistic text-to-motion generation. Yet, the existing methods often fail or produce implausible motions with unseen text inputs, which limits the applications. In this paper, we present OMG, a novel framework, which enables compelling motion generation from zero-shot open-vocabulary text prompts. Our key idea is to carefully tailor the pretrain-then-finetune paradigm into the text-to-motion generation. At the pre-training stage, our model improves the generation ability by learning the rich out-of-domain inherent motion traits. To this end, we scale up a large unconditional diffusion model up to 1B parameters, so as to utilize the massive unlabeled motion data up to over 20M motion instances. At the subsequent fine-tuning stage, we introduce motion ControlNet, which incorporates text prompts as conditioning information, through a trainable copy of the pre-trained model and the proposed novel Mixture-of-Controllers (MoC) block. MoC block adaptively recognizes various ranges of the sub-motions with a cross-attention mechanism and processes them separately with the text-token-specific experts. Such a design effectively aligns the CLIP token embeddings of text prompts to various ranges of compact and expressive motion features. Extensive experiments demonstrate that our OMG achieves significant improvements over the state-of-the-art methods on zero-shot text-to-motion generation. Project page: https://tr3e.github. io/omg-page.
Contractive error feedback for gradient compression

On-device memory concerns in distributed deep learning have become severe due to (i) the growth of model size in multi-GPU training, and (ii) the wide adoption of deep neural networks for federated learning on IoT devices which have limited storage. In such settings, communication efficient optimization methods are attractive alternatives, however they still struggle with memory issues. To tackle these challenges, we propose an communication efficient method called contractive error feedback (ConEF). As opposed to SGD with error-feedback (EFSGD) that inefficiently manages memory, ConEF obtains the sweet spot of convergence and memory usage, and achieves communication efficiency by leveraging biased and all-reducable gradient compression. We empirically validate ConEF on various learning tasks that include image classification, language modeling, and machine translation and observe that ConEF saves 80\% - 90\% of the extra memory in EFSGD with almost no loss on test performance, while also achieving 1.3x - 5x speedup of SGD. Through our work, we also demonstrate the feasibility and convergence of ConEF to clear up the theoretical barrier of integrating ConEF to popular memory efficient frameworks such as ZeRO-3.
Puppy: A Publicly Verifiable Watermarking Protocol

In this paper, we propose Puppy, the first formally defined framework for converting any symmetric watermarking into a publicly verifiable one. Puppy allows anyone to verify a watermark any number of times with the help of an untrusted third party, without requiring owner presence during detection. We formally define and prove security of Puppy using the ideal/real-world simulation paradigm and construct two practical and secure instances: (1) Puppy-TEE that uses Trusted Execution Environments (TEEs), and (2) Puppy-2PC that relies on two-party computation (2PC) based on garbled circuits. We then convert four current symmetric watermarking schemes into publicly verifiable ones and run extensive experiments using Puppy-TEE and Puppy-2PC. Evaluation results show that, while Puppy-TEE incurs some overhead, its total latency is on the order of milliseconds for three out of four watermarking schemes. Although the overhead of Puppy-2PC is higher (on the order of seconds), it is viable for settings that lack a TEE or where strong trust assumptions about a TEE need to be avoided. We further optimize the solution to increase its scalability and resilience to denial of service attacks via memoization.
Combinatorial Results on Barcode Lattices

A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial invariants on the space of barcodes. A partial order can be defined on these multipermutations, resulting in a class of posets known as combinatorial barcode lattices. In this paper, we provide a number of equivalent definitions for the combinatorial barcode lattice, show that its M\"obius function is a restriction of the M\"obius function of the symmetric group under the weak Bruhat order, and show its ground set is the Jordan-H\"older set of a labeled poset. Furthermore, we obtain formulas for the number of join-irreducible elements, the rank-generating function, and the number of maximal chains of combinatorial barcode lattices. Lastly, we make connections between intervals in the combinatorial barcode lattice and certain classes of matchings.
Zebra: Extending Context Window with Layerwise Grouped Local-Global Attention

This paper introduces a novel approach to enhance the capabilities of Large Language Models (LLMs) in processing and understanding extensive text sequences, a critical aspect in applications requiring deep comprehension and synthesis of large volumes of information. Recognizing the inherent challenges in extending the context window for LLMs, primarily built on Transformer architecture, we propose a new model architecture, referred to as Zebra. This architecture efficiently manages the quadratic time and memory complexity issues associated with full attention in the Transformer by employing grouped local-global attention layers. Our model, akin to a zebra's alternating stripes, balances local and global attention layers, significantly reducing computational requirements and memory consumption. Comprehensive experiments, including pretraining from scratch, continuation of long context adaptation training, and long instruction tuning, are conducted to evaluate the Zebra's performance. The results show that Zebra achieves comparable or superior performance on both short and long sequence benchmarks, while also enhancing training and inference efficiency.
Gravitational Waves from Primordial Black Hole Evaporation with Large Extra Dimensions

The spectra of gravitational waves from black hole evaporation generically peak at frequencies of order the Hawking temperature, making this signal ultra-high frequency for primordial black holes evaporating in the early universe. This motivates us to consider small black holes in theories with large extra dimensions, for which the peak frequency can be lowered substantially, since the true bulk Planck scale $M_*$ can be much smaller than the effective $M_{\rm Pl}$. We study the emission of brane-localized gravitons during the Hawking evaporation of ultra-light primordial black holes in the context of theories with large extra dimensions, with the ultimate goal of computing the contribution to the stochastic gravitational wave background. To accurately model black hole evolution, we compute greybody factors for all particle species emitted on the brane and in the bulk, presuming the majority of emission proceeds during the Schwarzschild phase. We then compute the power spectrum and present day spectral density parameter for brane-localized gravitons contributing to a gravitational wave signal. We find that for an optimal choice of parameters, the peak frequency plateaus in the sub-MHz regime, within range of planned high-frequency gravitational wave detectors, making this scenario a target for detection once their sensitivity exceeds $\Delta N_{\rm eff}$ bounds.
Efficient momentum space approach to superconductivity in quasiperiodic systems

We construct an efficient momentum space approach to the superconductivity in quasiperiodic multilayer systems. To this end, we extend the Brillouin zone (BZ) folding method to the superconducting (SC) phases by formulating the gap equation in the momentum space representation with the BZ folding. In this picture, we find that the SC order parameters generally exhibit finite momenta, which corresponds to the spatial fluctuation of the SC order in quasiperiodic multilayers. We apply the BZ folding method to a one dimensional model of quasiperiodic superconductors and demonstrate its numerical efficiency compared to the conventional method based on the real space representation with a large system size.
Bayes3D: fast learning and inference in structured generative models of 3D objects and scenes

Robots cannot yet match humans' ability to rapidly learn the shapes of novel 3D objects and recognize them robustly despite clutter and occlusion. We present Bayes3D, an uncertainty-aware perception system for structured 3D scenes, that reports accurate posterior uncertainty over 3D object shape, pose, and scene composition in the presence of clutter and occlusion. Bayes3D delivers these capabilities via a novel hierarchical Bayesian model for 3D scenes and a GPU-accelerated coarse-to-fine sequential Monte Carlo algorithm. Quantitative experiments show that Bayes3D can learn 3D models of novel objects from just a handful of views, recognizing them more robustly and with orders of magnitude less training data than neural baselines, and tracking 3D objects faster than real time on a single GPU. We also demonstrate that Bayes3D learns complex 3D object models and accurately infers 3D scene composition when used on a Panda robot in a tabletop scenario.
Mitigating Label Bias in Machine Learning: Fairness through Confident Learning

Discrimination can occur when the underlying unbiased labels are overwritten by an agent with potential bias, resulting in biased datasets that unfairly harm specific groups and cause classifiers to inherit these biases. In this paper, we demonstrate that despite only having access to the biased labels, it is possible to eliminate bias by filtering the fairest instances within the framework of confident learning. In the context of confident learning, low self-confidence usually indicates potential label errors; however, this is not always the case. Instances, particularly those from underrepresented groups, might exhibit low confidence scores for reasons other than labeling errors. To address this limitation, our approach employs truncation of the confidence score and extends the confidence interval of the probabilistic threshold. Additionally, we incorporate with co-teaching paradigm for providing a more robust and reliable selection of fair instances and effectively mitigating the adverse effects of biased labels. Through extensive experimentation and evaluation of various datasets, we demonstrate the efficacy of our approach in promoting fairness and reducing the impact of label bias in machine learning models.
Evaluating pro-arrhythmogenic effects of the T634S-hERG mutation: insights from a simulation study

A mutation to serine of a conserved threonine (T634S) in the hERG K+ channel S6 pore region has been identified as a variant of uncertain significance, showing a loss-of-function effect. However, its potential consequences for ventricular excitation and arrhythmogenesis have not been reported. This study evaluated possible functional effects of the T634S-hERG mutation on ventricular excitation and arrhythmogenesis by using multi-scale computer models of the human ventricle. A Markov chain model of the rapid delayed rectifier potassium current (IKr) was reconstructed for wild-type and T634S-hERG mutant conditions and incorporated into the ten Tusscher et al. models of human ventricles at cell and tissue (1D, 2D and 3D) levels. Possible functional impacts of the T634S-hERG mutation were evaluated by its effects on action potential durations (APDs) and their rate-dependence (APDr) at the cell level; and on the QT interval of pseudo-ECGs, tissue vulnerability to unidirectional conduction block (VW), spiral wave dynamics and repolarization dispersion at the tissue level. It was found that the T634S-hERG mutation prolonged cellular APDs, steepened APDr, prolonged the QT interval, increased VW, destablized re-entry and augmented repolarization dispersion across the ventricle. Collectively, these results imply potential pro-arrhythmic effects of the T634S-hERG mutation, consistent with LQT2.