Miracle-dz/UniFAR-FTUs huggingface dataset:
Rule Enforcing Through Ordering

In many real world situations, like minor traffic offenses in big cities, a central authority is tasked with periodic administering punishments to a large number of individuals. Common practice is to give each individual a chance to suffer a smaller fine and be guaranteed to avoid the legal process with probable considerably larger punishment. However, thanks to the large number of offenders and a limited capacity of the central authority, the individual risk is typically small and a rational individual will not choose to pay the fine. Here we show that if the central authority processes the offenders in a publicly known order, it properly incentives the offenders to pay the fine. We show analytically and on realistic experiments that our mechanism promotes non-cooperation and incentives individuals to pay. Moreover, the same holds for an arbitrary coalition. We quantify the expected total payment the central authority receives, and show it increases considerably.
Robustness of continuous-time adaptive control algorithms in the presence of unmodeled dynamics

This paper examines the robustness properties of existing adaptive control algorithms to unmodeled plant high-frequency dynamics and unmeasurable output disturbances. It is demonstrated thai there exist two infinite-gain operators in the nonlinear dynamic system which determines the time-evolution of output and parameter errors. The pragmatic implication of the existence of such infinite-gain operators is that 1) sinusoidal reference inputs at specific frequencies and/or 2) sinusoidal output disturbances at any frequency (including dc), can cause the loop gain to increase without bound, thereby exciting the unmodeled high-frequency dynamics, and yielding an unstable control system. Hence, it is concluded that existing adaptive control algorithms as they are presented in the literature referenced in this paper, cannot be used with confidence in practical designs where the plant contains unmodeled dynamics because instability is likely to result. Further understanding is required to ascertain how the currently implemented adaptive systems differ from the theoretical systems studied here and how further theoretical development can improve the robustness of adaptive controllers.
Semi-Weakly Supervised Object Kinematic Motion Prediction

Given a 3D object, kinematic motion prediction aims to identify the mobile parts as well as the corresponding motion parameters. Due to the large variations in both topological structure and geometric details of 3D objects, this remains a challenging task and the lack of large scale labeled data also constrain the performance of deep learning based approaches. In this paper, we tackle the task of object kinematic motion prediction problem in a semi-weakly supervised manner. Our key observations are two-fold. First, although 3D dataset with fully annotated motion labels is limited, there are existing datasets and methods for object part semantic segmentation at large scale. Second, semantic part segmentation and mobile part segmentation is not always consistent but it is possible to detect the mobile parts from the underlying 3D structure. Towards this end, we propose a graph neural network to learn the map between hierarchical part-level segmentation and mobile parts parameters, which are further refined based on geometric alignment. This network can be first trained on PartNet-Mobility dataset with fully labeled mobility information and then applied on PartNet dataset with fine-grained and hierarchical part-level segmentation. The network predictions yield a large scale of 3D objects with pseudo labeled mobility information and can further be used for weakly-supervised learning with pre-existing segmentation. Our experiments show there are significant performance boosts with the augmented data for previous method designed for kinematic motion prediction on 3D partial scans.
AdvCheck: Characterizing Adversarial Examples via Local Gradient Checking

Deep neural networks (DNNs) are vulnerable to adversarial examples, which may lead to catastrophe in security-critical domains. Numerous detection methods are proposed to characterize the feature uniqueness of adversarial examples, or to distinguish DNN's behavior activated by the adversarial examples. Detections based on features cannot handle adversarial examples with large perturbations. Besides, they require a large amount of specific adversarial examples. Another mainstream, model-based detections, which characterize input properties by model behaviors, suffer from heavy computation cost. To address the issues, we introduce the concept of local gradient, and reveal that adversarial examples have a quite larger bound of local gradient than the benign ones. Inspired by the observation, we leverage local gradient for detecting adversarial examples, and propose a general framework AdvCheck. Specifically, by calculating the local gradient from a few benign examples and noise-added misclassified examples to train a detector, adversarial examples and even misclassified natural inputs can be precisely distinguished from benign ones. Through extensive experiments, we have validated the AdvCheck's superior performance to the state-of-the-art (SOTA) baselines, with detection rate ($\sim \times 1.2$) on general adversarial attacks and ($\sim \times 1.4$) on misclassified natural inputs on average, with average 1/500 time cost. We also provide interpretable results for successful detection.
Kondo $s$-$d$ exchange interaction in the CuO$_2$ plane as the long sought mechanism of high temperature superconductivity in cuprates

