Miracle-dz/UniFAR-FTUs huggingface dataset:
Timing and spectral studies of Cen X-3 in multiple luminosity states using AstroSat

We present the results of timing and spectral analysis of the HMXB pulsar, Cen X-3, with the help of observations carried out using the Large Area X-ray Proportional Counter (LAXPC) on board AstroSat. As part of our analysis, we sampled the source properties during 4 different observation epochs covering two widely different intensity states. We obtain a timing solution and report precise measurements of the spin and orbital parameters corresponding to these observational epochs. The pulse profiles during the two intensity states reveal dramatically varying shapes within a time span of one month. We report the detection of one of the lowest measured frequencies of quasi periodic oscillations (QPO) at 0.026 ± 0.001 Hz for Cen X-3 during its low intensity state. We also find correlated periodic and aperiodic noise components in the power density spectra. We further carried out a phase averaged and a pulse phase resolved spectral study, where we find that the best fit continuum spectrum is well described by an absorbed Comptonization model along with a blackbody. Cen X-3 exhibited the presence of the ∼28 keV CRSF absorption line and a ∼6.6 keV Fe emission line in both the intensity states. Significant variations in the line forming regions and mode of accretion for Cen X-3 within time spans of a month make Cen X-3 a highly dynamic persistent binary.
Spatio-Temporal Learnable Proposals for End-to-End Video Object Detection

This paper presents the novel idea of generating object proposals by leveraging temporal information for video object detection. The feature aggregation in modern region-based video object detectors heavily relies on learned proposals generated from a single-frame RPN. This imminently introduces additional components like NMS and produces unreliable proposals on low-quality frames. To tackle these restrictions, we present SparseVOD, a novel video object detection pipeline that employs Sparse R-CNN to exploit temporal information. In particular, we introduce two modules in the dynamic head of Sparse R-CNN. First, the Temporal Feature Extraction module based on the Temporal RoI Align operation is added to extract the RoI proposal features. Second, motivated by sequence-level semantic aggregation, we incorporate the attention-guided Semantic Proposal Feature Aggregation module to enhance object feature representation before detection. The proposed SparseVOD effectively alleviates the overhead of complicated post-processing methods and makes the overall pipeline end-to-end trainable. Extensive experiments show that our method significantly improves the single-frame Sparse RCNN by 8%-9% in mAP. Furthermore, besides achieving state-of-the-art 80.3% mAP on the ImageNet VID dataset with ResNet-50 backbone, our SparseVOD outperforms existing proposal-based methods by a significant margin on increasing IoU thresholds (IoU>0.5).
The Vendi Score: A Diversity Evaluation Metric for Machine Learning

Diversity is an important criterion for many areas of machine learning (ML), including generative modeling and dataset curation. However, existing metrics for measuring diversity are often domain-specific and limited in flexibility. In this paper, we address the diversity evaluation problem by proposing the Vendi Score, which connects and extends ideas from ecology and quantum statistical mechanics to ML. The Vendi Score is defined as the exponential of the Shannon entropy of the eigenvalues of a similarity matrix. This matrix is induced by a user-defined similarity function applied to the sample to be evaluated for diversity. In taking a similarity function as input, the Vendi Score enables its user to specify any desired form of diversity. Importantly, unlike many existing metrics in ML, the Vendi Score does not require a reference dataset or distribution over samples or labels, it is therefore general and applicable to any generative model, decoding algorithm, and dataset from any domain where similarity can be defined. We showcase the Vendi Score on molecular generative modeling where we found it addresses shortcomings of the current diversity metric of choice in that domain. We also applied the Vendi Score to generative models of images and decoding algorithms of text where we found it confirms known results about diversity in those domains. Furthermore, we used the Vendi Score to measure mode collapse, a known shortcoming of generative adversarial networks (GANs). In particular, the Vendi Score revealed that even GANs that capture all the modes of a labeled dataset can be less diverse than the original dataset. Finally, the interpretability of the Vendi Score allowed us to diagnose several benchmark ML datasets for diversity, opening the door for diversity-informed data augmentation.
Coverage and Rate of Joint Communication and Parameter Estimation in Wireless Networks

