OpenRaiser/Intern-Atlas huggingface dataset:
Dynamic Algorithmic Service Agreements Perspective
Venue: arXiv cs.CY 2020
Year: 2020

A multi-disciplinary understanding of the concepts of identity, agency, relationships, interactions, and information could help us develop mitigation strategies for responsible human-algorithmic systems in the field of AI. It is imperative for us to question the use of the Terms of Service (ToS) agreements model in the context of algorithmic systems, specifically AI systems that make decisions which affect people and their livelihoods. In this position paper, we identify five areas of concern in traditional ToS agreements by drawing on studies of sociotechnical systems in Science and Technology Studies - accommodating and enabling change, co-constitution, reflective directionality, friction, and generativity. We aim to address these ToS shortcomings and propose components of a novel Dynamic Algorithmic Service Agreements (DASA) framework. The DASA could be employed as a self-regulation framework while also enabling additional feedback loops between people and algorithmic systems. Rich interaction frameworks could enable us to better negotiate and cooperate with AI systems towards accomplishing the real-world goals we use them for. We illustrate the DASA framework in the context of a Recommender System used in the curation of real and synthetic data. We do not intend for the DASA framework to replace the ToS model, but instead think it will provide practitioners with an alternative point of view for the design of dynamic interaction interfaces for AI systems that account for human identity and agency.
HyperCon: Image-To-Video Model Transfer for Video-To-Video Translation Tasks
Venue: arXiv cs.CV 2020
Year: 2020

Video-to-video translation is more difficult than image-to-image translation due to the temporal consistency problem that, if unaddressed, leads to distracting flickering effects. Although video models designed from scratch produce temporally consistent results, training them to match the vast visual knowledge captured by image models requires an intractable number of videos. To combine the benefits of image and video models, we propose an image-to-video model transfer method called Hyperconsistency (HyperCon) that transforms any well-trained image model into a temporally consistent video model without fine-tuning. HyperCon works by translating a temporally interpolated video frame-wise and then aggregating over temporally localized windows on the interpolated video. It handles both masked and unmasked inputs, enabling support for even more video-to-video translation tasks than prior image-to-video model transfer techniques. We demonstrate HyperCon on video style transfer and inpainting, where it performs favorably compared to prior state-of-the-art methods without training on a single stylized or incomplete video. Our project website is available at https://ryanszeto.com/projects/hypercon .
Medication Regimen Extraction From Medical Conversations
Venue: arXiv cs.CL 2020
Year: 2020

Extracting relevant information from medical conversations and providing it to doctors and patients might help in addressing doctor burnout and patient forgetfulness. In this paper, we focus on extracting the Medication Regimen (dosage and frequency for medications) discussed in a medical conversation. We frame the problem as a Question Answering (QA) task and perform comparative analysis over: a QA approach, a new combined QA and Information Extraction approach, and other baselines. We use a small corpus of 6,692 annotated doctor-patient conversations for the task. Clinical conversation corpora are costly to create, difficult to handle (because of data privacy concerns), and thus scarce. We address this data scarcity challenge through data augmentation methods, using publicly available embeddings and pretrain part of the network on a related task (summarization) to improve the model's performance. Compared to the baseline, our best-performing models improve the dosage and frequency extractions' ROUGE-1 F1 scores from 54.28 and 37.13 to 89.57 and 45.94, respectively. Using our best-performing model, we present the first fully automated system that can extract Medication Regimen tags from spontaneous doctor-patient conversations with about $\approx$71% accuracy.
Beyond Dirty Paper Coding for Multi-Antenna Broadcast Channel with Partial CSIT: A Rate-Splitting Approach
Venue: arXiv cs.IT 2020
Year: 2020

