Miracle-dz/UniFAR-FTUs huggingface dataset:
Indistinguishability obfuscation from well-founded assumptions

Indistinguishability obfuscation, introduced by [Barak et. al. Crypto 2001], aims to compile programs into unintelligible ones while preserving functionality. It is a fascinating and powerful object that has been shown to enable a host of new cryptographic goals and beyond. However, constructions of indistinguishability obfuscation have remained elusive, with all other proposals relying on heuristics or newly conjectured hardness assumptions. In this work, we show how to construct indistinguishability obfuscation from subexponential hardness of four well-founded assumptions. We prove: Informal Theorem: Let τ ∈ (0,∞), δ ∈ (0,1), ∈ (0,1) be arbitrary constants. Assume sub-exponential security of the following assumptions: - the Learning With Errors (LWE) assumption with subexponential modulus-to-noise ratio 2kє and noises of magnitude polynomial in k, where k is the dimension of the LWE secret, - the Learning Parity with Noise (LPN) assumption over general prime fields ℤp with polynomially many LPN samples and error rate 1/ℓδ, where ℓ is the dimension of the LPN secret, - the existence of a Boolean Pseudo-Random Generator (PRG) in NC0 with stretch n1+τ, where n is the length of the PRG seed, - the Decision Linear (DLIN) assumption on symmetric bilinear groups of prime order. Then, (subexponentially secure) indistinguishability obfuscation for all polynomial-size circuits exists. Further, assuming only polynomial security of the aforementioned assumptions, there exists collusion resistant public-key functional encryption for all polynomial-size circuits.
Rank dependent branching-selection particle systems

We consider a large family of branching-selection particle systems. The branching rate of each particle depends on its rank and is given by a function $b$ defined on the unit interval. There is also a killing measure $D$ supported on the unit interval as well. At branching times, a particle is chosen among all particles to the left of the branching one by sampling its rank according to $D$. The measure $D$ is allowed to have total mass less than one, which corresponds to a positive probability of no killing. Between branching times, particles perform independent Brownian Motions in the real line. This setting includes several well known models like Branching Brownian Motion (BBM), $N$-BBM, rank dependent BBM, and many others. We conjecture a scaling limit for this class of processes and prove such a limit for a related class of branching-selection particle system. This family is rich enough to allow us to use the behavior of solutions of the limiting equation to prove the asymptotic velocity of the rightmost particle under minimal conditions on $b$ and $D$. The behavior turns out to be universal and depends only on $b(1)$ and the total mass of $D$. If the total mass is one, the number of particles in the system $N$ is conserved and the velocities $v_N$ converge to $\sqrt{2 b(1)}$. When the total mass of $D$ is less than one, the number of particles in the system grows up in time exponentially fast and the asymptotic velocity of the rightmost one is $\sqrt{2 b(1)}$ independently of the number of initial particles.
COOKIE: A Dataset for Conversational Recommendation over Knowledge Graphs in E-commerce

In this work, we present a new dataset for conversational recommendation over knowledge graphs in e-commerce platforms called COOKIE. The dataset is constructed from an Amazon review corpus by integrating both user-agent dialogue and custom knowledge graphs for recommendation. Specifically, we first construct a unified knowledge graph and extract key entities between user--product pairs, which serve as the skeleton of a conversation. Then we simulate conversations mirroring the human coarse-to-fine process of choosing preferred items. The proposed baselines and experiments demonstrate that our dataset is able to provide innovative opportunities for conversational recommendation.
RespVAD: Voice Activity Detection via Video-Extracted Respiration Patterns

