OpenRaiser/Intern-Atlas huggingface dataset:
PlotQA: Reasoning over Scientific Plots
Venue: arXiv cs.CV 2020
Year: 2020

Existing synthetic datasets (FigureQA, DVQA) for reasoning over plots do not contain variability in data labels, real-valued data, or complex reasoning questions. Consequently, proposed models for these datasets do not fully address the challenge of reasoning over plots. In particular, they assume that the answer comes either from a small fixed size vocabulary or from a bounding box within the image. However, in practice, this is an unrealistic assumption because many questions require reasoning and thus have real-valued answers which appear neither in a small fixed size vocabulary nor in the image. In this work, we aim to bridge this gap between existing datasets and real-world plots. Specifically, we propose PlotQA with 28.9 million question-answer pairs over 224,377 plots on data from real-world sources and questions based on crowd-sourced question templates. Further, 80.76% of the out-of-vocabulary (OOV) questions in PlotQA have answers that are not in a fixed vocabulary. Analysis of existing models on PlotQA reveals that they cannot deal with OOV questions: their overall accuracy on our dataset is in single digits. This is not surprising given that these models were not designed for such questions. As a step towards a more holistic model which can address fixed vocabulary as well as OOV questions, we propose a hybrid approach: Specific questions are answered by choosing the answer from a fixed vocabulary or by extracting it from a predicted bounding box in the plot, while other questions are answered with a table question-answering engine which is fed with a structured table generated by detecting visual elements from the image. On the existing DVQA dataset, our model has an accuracy of 58%, significantly improving on the highest reported accuracy of 46%. On PlotQA, our model has an accuracy of 22.52%, which is significantly better than state of the art models.
HTMLPhish: Enabling Phishing Web Page Detection by Applying Deep Learning Techniques on HTML Analysis
Venue: arXiv cs.CR 2020
Year: 2020

Recently, the development and implementation of phishing attacks require little technical skills and costs. This uprising has led to an ever-growing number of phishing attacks on the World Wide Web. Consequently, proactive techniques to fight phishing attacks have become extremely necessary. In this paper, we propose HTMLPhish, a deep learning based data-driven end-to-end automatic phishing web page classification approach. Specifically, HTMLPhish receives the content of the HTML document of a web page and employs Convolutional Neural Networks (CNNs) to learn the semantic dependencies in the textual contents of the HTML. The CNNs learn appropriate feature representations from the HTML document embeddings without extensive manual feature engineering. Furthermore, our proposed approach of the concatenation of the word and character embeddings allows our model to manage new features and ensure easy extrapolation to test data. We conduct comprehensive experiments on a dataset of more than 50,000 HTML documents that provides a distribution of phishing to benign web pages obtainable in the real-world that yields over 93 percent Accuracy and True Positive Rate. Also, HTMLPhish is a completely language-independent and client-side strategy which can, therefore, conduct web page phishing detection regardless of the textual language.
Functional Asplund metrics for pattern matching, robust to variable lighting conditions
Venue: arXiv cs.CV 2020
Year: 2020

In this paper, we propose a complete framework to process images captured under uncontrolled lighting and especially under low lighting. By taking advantage of the Logarithmic Image Processing (LIP) context, we study two novel functional metrics: i) the LIP-multiplicative Asplund metric which is robust to object absorption variations and ii) the LIP-additive Asplund metric which is robust to variations of source intensity or camera exposure-time. We introduce robust to noise versions of these metrics. We demonstrate that the maps of their corresponding distances between an image and a reference template are linked to Mathematical Morphology. This facilitates their implementation. We assess them in various situations with different lightings and movement. Results show that those maps of distances are robust to lighting variations. Importantly, they are efficient to detect patterns in low-contrast images with a template acquired under a different lighting.
The Diversity-Innovation Paradox in Science
Venue: arXiv cs.SI 2020
Year: 2020

Prior work finds a diversity paradox: diversity breeds innovation, and yet, underrepresented groups that diversify organizations have less successful careers within them. Does the diversity paradox hold for scientists as well? We study this by utilizing a near-population of ~1.2 million US doctoral recipients from 1977-2015 and following their careers into publishing and faculty positions. We use text analysis and machine learning to answer a series of questions: How do we detect scientific innovations? Are underrepresented groups more likely to generate scientific innovations? And are the innovations of underrepresented groups adopted and rewarded? Our analyses show that underrepresented groups produce higher rates of scientific novelty. However, their novel contributions are devalued and discounted: e.g., novel contributions by gender and racial minorities are taken up by other scholars at lower rates than novel contributions by gender and racial majorities, and equally impactful contributions of gender and racial minorities are less likely to result in successful scientific careers than for majority groups. These results suggest there may be unwarranted reproduction of stratification in academic careers that discounts diversity's role in innovation and partly explains the underrepresentation of some groups in academia.
Material characterization and precise finite element analysis of fiber reinforced thermoplastic composites for 4D printing
Venue: arXiv cs.CG 2020
Year: 2020

