Miracle-dz/UniFAR-FTUs huggingface dataset:
Dissipation in Hydrodynamics from Micro- to Macroscale: Wisdom from Boltzmann and Stochastic Thermodynamics

We show that macroscopic irreversible thermodynamics for viscous fluids can be derived from exact information-theoretic thermodynamic identities valid at the microscale. Entropy production, in particular, is a measure of the loss of many-particle correlations in the same way in which it measures the loss of system-reservoirs correlations in stochastic thermodynamics (ST). More specifically, we first show that boundary conditions at the macroscopic level define a natural decomposition of the entropy production rate (EPR) in terms of thermodynamic forces multiplying their conjugated currents, as well as a change in suitable nonequilibrium potential that acts as a Lyapunov function in the absence of forces. Moving to the microscale, we identify the exact identities at the origin of these dissipative contributions for isolated Hamiltonian systems. We then show that the molecular chaos hypothesis, which gives rise to the Boltzmann equation at the mesoscale, leads to a positive rate of loss of many-particle correlations, which we identify with the Boltzmann EPR. By generalizing the Boltzmann equation to account for boundaries with nonuniform temperature and nonzero velocity, and resorting to the Chapman--Enskog expansion, we recover the macroscopic theory we started from. Finally, using a linearized Boltzmann equation we derive ST for dilute particles in a weakly out-of-equilibrium fluid and its corresponding macroscopic thermodynamics. Our work unambiguously demonstrates the information-theoretical origin of thermodynamic notions of entropy and dissipation in macroscale irreversible thermodynamics.
Learning Sampling Dictionaries for Efficient and Generalizable Robot Motion Planning With Transformers

Motion planning is integral to robotics applications such as autonomous driving, surgical robots, and industrial manipulators. Existing planning methods lack scalability to higher-dimensional spaces, while recent learning-based planners have shown promise in accelerating sampling-based motion planners (SMP) but lack generalizability to out-of-distribution environments. To address this, we present a novel approach, Vector Quantized-Motion Planning Transformers (VQ-MPT) that overcomes the key generalization and scaling drawbacks of previous learning-based methods. VQ-MPT consists of two stages. Stage 1 is a Vector Quantized-Variational AutoEncoder model that learns to represent the planning space using a finite number of sampling distributions, and stage 2 is an Auto-Regressive model that constructs a sampling region for SMPs by selecting from the learned sampling distribution sets. By splitting large planning spaces into discrete sets and selectively choosing the sampling regions, our planner pairs well with out-of-the-box SMPs, generating near-optimal paths faster than without VQ-MPT's aid. It is generalizable in that it can be applied to systems of varying complexities, from 2D planar to 14D bi-manual robots with diverse environment representations, including costmaps and point clouds. Trained VQ-MPT models generalize to environments unseen during training and achieve higher success rates than previous methods.
On the Effectiveness of Hybrid Mutual Information Estimation

Estimating the mutual information from samples from a joint distribution is a challenging problem in both science and engineering. In this work, we realize a variational bound that generalizes both discriminative and generative approaches. Using this bound, we propose a hybrid method to mitigate their respective shortcomings. Further, we propose Predictive Quantization (PQ): a simple generative method that can be easily combined with discriminative estimators for minimal computational overhead. Our propositions yield a tighter bound on the information thanks to the reduced variance of the estimator. We test our methods on a challenging task of correlated high-dimensional Gaussian distributions and a stochastic process involving a system of free particles subjected to a fixed energy landscape. Empirical results show that hybrid methods consistently improved mutual information estimates when compared to the corresponding discriminative counterpart.
Geo-Tiles for Semantic Segmentation of Earth Observation Imagery

To cope with the high requirements during the computation of semantic segmentations of earth observation imagery, current state-of-the-art pipelines divide the corresponding data into smaller images. Existing methods and benchmark datasets oftentimes rely on pixel-based tiling schemes or on geo-tiling schemes employed by web mapping applications. The selection of subimages (comprising size, location and orientation) is crucial. It affects the available context information of each pixel, defines the number of tiles during training, and influences the degree of information degradation while down- and up-sampling the tile contents to the size required by the segmentation model. We propose a new segmentation pipeline for earth observation imagery relying on a tiling scheme that creates geo-tiles based on the geo-information of the raster data. This approach exhibits several beneficial properties compared to pixel-based or common web mapping approaches. The proposed tiling scheme shows flexible customization properties regarding tile granularity, tile stride and image boundary alignment. This allows us to perform a tile specific data augmentation during training and a substitution of pixel predictions with limited context information using data of overlapping tiles during inference. The generated tiles show a consistent spatial tile extent w.r. t. heterogeneous sensors, varying recording distances and different latitudes. We demonstrate how the proposed tiling system allows to improve the results of current state-of-the-art semantic segmentation models. To foster future research we make the source code publicly available.
Time and Space Optimal Massively Parallel Algorithm for the 2-Ruling Set Problem

