Miracle-dz/UniFAR-FTUs huggingface dataset:
What Food Do We Tweet about on a Rainy Day?

Food choice is a complex phenomenon shaped by factors such as taste, ambience, culture or weather. In this paper, we explore food-related tweeting in different weather conditions. We inspect a Latvian food tweet dataset spanning the past decade in conjunction with a weather observation dataset consisting of average temperature, precipitation, and other phenomena. We find which weather conditions lead to specific food information sharing; automatically classify tweet sentiment and discuss how it changes depending on the weather. This research contributes to the growing area of large-scale social network data understanding of food consumers' choices and perceptions.
The Atacama Cosmology Telescope: A Measurement of the DR6 CMB Lensing Power Spectrum and Its Implications for Structure Growth

We present new measurements of cosmic microwave background (CMB) lensing over 9400 deg2 of the sky. These lensing measurements are derived from the Atacama Cosmology Telescope (ACT) Data Release 6 (DR6) CMB data set, which consists of five seasons of ACT CMB temperature and polarization observations. We determine the amplitude of the CMB lensing power spectrum at 2.3% precision (43σ significance) using a novel pipeline that minimizes sensitivity to foregrounds and to noise properties. To ensure that our results are robust, we analyze an extensive set of null tests, consistency tests, and systematic error estimates and employ a blinded analysis framework. Our CMB lensing power spectrum measurement provides constraints on the amplitude of cosmic structure that do not depend on Planck or galaxy survey data, thus giving independent information about large-scale structure growth and potential tensions in structure measurements. The baseline spectrum is well fit by a lensing amplitude of A lens = 1.013 ± 0.023 relative to the Planck 2018 CMB power spectra best-fit ΛCDM model and A lens = 1.005 ± 0.023 relative to the ACT DR4 + WMAP best-fit model. From our lensing power spectrum measurement, we derive constraints on the parameter combination S 8 CMBL ≡ σ 8 Ω m / 0.3 0.25 of S 8 CMBL = 0.818 ± 0.022 from ACT DR6 CMB lensing alone and S 8 CMBL = 0.813 ± 0.018 when combining ACT DR6 and Planck NPIPE CMB lensing power spectra. These results are in excellent agreement with ΛCDM model constraints from Planck or ACT DR4 + WMAP CMB power spectrum measurements. Our lensing measurements from redshifts z ∼ 0.5–5 are thus fully consistent with ΛCDM structure growth predictions based on CMB anisotropies probing primarily z ∼ 1100. We find no evidence for a suppression of the amplitude of cosmic structure at low redshifts.
Optimizing Linear Correctors: A Tight Output Min-Entropy Bound and Selection Technique

Post-processing of the raw bits produced by a true random number generator (TRNG) is always necessary when the entropy per bit is insufficient for security applications. In this paper, we derive a tight bound on the output min-entropy of the algorithmic post-processing module based on linear codes, known as linear correctors. Our bound is based on the codes’ weight distributions, and we prove that it holds even for the real-world noise sources that produce independent but not identically distributed bits. Additionally, we present a method for identifying the optimal linear corrector for a given input min-entropy rate that maximizes the throughput of the post-processed bits while simultaneously achieving the needed security level. Our findings show that for an output min-entropy rate of 0.999, the extraction efficiency of the linear correctors with the new bound can be up to <inline-formula> <tex-math notation="LaTeX">$\mathbf {130.56\, \%}$ </tex-math></inline-formula> higher when compared to the old bound, with an average improvement of <inline-formula> <tex-math notation="LaTeX">$\mathbf {41.2\, \%}$ </tex-math></inline-formula> over the entire input min-entropy range. On the other hand, the required min-entropy of the raw bits for the individual correctors can be reduced by up to <inline-formula> <tex-math notation="LaTeX">$\mathbf {61.62\, \%}$ </tex-math></inline-formula>.
Stochastic Domain Wall-Magnetic Tunnel Junction Artificial Neurons for Noise-Resilient Spiking Neural Networks