From an information theoretic perspective, joint communication and sensing (JCAS) represents a natural generalization of communication network functionality. However, it requires the re-evaluation of network performance from a multi-objective perspective. We develop a novel mathematical framework for characterizing the sensing and communication coverage probability and ergodic rate in JCAS networks. We employ a formulation of sensing parameter estimation based on mutual information to extend the notions of coverage probability and ergodic rate to the radar setting. We define sensing coverage probability as the probability that the rate of information extracted about the parameters of interest associated with a typical radar target exceeds some threshold, and sensing ergodic rate as the spatial average of the aforementioned rate of information. Using this framework, we analyze the downlink sensing and communication coverage and rate of a mmWave JCAS network employing a shared waveform, directional beamforming, and monostatic sensing. Leveraging tools from stochastic geometry, we derive upper and lower bounds for these quantities. We also develop several general technical results including: i) a generic method for obtaining closed form upper and lower bounds on the Laplace Transform of a shot noise process, ii) a new analog of Hölder’s Inequality to the setting of harmonic means, and iii) a relation between the Laplace and Mellin Transforms of a non-negative random variable. We use the derived bounds to numerically investigate the performance of JCAS networks under varying base station and blockage density. Among several insights, our numerical analysis indicates that network densification improves sensing SINR performance – in contrast to communications.
Atari-5: Distilling the Arcade Learning Environment down to Five Games

The Arcade Learning Environment (ALE) has become an essential benchmark for assessing the performance of reinforcement learning algorithms. However, the computational cost of generating results on the entire 57-game dataset limits ALE's use and makes the reproducibility of many results infeasible. We propose a novel solution to this problem in the form of a principled methodology for selecting small but representative subsets of environments within a benchmark suite. We applied our method to identify a subset of five ALE games, called Atari-5, which produces 57-game median score estimates within 10% of their true values. Extending the subset to 10-games recovers 80% of the variance for log-scores for all games within the 57-game set. We show this level of compression is possible due to a high degree of correlation between many of the games in ALE.
Granularity-aware Adaptation for Image Retrieval over Multiple Tasks

Strong image search models can be learned for a specific domain, ie. set of labels, provided that some labeled images of that domain are available. A practical visual search model, however, should be versatile enough to solve multiple retrieval tasks simultaneously, even if those cover very different specialized domains. Additionally, it should be able to benefit from even unlabeled images from these various retrieval tasks. This is the more practical scenario that we consider in this paper. We address it with the proposed Grappa, an approach that starts from a strong pretrained model, and adapts it to tackle multiple retrieval tasks concurrently, using only unlabeled images from the different task domains. We extend the pretrained model with multiple independently trained sets of adaptors that use pseudo-label sets of different sizes, effectively mimicking different pseudo-granularities. We reconcile all adaptor sets into a single unified model suited for all retrieval tasks by learning fusion layers that we guide by propagating pseudo-granularity attentions across neighbors in the feature space. Results on a benchmark composed of six heterogeneous retrieval tasks show that the unsupervised Grappa model improves the zero-shot performance of a state-of-the-art self-supervised learning model, and in some places reaches or improves over a task label-aware oracle that selects the most fitting pseudo-granularity per task.
A Comparison of Stochastic and Deterministic Downscaling in Eddy Resolving Ocean Modelling: The Lakshadweep Sea Case Study

This study compares the skills of two numerical models at the same horizontal resolution but based on different principles in representing meso- and sub-mesoscale ocean features. The first model, titled LD20-NEMO, was based on solving primitive equations of ocean dynamics. The second model, titled LD20-SDD, used a newer stochastic–deterministic downscaling (SDD) method. Both models had 1/20° resolution, the same meteo forcing, and used outputs from a data assimilating global model at 1/12° resolution available from Copernicus Marine Service (CMEMS). The LD20 models did not assimilate observational data but were physically aware of observations via the parent model. The LD20-NEMO only used a 2D set of data from CMEMS as the lateral boundary conditions. The LD20-SDD consumed the full 3D set of data from CMEMS and exploited the stochastic properties of these data to generate the downscaled field variables at higher resolution than the parent model. The skills of the three models were assessed against remotely sensed and in situ observations for the four-year period 2015–2018. The models showed similar skills in reproducing temperature and salinity, however the SDD version performed slightly better than the NEMO, and was more computationally efficient by a large margin.
When Physical Layer Key Generation Meets RIS: Opportunities, Challenges, and Road Ahead

Physical layer key generation (PLKG) is a promising technology to obtain symmetric keys between a pair of wireless communication users in a plug-and-play manner. The shared entropy source almost entirely comes from the intrinsic randomness of the radio channel, which is highly dependent on the wireless environments. However, in some static/block fading wireless environments, the intrinsic randomness of the wireless channel is hard to be guaranteed. Very recently, thanks to reconfigurable intelligent surfaces (RISs) with their excellent ability on electromagnetic wave control, the wireless channel environment can be customized. In this article, we overview the RISaided PLKG in static indoor environments, including its channel model and hardware architectures. Then, we propose potential application scenarios and analyze the design challenges of RIS aided PLKG, including channel reciprocity, RIS reconfiguration speed and RIS deployment via proof-of-concept experiments on a RIS-aided PLKG prototype system. In particular, our experimental results show that the key generation rate is 15-fold higher than that without RIS in a static indoor environment. Next, we design a RIS jamming attack via a prototype experiment and discuss its possible attack-defense countermeasures. Finally, several conclusions and future directions are identified.
SIR-HUXt -- a particle filter data assimilation scheme for assimilating CME time-elongation profiles