In this work, we present a constant-round algorithm for the $2$-ruling set problem in the Congested Clique model. As a direct consequence, we obtain a constant round algorithm in the MPC model with linear space-per-machine and optimal total space. Our results improve on the $O(\log \log \log n)$-round algorithm by [HPS, DISC'14] and the $O(\log \log \Delta)$-round algorithm by [GGKMR, PODC'18]. Our techniques can also be applied to the semi-streaming model to obtain an $O(1)$-pass algorithm. Our main technical contribution is a novel sampling procedure that returns a small subgraph such that almost all nodes in the input graph are adjacent to the sampled subgraph. An MIS on the sampled subgraph provides a $2$-ruling set for a large fraction of the input graph. As a technical challenge, we must handle the remaining part of the graph, which might still be relatively large. We overcome this challenge by showing useful structural properties of the remaining graph and show that running our process twice yields a $2$-ruling set of the original input graph with high probability.
Graph-based methods coupled with specific distributional distances for adversarial attack detection

Artificial neural networks are prone to being fooled by carefully perturbed inputs which cause an egregious misclassification. These adversarial attacks have been the focus of extensive research. Likewise, there has been an abundance of research in ways to detect and defend against them. We introduce a novel approach of detection and interpretation of adversarial attacks from a graph perspective. For an input image, we compute an associated sparse graph using the layer-wise relevance propagation algorithm (Bach et al., 2015). Specifically, we only keep edges of the neural network with the highest relevance values. Three quantities are then computed from the graph which are then compared against those computed from the training set. The result of the comparison is a classification of the image as benign or adversarial. To make the comparison, two classification methods are introduced: (1) an explicit formula based on Wasserstein distance applied to the degree of node and (2) a logistic regression. Both classification methods produce strong results which lead us to believe that a graph-based interpretation of adversarial attacks is valuable.
Robust covariance estimation with missing values and cell-wise contamination

Large datasets are often affected by cell-wise outliers in the form of missing or erroneous data. However, discarding any samples containing outliers may result in a dataset that is too small to accurately estimate the covariance matrix. Moreover, the robust procedures designed to address this problem require the invertibility of the covariance operator and thus are not effective on high-dimensional data. In this paper, we propose an unbiased estimator for the covariance in the presence of missing values that does not require any imputation step and still achieves near minimax statistical accuracy with the operator norm. We also advocate for its use in combination with cell-wise outlier detection methods to tackle cell-wise contamination in a high-dimensional and low-rank setting, where state-of-the-art methods may suffer from numerical instability and long computation times. To complement our theoretical findings, we conducted an experimental study which demonstrates the superiority of our approach over the state of the art both in low and high dimension settings.
Inferring Mood-While-Eating with Smartphone Sensing and Community-Based Model Personalization

The interplay between mood and eating has been the subject of extensive research within the fields of nutrition and behavioral science, indicating a strong connection between the two. Further, phone sensor data have been used to characterize both eating behavior and mood, independently, in the context of mobile food diaries and mobile health applications. However, limitations within the current body of literature include: i) the lack of investigation around the generalization of mood inference models trained with passive sensor data from a range of everyday life situations, to specific contexts such as eating, ii) no prior studies that use sensor data to study the intersection of mood and eating, and iii) the inadequate examination of model personalization techniques within limited label settings, as we commonly experience in mood inference. In this study, we sought to examine everyday eating behavior and mood using two datasets of college students in Mexico (N_mex = 84, 1843 mood-while-eating reports) and eight countries (N_mul = 678, 329K mood reports incl. 24K mood-while-eating reports), containing both passive smartphone sensing and self-report data. Our results indicate that generic mood inference models decline in performance in certain contexts, such as when eating. Additionally, we found that population-level (non-personalized) and hybrid (partially personalized) modeling techniques were inadequate for the commonly used three-class mood inference task (positive, neutral, negative). Furthermore, we found that user-level modeling was challenging for the majority of participants due to a lack of sufficient labels and data from the negative class. To address these limitations, we employed a novel community-based approach for personalization by building models with data from a set of similar users to a target user.
Focused Prefix Tuning for Controllable Text Generation