The spatiotemporal nature of neuronal behavior in spiking neural networks (SNNs) makes SNNs promising for edge applications that require high energy efficiency. To realize SNNs in hardware, spintronic neuron implementations can bring advantages of scalability and energy efficiency. Domain wall (DW)-based magnetic tunnel junction (MTJ) devices are well suited for probabilistic neural networks given their intrinsic integrate-and-fire behavior with tunable stochasticity. Here, we present a scaled DW-MTJ neuron with voltage-dependent firing probability. The measured behavior was used to simulate a SNN that attains accuracy during learning compared to an equivalent, but more complicated, multi-weight DW-MTJ device. The validation accuracy during training was also shown to be comparable to an ideal leaky integrate and fire device. However, during inference, the binary DW-MTJ neuron outperformed the other devices after Gaussian noise was introduced to the Fashion-MNIST classification task. This work shows that DW-MTJ devices can be used to construct noise-resilient networks suitable for neuromorphic computing on the edge.
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!

In this work we revisit the fundamental Single-Source Shortest Paths (SSSP) problem with possibly negative edge weights. A recent breakthrough result by Bernstein, Nanongkai and Wulff-Nilsen established a near-linear $O\left(m \log ^{8}(n) \log (W)\right)$-time algorithm for negative-weight SSSP, where W is an upper bound on the magnitude of the smallest negative-weight edge. In this work we improve the running time to $O\left(m \log ^{2}(n) \log (n W) \log \log n\right)$, which is an improvement by nearly six log-factors. Some of these log-factors are easy to shave (e.g. replacing the priority queue used in Dijkstra’s algorithm), while others are significantly more involved (e.g. to find negative cycles we design an algorithm reminiscent of noisy binary search and analyze it with drift analysis). As side results, we obtain an algorithm to compute the minimum cycle mean in the same running time as well as a new construction for computing Low-Diameter Decompositions in directed graphs.
A Comparison of 7 Tesla MR Spectroscopic Imaging and 3 Tesla MR Fingerprinting for Tumor Localization in Glioma Patients

Simple Summary This study compared two brain imaging methods, 7T magnetic resonance spectroscopic imaging (MRSI), which can image metabolic processes, and 3T magnetic resonance fingerprinting (MRF), which can image magnetic relaxation times, in 12 people with brain tumors called gliomas. Our goal was to understand how well these two approaches corresponded to each other, and which metabolite or relaxation time map was closest to the clinical standard, a neuroradiologist’s tumor segmentation. In order to do this, we defined hotspots for each method and compared their overlaps. Additionally, we investigated the region around the tumor to look for evidence of possible tumor infiltration. The results of this study could improve how we use magnetic resonance imaging to monitor gliomas in patients. Abstract This paper investigated the correlation between magnetic resonance spectroscopic imaging (MRSI) and magnetic resonance fingerprinting (MRF) in glioma patients by comparing neuro-oncological markers obtained from MRSI to T1/T2 maps from MRF. Data from 12 consenting patients with gliomas were analyzed by defining hotspots for T1, T2, and various metabolic ratios, and comparing them using Sørensen–Dice similarity coefficients (DSCs) and the distances between their centers of intensity (COIDs). The median DSCs between MRF and the tumor segmentation were 0.73 (T1) and 0.79 (T2). The DSCs between MRSI and MRF were the highest for Gln/tNAA (T1: 0.75, T2: 0.80, tumor: 0.78), followed by Gly/tNAA (T1: 0.57, T2: 0.62, tumor: 0.54) and tCho/tNAA (T1: 0.61, T2: 0.58, tumor: 0.45). The median values in the tumor hotspot were T1 = 1724 ms, T2 = 86 ms, Gln/tNAA = 0.61, Gly/tNAA = 0.28, Ins/tNAA = 1.15, and tCho/tNAA = 0.48, and, in the peritumoral region, were T1 = 1756 ms, T2 = 102 ms, Gln/tNAA = 0.38, Gly/tNAA = 0.20, Ins/tNAA = 1.06, and tCho/tNAA = 0.38, and, in the NAWM, were T1 = 950 ms, T2 = 43 ms, Gln/tNAA = 0.16, Gly/tNAA = 0.07, Ins/tNAA = 0.54, and tCho/tNAA = 0.20. The results of this study constitute the first comparison of 7T MRSI and 3T MRF, showing a good correspondence between these methods.
Multi-Sample Consensus Driven Unsupervised Normal Estimation for 3D Point Clouds