Four-dimensional (4D) printing, a new technology emerged from additive manufacturing (3D printing), is widely known for its capability of programming post-fabrication shape-changing into artifacts. Fused deposition modeling (FDM)-based 4D printing, in particular, uses thermoplastics to produce artifacts and requires computational analysis to assist the design processes of complex geometries. However, these artifacts are weak against structural loads, and the design quality can be limited by less accurate material models and numerical simulations. To address these issues, this paper propounds a composite structure design made of two materials - polylactic acid (PLA) and carbon fiber reinforced PLA (CFPLA) - to increase the structural strength of 4D printed artifacts and a workflow composed of several physical experiments and series of dynamic mechanical analysis (DMA) to characterize materials. We apply this workflow to 3D printed samples fabricated with different printed parameters to accurately characterize the materials and implement a sequential finite element analysis (FEA) to achieve accurate simulations. The accuracy of deformation induced by the triggering process is both computationally and experimentally verified with several creative design examples, and the 95% confidence interval of the accuracy is (0.972, 0.985). We believe the presented workflow is essential to the combination of geometry, material mechanism and design, and has various potential applications.
Remembering Winter Was Coming: Character-Oriented Video Summaries of TV Series
Venue: arXiv cs.MM 2020
Year: 2020

Today's popular TV series tend to develop continuous, complex plots spanning several seasons, but are often viewed in controlled and discontinuous conditions. Consequently, most viewers need to be re-immersed in the story before watching a new season. Although discussions with friends and family can help, we observe that most viewers make extensive use of summaries to re-engage with the plot. Automatic generation of video summaries of TV series' complex stories requires, first, modeling the dynamics of the plot and, second, extracting relevant sequences. In this paper, we tackle plot modeling by considering the social network of interactions between the characters involved in the narrative: substantial, durable changes in a major character's social environment suggest a new development relevant for the summary. Once identified, these major stages in each character's storyline can be used as a basis for completing the summary with related sequences. Our algorithm combines such social network analysis with filmmaking grammar to automatically generate character-oriented video summaries of TV series from partially annotated data. We carry out evaluation with a user study in a real-world scenario: a large sample of viewers were asked to rank video summaries centered on five characters of the popular TV series Game of Thrones, a few weeks before the new, sixth season was released. Our results reveal the ability of character-oriented summaries to re-engage viewers in television series and confirm the contributions of modeling the plot content and exploiting stylistic patterns to identify salient sequences.
The Benefits of Diversity: Permutation Recovery in Unlabeled Sensing from Multiple Measurement Vectors
Venue: arXiv cs.IT 2020
Year: 2020

In "Unlabeled Sensing", one observes a set of linear measurements of an underlying signal with incomplete or missing information about their ordering, which can be modeled in terms of an unknown permutation. Previous work on the case of a single noisy measurement vector has exposed two main challenges: 1) a high requirement concerning the \emph{signal-to-noise ratio} ($\snr$), i.e., approximately of the order of $n^{5}$, and 2) a massive computational burden in light of NP-hardness in general. In this paper, we study the case of \emph{multiple} noisy measurement vectors (MMVs) resulting from a \emph{common} permutation and investigate to what extent the number of MMVs $m$ facilitates permutation recovery by "borrowing strength". The above two challenges have at least partially been resolved within our work. First, we show that a large stable rank of the signal significantly reduces the required snr which can drop from a polynomial in $n$ for $m = 1$ to a constant for $m = Ω(\log n)$, where $m$ denotes the number of MMVs and $n$ denotes the number of measurements per MV. This bound is shown to be sharp and is associated with a phase transition phenomenon. Second, we propose a computational scheme for recovering the unknown permutation in practice. For the "oracle case" with the known signal, the maximum likelihood (ML) estimator reduces to a linear assignment problem whose global optimum can be obtained efficiently. For the case in which both the signal and permutation are unknown, the problem is reformulated as a bi-convex optimization problem with an auxiliary variable, which can be solved by the Alternating Direction Method of Multipliers (ADMM). Numerical experiments based on the proposed computational scheme confirm the tightness of our theoretical analysis.
$\sqrt{n}$-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank
Venue: arXiv cs.LG 2020
Year: 2020

