Miracle-dz/UniFAR-FTUs huggingface dataset:
Euclidean de Sitter black holes and microcanonical equilibrium

Schwarzschild-de Sitter (SdS) black holes do not admit a completely smooth Euclidean continuation. We discuss some modifications of the gravitational path integral that give Euclidean SdS a semiclassical equilibrium interpretation. First we consider"gravity in a cavity,"defining the canonical ensemble in a box that excises one horizon. However, this standard approach does not work for positive cosmological constant: the solution of lowest free energy has a negative heat capacity, which is inconsistent if it is to provide the leading semiclassical contribution to a canonical partition function. Instead we modify the boundary conditions in the path integral to construct the microcanonical partition function, which appears to be well-defined. We then bring two ensembles into contact and remove the boundary, producing states of a larger microcanonical ensemble that contain, for example, both a black hole and a cosmological horizon at once. These systems are closed and have no boundary, but they must possess some form of mild metric discontinuity. We discuss the case where the discontinuity is equivalent to the insertion of a thin, rigid membrane, separating two systems that can exchange energy and are at local equilibrium. Equilibrium configurations obtained in this way are found to be thermodynamically unstable if they contain a black hole.
Automatic Non-Invasive Isolation of Respiratory Cycles

In this paper, we introduce a novel algorithm designed to isolate individual respiratory cycles on a thoracic respiratory inductance plethysmography signal. The algorithm locates breaths using signal processing and statistical methods and enables the analysis of sleep data on an individual breath level. The algorithm was evaluated on 7.3 hours of hand-annotated data, or 8782 individual breaths in total, and was estimated to correctly isolate 94% of respiratory cycles while producing false positives that amount to only 5% of the total number of detections. The algorithm was specifically evaluated on data containing a great number of sleep-disordered breathing events. We found that the algorithm did not suffer in terms of accuracy when detecting breaths in the presence of sleep-disordered breathing. The algorithm was also evaluated across a large set of participants, and we found that the accuracy of the algorithm was consistent across participants. This algorithm is finally made public via an open-source Python library.
ePA*SE: Edge-based Parallel A* for Slow Evaluations

Parallel search algorithms harness the multithreading capability of modern processors to achieve faster planning. One such algorithm is PA*SE (Parallel A* for Slow Expansions), which parallelizes state expansions to achieve faster planning in domains where state expansions are slow. In this work, we propose ePA*SE (Edge-Based Parallel A* for Slow Evaluations) that improves on PA*SE by parallelizing edge evaluations instead of state expansions. This makes ePA*SE more efficient in domains where edge evaluations are expensive and need varying amounts of computational effort, which is often the case in robotics. On the theoretical front, we show that ePA*SE provides rigorous optimality guarantees. In addition, ePA*SE can be trivially extended to handle an inflation weight on the heuristic resulting in a bounded suboptimal algorithm w-ePA*SE (Weighted ePA*SE) that trades off optimality for faster planning. On the experimental front, we validate the proposed algorithm in two different planning domains: 1) motion planning for 3D humanoid navigation and 2) task and motion planning for a dual-arm robotic assembly task. We show that ePA*SE can be significantly more efficient than PA*SE and other alternatives. The open-source code for ePA*SE along with the baselines is available here: https://github.com/shohinm/parallel_search
Beyond 3D Siamese Tracking: A Motion-Centric Paradigm for 3D Single Object Tracking in Point Clouds