Deep normal estimators have made great strides on synthetic benchmarks. Unfortunately, their performance dramatically drops on the real scan data since they are supervised only on synthetic datasets. The point-wise annotation of ground truth normals is vulnerable to inefficiency and inaccuracies, which totally makes it impossible to build perfect real datasets for supervised deep learning. To overcome the challenge, we propose a multi-sample consensus paradigm for unsupervised normal estimation. The paradigm consists of multi-candidate sampling, candidate rejection, and mode determination. The latter two are driven by neighbor point consensus and candidate consensus respectively. Two primary implementations of the paradigm, MSUNE and MSUNE-Net, are proposed. MSUNE minimizes a candidate consensus loss in mode determination. As a robust optimization method, it outperforms the cutting-edge supervised deep learning methods on real data at the cost of longer runtime for sampling enough candidate normals for each query point. MSUNE-Net, the first unsupervised deep normal estimator as far as we know, significantly promotes the multi-sample consensus further. It transfers the three online stages of MSUNE to offline training. Thereby its inference time is 100 times faster. Besides that, more accurate inference is achieved, since the candidates of query points from similar patches can form a sufficiently large candidate set implicitly in MSUNE-Net. Comprehensive experiments demonstrate that the two proposed unsupervised methods are noticeably superior to some supervised deep normal estimators on the most common synthetic dataset. More importantly, they show better generalization ability and outperform all the SOTA conventional and deep methods on three real datasets: NYUV2, KITTI, and a dataset from PCV [1].
A Tale of Sampling and Estimation in Discounted Reinforcement Learning

The most relevant problems in discounted reinforcement learning involve estimating the mean of a function under the stationary distribution of a Markov reward process, such as the expected return in policy evaluation, or the policy gradient in policy optimization. In practice, these estimates are produced through a finite-horizon episodic sampling, which neglects the mixing properties of the Markov process. It is mostly unclear how this mismatch between the practical and the ideal setting affects the estimation, and the literature lacks a formal study on the pitfalls of episodic sampling, and how to do it optimally. In this paper, we present a minimax lower bound on the discounted mean estimation problem that explicitly connects the estimation error with the mixing properties of the Markov process and the discount factor. Then, we provide a statistical analysis on a set of notable estimators and the corresponding sampling procedures, which includes the finite-horizon estimators often used in practice. Crucially, we show that estimating the mean by directly sampling from the discounted kernel of the Markov process brings compelling statistical properties w.r. t. the alternative estimators, as it matches the lower bound without requiring a careful tuning of the episode horizon.
Crediting football players for creating dangerous actions in an unbiased way: the generation of threat (GoT) indices

We introduce an innovative methodology to identify football players at the origin of threatening actions in a team. In our framework, a threat is defined as entering the opposing team's danger area. We investigate the timing of threat events and ball touches of players, and capture their correlation using Hawkes processes. Our model-based approach allows us to evaluate a player's ability to create danger both directly and through interactions with teammates. We define a new index, called Generation of Threat (GoT), that measures in an unbiased way the contribution of a player to threat generation. For illustration, we present a detailed analysis of Chelsea's 2016-2017 season, with a standout performance from Eden Hazard. We are able to credit each player for his involvement in danger creation and determine the main circuits leading to threat. In the same spirit, we investigate the danger generation process of Stade Rennais in the 2021-2022 season. Furthermore, we establish a comprehensive ranking of Ligue 1 players based on their generated threat in the 2021-2022 season. Our analysis reveals surprising results, with players such as Jason Berthomier, Moses Simon and Frederic Guilbert among the top performers in the GoT rankings. We also present a ranking of Ligue 1 central defenders in terms of generation of threat and confirm the great performance of some center-back pairs, such as Nayef Aguerd and Warmed Omari.
Electron Pairing of Interfering Interface-Based Edge Modes.