In this paper, we consider the problem of online learning of Markov decision processes (MDPs) with very large state spaces. Under the assumptions of realizable function approximation and low Bellman ranks, we develop an online learning algorithm that learns the optimal value function while at the same time achieving very low cumulative regret during the learning process. Our learning algorithm, Adaptive Value-function Elimination (AVE), is inspired by the policy elimination algorithm proposed in (Jiang et al., 2017), known as OLIVE. One of our key technical contributions in AVE is to formulate the elimination steps in OLIVE as contextual bandit problems. This technique enables us to apply the active elimination and expert weighting methods from (Dudik et al., 2011), instead of the random action exploration scheme used in the original OLIVE algorithm, for more efficient exploration and better control of the regret incurred in each policy elimination step. To the best of our knowledge, this is the first $\sqrt{n}$-regret result for reinforcement learning in stochastic MDPs with general value function approximation.
Robustness to Modification with Shared Words in Paraphrase Identification
Venue: arXiv cs.CL 2020
Year: 2020

Revealing the robustness issues of natural language processing models and improving their robustness is important to their performance under difficult situations. In this paper, we study the robustness of paraphrase identification models from a new perspective -- via modification with shared words, and we show that the models have significant robustness issues when facing such modifications. To modify an example consisting of a sentence pair, we either replace some words shared by both sentences or introduce new shared words. We aim to construct a valid new example such that a target model makes a wrong prediction. To find a modification solution, we use beam search constrained by heuristic rules, and we leverage a BERT masked language model for generating substitution words compatible with the context. Experiments show that the performance of the target models has a dramatic drop on the modified examples, thereby revealing the robustness issue. We also show that adversarial training can mitigate this issue.
Privacy-Utility Tradeoffs in Routing Cryptocurrency over Payment Channel Networks
Venue: arXiv cs.CR 2020
Year: 2020

Payment channel networks (PCNs) are viewed as one of the most promising scalability solutions for cryptocurrencies today. Roughly, PCNs are networks where each node represents a user and each directed, weighted edge represents funds escrowed on a blockchain; these funds can be transacted only between the endpoints of the edge. Users efficiently transmit funds from node A to B by relaying them over a path connecting A to B, as long as each edge in the path contains enough balance (escrowed funds) to support the transaction. Whenever a transaction succeeds, the edge weights are updated accordingly. However, in deployed PCNs, channel balances (i.e., edge weights) are not revealed to users for privacy reasons; users know only the initial weights at time 0. Hence, when routing transactions, users first guess a path, then check if it supports the transaction. This guess-and-check process dramatically reduces the success rate of transactions. At the other extreme, knowing full channel balances can give substantial improvements in success rate at the expense of privacy. In this work, we study whether a network can reveal noisy channel balances to trade off privacy for utility. We show fundamental limits on such a tradeoff, and propose noise mechanisms that achieve the fundamental limit for a general class of graph topologies. Our results suggest that in practice, PCNs should operate either in the low-privacy or low-utility regime; it is not possible to get large gains in utility by giving up a little privacy, or large gains in privacy by sacrificing a little utility.
Master your Metrics with Calibration
Venue: arXiv cs.LG 2020
Year: 2020

Machine learning models deployed in real-world applications are often evaluated with precision-based metrics such as F1-score or AUC-PR (Area Under the Curve of Precision Recall). Heavily dependent on the class prior, such metrics make it difficult to interpret the variation of a model's performance over different subpopulations/subperiods in a dataset. In this paper, we propose a way to calibrate the metrics so that they can be made invariant to the prior. We conduct a large number of experiments on balanced and imbalanced data to assess the behavior of calibrated metrics and show that they improve interpretability and provide a better control over what is really measured. We describe specific real-world use-cases where calibration is beneficial such as, for instance, model monitoring in production, reporting, or fairness evaluation.
Analyzing Network Effects on a Fanfiction Community
Venue: arXiv cs.SI 2020
Year: 2020

Since the early days of the Web 2.0, online communities have been growing quickly and have become important part of life for large number of people. In one of these communities, fanfiction.net, users can read and write stories which are adapted, recreated and modified from original famous books, tv series, movies, among others. By following stories and their authors, the fanfiction community creates a social network. Previous research on online communities has shown how features of the social network can help explain the behavior of the community, so we are interested in studying fanfiction's social network as well as its influence in aspects of the community. In particular, in this article we describe several properties of the members of the community, and we also try to discover which factors explain the popularity of the authors. We discover that time since joining fanfiction and the size of the authors' biography, has a negative effect on the authors popularity. Moreover, we show that the users' network metrics help to explain better authors' popularity.
Dynamic Spatial-Temporal Representation Learning for Traffic Flow Prediction
Venue: arXiv cs.LG 2020
Year: 2020