The well-known Pavarini et al. [Phys. Rev. Lett. 87, 047003 (2001)] correlation between the critical temperature $T_c$, max and the shape of the Fermi contour of the optimally hole-doped cuprates are explained within the framework of the BCS theory with Kondo exchange interaction incorporated as a pairing mechanism. The strong influence of the relative position of the Cu4$s$ level with respect to the Cu3$d_{x^2-y^2}$ level on the critical temperature $T_c$ reveals why the $s$-$d$ hybridization of the conduction band is so important. This hybridization is proportional to the $s$-$d$ exchange scattering amplitude between the conduction electrons -- the mechanism of d-wave pairing in the CuO$_2$ plane. In other words the Kondo interaction considered as a pairing mechanism in the CuO$_2$ plane gives a natural explanation of the correlation between the critical temperature and the shape of the Fermi contour. The lack of an alternative explanation for the description of the critical temperature of optimally doped cuprates for several decades gives a hint that the long sought pairing mechanism has already been found.
Regularized Shallow Image Prior for Electrical Impedance Tomography

Untrained Neural Network Prior (UNNP) based algorithms have gained increasing popularity in tomographic imaging, as they offer superior performance compared to hand-crafted priors and do not require training. UNNP-based methods usually rely on deep architectures which are known for their excellent feature extraction ability compared to shallow ones. Contrary to common UNNP-based approaches, we propose a regularized shallow image prior method that combines UNNP with hand-crafted prior for Electrical Impedance Tomography (EIT). Our approach employs a 3-layer Multi-Layer Perceptron (MLP) as the UNNP in regularizing 2D and 3D EIT inversion. We demonstrate the influence of two typical hand-crafted regularizations when representing the conductivity distribution with shallow MLPs. We show considerably improved EIT image quality compared to conventional regularization algorithms, especially in structure preservation. The results suggest that combining the shallow image prior and the hand-crafted regularization can achieve similar performance to the Deep Image Prior (DIP) but with less architectural dependency and complexity of the neural network.
Direct Data-Driven Computation of Polytopic Robust Control Invariant Sets and State-Feedback Controllers

This paper presents a direct data-driven approach for computing robust control invariant (RCI) sets and their associated state-feedback control laws for linear time-invariant systems affected by bounded disturbances. The proposed method utilizes a single state-input trajectory generated from the system, to compute a polytopic RCI set with a desired complexity and an invariance-inducing feedback controller, without the need to identify a model of the system. The problem is formulated in terms of a set of sufficient linear matrix inequality conditions that are then combined in a semi-definite program to maximize the volume of the RCI set while respecting the state and input constraints. We demonstrate through a numerical case study that the proposed data-driven approach can generate RCI sets that are of comparable size to those obtained by a model-based method in which exact knowledge of the system matrices is assumed.
An evaluation of time series forecasting models on water consumption data: A case study of Greece

In recent years, the increased urbanization and industrialization has led to a rising water demand and resources, thus increasing the gap between demand and supply. Proper water distribution and forecasting of water consumption are key factors in mitigating the imbalance of supply and demand by improving operations, planning and management of water resources. To this end, in this paper, several well-known forecasting algorithms are evaluated over time series, water consumption data from Greece, a country with diverse socio-economic and urbanization issues. The forecasting algorithms are evaluated on a real-world dataset provided by the Water Supply and Sewerage Company of Greece revealing key insights about each algorithm and its use.
Differentially Private Stream Processing at Scale

We design, to the best of our knowledge, the first differentially private (DP) stream processing system at scale. Our system --Differential Privacy SQL Pipelines (DP-SQLP)-- is built using a streaming framework similar to Spark streaming, and is built on top of the Spanner database and the F1 query engine from Google. Towards designing DP-SQLP we make both algorithmic and systemic advances, namely, we (i) design a novel DP key selection algorithm that can operate on an unbounded set of possible keys, and can scale to one billion keys that users have contributed, (ii) design a preemptive execution scheme for DP key selection that avoids enumerating all the keys at each triggering time, and (iii) use algorithmic techniques from DP continual observation to release a continual DP histogram of user contributions to different keys over the stream length. We empirically demonstrate the efficacy by obtaining at least $16\times$ reduction in error over meaningful baselines we consider.
Code Reviewer Recommendation for Architecture Violations: An Exploratory Study