3D single object tracking (3D SOT) in LiDAR point clouds plays a crucial role in autonomous driving. Current approaches all follow the Siamese paradigm based on appearance matching. However, LiDAR point clouds are usually textureless and incomplete, which hinders effective appearance matching. Besides, previous methods greatly overlook the critical motion clues among targets. In this work, beyond 3D Siamese tracking, we introduce a motion-centric paradigm to handle 3D SOT from a new perspective. Following this paradigm, we propose a matching-free two-stage tracker M2-Track. At the 1st-stage, M2-Track localizes the target within successive frames via motion transformation. Then it refines the target box through motion-assisted shape completion at the 2nd-stage. Extensive experiments confirm that M2-Track significantly outperforms previous state-of-the-arts on three large-scale datasets while running at 57FPS (~ 8%, ~ 17% and ~ 22% precision gains on KITTI, NuScenes, and Waymo Open Dataset respectively). Further analysis verifies each component's effectiveness and shows the motioncentric paradigm's promising potential when combined with appearance matching. Code will be made available at https://github.com/Ghostish/Open3DSOT.
A Simple Hash-Based Early Exiting Approach For Language Understanding and Generation

Early exiting allows instances to exit at different layers according to the estimation of difficulty.Previous works usually adopt heuristic metrics such as the entropy of internal outputs to measure instance difficulty, which suffers from generalization and threshold-tuning. In contrast, learning to exit, or learning to predict instance difficulty is a more appealing way. Though some effort has been devoted to employing such “learn-to-exit” modules, it is still unknown whether and how well the instance difficulty can be learned. As a response, we first conduct experiments on the learnability of instance difficulty, which demonstrates that modern neural models perform poorly on predicting instance difficulty. Based on this observation, we propose a simple-yet-effective Hash-based Early Exiting approach HashEE) that replaces the learn-to-exit modules with hash functions to assign each token to a fixed exiting layer. Different from previous methods, HashEE requires no internal classifiers nor extra parameters, and therefore is more efficient.HashEE can be used in various tasks (including language understanding and generation) and model architectures such as seq2seq models. Experimental results on classification, regression, and generation tasks demonstrate that HashEE can achieve higher performance with fewer FLOPs and inference time compared with previous state-of-the-art early exiting methods.
Multi-scale analysis of global electromagnetic instabilities in ITER pre-fusion-power operation plasmas

Global electromagnetic gyrokinetic simulations are performed with the particle-in-cell code ORB5 for an ITER pre-fusion-power-operation plasma scenario, with half-field (2.65 T) and half-current (7.5 MA). We report on a ‘multi-scale‘ analysis of the discharge, considering eigenmodes and instabilities across three scale-lengths (n < 35, 45 < n < 70, n > 100). Although the scenario will nominally have neutral beam heating with particles injected with 1 MeV, Alfvén eigenmodes are investigated in the absence of such source, and reversed shear, toroidal and elliptical Alfvén eigenmodes are found with weak damping for moderately low toroidal mode numbers (10 ⩽ n ⩽ 35). At higher toroidal mode numbers (40 ⩽ n ⩽ 70), unstable Alfvénic modes have been observed close to rational surfaces and are labelled as beta-induced Alfvén eigenmodes (BAEs)/Alfvénic ion temperature gradient modes, since their frequency is associated with the BAE gap and they are driven by the bulk plasma on the Alfvénic continuum. These modes are unstable in the absence of energetic particles (EPs), and adding a species of EPs (with an isotropic 1 MeV slowing down distribution) has negligible impact on their growth rate. At higher toroidal mode numbers (n ⪅ 200), low frequency microscale instabilities are observed.
Exploring Smoothness and Class-Separation for Semi-supervised Medical Image Segmentation

Semi-supervised segmentation remains challenging in medical imaging since the amount of annotated medical data is often scarce and there are many blurred pixels near the adhesive edges or in the low-contrast regions. To address the issues, we advocate to firstly constrain the consistency of pixels with and without strong perturbations to apply a sufficient smoothness constraint and further encourage the class-level separation to exploit the low-entropy regularization for the model training. Particularly, in this paper, we propose the SS-Net for semi-supervised medical image segmentation tasks, via exploring the pixel-level smoothness and inter-class separation at the same time. The pixel-level smoothness forces the model to generate invariant results under adversarial perturbations. Meanwhile, the inter-class separation encourages individual class features should approach their corresponding high-quality prototypes, in order to make each class distribution compact and separate different classes. We evaluated our SS-Net against five recent methods on the public LA and ACDC datasets. Extensive experimental results under two semi-supervised settings demonstrate the superiority of our proposed SS-Net model, achieving new state-of-the-art (SOTA) performance on both datasets. The code is available at https://github.com/ycwu1997/SS-Net.
AdaFamily: A family of Adam-like adaptive gradient methods