In a controllable text generation dataset, there exist unannotated attributes that could provide irrelevant learning signals to models that use it for training and thus degrade their performance. We propose focused prefix tuning (FPT) to mitigate the problem and to enable the control to focus on the desired attribute. Experimental results show that FPT can achieve better control accuracy and text fluency than baseline models in single-attribute control tasks. In multi-attribute control tasks, FPT achieves comparable control accuracy with the state-of-the-art approach while keeping the flexibility to control new attributes without retraining existing models.
Cosmology in the Lorentz gauge theory

This proceeding is an introduction to cosmological applications of the Lorentz gauge theory. It provides the ingredients for a unique, though yet tentative $\Lambda$CDM theory of cosmology. The emergence of spacetime is described by the spontaneous symmetry breaking called here the khronogenesis. Space is then associated with the field strength of the antiself-dual gauge potential, and gravity is associated with the self-dual field strength. In the cosmological setting, khronogenesis seems to predict inflation. It is shown that the Lorentz gauge theory allows the consistent description of spin currents which could have important roles in cosmological phenomenology.
Affinity-based Attention in Self-supervised Transformers Predicts Dynamics of Object Grouping in Humans

The spreading of attention has been proposed as a mechanism for how humans group features to segment objects. However, such a mechanism has not yet been implemented and tested in naturalistic images. Here, we leverage the feature maps from self-supervised vision Transformers and propose a model of human object-based attention spreading and segmentation. Attention spreads within an object through the feature affinity signal between different patches of the image. We also collected behavioral data on people grouping objects in natural images by judging whether two dots are on the same object or on two different objects. We found that our models of affinity spread that were built on feature maps from the self-supervised Transformers showed significant improvement over baseline and CNN based models on predicting reaction time patterns of humans, despite not being trained on the task or with any other object labels. Our work provides new benchmarks for evaluating models of visual representation learning including Transformers.
Efficient Near Maximum-Likelihood Reliability-Based Decoding for Short LDPC Codes

In this paper, we propose an efficient decoding algorithm for short low-density parity check (LDPC) codes by carefully combining the belief propagation (BP) decoding and order statistic decoding (OSD) algorithms. Specifically, a modified BP (mBP) algorithm is applied for a certain number of iterations prior to OSD to enhance the reliability of the received message, where an offset parameter is utilized in mBP to control the weight of the extrinsic information in message passing. By carefully selecting the offset parameter and the number of mBP iterations, the number of errors in the most reliable positions (MRPs) in OSD can be reduced by mBP, thereby significantly improving the overall decoding performance of error rate and complexity. Simulation results show that the proposed algorithm can approach the maximum-likelihood decoding (MLD) for short LDPC codes with only a slight increase in complexity compared to BP and a significant decrease compared to OSD. Specifically, the order-(m-1) decoding of the proposed algorithm can achieve the performance of the order-m OSD.
Improving Polish to English Neural Machine Translation with Transfer Learning: Effects of Data Volume and Language Similarity

This paper investigates the impact of data volume and the use of similar languages on transfer learning in a machine translation task. We find out that having more data generally leads to better performance, as it allows the model to learn more patterns and generalizations from the data. However, related languages can also be particularly effective when there is limited data available for a specific language pair, as the model can leverage the similarities between the languages to improve performance. To demonstrate, we fine-tune mBART model for a Polish-English translation task using the OPUS-100 dataset. We evaluate the performance of the model under various transfer learning configurations, including different transfer source languages and different shot levels for Polish, and report the results. Our experiments show that a combination of related languages and larger amounts of data outperforms the model trained on related languages or larger amounts of data alone. Additionally, we show the importance of related languages in zero-shot and few-shot configurations.
Kalman Filter for Generalized 2-D Roesser Models

The design problem of the state filter for the generalized stochastic 2-D Roesser models, which appears when both the state and measurement are simultaneously subjected to the interference from white noise, is discussed. The well-known Kalman filter design is extended to the generalized 2-D Roesser models. Based on the method of “scanning line by line”,the filtering problem of generalized 2-D Roesser models with mode-energy reconstruction is solved. The formula of the optimal filtering, which minimizes the variance of the estimation error of the state vectors, is derived. The validity of the designed filter is verified by the calculation steps and the examples are introduced.
Dynamic Quantized Consensus Under DoS Attacks: Towards a Tight Zooming-Out Factor