Voice activity detection (VAD) refers to the task of identification of regions of human speech in digital signals such as audio and video. While VAD is a necessary first step in many speech processing systems, it poses challenges when there are high levels of ambient noise during the audio recording. To improve the performance of VAD under such conditions, several methods utilizing the visual information extracted from the region surrounding the mouth/lip region of the speakers’ video recording have been proposed. Even though these provide advantages over audio-only methods, they depend on faithful extraction of lip/mouth regions. Motivated by these, a new paradigm for VAD based on the fact that respiration forms the primary source of energy for speech production is proposed. Specifically, an audio-independent VAD technique using the respiration pattern extracted from the speakers’ video is developed. The respiration pattern is first extracted from the video focusing on the abdominal-thoracic region of a speaker using an optical flow based method. Subsequently, voice activity is detected from the respiration pattern signal using neural sequence-to-sequence prediction models. The efficacy of the proposed method is demonstrated through experiments on a challenging dataset recorded in real acoustic environments and compared with four previous methods based on audio and visual cues. Data and the code for our implementation will be made available at https://github.com/arnabkmondal/RespVAD.
Neural Machine Translation without Embeddings

Many NLP models operate over sequences of subword tokens produced by hand-crafted tokenization rules and heuristic subword induction algorithms. A simple universal alternative is to represent every computerized text as a sequence of bytes via UTF-8, obviating the need for an embedding layer since there are fewer token types (256) than dimensions. Surprisingly, replacing the ubiquitous embedding layer with one-hot representations of each byte does not hurt performance; experiments on byte-to-byte machine translation from English to 10 different languages show a consistent improvement in BLEU, rivaling character-level and even standard subword-level models. A deeper investigation reveals that the combination of embeddingless models with decoder-input dropout amounts to token dropout, which benefits byte-to-byte models in particular.
Coherent Multiantenna Receiver for BPSK-Modulated Ambient Backscatter Tags

Ambient backscatter communication (AmBC) is an emerging communication technology enabling green Internet of Things deployments. The widespread acceptance of this paradigm is limited by the low signal-to-interference-plus-noise ratio (SINR) of the signal impinging on the receiver antenna due to the strong direct path interference and unknown ambient signal. The adverse impact of these two factors can be mitigated by using noncoherent multiantenna receivers, which are known to require a higher SINR to reach the bit-error-rate (BER) performance of coherent receivers. However, considering the unknown ambient signal, unknown location of AmBC tags, and varying channel conditions, coherent receivers for AmBC systems are rarely studied in the literature. In this article, a coherent multiantenna receiver, which requires no prior information of the ambient signal for decoding the binary-phase-shift-keying (BPSK) modulated signal, is presented. The performance of the proposed receiver is compared with an ideal coherent receiver that has perfect phase information, and also with the performance of a noncoherent receiver, which assumes distributions for ambient signal and phase offset caused by the excess length of the backscatter path. Comparative simulation results show the designed receiver can achieve the same BER performance of the ideal coherent receiver with 1-dB more SINR, which corresponds to 5-dB or more gain with respect to noncoherent reception of on-off-keying modulated signals. Variation in the detection performance with the tag location shows that the coverage area is in the close vicinity of the transmitter and a larger region around the receiver, which is consistent with the theoretical results.
Dark photon search with a gyrotron and a transition edge sensor

A dark photon, one of the candidates of light dark matter, will be searched around 0.1 meV range by using a gyrotron. The use of a Transition Edge Sensor is the key of this experiment and the expected result is promising. This search will pave a way to future axion search using similar instruments.
ATG-PVD: Ticketing Parking Violations on A Drone

In this paper, we introduce a novel suspect-and-investigate framework, which can be easily embedded in a drone for automated parking violation detection (PVD). Our proposed framework consists of: 1) SwiftFlow, an efficient and accurate convolutional neural network (CNN) for unsupervised optical flow estimation; 2) Flow-RCNN, a flow-guided CNN for car detection and classification; and 3) an illegally parked car (IPC) candidate investigation module developed based on visual SLAM. The proposed framework was successfully embedded in a drone from ATG Robotics. The experimental results demonstrate that, firstly, our proposed SwiftFlow outperforms all other state-of-the-art unsupervised optical flow estimation approaches in terms of both speed and accuracy; secondly, IPC candidates can be effectively and efficiently detected by our proposed Flow-RCNN, with a better performance than our baseline network, Faster-RCNN; finally, the actual IPCs can be successfully verified by our investigation module after drone re-localization.
Howl: A Deployed, Open-Source Wake Word Detection System