We propose AdaFamily, a novel method for training deep neural networks. It is a family of adaptive gradient methods and can be interpreted as sort of a blend of the optimization algorithms Adam, AdaBelief and AdaMomentum. We perform experiments on standard datasets for image classification, demonstrating that our proposed method outperforms these algorithms.
Efficient Video Instance Segmentation via Tracklet Query and Proposal

Video Instance Segmentation (VIS) aims to simultaneously classify, segment, and track multiple object instances in videos. Recent clip-level VIS takes a short video clip as input each time showing stronger performance than frame-level VIS (tracking-by-segmentation), as more temporal context from multiple frames is utilized. Yet, most clip-level methods are neither end-to-end learnable nor real-time. These limitations are addressed by the recent VIS transformer (VisTR) [25] which performs VIS end-to-end within a clip. However, VisTR suffers from long training time due to its frame-wise dense attention. In addition, VisTR is not fully end-to-end learnable in multiple video clips as it requires a hand-crafted data association to link instance tracklets between successive clips. This paper proposes EfficientVIS, a fully end-to-end framework with efficient training and inference. At the core are tracklet query and tracklet proposal that associate and segment regions-of-interest (RoIs) across space and time by an iterative query-video interaction. We further propose a correspondence learning that makes tracklets linking between clips end-to-end learnable. Compared to VisTR, EfficientVIS requires $15\times$ fewer training epochs while achieving state-of-the-art accuracy on the YouTube-VIS benchmark. Meanwhile, our method enables whole video instance segmentation in a single end-to-end pass without data association at all.
Multi-Tailed Vision Transformer for Efficient Inference

Recently, Vision Transformer (ViT) has achieved promising performance in image recognition and gradually serves as a powerful backbone in various vision tasks. To satisfy the sequential input of Transformer, the tail of ViT first splits each image into a sequence of visual tokens with a fixed length. Then the following self-attention layers constructs the global relationship between tokens to produce useful representation for the downstream tasks. Empirically, representing the image with more tokens leads to better performance, yet the quadratic computational complexity of self-attention layer to the number of tokens could seriously influence the efficiency of ViT's inference. For computational reduction, a few pruning methods progressively prune uninformative tokens in the Transformer encoder, while leaving the number of tokens before the Transformer untouched. In fact, fewer tokens as the input for the Transformer encoder can directly reduce the following computational cost. In this spirit, we propose a Multi-Tailed Vision Transformer (MT-ViT) in the paper. MT-ViT adopts multiple tails to produce visual sequences of different lengths for the following Transformer encoder. A tail predictor is introduced to decide which tail is the most efficient for the image to produce accurate prediction. Both modules are optimized in an end-to-end fashion, with the Gumbel-Softmax trick. Experiments on ImageNet-1K demonstrate that MT-ViT can achieve a significant reduction on FLOPs with no degradation of the accuracy and outperform other compared methods in both accuracy and FLOPs.
CenterSnap: Single-Shot Multi-Object 3D Shape Reconstruction and Categorical 6D Pose and Size Estimation