This article deals with dynamic quantized consensus of dynamical agents in a general form under packet losses induced by denial-of-service (DoS) attacks. The communication channel has limited bandwidth and hence the transmitted signals over the network are subject to quantization. To deal with the agent's output, an observer is implemented at each node. The state of the observer is quantized by a finite-level quantizer and then transmitted over the network. To solve the problem of quantizer overflow under malicious packet losses, a zooming-in and out dynamic quantization mechanism is designed. By the new quantized controller proposed in the article, the zooming-out factor is lower bounded by the spectral radius of the agent's dynamic matrix. A sufficient condition of quantization range is provided under which the finite-level quantizer is free of overflow. A sufficient condition of tolerable DoS attacks for achieving consensus is also provided. At last, we study scalar dynamical agents as a special case and further tighten the zooming-out factor to a value smaller than the agent's dynamic parameter. Under such a zooming-out factor, it is possible to recover the level of tolerable DoS attacks to that of unquantized consensus, and the quantizer is free of overflow
High transport spin polarization in the van der Waals ferromagnet 
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:msub><mml:mi>Fe</mml:mi><mml:mn>4</mml:mn></mml:msub><mml:msub><mml:mi>GeTe</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math>

The challenging task of scaling-down the size of the power saving electronic devices can be accomplished by exploiting the spin degree of freedom of the conduction electrons in van der Waals (vdW) spintronic architectures built with 2D materials. One of the key components of such a device is a near-room temperature 2D ferromagnet with good metallicity that can generate a highly spin-polarized electronic transport current. However, most of the known 2D ferromagnets have either a very low temperature ordering, poor conductivity, or low spin polarization. In this context, the Fe$_n$GeTe$_2$ (with $n\geq3$) family of ferromagnets stand out due to their near-room temperature ferromagnetism and good metallicity. We have performed spin-resolved Andreev reflection spectroscopy on Fe$_4$GeTe$_2$ ($T_{Curie} \sim$ 273 K) and demonstrated that the ferromagnet is capable of generating a very high transport spin polarization, exceeding 50$\%$. This makes Fe$_4$GeTe$_2$ a strong candidate for application in all-vdW power-saving spintronic devices.
BiSync: A Bilingual Editor for Synchronized Monolingual Texts

In our globalized world, a growing number of situations arise where people are required to communicate in one or several foreign languages. In the case of written communication, users with a good command of a foreign language may find assistance from computer-aided translation (CAT) technologies. These technologies often allow users to access external resources, such as dictionaries, terminologies or bilingual concordancers, thereby interrupting and considerably hindering the writing process. In addition, CAT systems assume that the source sentence is fixed and also restrict the possible changes on the target side. In order to make the writing process smoother, we present BiSync, a bilingual writing assistant that allows users to freely compose text in two languages, while maintaining the two monolingual texts synchronized. We also include additional functionalities, such as the display of alternative prefix translations and paraphrases, which are intended to facilitate the authoring of texts. We detail the model architecture used for synchronization and evaluate the resulting tool, showing that high accuracy can be attained with limited computational resources. The interface and models are publicly available at https://github.com/jmcrego/BiSync and a demonstration video can be watched on YouTube https://youtu.be/_l-ugDHfNgU.
Maximal Domain Independent Representations Improve Transfer Learning

State of the art domain adaptation involves the creation of (1) a domain independent representation (DIRep) trained so that from that representation it is not possible to determine whether the input is from the source domain or the target and (2) a domain dependent representation (DDRep). The original input can then be reconstructed from those two representations. The classifier is trained only on source images using the DIRep. We show that information useful only in the source can be present in the DIRep, weakening the quality of the domain adaptation. To address this shortcoming, we ensure that DDRep is small and thus almost all information is available in the DIRep. We use synthetic data sets to illustrate a specific weakness, which we call the hidden data effect, and show in a simple context how our approach addresses it. We further showcase the performance of our approach against state-of-the-art algorithms using common image datasets. We also highlight the compatibility of our model with pretrained models, extending its applicability and versatility in real-world scenarios.
Empirical Bayes Methods for Combining Likelihoods

Abstract Suppose that several independent experiments are observed, each one yielding a likelihood L k (θ k ) for a real-valued parameter of interest θ k . For example, θ k might be the log-odds ratio for a 2 × 2 table relating to the kth population in a series of medical experiments. This article concerns the following empirical Bayes question: How can we combine all of the likelihoods L k to get an interval estimate for any one of the θ k 's, say θ1? The results are presented in the form of a realistic computational scheme that allows model building and model checking in the spirit of a regression analysis. No special mathematical forms are required for the priors or the likelihoods. This scheme is designed to take advantage of recent methods that produce approximate numerical likelihoods L k (θ k ) even in very complicated situations, with all nuisance parameters eliminated. The empirical Bayes likelihood theory is extended to situations where the θ k 's have a regression structure as well as an empiri.