Imperfect Channel State Information at the Transmitter (CSIT) is inevitable in modern wireless communication networks, and results in severe multi-user interference in multi-antenna Broadcast Channel (BC). While the capacity of the multi-antenna (Gaussian) BC with perfect CSIT is known and achieved by Dirty Paper Coding (DPC), the capacity and the capacity-achieving strategy of the multi-antenna BC with imperfect CSIT remain unknown. Conventional approaches therefore rely on applying communication strategies designed for perfect CSIT to the imperfect CSIT setting. In this work, we break this conventional routine and make two major contributions. First, we show that linearly precoded Rate-Splitting (RS), relying on the split of messages into common and private parts and linear precoding at the transmitter, and successive interference cancellation at the receivers, can achieve larger rate regions than DPC in multi-antenna BC with partial CSIT. Second, we propose a novel achievable scheme, denoted as Dirty Paper Coded Rate-Splitting (DPCRS), that relies on RS to split the user messages into common and private parts, and DPC to encode the private parts. We show that the rate region achieved by DPCRS in Multiple-Input Single-Output (MISO) BC with partial CSIT is enlarged beyond that of conventional DPC and that of linearly precoded RS. Gaining benefits from the capability of RS to partially decode the interference and partially treat interference as noise, DPCRS is less sensitive to CSIT inaccuracies, networks loads and user deployments compared with DPC and other existing transmission strategies. The proposed DPCRS acts as a new benchmark and the best-known achievable strategy for multi-antenna BC with partial CSIT.
Managing Machine Learning Workflow Components
Venue: arXiv cs.LG 2020
Year: 2020

Machine Learning Workflows (MLWfs) have become essential and a disruptive approach in problem-solving over several industries. However, the development process of MLWfs may be complicated, hard to achieve, time-consuming, and error-prone. To handle this problem, in this paper, we introduce machine learning workflow management (MLWfM) as a technique to aid the development and reuse of MLWfs and their components through three aspects: representation, execution, and creation. More precisely, we discuss our approach to structure the MLWfs' components and their metadata to aid retrieval and reuse of components in new MLWfs. Also, we consider the execution of these components within a tool. The hybrid knowledge representation, called Hyperknowledge, frames our methodology, supporting the three MLWfM's aspects. To validate our approach, we show a practical use case in the Oil & Gas industry.
Efficient Approximation of the Matching Distance for 2-parameter persistence
Venue: arXiv cs.CG 2020
Year: 2020

The matching distance is a computationally tractable topological measure to compare multi-filtered simplicial complexes. We design efficient algorithms for approximating the matching distance of two bi-filtered complexes to any desired precision $ε>0$. Our approach is based on a quad-tree refinement strategy introduced by Biasotti et al., but we recast their approach entirely in geometric terms. This point of view leads to several novel observations resulting in a practically faster algorithm. We demonstrate this speed-up by experimental comparison and provide our code in a public repository which provides the first efficient publicly available implementation of the matching distance.
Improving Interpretability of Word Embeddings by Generating Definition and Usage
Venue: arXiv cs.CL 2020
Year: 2020

Word embeddings are substantially successful in capturing semantic relations among words. However, these lexical semantics are difficult to be interpreted. Definition modeling provides a more intuitive way to evaluate embeddings by utilizing them to generate natural language definitions of corresponding words. This task is of great significance for practical application and in-depth understanding of word representations. We propose a novel framework for definition modeling, which can generate reasonable and understandable context-dependent definitions. Moreover, we introduce usage modeling and study whether it is possible to utilize embeddings to generate example sentences of words. These ways are a more direct and explicit expression of embedding's semantics for better interpretability. We extend the single task model to multi-task setting and investigate several joint multi-task models to combine usage modeling and definition modeling together. Experimental results on existing Oxford dataset and a new collected Oxford-2019 dataset show that our single-task model achieves the state-of-the-art result in definition modeling and the multi-task learning methods are helpful for two tasks to improve the performance.
Learning to Reach Goals via Iterated Supervised Learning
Venue: arXiv cs.LG 2020
Year: 2020