We present the development of SIR-HUXt, the integration of a sequential importance resampling (SIR) data assimilation scheme with the HUXt solar wind model. SIR-HUXt is designed to assimilate the time-elongation profiles of CME fronts in the low heliosphere, such as those typically extracted from heliospheric imager data returned by the STEREO, Parker Solar Probe, and Solar Orbiter missions. We use Observing System Simulation Experiments to explore the performance of SIR-HUXt for a simple synthetic CME scenario of a fully Earth directed CME flowing through a uniform ambient solar wind, where the CME is initialised with the average observed CME speed and width. These experiments are performed for a range of observer locations, from 20 deg to 90 deg behind Earth, spanning the L5 point where ESA's future Vigil space weather monitor will return heliospheric imager data for operational space weather forecasting. We show that SIR-HUXt performs well at constraining the CME speed, and has some success at constraining the CME longitude. The CME width is largely unconstrained by the SIR-HUXt assimilations, and more experiments are required to determine if this is due to this specific CME scenario, or is a general feature of assimilating time-elongation profiles. Rank-histograms suggest that the SIR-HUXt ensembles are well calibrated, with no clear indications of bias or under/over dispersion. Improved constraints on the initial CME speed lead directly to improvements in the CME transit time to Earth and arrival speed. For an observer in the L5 region, SIR-HUXt returned a 69% reduction in the CME transit time uncertainty, and a 63% reduction in the arrival speed uncertainty. This suggests SIR-HUXt has potential to improve the real-world representivity of HUXt simulations, and therefore has potential to reduce the uncertainty of CME arrival time hindcasts and forecasts.
Robust Fair Clustering: A Novel Fairness Attack and Defense Framework

Clustering algorithms are widely used in many societal resource allocation applications, such as loan approvals and candidate recruitment, among others, and hence, biased or unfair model outputs can adversely impact individuals that rely on these applications. To this end, many fair clustering approaches have been recently proposed to counteract this issue. Due to the potential for significant harm, it is essential to ensure that fair clustering algorithms provide consistently fair outputs even under adversarial influence. However, fair clustering algorithms have not been studied from an adversarial attack perspective. In contrast to previous research, we seek to bridge this gap and conduct a robustness analysis against fair clustering by proposing a novel black-box fairness attack. Through comprehensive experiments, we find that state-of-the-art models are highly susceptible to our attack as it can reduce their fairness performance significantly. Finally, we propose Consensus Fair Clustering (CFC), the first robust fair clustering approach that transforms consensus clustering into a fair graph partitioning problem, and iteratively learns to generate fair cluster outputs. Experimentally, we observe that CFC is highly robust to the proposed attack and is thus a truly robust fair clustering alternative.
Rank-N-Contrast: Learning Continuous Representations for Regression

Deep regression models typically learn in an end-to-end fashion without explicitly emphasizing a regression-aware representation. Consequently, the learned representations exhibit fragmentation and fail to capture the continuous nature of sample orders, inducing suboptimal results across a wide range of regression tasks. To fill the gap, we propose Rank-N-Contrast (RNC), a framework that learns continuous representations for regression by contrasting samples against each other based on their rankings in the target space. We demonstrate, theoretically and empirically, that RNC guarantees the desired order of learned representations in accordance with the target orders, enjoying not only better performance but also significantly improved robustness, efficiency, and generalization. Extensive experiments using five real-world regression datasets that span computer vision, human-computer interaction, and healthcare verify that RNC achieves state-of-the-art performance, highlighting its intriguing properties including better data efficiency, robustness to spurious targets and data corruptions, and generalization to distribution shifts. Code is available at: https://github.com/kaiwenzha/Rank-N-Contrast.
Constant-Power versus Constant-Voltage Actuation in Frequency Sweeps for Acoustofluidic Applications

Supplying a piezoelectric transducer with constant voltage or constant power during a frequency sweep can lead to different results in the determination of the acoustofluidic resonance frequencies, which are observed when studying the acoustophoretic displacements and velocities of particles suspended in a liquid-filled microchannel. In this work, three cases are considered: (1) Constant input voltage into the power amplifier, (2) constant voltage across the piezoelectric transducer, and (3) constant average power dissipation in the transducer. For each case, the measured and the simulated responses are compared, and good agreement is obtained. It is shown that Case 1, the simplest and most frequently used approach, is largely affected by the impedance of the used amplifier and wiring, so it is therefore not suitable for a reproducible characterization of the intrinsic properties of the acoustofluidic device. Case 2 strongly favors resonances at frequencies yielding the lowest impedance of the piezoelectric transducer, so small details in the acoustic response at frequencies far from the transducer resonance can easily be missed. Case 3 provides the most reliable approach, revealing both the resonant frequency, where the power-efficiency is the highest, as well as other secondary resonances across the spectrum.
Cloud removal Using Atmosphere Model