The remarkable Cooper-like pairing phenomenon in the Aharonov-Bohm interference of a Fabry-Perot interferometer-operating in the integer quantum Hall regime-remains baffling. Here, we report the interference of paired electrons employing "interface edge modes. " These modes are born at the interface between the bulk of the Fabry-Perot interferometer and an outer gated region tuned to a lower filling factor. Such a configuration allows toggling the spin and the orbital of the Landau level of the edge modes at the interface. We find that electron pairing occurs only when the two modes (the interfering outer and the first inner) belong to the same spinless Landau level.
Simulated Annealing in Early Layers Leads to Better Generalization

Recently, a number of iterative learning methods have been introduced to improve generalization. These typically rely on training for longer periods of time in exchange for improved generalization. LLF (later-layer-forgetting) is a state-of-the-art method in this category. It strengthens learning in early layers by periodically re-initializing the last few layers of the network. Our principal innovation in this work is to use Simulated annealing in EArly Layers (SEAL) of the network in place of re-initialization of later layers. Essentially, later layers go through the normal gradient descent process, while the early layers go through short stints of gradient ascent followed by gradient descent. Extensive experiments on the popular Tiny-ImageNet dataset benchmark and a series of transfer learning and few-shot learning tasks show that we outperform LLF by a significant margin. We further show that, compared to normal training, LLF features, although improving on the target task, degrade the transfer learning performance across all datasets we explored. In comparison, our method outperforms LLF across the same target datasets by a large margin. We also show that the prediction depth of our method is significantly lower than that of LLF and normal training, indicating on average better prediction performance. 11The code to reproduce our results is publicly available at: https://github.com/amiiir-sarfi/SEAL
ENSEMBLE METHODS FOR SOLVING PROBLEMS OF MEDICAL DIAGNOSIS

The authors proposed the consolidating method for analyzing series of observations based on a fitted model of a mixture of catalysts of the main components, which makes it possible to study any number of markers. Contrasting the longitudinal approach, it eliminates the need to connect regression analysis methods with their own uncertainties when choosing particular models. The consolidating method allows obtaining an original result in the subject area of early diagnosis of a disease: all options for using markers demonstrate an increase in classification accuracy with an increase in the length of a series of examinations.
Bounding Box Annotation with Visible Status

Training deep-learning-based vision systems requires the manual annotation of a significant amount of data to optimize several parameters of the deep convolutional neural networks. Such manual annotation is highly time-consuming and labor-intensive. To reduce this burden, a previous study presented a fully automated annotation approach that does not require any manual intervention. The proposed method associates a visual marker with an object and captures it in the same image. However, because the previous method relied on moving the object within the capturing range using a fixed-point camera, the collected image dataset was limited in terms of capturing viewpoints. To overcome this limitation, this study presents a mobile application-based free-viewpoint image-capturing method. With the proposed application, users can collect multi-view image datasets automatically that are annotated with bounding boxes by moving the camera. However, capturing images through human involvement is laborious and monotonous. Therefore, we propose gamified application features to track the progress of the collection status. Our experiments demonstrated that using the gamified mobile application for bounding box annotation, with visible collection progress status, can motivate users to collect multi-view object image datasets with less mental workload and time pressure in an enjoyable manner, leading to increased engagement.
Device Activity Detection in mMTC with Low-Resolution ADC: A New Protocol