Current reinforcement learning (RL) algorithms can be brittle and difficult to use, especially when learning goal-reaching behaviors from sparse rewards. Although supervised imitation learning provides a simple and stable alternative, it requires access to demonstrations from a human supervisor. In this paper, we study RL algorithms that use imitation learning to acquire goal reaching policies from scratch, without the need for expert demonstrations or a value function. In lieu of demonstrations, we leverage the property that any trajectory is a successful demonstration for reaching the final state in that same trajectory. We propose a simple algorithm in which an agent continually relabels and imitates the trajectories it generates to progressively learn goal-reaching behaviors from scratch. Each iteration, the agent collects new trajectories using the latest policy, and maximizes the likelihood of the actions along these trajectories under the goal that was actually reached, so as to improve the policy. We formally show that this iterated supervised learning procedure optimizes a bound on the RL objective, derive performance bounds of the learned policy, and empirically demonstrate improved goal-reaching performance and robustness over current RL algorithms in several benchmark tasks.
Double descent in the condition number
Venue: arXiv cs.LG 2020
Year: 2020

In solving a system of $n$ linear equations in $d$ variables $Ax=b$, the condition number of the $n,d$ matrix $A$ measures how much errors in the data $b$ affect the solution $x$. Estimates of this type are important in many inverse problems. An example is machine learning where the key task is to estimate an underlying function from a set of measurements at random points in a high dimensional space and where low sensitivity to error in the data is a requirement for good predictive performance. Here we discuss the simple observation, which is known but surprisingly little quoted (see Theorem 4.2 in \cite{Brgisser:2013:CGN:2526261}): when the columns of $A$ are random vectors, the condition number of $A$ is highest if $d=n$, that is when the inverse of $A$ exists. An overdetermined system ($n>d$) as well as an underdetermined system ($n<d$), for which the pseudoinverse must be used instead of the inverse, typically have significantly better, that is lower, condition numbers. Thus the condition number of $A$ plotted as function of $d$ shows a double descent behavior with a peak at $d=n$.
CRNs Exposed: Systematic Exploration of Chemical Reaction Networks
Venue: arXiv cs.ET 2020
Year: 2020

Formal methods have enabled breakthroughs in many fields, such as in hardware verification, machine learning and biological systems. The key object of interest in systems biology, synthetic biology, and molecular programming is chemical reaction networks (CRNs) which formalizes coupled chemical reactions in a well-mixed solution. CRNs are pivotal for our understanding of biological regulatory and metabolic networks, as well as for programming engineered molecular behavior. Although it is clear that small CRNs are capable of complex dynamics and computational behavior, it remains difficult to explore the space of CRNs in search for desired functionality. We use Alloy, a tool for expressing structural constraints and behavior in software systems, to enumerate CRNs with declaratively specified properties. We show how this framework can enumerate CRNs with a variety of structural constraints including biologically motivated catalytic networks and metabolic networks, and seesaw networks motivated by DNA nanotechnology. We also use the framework to explore analog function computation in rate-independent CRNs. By computing the desired output value with stoichiometry rather than with reaction rates (in the sense that $X \to Y+Y$ computes multiplication by $2$), such CRNs are completely robust to the choice of reaction rates or rate law. We find the smallest CRNs computing the max, minmax, abs and ReLU (rectified linear unit) functions in a natural subclass of rate-independent CRNs where rate-independence follows from structural network properties.
A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time
Venue: arXiv cs.DS 2020
Year: 2020