Cloud removal is an essential task in remote sensing data analysis. As the image sensors are distant from the earth ground, it is likely that part of the area of interests is covered by cloud. Moreover, the atmosphere in between creates a constant haze layer upon the acquired images. To recover the ground image, we propose to use scattering model for temporal sequence of images of any scene in the framework of low rank and sparse models. We further develop its variant, which is much faster and yet more accurate. To measure the performance of different methods {\em objectively}, we develop a semi-realistic simulation method to produce cloud cover so that various methods can be quantitatively analysed, which enables detailed study of many aspects of cloud removal algorithms, including verifying the effectiveness of proposed models in comparison with the state-of-the-arts, including deep learning models, and addressing the long standing problem of the determination of regularisation parameters. The latter is companioned with theoretic analysis on the range of the sparsity regularisation parameter and verified numerically.
Spectral broadening from turbulence in multiscale lower hybrid current drive simulations

The scattering of lower hybrid (LH) waves due to scrape-off layer filaments is investigated. It is revealed that scattering can account for the LH spectral gap without any ad hoc modification to the wave-spectrum. This is shown using a multiscale simulation approach which allows, for the first time, the inclusion of full-wave scattering physics in ray-tracing/Fokker–Planck calculations. In this approach, full-wave scattering probabilities are calculated for a wave interacting with a statistical ensemble of filaments. These probabilities are coupled to ray-tracing equations using radiative transfer theory. This allows the modeling of scattering along the entire ray-trajectory, which can be important in the multi-pass regime. Simulations are conducted for LH current drive (LHCD) in Alcator C-Mod, resulting in excellent agreement with experimental current and hard x-ray profiles. A region in filament parameter space is identified in which the impact of scattering on LHCD is saturated. Such a state coincides with experimental LHCD measurements, suggesting saturation indeed occurs in C-Mod, and therefore the exact statistical properties of the filaments are not important.
Probabilistic Verification of Approximate Algorithms with Unstructured Errors: Application to Fully Inexact Generalized ADMM

—We analyse the convergence of an approximate, fully inexact, ADMM algorithm under additive, deterministic and probabilistic error models. We consider the generalized ADMM scheme that is derived from generalized Lagrangian penalty with additive (smoothing) adaptive-metric quadratic proximal perturbations. We derive explicit deterministic and probabilistic convergence upper bounds for the lower- C 2 nonconvex case as well as the convex case under the Lipschitz continuity condition. We also present more practical conditions on the proximal errors under which convergence of the approximate ADMM to a suboptimal solution is guaranteed with high probability. We consider statistically and dynamically-unstructured conditional mean independent bounded error sequences. We validate our results using both simulated and practical software and algorithmic computational perturbations. We apply the proposed algorithm to a synthetic LASSO and robust regression with k -support norm regularization problems and test our proposed bounds under different computational noise levels. Compared to classical convergence results, the adaptive probabilistic bounds are more accurate in predicting the distance from the optimal set and parasitic residual error under different sources of inaccuracies.
Numerical relativity higher order gravitational waveforms of eccentric, spinning, nonprecessing binary black hole mergers

We use the open source, community-driven, numerical relativity software, the Einstein Toolkit to study the physics of eccentric, spinning, nonprecessing binary black hole mergers with mass-ratios $q=\{2, 4, 6\}$, individual dimensionless spin parameters $\chi_{1z}=\pm0.6$, $\chi_{2z}=\pm0.3$, that include higher order gravitational wave modes $\ell\leq4$, except for memory modes. Assuming stellar mass binary black hole mergers that may be detectable by the advanced LIGO detectors, we find that including modes up to $\ell=4$ increases the signal-to-noise of compact binaries between $3.5\%$ to $35\%$, compared to signals that only include the $\ell=|m|=2$ mode. We use two waveform models, TEOBResumS and SEOBNRE, which incorporate spin and eccentricity corrections in the waveform dynamics, to quantify the orbital eccentricity of our numerical relativity catalog in a gauge-invariant manner through fitting factor calculations. Our findings indicate that the inclusion of higher order wave modes has a measurable effect in the recovery of moderately and highly eccentric black hole mergers, and thus it is essential to develop waveform models and signal processing tools that accurately describe the physics of these astrophysical sources.