As a crucial component in intelligent transportation systems, traffic flow prediction has recently attracted widespread research interest in the field of artificial intelligence (AI) with the increasing availability of massive traffic mobility data. Its key challenge lies in how to integrate diverse factors (such as temporal rules and spatial dependencies) to infer the evolution trend of traffic flow. To address this problem, we propose a unified neural network called Attentive Traffic Flow Machine (ATFM), which can effectively learn the spatial-temporal feature representations of traffic flow with an attention mechanism. In particular, our ATFM is composed of two progressive Convolutional Long Short-Term Memory (ConvLSTM \cite{xingjian2015convolutional}) units connected with a convolutional layer. Specifically, the first ConvLSTM unit takes normal traffic flow features as input and generates a hidden state at each time-step, which is further fed into the connected convolutional layer for spatial attention map inference. The second ConvLSTM unit aims at learning the dynamic spatial-temporal representations from the attentionally weighted traffic flow features. Further, we develop two deep learning frameworks based on ATFM to predict citywide short-term/long-term traffic flow by adaptively incorporating the sequential and periodic data as well as other external influences. Extensive experiments on two standard benchmarks well demonstrate the superiority of the proposed method for traffic flow prediction. Moreover, to verify the generalization of our method, we also apply the customized framework to forecast the passenger pickup/dropoff demands in traffic prediction and show its superior performance. Our code and data are available at {\color{blue}\url{https://github.com/liulingbo918/ATFM}}.
Agora: A Unified Asset Ecosystem Going Beyond Marketplaces and Cloud Services
Venue: arXiv cs.DB 2020
Year: 2020

Data, algorithms, and compute/storage infrastructure are key assets that drive data science and artificial intelligence applications. As providing all these assets requires a huge investment, data science and artificial intelligence technologies are currently dominated by a small number of providers who can afford these investments. This leads to lock-in effects and hinders features that require a flexible exchange of assets among users. In this vision paper, we present Agora, a unified asset ecosystem. The Agora system provides the technical infrastructure that allows for offering and using data and algorithms, as well as physical infrastructure components. Agora is designed as an open ecosystem of asset marketplaces and provides to a broad audience not only data but the entire data value chain (including computational resources and human expertise). Agora (i) leverages a fine-grained exchange of assets, (ii) allows for combining assets to novel applications, and (iii) flexibly executes such applications on available resources. As a result, Agora overcomes lock-in effects and removes entry barriers for new asset providers. In contrast to existing data management systems, Agora operates in a heavily decentralized and dynamic environment: Data, algorithms, and even compute resources are dynamically created, modified, and removed by different stakeholders. Agora presents novel research directions for the data management community as a whole: It requires to combine our traditional expertise in scalable data processing and management with infrastructure provisioning as well as economic and application aspects of data, algorithms, and infrastructure.
Dynamic Time-Frequency Division Duplex
Venue: arXiv cs.IT 2020
Year: 2020

In this paper, we introduce dynamic time-frequency-division duplex (D-TFDD), which is a novel duplexing scheme that combines time-division duplex (TDD) and frequency-division duplex (FDD). In D-TFDD, a user receives from the base station (BS) on the downlink in one frequency band and transmits to the BS on the uplink in another frequency band, as in FDD. Next, the user shares its uplink transmission (downlink reception) on the corresponding frequency band with the uplink transmission or the downlink reception of another user in a D-TDD fashion. Hence, in a given frequency band, the BS communicates with user 1 (U1) and user 2 (U2) in a D-TDD fashion. The proposed D-TFDD scheme does not require inter-cell interference (ICI) knowledge and only requires channel state information (CSI) of the local BS-U1 and BS-U2 channels. Thereby, it is practical for implementation. The proposed D-TFDD scheme increases the throughput region between the BS and the two users in a given frequency band, and significantly decreases the outage probabilities on the corresponding BS-U1 and BS-U2 channels. Most importantly, the proposed D-TFDD scheme doubles the diversity gain on both the corresponding BS-U1 and the BS-U2 channels compared to the diversity gain of existing duplexing schemes, which results in very large performance gains.
Topology Optimization of Fluidic Pressure Loaded Structures and Compliant Mechanisms using the Darcy Method
Venue: arXiv cs.CE 2020
Year: 2020

In various applications, design problems involving structures and compliant mechanisms experience fluidic pressure loads. During topology optimization of such design problems, these loads adapt their direction and location with the evolution of the design, which poses various challenges. A new density-based topology optimization approach using Darcy's law in conjunction with a drainage term is presented to provide a continuous and consistent treatment of design-dependent fluidic pressure loads. The porosity of each finite element and its drainage term are related to its density variable using a Heaviside function, yielding a smooth transition between the solid and void phases. A design-dependent pressure field is established using Darcy's law and the associated PDE is solved using the finite element method. Further, the obtained pressure field is used to determine the consistent nodal loads. The approach provides a computationally inexpensive evaluation of load sensitivities using the adjoint-variable method. To show the efficacy and robustness of the proposed method, numerical examples related to fluidic pressure loaded stiff structures and small-deformation compliant mechanisms are solved. For the structures, compliance is minimized, whereas for the mechanisms a multi-criteria objective is minimized with given resource constraints.