We give the first constant-factor approximation for the Directed Latency problem in quasi-polynomial time. Here, the goal is to visit all nodes in an asymmetric metric with a single vehicle starting at a depot $r$ to minimize the average time a node waits to be visited by the vehicle. The approximation guarantee is an improvement over the polynomial-time $O(\log n)$-approximation [Friggstad, Salavatipour, Svitkina, 2013] and no better quasi-polynomial time approximation algorithm was known. To obtain this, we must extend a recent result showing the integrality gap of the Asymmetric TSP-Path LP relaxation is bounded by a constant [Köhne, Traub, and Vygen, 2019], which itself builds on the breakthrough result that the integrality gap for standard Asymmetric TSP is also a constant [Svensson, Tarnawsi, and Vegh, 2018]. We show the standard Asymmetric TSP-Path integrality gap is bounded by a constant even if the cut requirements of the LP relaxation are relaxed from $x(δ^{in}(S)) \geq 1$ to $x(δ^{in}(S)) \geq ρ$ for some constant $1/2 < ρ\leq 1$. We also give a better approximation guarantee in the special case of Directed Latency in regret metrics where the goal is to find a path $P$ minimize the average time a node $v$ waits in excess of $c_{rv}$, i.e. $\frac{1}{|V|} \cdot \sum_{v \in V} (c_v(P)-c_{rv})$.
PreVIous: A Methodology for Prediction of Visual Inference Performance on IoT Devices
Venue: arXiv cs.CV 2020
Year: 2020

This paper presents PreVIous, a methodology to predict the performance of convolutional neural networks (CNNs) in terms of throughput and energy consumption on vision-enabled devices for the Internet of Things. CNNs typically constitute a massive computational load for such devices, which are characterized by scarce hardware resources to be shared among multiple concurrent tasks. Therefore, it is critical to select the optimal CNN architecture for a particular hardware platform according to prescribed application requirements. However, the zoo of CNN models is already vast and rapidly growing. To facilitate a suitable selection, we introduce a prediction framework that allows to evaluate the performance of CNNs prior to their actual implementation. The proposed methodology is based on PreVIousNet, a neural network specifically designed to build accurate per-layer performance predictive models. PreVIousNet incorporates the most usual parameters found in state-of-the-art network architectures. The resulting predictive models for inference time and energy have been tested against comprehensive characterizations of seven well-known CNN models running on two different software frameworks and two different embedded platforms. To the best of our knowledge, this is the most extensive study in the literature concerning CNN performance prediction on low-power low-cost devices. The average deviation between predictions and real measurements is remarkably low, ranging from 3% to 10%. This means state-of-the-art modeling accuracy. As an additional asset, the fine-grained a priori analysis provided by PreVIous could also be exploited by neural architecture search engines.
To See in the Dark: N2DGAN for Background Modeling in Nighttime Scene
Venue: arXiv cs.CV 2020
Year: 2020

Due to the deteriorated conditions of \mbox{illumination} lack and uneven lighting, nighttime images have lower contrast and higher noise than their daytime counterparts of the same scene, which limits seriously the performances of conventional background modeling methods. For such a challenging problem of background modeling under nighttime scene, an innovative and reasonable solution is proposed in this paper, which paves a new way completely different from the existing ones. To make background modeling under nighttime scene performs as well as in daytime condition, we put forward a promising generation-based background modeling framework for foreground surveillance. With a pre-specified daytime reference image as background frame, the {\bfseries GAN} based generation model, called {\bfseries N2DGAN}, is trained to transfer each frame of {\bfseries n}ighttime video {\bfseries to} a virtual {\bfseries d}aytime image with the same scene to the reference image except for the foreground region. Specifically, to balance the preservation of background scene and the foreground object(s) in generating the virtual daytime image, we present a two-pathway generation model, in which the global and local sub-networks are well combined with spatial and temporal consistency constraints. For the sequence of generated virtual daytime images, a multi-scale Bayes model is further proposed to characterize pertinently the temporal variation of background. We evaluate on collected datasets with manually labeled ground truth, which provides a valuable resource for related research community. The impressive results illustrated in both the main paper and supplementary show efficacy of our proposed approach.
Predictive Precompute with Recurrent Neural Networks
Venue: arXiv cs.LG 2020
Year: 2020