This paper studies the complex task of simultaneous multi-object 3D reconstruction, 6D pose and size estimation from a single-view RGB-D observation. In contrast to instance- level pose estimation, we focus on a more challenging problem where CAD models are not available at inference time. Existing approaches mainly follow a complex multi-stage pipeline which first localizes and detects each object instance in the image and then regresses to either their 3D meshes or 6D poses. These approaches suffer from high-computational cost and low performance in complex multi-object scenarios, where occlusions can be present. Hence, we present a simple one- stage approach to predict both the 3D shape and estimate the 6D pose and size jointly in a bounding-box free manner. In particular, our method treats object instances as spatial centers where each center denotes the complete shape of an object along with its 6D pose and size. Through this per- pixel representation, our approach can reconstruct in real- time (40 FPS) multiple novel object instances and predict their 6D pose and sizes in a single-forward pass. Through extensive experiments, we demonstrate that our approach significantly outperforms all shape completion and categorical 6D pose and size estimation baselines on multi-object ShapeNet and NOCS datasets respectively with a 12.6% absolute improvement in mAP for 6D pose for novel real-world object instances.
Disorder-free localization with Stark gauge protection

Disorder-free localization in translation-invariant gauge theories presents a counterintuitive yet powerful framework of ergodicity breaking in quantum many-body physics. The fragility of this phenomenon in the presence of gauge-breaking errors has recently been addressed, but no scheme has been able to reliably stabilize disorder-free localization through all accessible evolution times while preserving the disorder-free property. Here, we introduce the concept of \textit{Stark gauge protection}, which entails a linear sum in gauge-symmetry local (pseudo)generators weighted by a Stark potential. Using exact diagonalization and Krylov-based methods, we show how this scheme can stabilize or even enhance disorder-free localization against gauge-breaking errors in $\mathrm{U}(1)$ and $\mathbb{Z}_2$ gauge theories up to all accessible evolution times, without inducing \textit{bona fide} Stark many-body localization. We show through a Magnus expansion that the dynamics under Stark gauge protection is described by an effective Hamiltonian where gauge-breaking terms are suppressed locally by the protection strength and additionally by the matter site index, which we argue is the main reason behind stabilizing the localization up to all accessible times. Our scheme is readily feasible in modern ultracold-atom experiments and Rydberg-atom setups with optical tweezers.
Exploring Hierarchical Graph Representation for Large-Scale Zero-Shot Image Classification

The main question we address in this paper is how to scale up visual recognition of unseen classes, also known as zero-shot learning, to tens of thousands of categories as in the ImageNet-21K benchmark. At this scale, especially with many fine-grained categories included in ImageNet-21K, it is critical to learn quality visual semantic representations that are discriminative enough to recognize unseen classes and distinguish them from seen ones. We propose a \emph{H}ierarchical \emph{G}raphical knowledge \emph{R}epresentation framework for the confidence-based classification method, dubbed as HGR-Net. Our experimental results demonstrate that HGR-Net can grasp class inheritance relations by utilizing hierarchical conceptual knowledge. Our method significantly outperformed all existing techniques, boosting the performance by 7\% compared to the runner-up approach on the ImageNet-21K benchmark. We show that HGR-Net is learning-efficient in few-shot scenarios. We also analyzed our method on smaller datasets like ImageNet-21K-P, 2-hops and 3-hops, demonstrating its generalization ability. Our benchmark and code are available at https://kaiyi.me/p/hgrnet.html.
Subcritical monotone cellular automata

We study monotone cellular automata (also known as 𝒰 ‐bootstrap percolation) in ℤd$$ {\mathbb{Z}}^d $$ with random initial configurations. Confirming a conjecture of Balister, Bollobás, Przykucki and Smith, who proved the corresponding result in two dimensions, we show that the critical probability is non‐zero for all subcritical models.
Understanding Failure Modes of Self-Supervised Learning