This paper investigates the effect of low-resolution analog-to-digital converters (ADCs) on device activity detection in massive machine-type communications (mMTC). The low-resolution ADCs induce two challenges on the device activity detection compared with the traditional setup with the assumption of infinite ADC resolution. First, the codebook design for signal quantization by the low-resolution ADC is particularly important since a good design of the codebook can lead to small quantization error on the received signal, which in turn has significant influence on the activity detector performance. To this end, prior information about the received signal power is needed, which depends on the number of active devices $K$. This is sharply different from the activity detection problem in traditional setups, in which the knowledge of $K$ is not required by the BS as a prerequisite. Second, the covariance-based approach achieves good activity detection performance in traditional setups while it is not clear if it can still achieve good performance in this paper. To solve the above challenges, we propose a communication protocol that consists of an estimator for $K$ and a detector for active device identities: 1) For the estimator, the technical difficulty is that the design of the ADC quantizer and the estimation of $K$ are closely intertwined and doing one needs the information/execution from the other. We propose a progressive estimator which iteratively performs the estimation of $K$ and the design of the ADC quantizer; 2) For the activity detector, we propose a custom-designed stochastic gradient descent algorithm to estimate the active device identities. Numerical results demonstrate the effectiveness of the communication protocol.
Cointegration without Unit Roots

It has been known since Elliott (1998) that standard methods of inference on cointegrating relationships break down entirely when autoregressive roots are near but not exactly equal to unity. We consider this problem within the framework of a structural VAR, arguing this it is as much a problem of identification failure as it is of inference. We develop a characterisation of cointegration based on the impulse response function, which allows long-run equilibrium relationships to remain identified even in the absence of exact unit roots. Our approach also provides a framework in which the structural shocks driving the common persistent components continue to be identified via long-run restrictions, just as in an SVAR with exact unit roots. We show that inference on the cointegrating relationships is affected by nuisance parameters, in a manner familiar from predictive regression; indeed the two problems are asymptotically equivalent. By adapting the approach of Elliott, M\"uller and Watson (2015) to our setting, we develop tests that robustly control size while sacrificing little power (relative to tests that are efficient in the presence of exact unit roots).
An L-DEIM Induced High Order Tensor Interpolatory Decomposition

This paper derives the CUR-type factorization for tensors in the Tucker format based on a new variant of the discrete empirical interpolation method known as L-DEIM. This novel sampling technique allows us to construct an efficient algorithm for computing the structure-preserving decomposition, which significantly reduces the computational cost. For large-scale datasets, we incorporate the random sampling technique with the L-DEIM procedure to further improve efficiency. Moreover, we propose randomized algorithms for computing a hybrid decomposition, which yield interpretable factorization and provide a smaller approximation error than the tensor CUR factorization. We provide comprehensive analysis of probabilistic errors associated with our proposed algorithms, and present numerical results that demonstrate the effectiveness of our methods.
First-order methods for Stochastic Variational Inequality problems with Function Constraints

The monotone Variational Inequality (VI) is an important problem in machine learning. In numerous instances, the VI problems are accompanied by function constraints which can possibly be data-driven, making the projection operator challenging to compute. In this paper, we present novel first-order methods for function constrained VI (FCVI) problem under various settings, including smooth or nonsmooth problems with a stochastic operator and/or stochastic constraints. First, we introduce the~{\texttt{OpConEx}} method and its stochastic variants, which employ extrapolation of the operator and constraint evaluations to update the variables and the Lagrangian multipliers. These methods achieve optimal operator or sample complexities when the FCVI problem is either (i) deterministic nonsmooth, or (ii) stochastic, including smooth or nonsmooth stochastic constraints. Notably, our algorithms are simple single-loop procedures and do not require the knowledge of Lagrange multipliers to attain these complexities. Second, to obtain the optimal operator complexity for smooth deterministic problems, we present a novel single-loop Adaptive Lagrangian Extrapolation~(\texttt{AdLagEx}) method that can adaptively search for and explicitly bound the Lagrange multipliers. Furthermore, we show that all of our algorithms can be easily extended to saddle point problems with coupled function constraints, hence achieving similar complexity results for the aforementioned cases. To our best knowledge, many of these complexities are obtained for the first time in the literature.