In both mobile and web applications, speeding up user interface response times can often lead to significant improvements in user engagement. A common technique to improve responsiveness is to precompute data ahead of time for specific activities. However, simply precomputing data for all user and activity combinations is prohibitive at scale due to both network constraints and server-side computational costs. It is therefore important to accurately predict per-user application usage in order to minimize wasted precomputation ("predictive precompute"). In this paper, we describe the novel application of recurrent neural networks (RNNs) for predictive precompute. We compare their performance with traditional machine learning models, and share findings from their large-scale production use at Facebook. We demonstrate that RNN models improve prediction accuracy, eliminate most feature engineering steps, and reduce the computational cost of serving predictions by an order of magnitude.
Privacy-Preserving Claims Exchange Networks for Virtual Asset Service Providers
Venue: arXiv cs.CR 2020
Year: 2020

In order for VASPs to fulfill the regulatory requirements from the FATF and the Travel Rule, VASPs need access to truthful information regarding originators, beneficiaries and other VASPs involved in a virtual asset transfer instance. Additionally, in seeking data regarding subjects (individuals or organizations) VASPs are faced with privacy regulations such as the GDPR and CCPA. In this paper we a propose privacy-preserving claims issuance model that carries indicators of the provenance of the data and the algorithms used to derive the claim or assertion. This allows VASPs to obtain originator and beneficiary information without necessarily having access to the private data about these entities. Secondly we propose the use of a consortium trust network arrangement for VASPs to exchange signed claims about subjects and their public-key information or certificate.
Erase-hidden and Drivability-improved Magnetic Non-Volatile Flip-Flops with NAND-SPIN Devices
Venue: arXiv cs.ET 2020
Year: 2020

Non-volatile flip-flops (NVFFs) using power gating techniques promise to overcome the soaring leakage power consumption issue with the scaling of CMOS technology. Magnetic tunnel junction (MTJ) is a good candidate for constructing the NVFF thanks to its low power, high speed, good CMOS compatibility, etc. In this paper, we propose a novel magnetic NVFF based on an emerging memory device called NAND-SPIN. The data writing of NAND-SPIN is achieved by successively applying two unidirectional currents, which respectively generate the spin orbit torque (SOT) and spin transfer torque (STT) for erase and programming operations. This characteristic allows us to design an erase-hidden and drivability-improved magnetic NVFF. Furthermore, more design flexibility could be obtained since the backup operation of the proposed NVFF is not limited by the inherent slave latch. Simulation results show that our proposed NVFF achieves performance improvement in terms of power, delay and area, compared with conventional slave-latch-driven SOT-NVFF designs.
Fingerprint Synthesis: Search with 100 Million Prints
Venue: arXiv cs.CV 2020
Year: 2020

Evaluation of large-scale fingerprint search algorithms has been limited due to lack of publicly available datasets. To address this problem, we utilize a Generative Adversarial Network (GAN) to synthesize a fingerprint dataset consisting of 100 million fingerprint images. In contrast to existing fingerprint synthesis algorithms, we incorporate an identity loss which guides the generator to synthesize fingerprints corresponding to more distinct identities. The characteristics of our synthesized fingerprints are shown to be more similar to real fingerprints than existing methods via eight different metrics (minutiae count - block and template, minutiae direction - block and template, minutiae convex hull area, minutiae spatial distribution, block minutiae quality distribution, and NFIQ 2.0 scores). Additionally, the synthetic fingerprints based on our approach are shown to be more distinct than synthetic fingerprints based on published methods through search results and imposter distribution statistics. Finally, we report for the first time in open literature, search accuracy against a gallery of 100 million fingerprint images (NIST SD4 Rank-1 accuracy of 89.7%).
Nonlocal network dynamics via fractional graph Laplacians
Venue: arXiv cs.SI 2020
Year: 2020

We introduce nonlocal dynamics on directed networks through the construction of a fractional version of a nonsymmetric Laplacian for weighted directed graphs. Furthermore, we provide an analytic treatment of fractional dynamics for both directed and undirected graphs, showing the possibility of exploring the network employing random walks with jumps of arbitrary length. We also provide some examples of the applicability of the proposed dynamics, including consensus over multi-agent systems described by directed networks.