Code review is a common practice in software development and often conducted before code changes are merged into the code repository. A number of approaches for automatically recommending appropriate reviewers have been proposed to match such code changes to pertinent reviewers. However, such approaches are generic, i.e., they do not focus on specific types of issues during code reviews. In this paper, we propose an approach that focuses on architecture violations, one of the most critical type of issues identified during code review. Specifically, we aim at automating the recommendation of code reviewers, who are potentially qualified to review architecture violations, based on reviews of code changes. To this end, we selected three common similarity detection methods to measure the file path similarity of code commits and the semantic similarity of review comments. We conducted a series of experiments on finding the appropriate reviewers through evaluating and comparing these similarity detection methods in separate and combined ways with the baseline reviewer recommendation approach, RevFinder. The results show that the common similarity detection methods can produce acceptable performance scores and achieve a better performance than RevFinder. The sampling techniques used in recommending code reviewers can impact the performance of reviewer recommendation approaches. We also discuss the potential implications of our findings for both researchers and practitioners.
Microscopic calculation of the pinning energy of a vortex in the inner crust of a neutron star

The structure of a vortex in the inner crust of a pulsar is calculated microscopically in the Wigner-Seitz cell approximation, simulating the conditions of the inner crust of a cold, non-accreting neutron star, in which a lattice of nuclei coexists with a sea of superfluid neutrons. The calculation is based on the axially deformed Hartree-Fock-Bogolyubov framework, using effective interactions. The present work extends and improves previous studies in four ways: i) it allows for the axial deformation of protons induced by the large deformation of neutrons due to the appearance of vortices; ii) it includes the effect of Coulomb exchange; iii) considers the possible effects of the screening of the pairing interaction; and iv) it improves the numerical treatment. We also demonstrate that the binding energy of the nucleus-vortex system can be used as a proxy to the pinning energy of a vortex and discuss in which conditions this applies. From our results, we can estimate the mesoscopic pinning forces per unit length acting on vortices. We obtain values ranging between $10^{14}$ to $10^{16}$ dyn/cm, consistent with previous findings.
XPert: Peripheral Circuit & Neural Architecture Co-search for Area and Energy-efficient Xbar-based Computing

The hardware-efficiency and accuracy of Deep Neural Networks (DNNs) implemented on In-memory Computing (IMC) architectures primarily depend on the DNN architecture and the peripheral circuit parameters. It is therefore essential to holistically co-search the network and peripheral parameters to achieve optimal performance. To this end, we propose XPert, which co-searches network architecture in tandem with peripheral parameters such as the type and precision of analog-to-digital converters, crossbar column sharing and the layer-specific input precision using an optimization-based design space exploration. Compared to VGG16 baselines, XPert achieves 10.24× (4.7×) lower EDAP, 1.72× (1.62×) higher TOPS/W, 1.93× (3×) higher TOPS/mm2 at 92.46% (56.7%) accuracy for CIFAR10 (TinyImagenet) datasets. The code for this paper is available at the following Github link
Patterns Detection in Glucose Time Series by Domain Transformations and Deep Learning

People with diabetes have to manage their blood glucose level to keep it within an appropriate range. Predicting whether future glucose values will be outside the healthy threshold is of vital importance in order to take corrective actions to avoid potential health damage. In this paper we describe our research with the aim of predicting the future behavior of blood glucose levels, so that hypoglycemic events may be anticipated. The approach of this work is the application of transformation functions on glucose time series, and their use in convolutional neural networks. We have tested our proposed method using real data from 4 different diabetes patients with promising results.
Generalized Information Bottleneck for Gaussian Variables

The information bottleneck (IB) method offers an attractive framework for understanding representation learning, however its applications are often limited by its computational intractability. Analytical characterization of the IB method is not only of practical interest, but it can also lead to new insights into learning phenomena. Here we consider a generalized IB problem, in which the mutual information in the original IB method is replaced by correlation measures based on Renyi and Jeffreys divergences. We derive an exact analytical IB solution for the case of Gaussian correlated variables. Our analysis reveals a series of structural transitions, similar to those previously observed in the original IB case. We find further that although solving the original, Renyi and Jeffreys IB problems yields different representations in general, the structural transitions occur at the same critical tradeoff parameters, and the Renyi and Jeffreys IB solutions perform well under the original IB objective. Our results suggest that formulating the IB method with alternative correlation measures could offer a strategy for obtaining an approximate solution to the original IB problem.
Analysis and Comparison of Two-Level KFAC Methods for Training Deep Neural Networks

As a second-order method, the Natural Gradient Descent (NGD) has the ability to accelerate training of neural networks. However, due to the prohibitive computational and memory costs of computing and inverting the Fisher Information Matrix (FIM), efficient approximations are necessary to make NGD scalable to Deep Neural Networks (DNNs). Many such approximations have been attempted. The most sophisticated of these is KFAC, which approximates the FIM as a block-diagonal matrix, where each block corresponds to a layer of the neural network. By doing so, KFAC ignores the interactions between different layers. In this work, we investigate the interest of restoring some low-frequency interactions between the layers by means of two-level methods. Inspired from domain decomposition, several two-level corrections to KFAC using different coarse spaces are proposed and assessed. The obtained results show that incorporating the layer interactions in this fashion does not really improve the performance of KFAC. This suggests that it is safe to discard the off-diagonal blocks of the FIM, since the block-diagonal approach is sufficiently robust, accurate and economical in computation time.
Convergence of a Least‐Squares Monte Carlo Algorithm for Bounded Approximating Sets