We describe Howl, an open-source wake word detection toolkit with native support for open speech datasets such as Mozilla Common Voice (MCV) and Google Speech Commands (GSC). We report benchmark results of various models supported by our toolkit on GSC and our own freely available wake word detection dataset, built from MCV. One of our models is deployed in Firefox Voice, a plugin enabling speech interactivity for the Firefox web browser. Howl represents, to the best of our knowledge, the first fully productionized, open-source wake word detection toolkit with a web browser deployment target. Our codebase is at howl.ai.
Dynamic Channel Emulation in a Cost-Effective MPAC Setup for mmWave Devices Over-The-Air Testing with Dominant Cluster Concept

Millimeter-Wave (mmWave) has been considered as the key enabler for the fifth generation (5G) communications. The link budget and spectral efficiency of mmWave communications can be further enhanced by adopting the massive multiple-input-multiple-output (MIMO) exploiting beamforming. Nevertheless, it is essential to design and test mmWave 5G devices under various realistic scenarios, since the uncontrollable radio propagation channels pose intrinsic limitations on system performance. This requires emulating the realistic dynamic mmWave channels in a reproducible manner in laboratories, hence the goal of this paper. In this contribution, the beamforming effect is firstly investigated, showing that the non-dominant clusters existing in the mmWave channels are insignificant with beamforming operations applied in mmWave 5G devices. Thus, an over-the-air (OTA) emulation strategy for dynamic mmWave channels is then proposed based on a dominant-cluster concept using a sectored multiprobe anechoic chamber (SMPAC) setup. The key design parameters including the probe number and the angular spacing of probes are investigated through comprehensive simulations. A cost-effective switch circuit is also designed for this purpose and validated in the simulation. Furthermore, a dynamic mmWave channel measured in an indoor scenario at 28-30 GHz is presented, where the proposed emulation strategy is also validated by reproducing the measured reality.
Kronecker CP Decomposition With Fast Multiplication for Compressing RNNs

Recurrent neural networks (RNNs) are powerful in the tasks oriented to sequential data, such as natural language processing and video recognition. However, because the modern RNNs have complex topologies and expensive space/computation complexity, compressing them becomes a hot and promising topic in recent years. Among plenty of compression methods, tensor decomposition, e.g., tensor train (TT), block term (BT), tensor ring (TR), and hierarchical Tucker (HT), appears to be the most amazing approach because a very high compression ratio might be obtained. Nevertheless, none of these tensor decomposition formats can provide both space and computation efficiency. In this article, we consider to compress RNNs based on a novel Kronecker CANDECOMP/PARAFAC (KCP) decomposition, which is derived from Kronecker tensor (KT) decomposition, by proposing two fast algorithms of multiplication between the input and the tensor-decomposed weight. According to our experiments based on UCF11, Youtube Celebrities Face, UCF50, TIMIT, TED-LIUM, and Spiking Heidelberg digits datasets, it can be verified that the proposed KCP-RNNs have a comparable performance of accuracy with those in other tensor-decomposed formats, and even 278 $219\times $ compression ratio could be obtained by the low-rank KCP. More importantly, KCP-RNNs are efficient in both space and computation complexity compared with other tensor-decomposed ones. Besides, we find KCP has the best potential of parallel computing to accelerate the calculations in neural networks.
Automatic sleep stage classification with deep residual networks in a mixed-cohort setting