Self-supervised learning methods have shown impressive results in downstream classification tasks. However, there is limited work in understanding their failure models and interpreting the learned representations of these models. In this paper, we tackle these issues and study the representation space of self-supervised models by understanding the underlying reasons for misclassifications in a downstream task. Over several state-of-the-art self-supervised models including SimCLR, SwaV, MoCo V2 and BYOL, we observe that representations of correctly classified samples have few discriminative features with highly deviated values compared to other features. This is in a clear contrast with representations of misclassified samples. We also observe that noisy features in the representation space often correspond to spurious attributes in images making the models less interpretable. Building on these observations, we propose a sample-wise Self-Supervised Representation Quality Score (or, Q-Score) that, without access to any label information, is able to predict if a given sample is likely to be misclassified in the downstream task, achieving an AUPRC of up to 0.90. Q-Score can also be used as a regularization to remedy low-quality representations leading to 3.26% relative improvement in accuracy of SimCLR on ImageNet-100. Moreover, we show that Q-Score regularization increases representation sparsity, thus reducing noise and improving interpretability through gradient heatmaps. Feature Indices Class Accuracy: 100.0
Hα morphologies of star clusters in 16 LEGUS galaxies: Constraints on HII region evolution timescales

The analysis of star cluster ages in tandem with the morphology of their HII regions can provide insight into the processes that clear a cluster’s natal gas, as well as the accuracy of cluster ages and dust reddening derived from Spectral Energy Distribution (SED) fitting. We classify 3757 star clusters in 16 nearby galaxies according to their Hα morphology (concentrated, partially exposed, no emission), using Hubble Space Telescope (HST) imaging from the Legacy ExtraGalactic Ultraviolet Survey (LEGUS). We find: 1) The mean SED ages of clusters with concentrated (1-2 Myr) and partially exposed HII region morphologies (2-3 Myr) indicate a relatively early onset of gas clearing and a short (1-2 Myr) clearing timescale. 2) The reddening of clusters can be overestimated due to the presence of red supergiants, which is a result of stochastic sampling of the IMF in low mass clusters. 3) The age-reddening degeneracy impacts the results of the SED fitting – out of 1408 clusters with M* ≥ 5000 M⊙, we find that at least 46 (3 per cent) have SED ages which appear significantly underestimated or overestimated based on Hα and their environment, while the total percentage of poor age estimates is expected to be several times larger. 4) Lastly, we examine the dependence of the morphological classifications on spatial resolution. At HST resolution, our conclusions are robust to the distance range spanned by the sample (3-10 Mpc). However, analysis of ground-based Hα images shows that compact and partially exposed morphologies frequently cannot be distinguished from each other.
Ensemble Methods for Robust Support Vector Machines using Integer Programming

In this work we study binary classification problems where we assume that our training data is subject to uncertainty, i.e. the precise data points are not known. To tackle this issue in the field of robust machine learning the aim is to develop models which are robust against small perturbations in the training data. We study robust support vector machines (SVM) and extend the classical approach by an ensemble method which iteratively solves a non-robust SVM on different perturbations of the dataset, where the perturbations are derived by an adversarial problem. Afterwards for classification of an unknown data point we perform a majority vote of all calculated SVM solutions. We study three different variants for the adversarial problem, the exact problem, a relaxed variant and an efficient heuristic variant. While the exact and the relaxed variant can be modeled using integer programming formulations, the heuristic one can be implemented by an easy and efficient algorithm. All derived methods are tested on random and realistic datasets and the results indicate that the derived ensemble methods have a much more stable behaviour when changing the protection level compared to the classical robust SVM model.
Fully-Connected Network on Noncompact Symmetric Space and Ridgelet Transform based on Helgason-Fourier Analysis

Neural network on Riemannian symmetric space such as hyperbolic space and the manifold of symmetric positive deﬁnite (SPD) matrices is an emerging subject of research in geometric deep learning. Based on the well-established framework of the Helgason-Fourier transform on the noncompact symmetric space, we present a fully-connected network and its associated ridgelet transform on the noncompact symmetric space, covering the hyperbolic neural network (HNN) and the SPDNet as special cases. The ridgelet transform is an analysis operator of a depth-2 continuous network spanned by neurons, namely, it maps an arbitrary given function to the weights of a network. Thanks to the coordinate-free reformulation, the role of nonlinear activation functions is revealed to be a wavelet function. Moreover, the reconstruction formula is applied to present a constructive proof of the universality of ﬁnite networks on symmetric spaces.