We analyse the convergence properties of the Longstaff–Schwartz algorithm for approximately solving optimal stopping problems that arise in the pricing of American (Bermudan) financial options. Based on a new approximate dynamic programming principle error propagation inequality, we prove sample complexity error estimates for this algorithm for the case in which the corresponding approximation spaces may not necessarily possess any linear structure at all and may actually be any arbitrary sets of functions, each of which is uniformly bounded and possesses finite VC‐dimension, but is not required to satisfy any further material conditions. In particular, we do not require that the approximation spaces be convex or closed, and we thus significantly generalize the results of Egloff, Clement et al., and others. Using our error estimation theorems, we also prove convergence, up to any desired probability, of the algorithm for approximating sets defined using L2 orthonormal bases, within a framework depending subexponentially on the number of time steps. In addition, we prove estimates on the overall convergence rate of the algorithm for approximation spaces defined by polynomials.
Dataset and Baseline System for Multi-lingual Extraction and Normalization of Temporal and Numerical Expressions

Temporal and numerical expression understanding is of great importance in many downstream Natural Language Processing (NLP) and Information Retrieval (IR) tasks. However, much previous work covers only a few sub-types and focuses only on entity extraction, which severely limits the usability of identified mentions. In order for such entities to be useful in downstream scenarios, coverage and granularity of sub-types are important; and, even more so, providing resolution into concrete values that can be manipulated. Furthermore, most previous work addresses only a handful of languages. Here we describe a multi-lingual evaluation dataset - NTX - covering diverse temporal and numerical expressions across 14 languages and covering extraction, normalization, and resolution. Along with the dataset we provide a robust rule-based system as a strong baseline for comparisons against other models to be evaluated in this dataset. Data and code are available at \url{https://aka.ms/NTX}.
Affective Computing for Human-Robot Interaction Research: Four Critical Lessons for the Hitchhiker

Social Robotics and Human-Robot Interaction (HRI) research relies on different Affective Computing (AC) solutions for sensing, perceiving and understanding human affective behaviour during interactions. This may include utilising off-the-shelf affect perception models that are pre-trained on popular affect recognition benchmarks and directly applied to situated interactions. However, the conditions in situated human-robot interactions differ significantly from the training data and settings of these models. Thus, there is a need to deepen our understanding of how AC solutions can be best leveraged, customised and applied for situated HRI. This paper, while critiquing the existing practices, presents four critical lessons to be noted by the hitchhiker when applying AC for HRI research. These lessons conclude that: (i) The six basic emotions categories are not always relevant in situated interactions, (ii) Affect recognition accuracy (%) improvement as the sole goal is inappropriate for situated interactions, (iii) Affect recognition may not generalise across contexts, and (iv) Affect recognition alone is insufficient for adaptation and personalisation. By describing the background and the context for each lesson, and demonstrating how these lessons have been compiled from the various studies of the authors, this paper aims to enable the hitchhiker to successfully leverage AC solutions for advancing HRI research.
Polarization formalism for ALP-induced X-ray emission from magnetars

Missions like NASA's Imaging X-ray Polarimetry Explorer (IXPE) are poised to provide an unprecedented view of the Universe in polarized X-rays. Polarization probes physical anisotropies, a fact exploited by particle physicists to look for the anisotropic a E·B operator in the axion-like-particle (ALP) Lagrangian. Such studies have typically focused on polarization in the radio and microwaves, through local or cosmic birefringence effects. To such polarization studies we add X-rays emanating from magnetars — a class of neutron stars with near-critical strength magnetic fields — that are important targets for IXPE. ALPs produced in the neutron star core convert to X-rays in the magnetosphere; such X-rays are polarized along the direction parallel to the dipolar magnetic field at the point of conversion. We develop the full theoretical formalism for ALP-induced polarization in the presence of dipolar magnetic fields. For uncorrelated photon and ALP production mechanisms, we completely disentangle the ALP contributions to the Stokes parameters in terms of the ALP intensity, the ALP-to-photon conversion probability, and the ALP-induced birefringence. In the proper limit, our results demonstrate that the inclusion of ALPs suppresses the observed degree of circular polarization compared to its pure astrophysical value. Our results can also be used to impose limits on ALP couplings with IXPE polarization data from magnetars 4U 0142+61 and 1RXS J170849.0-400910, the subject of upcoming work.