STUDY OBJECTIVES Sleep stage scoring is performed manually by sleep experts and is prone to subjective interpretation of scoring rules with low intra- and interscorer reliability. Many automatic systems rely on few small-scale databases for developing models, and generalizability to new datasets is thus unknown. We investigated a novel deep neural network to assess the generalizability of several large-scale cohorts. METHODS A deep neural network model was developed using 15684 polysomnography studies from five different cohorts. We applied four different scenarios: 1) impact of varying time-scales in the model; 2) performance of a single cohort on other cohorts of smaller, greater or equal size relative to the performance of other cohorts on a single cohort; 3) varying the fraction of mixed-cohort training data compared to using single-origin data; and 4) comparing models trained on combinations of data from 2, 3, and 4 cohorts. RESULTS Overall classification accuracy improved with increasing fractions of training data (0.25%: 0.782 ± 0.097, 95% CI [0.777 - 0.787]; 100%: 0.869 ± 0.064, 95% CI [0.864 - 0.872]), and with increasing number of data sources (2: 0.788 ± 0.102, 95% CI [0.787 - 0.790]; 3: 0.808 ± 0.092, 95% CI [0.807 - 0.810]; 4: 0.821 ± 0.085, 95% CI [0.819 - 0.823]). Different cohorts show varying levels of generalization to other cohorts. CONCLUSION Automatic sleep stage scoring systems based on deep learning algorithms should consider as much data as possible from as many sources available to ensure proper generalization. Public datasets for benchmarking should be made available for future research.
Testing for equality between conditional copulas given discretized conditioning events

Several procedures have been recently proposed to test the simplifying assumption for conditional copulas. Instead of considering pointwise conditioning events, we study the constancy of the conditional dependence structure when some covariates belong to general Borel conditioning subsets. We introduce several test statistics based on the equality of conditional Kendall's taus and derive their asymptotic distributions under the null hypothesis. In settings where such conditioning events are not fixed ex ante, we propose a data‐driven procedure to recursively build such relevant subsets. This procedure is based on decision trees that maximize the differences between the conditional Kendall's taus, which correspond to the leaves of the trees. Empirical results for such tests are illustrated in the Supplementary Material. Moreover, a study of the conditional dependence between financial stock returns is presented and highlights specific contagion effects of past returns. The last application deals with conditional dependence between coverage amounts in an insurance dataset.
EmoGraph: Capturing Emotion Correlations using Graph Networks

Most emotion recognition methods tackle the emotion understanding task by considering individual emotion independently while ignoring their fuzziness nature and the interconnections among them. In this paper, we explore how emotion correlations can be captured and help different classification tasks. We propose EmoGraph that captures the dependencies among different emotions through graph networks. These graphs are constructed by leveraging the co-occurrence statistics among different emotion categories. Empirical results on two multi-label classification datasets demonstrate that EmoGraph outperforms strong baselines, especially for macro-F1. An additional experiment illustrates the captured emotion correlations can also benefit a single-label classification task.
Spiraling solutions of nonlinear Schrödinger equations

We study a new family of sign-changing solutions to the stationary nonlinear Schrödinger equation \[ -\Delta v +q v =|v|^{p-2} v, \qquad \text{in}\,{ {\mathbb{R}^{3}},} \] with $2 < p < \infty$ and $q \ge 0$. These solutions are spiraling in the sense that they are not axially symmetric but invariant under screw motion, i.e., they share the symmetry properties of a helicoid. In addition to existence results, we provide information on the shape of spiraling solutions, which depends on the parameter value representing the rotational slope of the underlying screw motion. Our results complement a related analysis of Del Pino, Musso and Pacard in their study (2012, Manuscripta Math., 138, 273–286) for the Allen–Cahn equation, whereas the nature of results and the underlying variational structure are completely different.
A Variational Approach to Unsupervised Sentiment Analysis

In this paper, we propose a variational approach to unsupervised sentiment analysis. Instead of using ground truth provided by domain experts, we use target-opinion word pairs as a supervision signal. For example, in a document snippet "the room is big," (room, big) is a target-opinion word pair. These word pairs can be extracted by using dependency parsers and simple rules. Our objective function is to predict an opinion word given a target word while our ultimate goal is to learn a sentiment classifier. By introducing a latent variable, i.e., the sentiment polarity, to the objective function, we can inject the sentiment classifier to the objective function via the evidence lower bound. We can learn a sentiment classifier by optimizing the lower bound. We also impose sophisticated constraints on opinion words as regularization which encourages that if two documents have similar (dissimilar) opinion words, the sentiment classifiers should produce similar (different) probability distribution. We apply our method to sentiment analysis on customer reviews and clinical narratives. The experiment results show our method can outperform unsupervised baselines in sentiment analysis task on both domains, and our method obtains comparable results to the supervised method with hundreds of labels per aspect in customer reviews domain, and obtains comparable results to supervised methods in clinical narratives domain.
Beyond Individual and Group Fairness

We present a new data-driven model of fairness that, unlike existing static definitions of individual or group fairness is guided by the unfairness complaints received by the system. Our model supports multiple fairness criteria and takes into account their potential incompatibilities. We consider both a stochastic and an adversarial setting of our model. In the stochastic setting, we show that our framework can be naturally cast as a Markov Decision Process with stochastic losses, for which we give efficient vanishing regret algorithmic solutions. In the adversarial setting, we design efficient algorithms with competitive ratio guarantees. We also report the results of experiments with our algorithms and the stochastic framework on artificial datasets, to demonstrate their effectiveness empirically.
Entropia: A Family of Entropy-Based Conformance Checking Measures for Process Mining

This paper presents a command-line tool, called Entropia, that implements a family of conformance checking measures for process mining founded on the notion of entropy from information theory. The measures allow quantifying classical non-deterministic and stochastic precision and recall quality criteria for process models automatically discovered from traces executed by IT-systems and recorded in their event logs. A process model has "good" precision with respect to the log it was discovered from if it does not encode many traces that are not part of the log, and has "good" recall if it encodes most of the traces from the log. By definition, the measures possess useful properties and can often be computed quickly.
MTOP: A Comprehensive Multilingual Task-Oriented Semantic Parsing Benchmark

Scaling semantic parsing models for task-oriented dialog systems to new languages is often expensive and time-consuming due to the lack of available datasets. Available datasets suffer from several shortcomings: a) they contain few languages b) they contain small amounts of labeled examples per language c) they are based on the simple intent and slot detection paradigm for non-compositional queries. In this paper, we present a new multilingual dataset, called MTOP, comprising of 100k annotated utterances in 6 languages across 11 domains. We use this dataset and other publicly available datasets to conduct a comprehensive benchmarking study on using various state-of-the-art multilingual pre-trained models for task-oriented semantic parsing. We achieve an average improvement of +6.3 points on Slot F1 for the two existing multilingual datasets, over best results reported in their experiments. Furthermore, we demonstrate strong zero-shot performance using pre-trained models combined with automatic translation and alignment, and a proposed distant supervision method to reduce the noise in slot label projection.
Learning Domain-invariant Graph for Adaptive Semi-supervised Domain Adaptation with Few Labeled Source Samples

Domain adaptation aims to generalize a model from a source domain to tackle tasks in a related but different target domain. Traditional domain adaptation algorithms assume that enough labeled data, which are treated as the prior knowledge are available in the source domain. However, these algorithms will be infeasible when only a few labeled data exist in the source domain, and thus the performance decreases significantly. To address this challenge, we propose a Domain-invariant Graph Learning (DGL) approach for domain adaptation with only a few labeled source samples. Firstly, DGL introduces the Nystrom method to construct a plastic graph that shares similar geometric property as the target domain. And then, DGL flexibly employs the Nystrom approximation error to measure the divergence between plastic graph and source graph to formalize the distribution mismatch from the geometric perspective. Through minimizing the approximation error, DGL learns a domain-invariant geometric graph to bridge source and target domains. Finally, we integrate the learned domain-invariant graph with the semi-supervised learning and further propose an adaptive semi-supervised model to handle the cross-domain problems. The results of extensive experiments on popular datasets verify the superiority of DGL, especially when only a few labeled source samples are available.